From 5308560a4c92173fbdac72856659c10b8533cd0b Mon Sep 17 00:00:00 2001 From: Aastha Gupta Date: Sat, 10 Mar 2018 14:31:24 +0530 Subject: [PATCH 1/2] Directory indexing for creating search database Fixes #70 This will ease the process of updating search entries because now we don't have to maintain a hard-coded database and a simple update in the directory will be enough. --- code/js/metadata.js | 55 +++++++++++++++++++++++++++++++++++++++++++++ code/js/popup.js | 11 +++------ code/popup.html | 2 +- 3 files changed, 59 insertions(+), 9 deletions(-) create mode 100644 code/js/metadata.js diff --git a/code/js/metadata.js b/code/js/metadata.js new file mode 100644 index 0000000..ed3143c --- /dev/null +++ b/code/js/metadata.js @@ -0,0 +1,55 @@ +// Copyright (c) 2018 The OpenGenus Authors. All rights reserved. +// Use of this source code is governed by a BSD-style license that can be +// found in the LICENSE file. + +var obj = {}; + +function readDirectory(dirEntry) { + var dirReader = dirEntry.createReader(); + dirReader.readEntries(function(entries) { + for(var i = 0; i < entries.length; i++) { + var entry = entries[i]; + if (entry.isDirectory){ + readDirectory(entry); + } + else if (entry.isFile) { + var filename = entry.name; + var filepath = entry.fullPath.split("/").slice(2,-1).join("/"); + if (!obj[filepath]) { + obj[filepath] = []; + } + obj[filepath].push(filename); + } + } + localStorage["metadata"] = JSON.stringify(obj); + }); +} + +function populate () { + chrome.runtime.getPackageDirectoryEntry(function(storageRootEntry) { + if(storageRootEntry.isDirectory) { + var dirReader = storageRootEntry.createReader(); + + var readEntries = function() { + dirReader.readEntries(function(entries) { + for(var i = 0; i < entries.length; i++) { + var entry = entries[i]; + if (entry.name === "code") { + readDirectory(entry); + break; + } + } + + if (!entries.length) + readEntries(); + }); + }; + + readEntries(); + } + }); +} + +if (!localStorage["metadata"]) { + populate(); +} diff --git a/code/js/popup.js b/code/js/popup.js index 83e1ed3..fcef534 100644 --- a/code/js/popup.js +++ b/code/js/popup.js @@ -2,11 +2,6 @@ // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. -obj = {"bit_manipulation/src/count_set_bits": ["countSetBits.js", "count_set_bits_lookup_table.cpp", "count_set_bits.py", "CountSetBits.java", "count_set_bits.cpp", "README.md", "count_set_bits.c"], "graph_algorithms/src/karger_minimum_cut": ["karger.java", "README.md"], "bit_manipulation/test": ["README.md"], "sorting/src/sleep_sort": ["sleep_sort.swift", "sleep_sort.jl", "sleep_sort.php", "sleep_sort.m", "sleep_sort.js", "sleep_sort.c", "sleep_sort.cs", "sleep_sort.go", "sleep_sort.sh", "README.md", "sleep_sort.rb", "sleep_sort.py", "sleep_sort.cpp", "sleep_sort.java", "sleep_sort.scala"], "graph_algorithms/src/bridges_in_graph": ["bridges.cpp", "README.md"], "data_structures/src/tree/heap/pairing_heap": ["pairing_heap.fs", "pairing_heap.sml", "README.md"], "dynamic_programming/src/rod_cutting": ["rod_cutting.py", "rod_cutting.hs", "rod_cutting.cpp", "README.md"], "backtracking/src/rat_in_a_maze": ["rat_in_a_maze.cpp", "README.md"], "greedy_algorithms/src/egyptian_fraction": ["egyptian_fraction.cpp", "egyptian_fraction.py"], "computational_geometry/src/area_of_triangle": ["area_of_triangle.cpp", "area_of_triangle.rs", "AreaOfTriangle.java", "area_of_triangle.js", "area_of_triangle.py", "area_of_triangle.go"], "bit_manipulation/src/twice_unique_number": ["two_Unique_Numbers.c", "twoUniqueNumbers.cpp", "README.md"], "graph_algorithms/src/adjacency_lists_graph_representation/adjacency_lists_in_C": ["lgraph_struct.c", "lgraph_stack.c", "lgraph_stack.h", "README.MD", "lgraph_struct.h", "main.c"], "online_challenges/src/project_euler/problem_003": ["problem_003.py", "problem_003.cpp", "README.md"], "online_challenges/src/project_euler/problem_002": ["problem_002.cpp", "problem_002.py", "README.md"], "online_challenges/src/project_euler/problem_001": ["README.md", "problem_001.py", "problem_001.cpp"], "data_structures/src/tree/binary_tree/binary_tree/convert_to_doubly_linked_list": ["convert_to_doubly_linked_list.cpp"], "online_challenges/src/project_euler/problem_006": ["problem_006.cpp", "README.md", "problem_006.py"], "online_challenges/src/project_euler/problem_005": ["README.md", "problem_005.cpp"], "online_challenges/src/project_euler/problem_004": ["README.md", "problem_004.py", "problem_004.cpp"], "online_challenges/src/project_euler/problem_009": ["problem_009.cpp", "README.md"], "online_challenges/src/project_euler/problem_008": ["problem_008.py", "README.md"], "graph_algorithms/src/steiner_tree": ["steiner_tree.java"], "search/src/binary_search": ["binary_search.php", "binary_search.py", "binary_search.c", "binary_search.cs", "binary_search.cpp", "binary_search.java", "binary_search.kt", "binary_search.hs", "binary_search.rkt", "binary_search.swift", "README.md", "binary_search.sh", "binary_search.go", "binary_search.js", "binary_search.rs", "binary_search.scala", "binary_search.rb"], "data_structures/src/tree/tree/suffix_array": ["suffix_array.cpp"], "dynamic_programming/src/longest_common_substring": ["longest_common_substring.cpp"], "mathematical_algorithms/src/modular_inverse": ["modular_inverse.cpp", "modular_inverse.rb", "modular_inverse.java", "modular_inverse.py"], "unclassified/src/biggest_suffix": ["biggest_suffix.c"], "mathematical_algorithms/src/jacobi_method": ["jacobi_method.java", "README.md"], "data_structures/src/list/singly_linked_list/operations/sort": ["bubble_sort.cpp"], "sorting/src/counting_sort": ["counting_sort.swift", "counting_sort.java", "counting_sort.cs", "README.md", "counting_sort.go", "counting_sort.py", "counting_sort.m", "counting_sort.js", "counting_sort.cpp", "counting_sort.c"], "sorting/src/bubble_sort": ["bubble_sort.rs", "bubble_sort.kt", "bubble_sort.sml", "bubble_sort.exs", "bubble_sort.m", "bubble_sort_efficient.cpp", "bubble_sort.cpp", "bubble_sort.java", "bubble_sort.go", "bubble_sort.sh", "bubble_sort.elm", "bubble_sort.hs", "bubble_sort.js", "README.md", "Bubble_sort.f", "bubble_sort.swift", "bubble_sort.rb", "bubble_sort.ts", "bubble_sort.jl", "bubble_sort.cs", "bubble_sort.c", "bubble_sort.py", "bubble_sort.php"], "data_structures/src/queue/reverse_queue": ["reverse_queue.py", "reverse_queue.go", "reverse_queue.java", "reverse_queue.cpp", "reverse_queue.swift"], "bit_manipulation/src/hamming_distance": ["hamming_distance.py", "hamming_distance.cpp", "hamming_distance.c", "hamming_distance.java", "README.md", "hamming_distance2.py"], "graph_algorithms/src/cycle_directed_graph": ["cycle_directed_graph.cpp", "cycle_directed_detection.c", "cycle_directed_graph.py", "cycle_directed_graph.c", "README.md"], "backtracking/src/sudoku_solve": ["sudoku_solve.py", "SudokuSolve.c", "SudokuSolve.cpp", "README.md"], "dynamic_programming/src/longest_common_increasing_subsequence": ["longest_common_increasing_subsequence.cpp"], "backtracking/src/permutations_of_string": ["permutations_of_string_itertools.py", "permutations_of_string.py", "permutations_of_string.c", "permutations_of_string_stl.cpp", "README.md", "permutations_of_string.go", "permutations_of_string.kt"], "mathematical_algorithms/src/amicable_numbers": ["amicable_numbers.js", "amicable_numbers.cpp", "amicable numbers.py", "amicable_numbers.rs", "amicable_numbers.go", "amicable_numbers.py", "amicable_numbers.rb", "amicable_numbers.java", "amicable_numbers.cs"], "data_structures/src/list/singly_linked_list/operations/n_th_node_linked_list": ["nth_node_from_end.cpp", "nth_node_from_end.c"], "mathematical_algorithms/src/check_is_square": ["check_is_square.py", "check_is_square.php", "check_is_square.js", "check_is_square.scala", "check_is_square.java", "check_is_square.go", "check_is_square.ruby", "check_is_square.rs", "check_is_square.swift", "check_is_square.cpp", "check_is_square.cs"], "graph_algorithms/src/cycle_undirected_graph": ["cycleGraph.cpp", "CheckCycle.java", "cycle_using_union_find_datastructure.cpp", "README.md", "cycle_undirected_graph.py"], "string_algorithms/src/remove_dups": ["remove_dups.c", "remove_dups.cpp", "remove_dumps.py"], "data_structures/src/tree/tree/trie": ["trie.cpp", "trie.py", "trie.java", "trie.cs", "trie.rb", "trie.scala", "trie.c", "trie.swift"], "dynamic_programming/src/minimum_cost_polygon_triangulation": ["README.md"], "data_structures/src/tree/binary_tree/binary_tree/diameter": ["diameter2.c", "diameter_test.cpp", "diameter2.cpp", "diameter.java", "diameter.hs", "diameter.cpp", "diameter.c", "diameter.py", "README.md"], "computational_geometry/src/2d_line_intersection": ["line.rb", "line.cs", "line.c", "line.java", "line.js", "line.py", "README.md", "line.cpp", "line2dintersection.hs"], "cryptography/src/affine_cipher": ["affine.cpp", "affine_cipher.py", "affine.py", "Affine.java", "affine.htm"], "mathematical_algorithms/src/diophantine": ["diophantine.cpp"], "mathematical_algorithms/src/prime_numbers_of_n": ["prime_numbers_of_n.py", "README.md", "prime_numbers_of_n.cpp"], "data_structures/src/queue/queue_stream": ["queue_stream.cs"], "sorting/src/quick_sort": ["quick_sort_three_way.cpp", "quick_sort_in_place.scala", "quick_sort.elm", "quick_sort.m", "quick_sort.go", "quick_sort.ml", "quick_sort_median_of_medians.c", "quick_sort.scala", "quick_sort.rs", "quick_sort.rb", "quick_sort.hs", "quick_sort.swift", "quick_sort.lua", "quick_sort.ts", "quick_sort.cpp", "quick_sort.java", "README.md", "dutch_national_flag.cpp", "quick_sort.sh", "quick_sort.cs", "quick_sort.py", "quick_sort.c", "quick_sort.js"], "compression/test": ["README.md"], "data_structures/src/stack/sort_stack": ["sort_stack.py", "sort_stack.c", "sort_stack.cpp", "README.md"], "mathematical_algorithms/src/reverse_number": ["reverse_number.go", "reverse_number.py", "reverse_number.js", "reverse_number.php", "Reverse_a_number.c", "reverse_number.hs", "reverse_number_recursion.java", "reverse_number.c", "reverse_number.rb", "reverse_number.cs", "reverse_number.java", "reverse_number.swift", "reverse_number.cpp"], "networking/test": ["README.md"], "graph_algorithms/src/eulerian_path": ["eulerian.py", "eulerian.java", "README.md"], "string_algorithms/src/rabin_karp_algorithm": ["rabin_karp.py", "RabinKarp.java", "README.md", "rabin-karp.c"], "string_algorithms/src/lipogram_checker": ["lipogram_checker.cpp", "lipogram_checker.py", "lipogram_checker.cs", "lipogram_checker.js"], "graph_algorithms/src/ford_fulkerson_maximum_flow": ["FordFulkersonUsingBfs.java", "ford_fulkerson_using_bfs.cpp", "ford_fulkerson_using_bfs.py", "ford_fulkerson.cpp", "README.md"], "unclassified/src/jaccard_similarity": ["jaccard.c", "jaccard.py", "README.md", "jaccard.java"], "mathematical_algorithms/src/convolution": ["convolution.cpp"], "graph_algorithms/src/kruskal_minimum_spanning_tree": ["kruskal_minimum_spanning_tree.py", "kruskal_mst.c", "README.md", "Kruskals.java", "kruskal_minimum_spanning_tree.cpp"], "dynamic_programming/src/palindrome_partition": ["palindrome_partition.js", "palindrome_partition.cpp", "README.md"], "mathematical_algorithms/src/babylonian_method": ["babylonian_method.js", "Babylonian_method.py", "babylonian_method.c", "babylonian_method.cpp", "README.md", "babylonian_method.go", "babylonian_method.java"], "sorting/src/heap_sort": ["heap_sort.rs", "heap_sort.cpp", "heap_sort.java", "heap_sort.m", "heap_sort.js", "heap_sort.swift", "heap_sort.sc", "heap_sort.go", "heap_sort.c", "README.md", "heap_sort.py", "heap_sort.rb", "heap_sort.cs"], "unclassified/src/minimum_subarray_size_with_degree": ["minSubarraySizeWithDegree.cpp"], "unclassified/src/tokenizer": ["string_tokenizer.cpp"], "computational_geometry/src/2d_separating_axis_test": ["sat.cpp"], "sorting/src/circle_sort": ["circle_sort.cpp", "circle_sort.m", "circle_sort.swift", "circle_sort.js", "circle_sort.c", "circle_sort.py", "circle_sort.cs", "circle_sort.java"], "graph_algorithms/src/dinic_maximum_flow": ["dinic_maximum_flow.cpp"], "mathematical_algorithms/src/sieve_of_eratosthenes": ["sieve_of_eratosthenes.go", "sieve_of_eratosthenes.java", "sieve_of_eratosthenes.c", "sieve_of_eratosthenes_linear.cpp", "sieve_of_erathosthenes_compact.cpp", "sieve_of_eratosthenes.php", "sieve_of_eratosthenes.js", "README.md", "sieve_of_eratosthenes.cpp", "sieve_of_eratosthenes.hs", "sieve_of_eratosthenes.cs", "sieve_of_eratosthenes.py"], "graph_algorithms/src/fleury_algorithm_euler_path": ["README.md"], "mathematical_algorithms/src/armstrong_numbers": ["armstrong_numbers.py", "armstrong_numbers.java", "armstrong_number.php", "armstrong_numbers.rb", "armstrong_numbers.c", "README.md", "armstrong_numbers.cpp", "armstrong_numbers.cs", "armstrong_numbers.go", "armstrong_numbers.js"], "data_structures/src/tree/binary_tree/aa_tree": ["README.md", "aa_tree.cpp"], "mathematical_algorithms/src/perfect_number": ["perfect_number.py", "perfect_number.c", "perfect_number.cpp", "perfect_number.java", "perfect_number.rs", "perfect_number.rb", ".gitignore", "perfect_number.hs", "README.md", "perfect_number.php", "perfect_number.js", "perfect_number_list.cpp"], "online_challenges/src/project_euler/problem_007": ["problem_007.cpp", "README.md"], "mathematical_algorithms/src/shuffle_array": ["shuffle_array.rb", "shuffle_array.js", "README.md", "shuffle_array.cpp"], "compression/src/lossy_compression": ["README.md"], "mathematical_algorithms/src/tridiagonal_matrix": ["tridiagonal_matrix.java", "README.md"], "artificial_intelligence/src/decision_tree": ["decision_tree.py", "data_banknote_authentication.csv"], "mathematical_algorithms/src/count_trailing_zeroes": ["count_trailing_zeroes_factorial.java", "count_trailing_zeroes.c", "count_trailing_zeros_factorial.js", "count_trailing_zeroes.scala", "count_trailing_zeros_factorial.cpp", "count_trailing_zeros_factorial.py"], "data_structures/src/bag": ["bag.js", "bag.java", "bag.py"], "online_challenges/test": ["README.md"], "greedy_algorithms/src/prim_minimum_spanning_tree": ["prims_mst.py", "prim_mst.cpp", "README.md", "prim_mst_haskell.hs"], "graph_algorithms/src/cut_vertices": ["cut_vertices.cpp", "README.md"], "string_algorithms/src/palindrome_checker": ["Palindrome.purs", "palindrome.sh", "palindrome.cs", "palindrome.rb", "Palindrome.java", "palindrome.lua", "palindrome.swift", "palindrome.py", "palindrome.rs", "palindrome.c", "palindrome.js", "palindrome.cpp", "palindrome.go", "palindrome.php", "palindrome.clj", "palindrome.hs", "Palindrome.kt", "palindrome.ex", "palindrome.erl"], "mathematical_algorithms/src/average_stream_numbers": ["average_stream_numbers.go", "average_stream_numbers.py", "README.md", "average_stream_numbers.cpp"], "data_structures/src/tree/binary_tree/binary_tree/make_mirror_tree": ["make_mirror_tree.cpp", "make_mirror_tree.c", "make_mirror_tree.py", "README.md"], "mathematical_algorithms/src/log_of_factorial": ["log_of_factorial.c", "log_of_factorial.cpp", "log_of_factorial.py"], "string_algorithms/src/password_strength_checker": ["pw_checker.cpp", "pw_checker.py", "pw_checker.cs", "README.md", "pw_checker.java", "pw_checker.js"], "mathematical_algorithms/src/binomial_coefficient": ["binomial_coefficient.cpp", "binomial_coefficient.go", "binomial_coefficient.py", "README.md", "binomial_coefficient.java"], "mathematical_algorithms/src/fast_fourier_transform": ["fast_fourier_transform.java"], "data_structures/src/list/singly_linked_list/operations/unclassified": ["union_intersection_in_list.c", "linked_List_Operations.cpp", "union_intersection_in_list.textClipping", "LinkedList.java"], "data_structures/src/tree/space_partitioning_tree/interval_tree": ["interval_tree.cpp", "interval_tree.java", "README.md"], "computational_geometry/src/graham_scan": ["GrahamScan.java", "graham_scan.cpp"], "mathematical_algorithms/src/newton_polynomial": ["README.md", "newton_polynomial.java"], "sorting/src/intro_sort": ["intro_sort.cpp", "intro_sort.m", "intro_sort.swift"], "bit_manipulation/src/sum_binary_numbers": ["sum_binary_numbers.c", "README.md"], "data_structures/test/tree/multiway_tree/red_black_tree": ["test_red_black.c"], "dynamic_programming/src/largest_sum_contiguous_subarray": ["largest_sum_contiguous_subarray.java", "largest_sum_contiguous_subarray.cpp", "largest_sum_contiguous_subarray.py", "README.md", "largest_sum_contiguous_subarray.hs", "largest_sum_contiguous_subarray.go"], "graph_algorithms/src/left_view_binary_tree": ["left_view_binary_tree.cpp", "left_view_binary.py"], "operating_system/src/shortest_seek_time_first": ["shortest_seek_time_first.c", "shortest_seek_time_first.cpp"], "graph_algorithms/src/centroid_decomposition": ["centroid_decomposition.java"], "artificial_intelligence/src/support_vector_machine": ["README.md"], "mathematical_algorithms/src/lexicographic_string_rank": ["lexicographic_string_rank.c", "lexicographic_string_rank.java", "lexicographic_string_rank.cpp", "lexicographic_string_rank.py", "README.md"], "operating_system/src/multi_level_feedback_queue_scheduling": ["mlfq.ts"], "data_structures/src/hashs/hash_table": ["double_hashing.c", "hash_table.rs", "hash_table.swift", "hash_table.cpp", "hash_table.cs", "hash_table.c", "hash_table.go", "hash_table.java", "README.md", "hash_table.js"], "computational_geometry/src/cohen_sutherland_lineclip": ["lineclip.c", "README.md"], "bit_manipulation/src/xor_swap": ["xor_swap.c", "README.md", "xor_swap.py", "xor_swap.cpp"], "data_structures/src/list/singly_linked_list/operations/push": ["push.cpp"], "dynamic_programming/test/subset_sum": ["test_subset_sum.cpp"], "backtracking/src/partitions_of_set": ["set_partitions.cpp", "set_partitions.go", "README.md"], "greedy_algorithms/src/job_sequencing": ["job_sequencing.py", "README.md", "job_sequencing.cpp"], "greedy_algorithms/src/hillclimber": ["Hillclimber.java"], "graph_algorithms/src/minimum_s_t_cut": ["README.md"], "divide_conquer/src/closest_pair_of_points": ["closest_pair.py", "closest_pair.cpp"], "sorting/src/bead_sort": ["bead_sort.cpp", "bead_sort.php", "bead_sort.py", "bead_sort.java", "bead_sort.cs", "bead_sort.swift", "bead_sort.c", "README.md", "bead_sort.m", "bead_sort_numpy.py", "bead_sort.js"], "data_structures/src/tree/binary_tree/binary_tree/is_balance": ["README.md", "is_balance.java"], "operating_system/src/peterson_algorithm_for_mutual_exclusion": ["mythreads.h", "peterson_algo_mutual_exclusion_in_c.c"], "data_structures/src/queue/circular_buffer": ["circular_buffer.py", "circular_buffer.cpp"], "mathematical_algorithms/src/pandigital_number": ["pandigital_number.c", "README.md", "pandigital_number.rb"], "networking/src/validate_IP": ["validate_ip.sh", "is_valid_ip.php", "ipv4_check.go", "README.md", "Validate_connection_ipv4.py", "validate_ip.rb", "validate_ipv4.py", "validate_ipv4.js", "validate_ip.c"], "utility/src/palindrome/palindrome_check": ["palindrome_check.cpp", "palindrome_check.rb"], "randomized_algorithms/src/randomized_quick_sort": ["randomized_quicksort.c"], "mathematical_algorithms/src/fibonacci_number": ["fibonacci_for_big_numbers.cpp", "fibonacci_number.swift", "fibonacci_number.c", "fibonacci_number.cpp", "fibonacci_matrix_multiplication.py", "fibonacci_number.ex", "fibonacci_number.py", "fibonacci_number.erl", "fibonacci_number.php", "fibonacci_number.scala", "fast_fibonacci.c", "fibonacci_number.go", "fibonacci_number.clj", "fibonacci_number.cs", "fibonacci_memorized.swift", "fibonacci_number.hs", "fibonacci_number.rb", "README.md", "fibonacci_number.rs", "fibonacci_lucas.py", "fibonacci_number.java", "fibonacci_number.js", "fibonacci_matrix_exponentiation.cpp"], "mathematical_algorithms/src/largrange_polynomial": ["README.md", "lagrange_polynomial.java"], "computational_geometry/src/bresenham_line": ["bresenham_line.py", "bresenhams_line.cpp"], "greedy_algorithms/test": ["README.md"], "graph_algorithms/src/bipartite_checking": ["BipartiteGraphCheckAdjacencyList.java", "bipartite.cpp", "bipartitecheckingusing_bfs.cpp", "README.md", "bipartite_checking.cpp", "BipartiteBfs.java"], "unclassified/test": ["README.md"], "mathematical_algorithms/src/reverse_factorial": ["reverse_factorial.py", "reverse_factorial.rb", "reverse_factorial.java", "README.md", "reverse_factorial.js", "reverse_factorial.go"], "artificial_intelligence/src/gaussian_mixture_model": ["README.md"], "graph_algorithms/src/dijkstra_shortest_path": ["dijkstra_gnu_fast.cpp", "dijkstra.cpp", "Dijkstra.py", "README.md", "dijkstra_efficient.py", "Dijkstra_Algorithm.c"], "mathematical_algorithms/src/fractals": ["julia_miim.cpp", "simple_julia.cpp"], "dynamic_programming/src/subset_sum": ["subset_sum.go", "subset_sum.java", "subset_sum.cpp", "subset_sum.py", "README.md"], "sorting/src/bogo_sort": ["bogo_sort.go", "bogo_sort.py", "bogo_sort.fs", "bogo_sort.rb", "bogo_sort.js", "bogo_sort.cpp", "bogo_sort.m", "README.md", "bogo_sort.swift", "bogo_sort.java"], "mathematical_algorithms/src/lucas_theorem": ["lucas_theorem.cpp"], "graph_algorithms/src/topological_sort": ["topological_sort_adjacency_matrix.java", "toposort.py", "topological.hs", "TopologicalSortAdjacencyMatrix.java", "topological_sort_adjacency_list.java", "TopologicalSortAdjacencyList.java", "toposort.cpp", "README.md", "topological_sort.c", "kahn_algo_unique_toposort.cpp"], "greedy_algorithms/src/dijkstra_shortest_path": ["dijkstra_shortest_path.c", "dijkstra_shortest_path.java", "dijkstra-shortest-path.cpp", "dijkstra_shortest_path.py", "README.md"], "graph_algorithms/src/shortest_path_k_edges": ["README.md"], "graph_algorithms/src/johnson_algorithm_shortest_path": ["johnsons_algo.py", "README.md"], "graph_algorithms/src/tarjan_algorithm_strongly_connected_components": ["README.md", "tarjan_algorithm.c"], "data_structures/src/list/doubly_linked_list": ["doubly_linked_list.java", "doubly_linked_list.js", "doubly_linked_list.swift", "doubly_linked_list.py", "doubly_linked_list.cpp", "doubly_linked_list.h", "doubly_linked_list.go", "doubly_linked_list.c"], "graph_algorithms/test": ["README.md"], "dynamic_programming/src/knapsack": ["knapsack.c", "Knapsack.java", "knapsack.js", "knapsack.py", "README.md", "knapsack.go", "knapsack.cpp"], "online_challenges/src/project_euler/problem_010": ["README.md", "problem_010.cpp"], "online_challenges/src/project_euler/problem_014": ["README.md", "problem_014.cpp"], "data_structures/test/list": ["test_list.cpp"], "dynamic_programming/src/longest_common_subsequence": ["LongestCommonSubsequenceRec.java", "Longest_Common_Subsequence.py", "LongestCommonSubsequence.java", "README.md", "longestCommonSubsequence.go", "longest_common_subsequence.cpp"], "graph_algorithms/src/transitive_closure_graph": ["transitive_closure_graph_floyd_warshall.cpp", "transitive_closure.cpp", "README.md", "transitive_closure_graph.py"], "graph_algorithms/src/bellman_ford_algorithm": ["BellmanFordEdgeList.java", "bellman_ford.cpp", "bellman_ford.php", "BellmanFordAdjacencyList.java", "bellman_ford.py", "README.md", "bellman_ford.c"], "data_structures/src/tree/binary_tree/binary_tree/make_binary_tree/from_inorder_and_preorder": ["make_tree_from_inorder_and_preorder.cpp", "README.md", "make_tree_from_inorder_and_preorder.java", "make_tree_from_inorder_and_preorder.c"], "data_structures/src/hashs/bloom_filter": ["bloom_filter.c", "bloom_filter.java", "bloom_filter.js", "bloom_filter.py", "bloom_filter.cpp", "bloom_filter.swift", "bloom_filter.scala"], "dynamic_programming/src/longest_bitonic_sequence": ["longest_bitonic_sequence.py", "longestBitonicSeq.cpp", "longest_bitonic_sequence.c", "README.md", "longestBitonicSequence.java", "longest_bitonic_sequence.js"], "cellular_automaton/src/brians_brain": ["README.md"], "data_structures/src/list/singly_linked_list/operations/print_reverse": ["print_reverse.py", "print_reverse.scala"], "graph_algorithms/src/channel_assignment": ["README.md"], "mathematical_algorithms/src/karatsuba_multiplication": ["karatsuba_multiplication.java"], "dynamic_programming/src/min_cost_path": ["min_cost_path.py", "README.md", "min_cost_path.cpp", "min_cost_path.java"], "backtracking/src/algorithm-x": ["algo-x.cpp", "README.md"], "mathematical_algorithms/src/horner_polynomial_evaluation": ["horner_polynomial_evaluation.java", "horner_polynomial_evaluation.cpp", "README.md"], "greedy_algorithms/src/huffman_coding": ["huffman_codiing.py", "README.md", "huffman_coding.cpp"], "string_algorithms/src/morse_code": ["morsecode.go", "morsecode.py", "morsecode.js"], "operating_system/src/first_come_first_serve": ["fcfs.cs", "fcfs.cpp", "fcfs.py", "fcfs.rs", "FCFS.java"], "mathematical_algorithms/src/lucky_number": ["lucky_number.c", "lucky_number.java", "README.md"], "bit_manipulation/src/bit_division": ["bitDivison.py", "bitDivision.go", "bitDivision.js", "README.md", "bitDivision.c", "BitDivision.java"], "unclassified/src/utilities": ["convert2mp3.sh", "download_link.sh"], "data_structures/src/tree/binary_tree/binary_tree/path_sum/sum_left": ["README.md", "sum_left.c"], "search/src/interpolation_search": ["interpolation_search.py", "interpolation_search.java", "interpolation_search.cpp", "interpolation_search.go", "README.md", "interpolation_search.php", "interpolation_search.c"], "graph_algorithms/src/maximum_bipartite_matching": ["README.md", "max_bipartite_matching.py"], "string_algorithms/src/kasai_algorithm": ["kasai_algorithm.cpp", "README.md"], "data_structures/src/tree/binary_tree/binary_tree/is_same": ["is_same.cpp"], "artificial_intelligence/src/k_means": ["k_means.py", "k_means.swift", "k_means.cpp", "README.md"], "artificial_intelligence/src/naive_bayes": ["naive_bayes.swift", "README.md"], "data_structures/src/tree/heap/soft_heap": ["soft_heap.cpp"], "cryptography/src/polybius_cipher": ["polybius.py"], "sorting/src/tree_sort": ["tree_sort.java", "tree_sort.js", "tree_sort.c", "tree_sort.go", "tree_sort.cpp", "tree_sort.py"], "data_structures/src/list/singly_linked_list/operations/reverse": ["reverse_iteration.cpp", "reverse_recursion2.cpp", "reverse_recursion.cpp", "reverse.c", "reverse.cpp"], "design_pattern/src/observer_pattern": ["observer_pattern.cpp", "observer_pattern.rs"], "sorting/src/cycle_sort": ["cycle_sort.js", "cycle_sort.java", "cycle_sort.go", "cycle_sort.cpp", "README.md", "cycle_sort.m", "cycle_sort.cs", "cycle_sort.swift", "cycle_sort.py"], "data_structures/src/list/singly_linked_list/operations/merge_sorted": ["merge_sorted.cpp"], "mathematical_algorithms/test": ["README.md"], "data_structures/src/list/xor_linked_list": ["xor_linked_list.cpp", "README.md"], "mathematical_algorithms/src/segmented_sieve_of_eratosthenes": ["segmented_sieve_of_eratosthenes.cpp"], "greedy_algorithms/src/kruskal_minimum_spanning_tree": ["kruskal.c", "kruskal.py", "README.md"], "data_structures/src/list/skip_list": ["skip_list.swift", "skip_list.c", "skip_list.cpp", "skip_list.scala", "README.md", "skip_list.java"], "bit_manipulation/src/sum_equals_xor": ["sum_equals_xor.py", "sum_equals_xor.c", "README.md", "sum_equals_xor.cpp"], "artificial_intelligence/src/random_forests": ["README.md"], "data_structures/src/queue/queue_using_stack": ["queue_using_stack.java", "queue_using_stack.cpp", "queue_using_stack.sh"], "mathematical_algorithms/src/exponentiation_power/exponentiation_by_squaring": ["exponentiation_by_squaring.cpp", "exponentiation_by_squaring.go", "exponentiation_by_squaring.py"], "cellular_automaton/src/von_neumann_cellular_automata": ["README.md"], "data_structures/src/tree/b_tree/two_three_tree": ["TwoThreeTree.scala"], "data_structures/src/list/singly_linked_list/operations/rotate": ["rotate.cpp"], "artificial_intelligence/src/hierachical-clustering": ["hierachical_clustering.cpp", "README.md"], "data_structures/test/tree/binary_tree/binary_tree/is_same": ["test_is_same.cpp"], "cryptography/src/atbash_cipher": ["atbash_cipher.cpp", "README.md", "atbash_cipher.py"], "backtracking/src/knight_tour": ["knight_tour_withoutBT.c", "knight_tour.rs", "knight_tour.cpp", "knight_tour.java", "knight_tour.py", "README.md", "knight_tour.c", "knight_tour.go"], "dynamic_programming/src/Array_Median": ["median.php", "median.rs", "Median.java", "median.rb", "median.py"], "backtracking/src/m_coloring_problem": ["m_coloring.py"], "cryptography/src/rail_fence_cipher": ["rail_fence.rb", "rail_fence.py", "rail_fence.cpp"], "string_algorithms/src/z_algorithm": ["z_algorithm_z_array.cpp", "Z_Algorithm.py", "Z-algo.cpp", "README.md"], "divide_conquer/src/warnock_algorithm": ["warnock_algorithm.pde"], "sorting/src/bucket_sort": ["bucket_sort.js", "bucket_sort.m", "bucket_sort.java", "bucket_sort.cs", "bucket_sort.hs", "bucket_sort.php", "README.md", "bucket_sort.cpp", "bucket_sort.swift", "bucket_sort.rb", "bucket_sort.c", "bucket_sort.py", "bucket_sort.go"], "mathematical_algorithms/src/derangements": ["derangements.c"], "data_structures/src/tree/binary_tree/binary_tree/is_binary_tree": ["is_binary_tree.cpp"], "backtracking/src/subset_sum": ["SubsetSum.java", "Subset_Sum.c", "subset_sum.go", "Subset_Sum_Duplicates.py", "subset_sum.cpp", "SubsetSum.py", "README.md"], "data_structures/test/tree/binary_tree/binary_tree/path_sum": ["test_path_sum_for_sum_of_whole_paths.cpp", "test_path_sum_for_sum_of_part_paths.cpp", "test_path_sum_for_whole_paths.cpp"], "dynamic_programming/src/coin_change": ["mincoinchange.cpp", "coinchange.go", "coin_change.java", "coin_change.py", "README.md", "coinchange.c", "coinchange.cpp"], "data_structures/src/tree/heap/max_heap": ["max_heap.py", "max_heap.go", "max_heap.java", "max_heap.cpp", "max_heap.c"], "compression/src/lossless_compression/lempel-ziv-welch": ["lzw.cpp", "lzw.py", "README.md"], "mathematical_algorithms/src/smallest_digit_in_number": ["smallest_digit_in_number.js", "Smallest_digit_in_number.hs", "smallest_digit_in_number.cpp", "smallest_digit_in_number.rb", "smallest_digit_in_number.php", "smallest_digit_in_number.py", "smallest_digit_in_number.c", "smallest_digit_in_number.java"], "computational_geometry/src/axis_aligned_bounding_box_collision": ["axis_aligned_bounding_box_collision.cpp", "axis_aligned_bounding_box_collision.go"], "artificial_intelligence/src/Logistic_Regression": ["README.md", "Logistic_Regression.py"], "divide_conquer/test": ["README.md"], "randomized_algorithms/src/kth_smallest_element_algorithm": ["kth_smallest_element_algorithm.c", "kth_smallest_element_algorithm.cpp", "README.md"], "search/src/fuzzy_search": ["fuzzy_search.js", "fuzzy_search.php"], "cryptography/src/huffman_encoding": ["huffman_encoding.c"], "string_algorithms/src/trie_pattern_search": ["trie.cpp", "README.md"], "numerical_analysis/integral/src": ["integral_trapezoid.cpp", "integral_rectangle.cpp"], "sorting/src/shaker_sort": ["shaker_sort.js", "shaker_sort.cpp", "shaker_sort.cs", "shaker_sort.java", "shaker_sort.rs", "shaker_sort.c", "shaker_sort.go", "README.md", "shaker_sort.py", "shaker_sort.swift", "shaker_sort.m", "shaker_sort.php"], "dynamic_programming/src/shortest_common_supersequence": ["shortest_common_supersequence.py", "SCS.java", "README.md", "shortest_common_supersequence.cpp"], "backtracking/src/powerset": ["PowerSet.java", "powerset.go"], "string_algorithms/src/aho_corasick_algorithm": ["aho_corasick.java", "aho_corasick.cpp", "aho_corasick_algorithm.cpp", "README.md"], "dynamic_programming/src/longest_increasing_subsequence": ["longest_increasing_subsequence_using_segment_tree.cpp", "longest_increasing_subsequence.c", "longest_increasing_subsequence.cpp", "longest_increasing_subsequence.js", "longest_increasing_subsequence.py", "longest_increasing_subsequence.go", "README.md", "longest_increasing_subsequence.java"], "data_structures/src/list/circular_linked_list/operations": ["has_loop.py", "is_circular.py"], "greedy_algorithms/src/fractional_knapsack": ["fractional_knapsack.cpp", "fractional_knapsack.java", "fractional_knapsack.go", "README.md", "fractional_knapsack.cs", "fractional_knapsack.c", "fractional_knapsack.py"], "operating_system/src/bankers_algorithm": ["banker_safety.cpp"], "graph_algorithms/src/connected_components": ["connected_components.c"], "data_structures/src/stack/stack": ["stack.php", "stack.js", "stack.rb", "stack.c", "stack.rs", "stack.cs", "stack.ex", "README.md", "stack.cpp", "stack.py", "stack.go", "stack.erl", "stack.swift", "stack.java"], "mathematical_algorithms/src/multiply_polynomial": ["multiply_polynomial.cpp", "README.md"], "sorting/src/stooge_sort": ["stooge_sort.js", "stooge_sort.java", "stooge_sort.go", "stooge_sort.c", "README.md", "stooge_sort.py"], "cryptography/src/porta_cipher": ["porta.py"], "data_structures/src/tree/binary_tree/avl_tree": ["avl_tree.cpp", "avl_tree.java", "avl_tree.swift"], "data_structures/src/tree/b_tree/b_tree/b_tree_C": ["README.md", "main.c", "btree.c", "btree.h"], "cryptography/src/vigenere_cipher": ["vigenere_cipher.jl", "vigenere_cipher.rb", "vigenere.go", "vigenere_cipher.py", "vigenere_cipher.java", "vigenere_cipher.php", "vigenere_cypher.cpp", "vigenere_cipher.c", "README.md", "vigenere_cipher.js", "vigenere_cipher.hs"], "data_structures/src/tree/multiway_tree/union_find": ["union_find.cpp", "union_find.js", "union_find.c", "union_find.py", "union_find.java", "README.md", "union_find.go", "union_find.scala"], "sorting/src/gnome_sort": ["gnome_sort.cpp", "gnome_sort.py", "gnome_sort.m", "gnome_sort.java", "gnome_sort.swift"], "dynamic_programming/src/binomial_coefficient": ["binomial_coefficient.cpp", "binomial_coefficient.c", "binomial_coefficient.js", "binomial_coefficient.py", "README.md", "binomial_coefficient.java"], "data_structures/src/stack/abstract_stack/cpp/arrayStack": ["ArrayStack.h", "arraystackTester.cpp"], "data_structures/src/queue/queue": ["queue.swift", "queue.java", "queue.py", "queue_vector.cpp", "queue.cpp", "queue.js", "README.md", "queue.c", "queue.cs", "queue.go", "queue.rb"], "bit_manipulation/src/lonely_integer": ["lonelyInteger.go", "LonelyInt.js", "lonelyInteger.py", "LonelyInt.java", "LonelyInteger.c", "README.md", "lonelyInteger.cpp", "lonely_integer.rs"], "dynamic_programming/src/minimum_insertion_palindrome": ["minimum_insertions_palindrome_using_lcs.cpp"], "cryptography/src/morse_cipher": ["morse_code_generator.cpp", "morse_code_translator.php", "morse_code_translator.cpp", "morseCode_translator.lua", "morse_code_generator.rb", "morse_code_translator.ts", "MorseCode.java", "morse-code-translator.js", "morse_code_translator.py", "README.md", "morsecode.sh", "morse_code_generator.c", "morse_code_generator.bf"], "operating_system/test": ["README.md"], "data_structures/src/other": ["README.md"], "data_structures/src/tree/heap/min_heap": ["min_heap.swift", "min_heap.py", "min_heap.cpp", "min_heap.js", "min_heap2.cpp", "min_heap.rb", "min_heap.java"], "data_structures/src/list/singly_linked_list/operations/delete": ["delete_node_with_key.java"], "compression/src/lossless_compression/huffman": ["huffman.test.cpp", "huffman.cpp", "README.md"], "dynamic_programming/src/minimum_insertions_palindrome": ["minimum_insertions_palindrome.cpp"], "data_structures/src/tree/binary_tree/binary_tree/traversal/preorder/right_view": ["right_view2.cpp", "right_view.py", "README.md", "right_view.cpp"], "unclassified/src/biggest_of_n_numbers": ["biggest_of_n_numbers.c", "biggest_of_n_numbers.cpp", "biggest_of_n_numbers2.cpp", "biggest_of_n_numbers.py"], "mathematical_algorithms/src/euler_totient": ["euler_totient.c", "euler_totient_sieve.cpp", "euler_totient_sieve.py", "euler_totient.java", "README.md", "euler_totient.cpp", "euler_totient.py"], "unclassified/src/josephus_problem": ["josephus.go", "josephus.cpp", "josephus.c", "josephus.py"], "artificial_intelligence/src/nearest_sequence_memory/nsm_MATLAB": ["main.m", "simulator.m", "nsm_agent.m"], "mathematical_algorithms/src/catalan_number": ["catalan_number_dynamic.cpp", "catalan_number.rb", "catalan_number.java", "catalan_number.js", "catalan_number.c", "catlan_number.py", "catalan_number.py", "catalan_number_recursive.cpp", "README.md", "catalan_number.scala"], "mathematical_algorithms/src/pythagorean_triplet": ["pythagorean_triplet.cpp"], "sorting/src/comb_sort": ["comb_sort.m", "comb_sort.swift", "comb_sort.go", "comb_sort.cpp", "comb_sort.js", "README.md", "comb_sort.java"], "graph_algorithms/src/prim_minimum_spanning_tree": ["prim_minimum_spanning_tree.py", "prim_minimum_spanning_tree.cpp", "Prims.c", "README.md"], "backtracking/test": ["README.md"], "artificial_intelligence/src/principal_component_analysis": ["pca.py", "README.md"], "bit_manipulation/src/flip_bits": ["flippingbits.c", "flippingbits.cpp", "FlipBits.java", "README.md", "flippingbits.py"], "data_structures/src/tree/binary_tree/binary_tree/maximum_height": ["maximum_height2.cpp", "maximum_height.cpp", "maximum_height.java", "README.md", "maximum_height.py"], "cryptography/src/rsa": ["rsa.cs", "rsa.c", "rsa_input.in", "rsa.py", "RSA.java"], "computational_geometry/src/jarvis_march": ["jarvis_march.cpp"], "graph_algorithms/src/kuhn_maximum_matching": ["kuhn_maximum_matching.cpp"], "bit_manipulation/src/invert_bit": ["invert_bit.py", "invert_bit.cpp", "invert_bit.c"], "backtracking/src/number_of_ways_in_maze": ["no_of_ways_in_maze.java", "no_of_ways_in_maze.rs", "noOfWaysinMaze.c", "README.md", "number_of_ways_in_maze.cpp", "no_of_ways_in_maze.go"], "randomized_algorithms/test": ["README.md"], "string_algorithms/src/pangram_checker": ["pangram_checker.go", "Pangram.java", "pangram_checker.m", "pangram.cpp", "pangram-checker.js", "pangram_checker.c", "pangram_checker.swift", "pangram_checker.py", "pangram.rb"], "data_structures/src/stack/prefix_to_postfix": ["prefix_to_postfix.py", "README.md"], "artificial_intelligence/src/neural_network": ["neuralnetwork.py"], "mathematical_algorithms/src/steepest_descent": ["steepest_descent.cpp"], "unclassified/src/majority_element": ["majority_element.cpp"], "dynamic_programming/src/maximum_sum_increasing_subsequence": ["README.md", "maximum_sum_increasing_subsequence.c"], "graph_algorithms/src/biconnected_components": ["biconnected_components.java", "README.md", "biconnected_components.cpp"], "cellular_automaton/src/genetic_algorithm": ["genetic_algorithm.java", "genetic_algorithm2.py", "genetic_algorithm.py", "genetic.cpp", "genetic_algorithm.go", "genetic_algorithm.js"], "dynamic_programming/src/box_stacking": ["README.md", "box_stacking.cpp", "box_stacking.py", "BoxStacking.java"], "mathematical_algorithms/src/greatest_digit_in_number": ["greatest_digit_in_number.cs", "greatest_digit_in_number.c", "greatest_digit_in_number.rb", "greatest_digit_in_number.cpp", "greatest_digit_in_number.hs", "greatest_digit_in_number.py", "greatest_digit_in_number.js", "greatest_digit_in_number.php", "greatest_digit_in_number.java"], "mathematical_algorithms/src/next_larger_number": ["next_larger_number.cpp", "next_larger_number.py", "next_larger_number.php", "next_larger_number.java"], "mathematical_algorithms/src/pascal_triangle": ["pascal_triangle.py", "pascal_triangle.exs", "pascal_triangle.c", "pascal_triangle.go", "README.md", "pascal_triangle.java", "pascal_triangle.cpp"], "data_structures/src/tree/space_partitioning_tree/quad_tree": ["quad_tree.swift"], "graph_algorithms/src/postorder_from_inorder_and_preorder": ["inprepost.cpp"], "dynamic_programming/src/weighted_job_scheduling": ["weighted_job_scheduling.cpp", "README.md"], "search/src/ternary_search": ["ternary_search.c", "ternary_search.js", "ternary_search.py", "ternary_search.cpp", "ternary_search.kt", "Ternary_search.java", "README.md", "ternary_search.go", "ternary_search.rs", "ternary_search.php"], "backtracking/src/n_queen": ["nqueen_bit.go", "NQueen_Bitset.cpp", "nqueen.py", "nqueen.go", "NQueen_Backtracking.cpp", "n _queen.c", "nQueen.hs", "Nqueen_Backtracking.rs", "README.md", "NQueen_BitImp.cpp", "NQueen.java"], "graph_algorithms/src/graph_coloring": ["graph_coloring.java", "graph_color_greedy.py", "README.md", "graph_coloring.cpp"], "graph_algorithms/src/hamiltonian_path": ["hamiltonian_path.cpp"], "backtracking/src/partitions_of_number": ["partitions_of_number.cpp", "README.md", "partitions_of_number.rs", "partitions_of_number.go"], "cellular_automaton/src/conways_game_of_life": ["game_of_life_C_SDL.c", "GameOfLife.hs", "life.py", "life.c", "life.rb", "conways_game_of_life.rb", "README.md", "life.cpp", "Conway.java", "life.go"], "artificial_intelligence/src/factorization_machines": ["README.md"], "computational_geometry/src/quickhull": ["test_data_soln.txt", "test_data_soln.png", "quickhull.hs", "quickhull.cpp", "README.md", "quickHull.java", "test_data.csv"], "operating_system/src/shell/C": ["Shell.c", "Makefile", "README.md"], "unclassified/src/split_list": ["split_list.py"], "design_pattern/src/singleton_pattern": ["singleton_pattern.java", "singleton_pattern.cpp"], "sorting/src/median_sort": ["median_sort.cs", "median_sort.m", "median_sort_fast.cpp", "median_sort.py", "median_sort.cpp", "median_sort.swift"], "graph_algorithms/src/bridge_tree": ["bridge_tree.cpp"], "unclassified/src/magic_square": ["magic_square.py", "magic_square.c", "magic_square.php", "magic_square.swift"], "cellular_automaton/src/langtons_ant": ["LangtonAnt.py", "LangtonAnt.cpp", "LangtonAnt.java", "LangtonAnt.html", "README.md"], "artificial_intelligence/src/SAT": ["togasat.cpp"], "data_structures/src/tree/binary_tree/rope": ["rope.py"], "string_algorithms/src/naive_pattern_search": ["naive_pattern_search.py", "README.md"], "operating_system/src/producer_consumer": ["producer_consumer.cpp"], "mathematical_algorithms/src/tribonacci_numbers": ["tribonacci_numbers.cpp", "tribonacci_numbers.py", "tribonacci_numbers.go", "tribonacci_numbers.rs", "Tribonnaci.java", "tribonacci_numbers.java"], "data_structures/src/tree/multiway_tree/red_black_tree": ["red_black_tree.test.cpp", "red_black_tree.c", "red_black_tree.rb", "red_black_tree.cpp", "red_black_tree.java", "red_black_tree.h", "red_black_tree.scala"], "graph_algorithms/src/hopcroft_karp_algorithm": ["README.md"], "mathematical_algorithms/src/fermats_little_theorem": ["fermats_little_theorem.py", "fermats_little_theorem.cpp"], "graph_algorithms/src/bron_kerbosch_algorithm": ["bron_kerbosch.java"], "unclassified/src/spiral_printing": ["spiral.c", "spiral_print.cpp", "spiral_print_array.py", "spiral_print.go"], "data_structures/src/tree/binary_tree/binary_tree/minimum_height": ["minimum_height.py", "README.md", "minimum_height.cpp", "minimum_height.java", "minimum_height.c"], "utility/test": ["README.md", "test_palindrome_check.cpp"], "mathematical_algorithms/src/std": ["std.py", "std.js", "std.c", "std.go", "std.cpp"], "artificial_intelligence/test": ["README.md"], "string_algorithms/src/finite_automata": ["SearchStringUsingDFA.java", "SearchStringUsingDFA.rs", "README.md"], "computational_geometry/src/sutherland_hodgeman_clipping": ["sutherland.c", "README.md", "sutherland.cpp"], "dynamic_programming/src/no_consec_ones": ["no_consec_1.cpp", "no_consec_ones.py", "README.md"], "dynamic_programming/src/boolean_parenthesization": ["boolean_parenthesization.c", "boolean_parenthesization.swift", "boolean_parenthesization.java", "boolean_parenthesization.cpp", "boolean_parenthesization.py", "README.md"], "data_structures/src/tree/binary_tree/binary_tree/tree/bottom_view_binary_tree": ["bottom_view_tree.java", "bottom_view_tree.cpp"], "artificial_intelligence/src/k_Nearest_Neighbours": ["iris.data", "k_Nearest_Neighbours.py"], "string_algorithms/src/suffix_array": ["suffixArray.java", "README.md"], "cryptography/src/runningkey_cipher": ["runningkey.py"], "mathematical_algorithms/src/2sum": ["2sum.c", "2sum.rs", "2sum.java", "2sum.rb", "2sum.go", "2sum.js", "2sum.cpp", "2sum.py"], "mathematical_algorithms/src/replace_0_with_5": ["replace_0_with_5.go", "replace_0_with_5.java", "replace_0_with_5.py", "0_to_5_efficent.cpp", "replace_0_with_5.cpp", "replace_0_with_5.js", "replace_0_with_5.c"], "computational_geometry/src/distance_between_points": ["distance_between_points.go", "distance_between_points.py", "distance_between_points.c", "distance_between_points.cpp", "distance_between_points.js", "distance_between_points.rs", "README.md", "DistanceBetweenPoints.java"], "graph_algorithms/src/breadth_first_search": ["bfs.rb", "breadth_first_search.py", "bfs.c", "breadth_first_search.swift", "bfs.cpp", "README.md", "Bfs.java"], "data_structures/src/stack/balanced_expression": ["balanced_expression.java"], "cryptography/src/rot13_cipher": ["rotN.js", "rot13.py", "rotN.java", "rot13.cpp", "rot13.sh", "rot13.js", "README.md", "rot13.rb", "rotN.cpp", "rotN.c"], "cryptography/src/caesar_cipher": ["caesar.go", "caesar_cipher.js", "encryption.cpp", "caesar_cipher.java", "CaesarCipher.cs", "caesar_cipher.php", "decryption.cpp", "casesar.hs", "caesar.rb", "caesar_cipher.cpp", "README.md", "caesar.py", "caesar.c"], "sorting/src/pigeonhole_sort": ["pigeonhole_sort.cpp", "pigeonhole_sort.java", "pigeonhole_sort.c", "pigeonhole_sort.py", "pigeonhole_sort.swift", "README.md", "pigeonhole_sort.cs", "pigeonhole_sort.m"], "sorting/src/shell_sort": ["shell_sort.m", "shell_sort.cpp", "shell_sort.js", "shell_sort.c", "shell_sort.java", "shell_sort.go", "README.md", "shell_sort.swift", "shell_sort.py"], "artificial_intelligence/src/gradient_boosting_trees": ["README.md"], "mathematical_algorithms/src/add_polynomials": ["add_polynomials.cpp", "README.md", "add_polynomials.c", "add_polynomials.go"], "bit_manipulation/src/magic_number": ["magic_number.c", "nth_magic_number.cpp", "magic_number.py", "magic_number.java", "README.md"], "data_structures/src/tree/binary_tree/binary_tree/traversal/preorder/left_view": ["left_view.java"], "divide_conquer/src/inversion_count": ["inversion_count.py", "inversion_count.js", "inversion_count.java", "README.md", "count_inversions.c", "inversion_count.cpp"], "cellular_automaton/test": ["README.md"], "mathematical_algorithms/src/permutation_lexicographic_order": ["permutation_lexicographic_order.cpp", "README.md"], "bit_manipulation/src/convert_number_binary": ["convert_number_binary.php", "intToBinary.py", "convert_number_binary.js", "binary_to_int.py", "README.md", "convert_number_binary.cpp", "ConvertNumberBinary.java", "convert_number_binary.hs", "convert_number_binary.c"], "cryptography/src/rsa_digital_signature": ["rsa_digital_signature.ipynb"], "sorting/src/flash_sort": ["flash_sort.js", "flash_sort.swift", "README.md", "flash_sort.c", "flash_sort.m"], "greedy_algorithms/src/k_centers": ["k_centers.py", "README.md"], "mathematical_algorithms/src/factorial": ["factorial.go", "factorial.clj", "factorial.swift", "factorial.scala", "factorial.ex", "factorial.java", "factorial.rs", "factorial_recursion.js", "factorial_iteration.py", "factorial-hrw.py", "factorial_recursion.cpp", "factorial.erl", "factorial_recursion.cs", "factorial.rb", "factorial.php", "factorial_iteration.c", "factorial_iteration.js", "factorial_recursion.c", "factorial.c", "factorial_recursion.py", "factorial_iteration.cs", "factorial.hs"], "greedy_algorithms/src/activity_selection": ["activity_selection.py", "activity_selection.cpp", "README.md", "activity_selection.java"], "dynamic_programming/src/edit_distance": ["edit_distance_hirschberg.cpp", "edit_distance.hs", "edit_distance.go", "edit_distance.c", "edit_distance.cpp", "edit_distance.py", "README.md", "edit_distance_backtracking.cpp", "edit_distance.java"], "search/src/exponential_search": ["exponential_search2.cpp", "exponential_search2.py", "exponential_search.rs", "exponential_search.cpp", "exponential_search.rb", "exponential_search.php", "exponential_search.js", "README.md", "exponential_search.java", "exponential_search.go"], "operating_system/src/readers_writes": ["readers_writes.cpp"], "cryptography/test": ["README.md"], "randomized_algorithms/src/random_from_stream": ["Random_number_selection_from_a_stream.cpp"], "graph_algorithms/src/hamiltonian_cycle": ["README.md", "hamiltonian_cycle.py"], "data_structures/src/stack/postfix_evaluation": ["postfix_evalluation.py", "postfix_evaluation.c", "postfix_evaluation.sh", "infix_to_postfix_evaluation.cpp", "README.md"], "cryptography/src/autokey_cipher": ["autokey.py"], "graph_algorithms/src/boruvka_minimum_spanning_tree": ["README.md", "boruvka_minimum_spanning_tree.cpp"], "search/src/fibonacci_search": ["fibonacci_search.c", "fibonacci_search.cpp", "fibonacci_search.py", "fibonacci_search.swift", "fibonacci_search.js"], "selection_algorithms/test": ["README.md"], "square_root_decomposition/src/MO's Algorithm": ["MOAlgo.cpp"], "artificial_intelligence/src/Linear_Regression": ["linear_regression.py", "linearRegression.js", "README.md", "LinearRegression.java", "linear_regression.swift"], "square_root_decomposition/test": ["README.md"], "bit_manipulation/src/thrice_unique_number": ["uniqueNumber.py", "ThriceUniqueNumber.java", "threeUnique.cpp", "README.md", "thrice_unique_number.js"], "dynamic_programming/src/longest_independent_set": ["README.md"], "bit_manipulation/src/byte_swapper": ["ByteSwapper.java"], "artificial_intelligence/src/q_learning": ["qLearning.js", "README.md"], "mathematical_algorithms/src/simpsons_rule": ["simpsons_rule.py"], "mathematical_algorithms/src/gaussian_elimination": ["gaussian_elimination.cpp", "gaussian_elimination.java"], "unclassified/src/fifteen_puzzle": ["log.txt", "Makefile", "readme.md", "fifteen.c"], "computational_geometry/test": ["README.md"], "operating_system/src/round_robin_scheduling": ["round_robin_scheduling.cpp", "round_robin_scheduling.java"], "dynamic_programming/src/factorial": ["factorial.py", "factorial.go", "factorial.scala", "factorial.java"], "data_structures/src/tree/binary_tree/treap": ["persistent_treap.kt", "treap.java", "treap.swift", "treap.cpp", "treap.scala"], "randomized_algorithms/src/random_node_linkedlist": ["README.md"], "bit_manipulation/src/maximum_xor_value": ["max_xor_value.cpp", "README.md"], "dynamic_programming/src/matrix_chain_multiplication": ["matrix_chain_multiplication.cpp", "matrix_chain_multiplication.c", "matrix_chain_multiplication.py", "README.md", "MatrixChainMultiplication.java"], "data_structures/src/tree/binary_tree/binary_tree/traversal/inorder/right_threaded": ["right_threaded.cpp"], "data_structures/src/list/singly_linked_list/operations/detect_cycle": ["detect_cycle.cpp"], "mathematical_algorithms/src/sieve_of_atkin": ["sieve_of_atkin.cpp", "sieve_of_atkin.c", "sieve_of_atkin.py", "sieve_of_atkin.java"], "mathematical_algorithms/src/prime_factors": ["prime_factors.cpp", "prime_factors.go", "prime_factors.py", "prime_factors.java", "prime_factors.c", "sum_of_primes.cpp"], "dynamic_programming/src/egg_dropping_puzzle": ["eggDropping.hs", "egg_dropping_puzzle.cpp", "README.md", "egg_dropping.py"], "graph_algorithms/src/floyd_warshall_algorithm": ["FloydWarshall.java", "floyd_warshall.py", "floyd_warshall.cpp", "floydWarshall.c", "README.md"], "unclassified/src/leap_year": ["leap_year.py", "leap_year.c", "README.txt", "leap_year.cpp"], "cryptography/src/columnar_transposition_cipher": ["columnar_transposition.cpp"], "dynamic_programming/src/longest_palindromic_substring": ["LongestPalindromicSubstring.cpp", "README.md"], "mathematical_algorithms/src/sum_of_digits": ["sum_of_digits.py", "sum_of_digits.rb", "sum_of_digits.cpp", "sum_of_digits.rs", "sum_of_digits.go", "sum_of_digits.swift", "sum_of_digits.cs", "sum_of_digits.js", "sum_of_digits_with_recursion.c", "sum_of_digits.java", "sum_of_digits.ex", "sum_of_digits.php", "sum_of_digits.c"], "cellular_automaton/src/nobili_cellular_automata": ["README.md"], "bit_manipulation/src/power_of_2": ["power_of_2.py", "PowerOf2.cs", "PowerOf2.java", "power_of_2.js", "power_of_2.cpp", "power_of_2.rs", "power_of_2.jl", "power_of_2.go", "power_of_2.c"], "mathematical_algorithms/src/decoding_of_string": ["README.md"], "mathematical_algorithms/src/poisson_sample": ["poisson_sample.py"], "search/test": ["test_search.cpp", "test_search.py", "README.md"], "data_structures/src/tree/multiway_tree/splay_tree": ["splay_tree.java", "splay_tree.go", "splay_tree.kt", "splay_tree.cpp", "readme.md", "splay_tree.scala"], "mathematical_algorithms/src/taxicab_numbers": ["taxicab_numbers.py"], "mathematical_algorithms/src/magic_square": ["magic_square.py", "README.md"], "greedy_algorithms/src/warshall": ["warshalls.c"], "mathematical_algorithms/src/primality_tests/solovay-strassen_primality_test": ["solovay-strassen_primality_test.cpp"], "numerical_analysis/monte_carlo/src": ["integral_monte_carlo.cpp", "pi_monte_carlo.cpp"], "randomized_algorithms/src/shuffle_an_array": ["shuffle_an_array.php", "shuffle_an_array.cpp", "Shuffle_An_Array.java", "shuffle_an_array.rs", "shuffle_library.rb", "shuffle_an_array.py", "shuffleArray.js", "shuffle_an_array.rb", "README.md"], "string_algorithms/src/kmp_algorithm": ["kmp.py", "kmp_algorithm.cpp", "README.md"], "mathematical_algorithms/src/russian_peasant_multiplication": ["russian_peasant_multiplication.go", "russian_peasant_multiplication.py", "russian_peasant_multiplication.rs", "russian_peasant_multiplication.cs", "russian_peasant_multiplication.php", "README.md", "russian_peasant_multiplication.cpp", "russian_peasant_multiplication.js"], "search/src/linear_search": ["linear_search.swift", "linear_search.cs", "linear_search.rb", "linear_search.c", "linear_search.clj", "linear_search.js", "linear_search.nim", "linear_search.kt", "linear_search.go", "linear_search.rs", "linear_search.java", "linear_search.cpp", "linear_search.hs", "README.md", "linear_search.ml", "linear_search.php", "SentinelLinearSearch.cpp", "linear_search.py", "linear_search.scala"], "graph_algorithms/src/travelling_salesman_mst": ["travelling_salesman.py", "README.md", "Travelling_salesman.cpp"], "graph_algorithms/src/Bipartite_check": ["Bipartite_check.java"], "dynamic_programming/src/Optimal_Binary_Search_Tree": ["Optimal_BST.py"], "dynamic_programming/src/maximum_sum_sub_matrix": ["MaximumSubMatrixSum.java", "MaxSumSubMatrix.cpp"], "data_structures/src/tree/multiway_tree/fenwick_tree": ["fenwick_tree.java", "fenwick_tree.py", "fenwick_tree.go", "fenwick_tree_inversion_count.cpp", "README.md", "fenwick_tree.c", "fenwick_tree.pl", "fenwick_tree.cpp"], "mathematical_algorithms/src/dfa_division": ["README.md"], "artificial_intelligence/src/restricted_boltzmann_machine": ["README.md"], "string_algorithms/src/arithmetic_on_large_numbers": ["string_subtract.cpp", "string_addition.cpp", "string_multiplication.cpp", "string_factorial.cpp"], "string_algorithms/src/anagram_search": ["anagram_search.rb", "anagram_search.java", "anagram_search.c", "anagram_search.cs", "anagram_search.go", "anagram_search.js", "anagram_search.swift", "anagram_search.cpp", "README.md", "anagram_search.py"], "sorting/src/selection_sort": ["selection_sort.vb", "selection_sort.php", "selection_sort.m", "selection_sort.kt", "selection_sort.rs", "selection_sort.rb", "selection_sort.py", "selection_sort.java", "selection_sort.c", "README.md", "selection_sort.js", "selection_sort.hs", "selection_sort.swift", "selection_sort.go", "selection_sort.cs", "selection_sort.sh", "selection_sort.cpp"], "sorting/src/insertion_sort": ["insertion_sort.php", "insertion_sort.swift", "insertion_sort.cs", "insertion_sort.cpp", "insertion_sort.m", "insertion_sort.java", "insertion_sort.sh", "insertion_sort.rb", "README.md", "insertion_sort.rs", "insertion_sort.c", "insertion_sort.go", "insertion_sort.py", "insertion_sort.js", "insertion_sort.hs", "insertion_sort.ml"], "data_structures/src/tree/space_partitioning_tree/kd_tree": ["kd_tree.cpp", "kd_tree.java"], "online_challenges/src/project_euler/problem_016": ["problem_016.py", "README.md"], "graph_algorithms/src/data_structures/adjacency_matrix_C": ["mgraph_struct.c", "mgraph_struct.h", "main.c"], "operating_system/src/least_recently_used": ["lru.c"], "dynamic_programming/src/longest_palindromic_sequence": ["longest_palindromic_sequence.c", "longest_palindromic_sequence.py", "longest_palindromic_sequence.js", "README.md", "longest_palindromic_sequence.cpp"], "mathematical_algorithms/src/fast_inverse_sqrt": ["fast_inverse_sqrt.cpp"], "artificial_intelligence/src/TSP": ["noneuc_100", "algo.md", "euc_500", "noneuc_500", "Makefile", "euc_250", "euc_100", "noneuc_250", "salesman.cpp"], "data_structures/src/tree/heap/binomial_heap": ["binomial_heap.cpp", "binomial_heap.c", "binomial_heap.scala"], "sorting/src/radix_sort": ["radix_sort.rs", "radix_sort.c", "radix_sort.hs", "radix_sort.js", "radix_sort.cpp", "radix_sort.py", "README.md", "radix_sort.java", "radix_sort.go"], "selection_algorithms/src/median-of-medians": ["median_of_medians.c", "median_of_medians.hs", "median_of_medians.py"], "data_structures/src/tree/space_partitioning_tree/segment_tree": ["lazy_segment_tree.java", "segment_tree_rmq.py", "segment_tree.scala", "segment_tree_sum.go", "segment_tree_kth_statistics_on_segment.cpp", "persistent_segment_tree_sum.cpp", "segment_tree_sum.cpp", "segment_tree_sum.rb", "segment_tree_rmq.go", "README.md", "segment_tree_rmq.cpp", "segment_tree.java", "segment_tree_lazy_propagation.cpp", "segment_tree_sum.py"], "mathematical_algorithms/src/delannoy_number": ["delannoy_number.cpp", "README.md"], "mathematical_algorithms/src/primality_tests/miller_rabin_primality_test": ["miller_rabin_primality_test.cpp", "miller_rabin_primality_test.py"], "online_challenges/src/project_euler/problem_036": ["problem_036.cpp", "problem_036.py", "README.md"], "sorting/test": ["test_sort.cpp", "test_sort.py", "README.md"], "computational_geometry/src/halfplane_intersection": ["halfplane_intersection.cpp"], "cellular_automaton/src/elementary_cellular_automata": ["README.md", "ElementaryCellularAutomaton.java"], "mathematical_algorithms/src/count_digits": ["count_digits.js", "count_digits.cpp", "count_digits.py", "count_digits.swift", "count_digits.cs", "count_digits.go", "count_digits.c", "count_digits.java", "count_digits.hs"], "cryptography/src/aes_128": ["aes_128.cpp", "AES_128.py"], "unclassified/src/lapindrom_checker": ["lapindrome_checker.cpp", "lapindrome_checker.py"], "string_algorithms/src/manachar_algorithm": ["manachar_longest_palindromic_subs.cpp", "manachar_longest_palindromic_subs.py"], "cryptography/src/baconian_cipher": ["baconian.php", "baconian.rb", "baconian.java", "baconian.py", "README.md"], "graph_algorithms/src/astar_algorithm": ["astar.js"], "sorting/src/topological_sort": ["topological_sort.cpp", "topological_sort.c", "topological_sort.java"], "design_pattern/test": ["README.md"], "data_structures/src/tree/heap/priority_queue/leftist_tree": ["leftist_priority_queue.cpp"], "artificial_intelligence/src/t_distributed_stochastic_neighbor_embedding": ["README.md"], "mathematical_algorithms/src/coprime_numbers": ["coprime_numbers.py", "coprime_numbers.rb", "coprime_numbers.c", "coprime_numbers.rs", "coprime_numbers.js", "coprime_numbers.go", "coprime_numbers.cpp", "coprime_numbers.cs"], "divide_conquer/src/merge_sort_using_divide_and_conquer": ["inversions.c", "MergeSort.java", "merge_sort_usingDandC.cpp", "README.md"], "graph_algorithms/src/depth_first_search": ["Dfs.java", "Dfs.kt", "dfs.rb", "depth_first_search.py", "README.md", "dfs.cpp", "dfs.c", "dfs.go"], "mathematical_algorithms/src/integer_conversion": ["decimal_to_oct.cpp", "decimal_to_any_base.py", "decimal_to_bin.cpp", "decimal_to_int.go", "decimal_to_hex.cpp", "decimal_to_any_base.js"], "data_structures/src/tree/binary_tree/binary_tree/node": ["node.cpp"], "networking/src/determine_endianess": ["determine_endianess.c"], "mathematical_algorithms/src/automorphic_numbers": ["automorphic_numbers.hs", "automorphic_numbers.cs", "automorphic_numbers.cpp", "automorphic_numbers.swift", "automorphic_numbers.php", "automorphic_numbers.go", "README.md", "automorphic_numbers.py", "automorphic_numbers.c", "automorphic_numbers.java", "automorphic_numbers.rb", "automorphic_numbers.js"], "mathematical_algorithms/src/divided_differences": ["divided_differences.java", "README.md"], "randomized_algorithms/src/reservoir_sampling": ["README.md", "reservoir_sampling.cpp", "reservoir_sampling.rs"], "graph_algorithms/src/longest_path_directed_acyclic_graph": ["README.md", "longest_path_directed_acyclic_graph.cpp"], "dynamic_programming/src/tiling_problem": ["tiling.cpp", "README.md", "tiling.py"], "data_structures/src/tree/multiway_tree/van_emde_boas_tree": ["van_emde_boas.cpp"], "mathematical_algorithms/src/integer_to_roman": ["integer_to_roman.cpp", "integer_to_roman.js", "integer_to_roman.py"], "graph_algorithms/src/count_of_ways_n": ["Count_of_ways_n.cpp"], "divide_conquer/src/quick_sort": ["quick_sort2.cpp", "quick_sort.rs", "quick_sort_java", "quick_sort.hs", "quick_sort.swift", "quick_sort.cpp", "README.md", "quick_sort.py", "quick_sort.c"], "bit_manipulation/src/subset_generation": ["subsetsum.cpp", "subsetgeneratorusingbit.cpp", "README.md", "subset_mask_generator.cpp"], "updated_at": 1111, "string_algorithms/src/boyer_moore_algorithm": ["boyer_moore.c", "README.md", "boyer_moore_algorithm.cpp"], "graph_algorithms/src/vertex_cover": ["README.md"], "string_algorithms/src/levenshtein_distance": ["LevenshteinDistance.java"], "graph_algorithms/src/strongly_connected_components": ["strongly_connected_components.cpp", "strongly_connected_components.py", "README.md"], "operating_system/src/dining_philosophers": ["README.md", "dining_philosophers.c"], "computational_geometry/src/area_of_polygon": ["AreaOfPolygon.java", "area_of_polygon.c", "area_of_polygon.cpp", "area_of_polygon.py"], "unclassified/src/average": ["average.c", "average.erl", "average.java", "average.scala", "average.cpp", "average.swift", "average.php", "average.ex", "average.py", "average.rb", "average.rs", "average.go", "average.es6.js", "average.js"], "data_structures/src/queue/queue_using_linked_list": ["queue_using_linked_list.java", "queue_using_linked_list.c", "queue_using_linked_list.rb", "queue_using_linked_list.cpp", "queue_using_linked_list.py", "README.md"], "data_structures/src/list/singly_linked_list/operations/find": ["SearchElement_list.java"], "data_structures/src/stack/reverse_stack": ["reverse_stack_without_extra_space.cpp", "reverse_stack.cs", "reverse_stack.py", "reverse_stack.c", "reverse_stack.java", "README.md", "reverse_stack.go", "reverse_stack.swift"], "greedy_algorithms/src/minimum_coins": ["minimum-coins.js", "MinimumCoins.hs", "minimum_coins.go", "minimum_coins.py", "README.md", "MinimumCoins.java", "minimum_coins.cpp"], "backtracking/src/crossword_puzzle": ["CrosswordPuzzle.java"], "graph_algorithms/src/maximum_edge_disjoint_paths": ["README.md"], "data_structures/src/stack/infix_to_postfix": ["infix_to_postfix.java", "infix_to_postfix.py", "README.md", "infix_to_postfix.c", "infix_to_postfix.cpp"], "string_algorithms/test": ["README.md"], "search/src/jump_search": ["jump_search.php", "jump_search.java", "jump_search.cpp", "jump_search.py", "jump_search.go", "jump_search.js", "jump_search.swift", "jump_search.rs", "jump_search.c", "README.md"], "operating_system/src/smallest_remaining_time_first": ["srtf.c"], "divide_conquer/src/karatsuba_multiplication": ["multiply.java"], "randomized_algorithms/src/karger_minimum_cut_algorithm": ["karger_minimum_cut_algorithm.cpp", "README.md"], "mathematical_algorithms/src/tower_of_hanoi": ["tower_of_hanoi.py", "tower_of_hanoi.ml", "tower_of_hanoi.go", "tower_of_hanoi_binary_solution.c", "tower_of_hanoi.c", "tower_of_hanoi.java", "README.md", "tower_of_hanoi.scala", "tower_of_hanoi.rs", "tower_of_hanoi.js", "tower_of_hanoi.cpp", "tower_of_hanoi.hs"], "mathematical_algorithms/src/primality_tests/fermat_primality_test": ["fermat_primality_test.c"], "mathematical_algorithms/src/gcd_and_lcm": ["gcd_and_lcm.java", "gcd_and_lcm.js", "gcd_and_lcm.ex", "gcd_and_lcm.php", "gcd_and_lcm.scala", "gcd_and_lcm.cpp", "gcd_and_lcm.cs", "gcd_and_lcm.c", "gcd_and_lcm.erl", "gcd_and_lcm.py", "gcd_and_lcm.go"], "mathematical_algorithms/src/newton_raphson_method": ["newton_raphson.c", "README.md", "newton_raphson.cpp", "newton_raphson.php"], "mathematical_algorithms/src/hill_climbing": ["hill_climbing.java"], "unclassified/src/paint_fill": ["paint_fill.cpp"], "sorting/src/merge_sort": ["merge_sort.c", "merge_sort.php", "merge_sort.java", "merge_sort_linked_list.c", "merge_sort.go", "merge_sort.swift", "merge_sort.rb", "merge_sort.pl", "merge_sort.rs", "merge_sort.fs", "merge_sort.js", "merge_sort.ts", "merge_sort.py", "merge_sort.hs", "README.md", "merge_sort.cpp", "merge_sort.m", "merge_sort.sh", "merge_sort.scala", "merge_sort.cs"]}; - -obj_keys = Object.keys(obj); -obj_keys.sort(); - //Tags for easy search var tags = ['sort','search','math','string','crypto','data structures','graph','greedy','operating systems','artificial intelligence']; var favs = []; @@ -93,6 +88,8 @@ $(function() { var current_fname; function dumpBookmarks(query) { + var obj = JSON.parse(localStorage["metadata"]); + $('#search').val(query); $("#front").hide(); $("#favorites").hide(); @@ -117,10 +114,8 @@ function dumpBookmarks(query) if(found_word == 1) - for (var key in obj_keys) + for (var key in obj) { - key = obj_keys[key]; - var current_found = 0; for(var pos in single_query) { diff --git a/code/popup.html b/code/popup.html index f66d81b..08cc60b 100644 --- a/code/popup.html +++ b/code/popup.html @@ -1,6 +1,6 @@ - + From b77b8338e20d4737e6c4335951b0cdd3f22094a6 Mon Sep 17 00:00:00 2001 From: Aastha Gupta Date: Mon, 19 Mar 2018 01:51:14 +0530 Subject: [PATCH 2/2] Add setting option to refresh metadata --- code/js/metadata.js | 2 +- code/popup.html | 7 ++++++- 2 files changed, 7 insertions(+), 2 deletions(-) diff --git a/code/js/metadata.js b/code/js/metadata.js index ed3143c..77fef5e 100644 --- a/code/js/metadata.js +++ b/code/js/metadata.js @@ -50,6 +50,6 @@ function populate () { }); } -if (!localStorage["metadata"]) { +if (!localStorage["metadata"] || location.hash === "#refresh") { populate(); } diff --git a/code/popup.html b/code/popup.html index 08cc60b..834413c 100644 --- a/code/popup.html +++ b/code/popup.html @@ -53,8 +53,13 @@ Favorites + + -