Functions — github.com/OpenGenus/quark

CodeHub MCPcopy Create free account

hub / github.com/OpenGenus/quark / functions

Functions5,611 in github.com/OpenGenus/quark

⨍ Functions 5,611◇ Types & classes 781

↓ 20 callersMethodaddEdge

code/code/graph_algorithms/src/eulerian_path/eulerian.py:15

↓ 20 callersMethodcbegin

code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:700

↓ 20 callersMethodcend

code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:721

↓ 20 callersFunctioncomp

code/code/data_structures/src/tree/tree/suffix_array/suffix_array.cpp:13

↓ 20 callersFunctionsum

Part of Cosmos by OpenGenus Foundation

code/code/unclassified/src/average/average.rb:2

↓ 19 callersMethodPrint

code/code/operating_system/src/first_come_first_serve/fcfs.py:21

↓ 19 callersMethodcheck

<p> Checks if the element is a member of the bloom filter. T:: O(k); where k is the number of hash functions @param element The element th

code/code/data_structures/src/hashs/bloom_filter/bloom_filter.java:155

↓ 19 callersFunctioncreateLocal

(input, format, locale, strict)

code/js/moment.js:2632

↓ 19 callersFunctionisPalindrome

code/code/utility/src/palindrome/palindrome_check/palindrome_check.cpp:52

↓ 19 callersFunctionisPalindromeRecursive

code/code/utility/src/palindrome/palindrome_check/palindrome_check.cpp:10

↓ 19 callersFunctionr

code/js/bootstrap.min.js:6

↓ 18 callersMethodadd

add new node to head of list

code/code/data_structures/src/list/circular_linked_list/operations/has_loop.py:35

↓ 18 callersMethodequals

code/code/data_structures/src/hashs/hash_table/hash_table.java:12

↓ 18 callersFunctiongLG_NbNodes

---------------------------GETTERS-----------------------------------------*/

code/code/graph_algorithms/src/adjacency_lists_graph_representation/adjacency_lists_in_C/lgraph_struct.c:9

↓ 18 callersFunctionl

code/js/popper.min.js:4

↓ 18 callersMethodpop_front

code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:623

↓ 18 callersMethodreverse

code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:797

↓ 18 callersFunctionvar

code/code/mathematical_algorithms/src/std/std.cpp:12

↓ 17 callersMethodcompareTo

(Interval<Type> other)

code/code/data_structures/src/tree/space_partitioning_tree/interval_tree/interval_tree.java:64

↓ 17 callersMethoderase

code/code/data_structures/src/tree/multiway_tree/red_black_tree/red_black_tree.cpp:175

↓ 17 callersFunctionmap

code/js/moment.js:61

↓ 17 callersFunctionmax

get the max of two no.s

code/code/data_structures/src/tree/binary_tree/binary_tree/diameter/diameter2.cpp:15

↓ 17 callersFunctionp

code/js/bootstrap.min.js:6

↓ 17 callersMethodpush

code/code/data_structures/src/queue/circular_buffer/circular_buffer.py:10

↓ 17 callersMethodsize

code/code/data_structures/src/tree/heap/max_heap/max_heap.java:28

↓ 16 callersMethodNext

code/code/cellular_automaton/src/conways_game_of_life/life.go:60

↓ 16 callersMethodaddUndirectedEdge

( Map <Integer, List <Edge>> graph, int from, int to)

code/code/graph_algorithms/src/bipartite_checking/BipartiteGraphCheckAdjacencyList.java:199

↓ 16 callersFunctionaddUnitAlias

(unit, shorthand)

code/js/moment.js:499

↓ 16 callersFunctionaddUnitPriority

(unit, priority)

code/js/moment.js:527

↓ 16 callersFunctionconnect

Establish a connection of given weight

code/code/graph_algorithms/src/prim_minimum_spanning_tree/Prims.c:21

↓ 16 callersMethodcount

code/code/data_structures/src/tree/multiway_tree/union_find/union_find.py:43

↓ 16 callersFunctionisUndefined

code/js/moment.js:49

↓ 16 callersFunctionmin

Utility function to find minimum of three numbers */

code/code/dynamic_programming/src/edit_distance/edit_distance.c:21

↓ 16 callersMethodresize

code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:645

↓ 16 callersFunctionreverse

Below is the function that reverses the given stack using insertAtBottom()

code/code/data_structures/src/stack/reverse_stack/reverse_stack.c:64

↓ 16 callersFunctionswap

code/code/data_structures/src/tree/heap/max_heap/max_heap.go:10

↓ 15 callersFunctiongEdge_DestNode

code/code/graph_algorithms/src/adjacency_lists_graph_representation/adjacency_lists_in_C/lgraph_struct.c:18

↓ 15 callersMethodinsert

Insert the given value in the tree. The tree is traveled until an empty sub-tree is found: If the value is lesser than the one hold by the current no

code/code/sorting/src/tree_sort/tree_sort.go:40

↓ 15 callersFunctionrememberBlobURL

(bloburl,mimetype,charset)

code/content.js:2664

↓ 15 callersFunctionreplaceURL

(url,baseuri,crossorigin)

code/content.js:2395

↓ 14 callersFunctionFt

code/js/jquery.js:5

↓ 14 callersMethodadd_edge

(self, u, v, w)

code/code/graph_algorithms/src/dijkstra_shortest_path/dijkstra_efficient.py:85

↓ 14 callersMethodcreate

code/code/data_structures/src/tree/multiway_tree/union_find/union_find.py:26

↓ 14 callersMethodemplace_back

code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:509

↓ 14 callersFunctiongetHeight

helper function to return height of a node

code/code/mathematical_algorithms/src/2sum/2sum.c:29

↓ 14 callersMethodheight

code/code/data_structures/src/tree/binary_tree/avl_tree/avl_tree.java:20

↓ 14 callersMethodinsert

code/code/graph_algorithms/src/dijkstra_shortest_path/dijkstra_efficient.py:31

↓ 14 callersMethodprint

code/code/data_structures/src/list/skip_list/skip_list.cpp:93

↓ 14 callersFunctionswap

code/code/data_structures/test/tree/multiway_tree/red_black_tree/test_red_black.c:152

↓ 13 callersMethodAddNode

(coeff, pow int)

code/code/mathematical_algorithms/src/add_polynomials/add_polynomials.go:15

↓ 13 callersMethodadd

<p> Adds the element into the bloom filter. To get added, it must pass through the k hash functions of the bloom filter. T:: O(k); where k is the num

code/code/data_structures/src/hashs/bloom_filter/bloom_filter.java:125

↓ 13 callersMethodconnect

code/code/graph_algorithms/src/depth_first_search/dfs.rb:15

↓ 13 callersMethodinsert_term

code/code/mathematical_algorithms/src/add_polynomials/add_polynomials.cpp:33

↓ 13 callersFunctionmax

helper function to get maximum of two integers

code/code/dynamic_programming/src/longest_bitonic_sequence/longest_bitonic_sequence.c:6

↓ 13 callersMethodmultiply

(String s1,String s2,int n)

code/code/divide_conquer/src/karatsuba_multiplication/multiply.java:40

↓ 13 callersFunctionn

code/highlight.pack.js:2

↓ 13 callersMethodnext

code/code/data_structures/src/list/doubly_linked_list/doubly_linked_list.py:79

↓ 13 callersFunctionprint

code/code/unclassified/src/spiral_printing/spiral.c:34

↓ 13 callersMethodprint

code/code/computational_geometry/src/halfplane_intersection/halfplane_intersection.cpp:27

↓ 13 callersFunctionreplaceBlobURL

code/content.js:2947

↓ 12 callersMethodAdd

code/code/data_structures/src/hashs/bloom_filter/bloom_filter.cpp:17

↓ 12 callersMethodPush

code/code/data_structures/src/stack/reverse_stack/reverse_stack.go:21

↓ 12 callersFunctionabsFloor

code/js/moment.js:259

↓ 12 callersMethodaddEdge

code/code/graph_algorithms/src/graph_coloring/graph_coloring.cpp:22

↓ 12 callersFunctionaddRoundKey

code/code/cryptography/src/aes_128/AES_128.py:199

↓ 12 callersMethodconnect

code/code/graph_algorithms/src/breadth_first_search/bfs.rb:15

↓ 12 callersFunctiondeprecate

code/js/moment.js:301

↓ 12 callersFunctionis_red

code/code/data_structures/src/tree/multiway_tree/red_black_tree/red_black_tree.c:18

↓ 12 callersMethodmerge

(int a[][],int rn1,int rn2)

code/code/graph_algorithms/src/karger_minimum_cut/karger.java:23

↓ 12 callersMethodsize

code/code/data_structures/src/tree/binary_tree/rope/rope.py:12

↓ 12 callersFunctionswap

Part of Cosmos by OpenGenus Foundation

code/code/sorting/src/median_sort/median_sort.cpp:6

↓ 11 callersFunctionadvance

code/code/sorting/src/merge_sort/merge_sort.cpp:24

↓ 11 callersFunctioninsert

code/code/data_structures/src/hashs/hash_table/hash_table.c:41

↓ 11 callersFunctionisArray

code/js/moment.js:25

↓ 11 callersFunctionnormalizeUnits

code/js/moment.js:504

↓ 11 callersFunctionpush

A utility function to insert a node at the begining of a linked list*/

code/code/data_structures/src/list/singly_linked_list/operations/unclassified/union_intersection_in_list.c:68

↓ 11 callersFunctionr

code/js/jquery.js:5

↓ 11 callersFunctionut

code/js/jquery.js:4

↓ 10 callersMethodLess

code/code/greedy_algorithms/src/fractional_knapsack/fractional_knapsack.go:42

↓ 10 callersMethodaddEdge

(List<Edge>[] graph, int from, int to, double cost)

code/code/graph_algorithms/src/bellman_ford_algorithm/BellmanFordAdjacencyList.java:32

↓ 10 callersMethodaddSeperateCode

code/code/compression/src/lossless_compression/huffman/huffman.cpp:438

↓ 10 callersMethodadd_edge

code/code/graph_algorithms/src/cycle_directed_graph/cycle_directed_graph.py:9

↓ 10 callersFunctioncompare

For Ascending Order Sort

code/code/operating_system/src/shortest_seek_time_first/shortest_seek_time_first.c:8

↓ 10 callersMethodcompare

(KDPoint n1,KDPoint n2)

code/code/data_structures/src/tree/space_partitioning_tree/kd_tree/kd_tree.java:154

↓ 10 callersFunctionf

code/code/square_root_decomposition/src/MO's Algorithm/MOAlgo.cpp:33

↓ 10 callersMethodgetStart

code/code/data_structures/src/tree/space_partitioning_tree/interval_tree/interval_tree.java:24

↓ 10 callersFunctioninsert

code/code/sorting/src/merge_sort/merge_sort_linked_list.c:13

↓ 10 callersFunctioninsert

function to insert a node into the treap performs simple BST insert and calls treap_insert_fixup

code/code/data_structures/src/tree/binary_tree/treap/treap.cpp:83

↓ 10 callersFunctionisFunction

code/js/moment.js:346

↓ 10 callersMethodleft

code/code/data_structures/src/tree/binary_tree/binary_tree/node/node.cpp:128

↓ 10 callersFunctionlt

code/js/jquery.js:4

↓ 10 callersFunctionmin

code/code/data_structures/src/tree/binary_tree/binary_tree/minimum_height/minimum_height.c:52

↓ 10 callersMethodplay

code/code/cellular_automaton/src/conways_game_of_life/life.rb:11

↓ 10 callersMethodprint

code/code/divide_conquer/src/merge_sort_using_divide_and_conquer/MergeSort.java:64

↓ 10 callersFunctionpush

Function to push an item to stack*/

code/code/data_structures/src/stack/reverse_stack/reverse_stack.c:106

↓ 10 callersMethodright

code/code/data_structures/src/tree/binary_tree/binary_tree/node/node.cpp:136

↓ 10 callersFunctions

code/js/bootstrap.min.js:6

↓ 9 callersMethodToString

Returns a string representation of the stack.

code/code/data_structures/src/stack/stack/stack.cs:79

↓ 9 callersFunction_

code/js/jquery.js:4

↓ 9 callersFunctionaddEdge

code/code/graph_algorithms/src/breadth_first_search/bfs.cpp:43

← previous next →101–200 of 5,611, ranked by callers