Functions — github.com/ashish-chopra/Structures

hub / github.com/ashish-chopra/Structures / functions

Functions393 in github.com/ashish-chopra/Structures

⨍ Functions 393◇ Types & classes 106

↓ 2 callersMethodisEmpty

checks to see if stack is empty. returns true if yes, false otherwise.

src/main/java/com/stacks/StackWithMiddle.java:46

↓ 2 callersMethodisEven

(int num)

src/main/java/com/stacks/StackWithMiddle.java:75

↓ 2 callersMethodless

(Comparable v, Comparable w)

src/main/java/com/sorting/Quick.java:89

↓ 2 callersMethodless

(Comparable v, Comparable w)

src/main/java/com/sorting/Selection.java:96

↓ 2 callersMethodless

(Comparable v, Comparable w)

src/main/java/com/sorting/Merge.java:147

↓ 2 callersMethodless

(Comparable v, Comparable w)

src/main/java/com/sorting/Insertion.java:81

↓ 2 callersMethodmerge

(Comparable[] a, Comparable[] aux, int lo, int mid, int hi)

src/main/java/com/sorting/Merge.java:98

↓ 2 callersMethodmin

gets the smallest key in BST @return Key

src/main/java/com/trees/BST.java:176

↓ 2 callersMethodnext

()

src/main/java/com/bags/Bag.java:99

↓ 2 callersMethodpeek

retrieves the last item inserted in the stack, but does not remove @return an item inserted recently.

src/main/java/com/stacks/Stack.java:76

↓ 2 callersMethodredo

re-does the last undone operation. @return the operation/item code

src/main/java/com/applications/Checkpoint.java:72

↓ 2 callersMethodremove

()

src/main/java/com/bags/Bag.java:103

↓ 2 callersMethodresize

(int size)

src/main/java/com/queues/RandomizedQueue.java:108

↓ 2 callersMethodresize

(int size)

src/main/java/com/stacks/ResizingCapacityStackOfStrings.java:81

↓ 2 callersMethodsample

returns a randomly chosen item from the queue without removing it. Throws NoSuchElementException when queue is empty. @return an item from the queue.

src/main/java/com/queues/RandomizedQueue.java:91

↓ 2 callersMethodshow

prints sequence of Objects to standard output. @param array the array to be printed

src/main/java/com/sorting/Shell.java:75

↓ 2 callersMethodsize

returns the size of buffer as number of characters it occupies. @return number of characters in buffer as <code>int</code>

src/main/java/com/applications/Buffer.java:94

↓ 2 callersMethodsize

returns the current size of symbol table. @return

src/main/java/com/tables/UnorderedST.java:131

↓ 2 callersMethodsize

()

src/main/java/com/bags/Bag.java:74

↓ 2 callersMethodsort

rearranges the array in ascending order, using the natural order. @param array array to be sorted

src/main/java/com/sorting/Quick.java:42

↓ 2 callersMethodtoString

returns the string representation of this object data.

src/main/java/com/applications/HumpingDumping.java:64

↓ 1 callersMethodE

gets the total number of edges in the graph. @return

src/main/java/com/graphs/Graph.java:120

↓ 1 callersMethodbfs

(Graph G, int s)

src/main/java/com/graphs/BreadthFirstSearch.java:37

↓ 1 callersMethodclear

clears the stack object by permanently deleting the content. Once this action is performed, it cannot be undone.

src/main/java/com/stacks/Stack.java:107

↓ 1 callersMethodcontains

(String key)

src/main/java/com/graphs/SymbolGraph.java:98

↓ 1 callersMethoddelete

deletes the item with a given key if found in the table. @param key

src/main/java/com/tables/UnorderedST.java:141

↓ 1 callersMethoddelete

deletes the node containing the given key. @param key Key stored in BST.

src/main/java/com/trees/BST.java:335

↓ 1 callersMethoddequeue

removes the least recent item from the queue. @return an item from the queue.

src/main/java/com/queues/Queue.java:58

↓ 1 callersMethoddfs

(Graph graph, int sourceVertex)

src/main/java/com/graphs/ConnectedComponents.java:44

↓ 1 callersMethoddfs

(int s)

src/main/java/com/graphs/Cycle.java:47

↓ 1 callersMethoddfs

(Graph graph, int source)

src/main/java/com/graphs/DepthFirstSearch.java:67

↓ 1 callersMethodevaluate

(String b, String a, String operator)

src/main/java/com/applications/InfixExpression.java:62

↓ 1 callersMethodexch

(Comparable[] a, int i, int j)

src/main/java/com/sorting/Shell.java:65

↓ 1 callersMethodexchange

(Object[] a, int i, int j)

src/main/java/com/sorting/Quick.java:96

↓ 1 callersMethodexecute

executes the person on the position specified by the argument. @param M position of a person as <code>int</code>. @return sequence of execution as <co

src/main/java/com/applications/Josephus.java:51

↓ 1 callersMethodgetStateName

()

src/test/java/com/sorting/HeapSortTest.java:81

↓ 1 callersMethodgetStateName

()

src/test/java/com/sorting/MergeSortTest.java:66

↓ 1 callersMethodgetStateName

()

src/test/java/com/sorting/SelectionSortTest.java:61

↓ 1 callersMethodhasCycle

determines if the given Graph graph has cycle. @return true if cycle exists, false otherwise.

src/main/java/com/graphs/Cycle.java:63

↓ 1 callersMethodhasNext

()

src/main/java/com/queues/RandomizedQueue.java:129

↓ 1 callersMethodhasNext

()

src/main/java/com/queues/Deque.java:170

↓ 1 callersMethodhasNext

()

src/main/java/com/tables/UnorderedST.java:181

↓ 1 callersMethodhasNext

()

src/main/java/com/lists/LinkedList.java:170

↓ 1 callersMethodid

(int v)

src/main/java/com/graphs/ConnectedComponents.java:57

↓ 1 callersMethodisEmpty

checks to see if queue is empty. @return true if no element is in the queue, false otherwise.

src/main/java/com/queues/ResizingQueueOfStrings.java:67

↓ 1 callersMethodisEmpty

checks to see if queue is empty. @return true if queue is empty, false otherwise.

src/main/java/com/queues/FixedCapacityQueueOfStrings.java:66

↓ 1 callersMethodisEmpty

checks if the symbol table is empty. @return

src/main/java/com/tables/UnorderedST.java:123

↓ 1 callersMethodisEmpty

checks is the list is empty

src/main/java/com/lists/CircularLinkedList.java:57

↓ 1 callersMethodisOperand

(String s)

src/main/java/com/applications/InfixExpression.java:54

↓ 1 callersMethodisOperator

(String s)

src/main/java/com/applications/InfixExpression.java:50

↓ 1 callersMethodisReadyForA

()

src/main/java/com/applications/Threading.java:22

↓ 1 callersMethodisReadyForB

()

src/main/java/com/applications/Threading.java:19

↓ 1 callersMethodisRightParanthesis

(String s)

src/main/java/com/applications/InfixExpression.java:58

↓ 1 callersMethoditerator

returns an iterator of this random queue object.

src/main/java/com/queues/RandomizedQueue.java:103

↓ 1 callersMethoditerator

returns an iterator over the elements of the bag.

src/main/java/com/bags/Bag.java:70

↓ 1 callersMethodkeys

iterates the keys in the symbol table @return an iterator on the keys in the data structure

src/main/java/com/tables/ST.java:215

↓ 1 callersMethodless

(Comparable v, Comparable w)

src/main/java/com/sorting/Shell.java:58

↓ 1 callersMethodlookup

(char c)

src/main/java/com/applications/MoveToFront.java:55

↓ 1 callersMethodmax

gets the largest key present in BST. @return key the largest key.

src/main/java/com/trees/BST.java:196

↓ 1 callersMethodmaxDegree

returns the maximum degree of the graph. That is the maximum number of edges to any vertex in the given graph. @return degree as <code>int</code>.

src/main/java/com/graphs/BasicOperations.java:46

↓ 1 callersMethodnumberOfSelfLoops

return the count of self loops in the graph. Self loop is an edge from vertex V to the same vertex V. @return

src/main/java/com/graphs/BasicOperations.java:79

↓ 1 callersMethodput

inserts the given key-value pair in the symbol table if not present already. In case key is found, then corresponding value is replaced. if value is

src/main/java/com/tables/ST.java:63

↓ 1 callersMethodremove

remove the node at specified position in the list @param index specifies the position from the list in integer @return true removed node from the list

src/main/java/com/lists/LinkedList.java:138

↓ 1 callersMethodremoveAt

(int index)

src/main/java/com/applications/Josephus.java:65

↓ 1 callersMethodresize

(int size)

src/main/java/com/queues/ResizingQueueOfStrings.java:72

↓ 1 callersMethodresize

(Object[] arr, int size)

src/main/java/com/tables/ST.java:92

↓ 1 callersMethodresize

(int size)

src/main/java/com/bags/Bag.java:78

↓ 1 callersMethodresizeKeys

(Comparable[] arr, int size)

src/main/java/com/tables/ST.java:103

↓ 1 callersMethodrun

()

src/test/java/com/Test.java:29

↓ 1 callersMethodsetADone

()

src/main/java/com/applications/Threading.java:29

↓ 1 callersMethodsetBDone

()

src/main/java/com/applications/Threading.java:26

↓ 1 callersMethodshow

prints sequence of Objects to standard output. @param array the array to be printed

src/main/java/com/sorting/Quick.java:108

↓ 1 callersMethodsize

return the current size of the Humping Dumping array. @return

src/main/java/com/applications/HumpingDumping.java:38

↓ 1 callersMethodsize

returns the number of elements in the stack. @return the size of stack as integer.

src/main/java/com/stacks/Stack.java:95

↓ 1 callersMethodswap

swap the elements in the said strategy as mentioned above.

src/main/java/com/applications/HumpingDumping.java:48

↓ 1 callersMethodtoInfix

(Queue<String> expression)

src/main/java/com/applications/InfixExpression.java:28

↓ 1 callersMethodtoString

returns the string representation of the object state.

src/main/java/com/unions/WeightedQuickUF.java:75

↓ 1 callersMethodtoString

returns a string representation of UF.

src/main/java/com/unions/UnionFind.java:93

↓ 1 callersMethodtoString

returns string representation of current state of QuickUF object. Useful for testing.

src/main/java/com/unions/QuickUF.java:68

↓ 1 callersMethodtoString

returns a String representation of the graph.

src/main/java/com/graphs/Graph.java:150

MethodBST

creates an empty binary search tree

src/main/java/com/trees/BST.java:75

MethodBag

creates a new empty Bag.

src/main/java/com/bags/Bag.java:38

MethodBagIterator

()

src/main/java/com/bags/Bag.java:91

MethodBasicOperations

(Graph graph)

src/main/java/com/graphs/BasicOperations.java:18

MethodBreadthFirstSearch

(Graph graph, int source)

src/main/java/com/graphs/BreadthFirstSearch.java:31

MethodBuffer

constructs a buffer object.

src/main/java/com/applications/Buffer.java:35

MethodCheckpoint

()

src/main/java/com/applications/Checkpoint.java:34

MethodCircularLinkedList

creates new empty CircularLinkedList

src/main/java/com/lists/CircularLinkedList.java:37

MethodCity

(String name, int number)

src/test/java/com/sorting/HeapSortTest.java:76

MethodCity

(String name, int number)

src/test/java/com/sorting/MergeSortTest.java:61

MethodCity

(String name, int number)

src/test/java/com/sorting/SelectionSortTest.java:56

MethodConnectedComponents

(Graph graph)

src/main/java/com/graphs/ConnectedComponents.java:32

MethodCycle

creates a Cycle object which processes the given graph from the given source vertex s. @param graph The Graph under processing. @param sourceVertex so

src/main/java/com/graphs/Cycle.java:34

MethodDepthFirstSearch

creates a depth first search object and process the given Graph in DFS fashion. @param graph Graph @param sourceVertex source v

src/main/java/com/graphs/DepthFirstSearch.java:47

MethodDeque

constructs the object.

src/main/java/com/queues/Deque.java:42

MethodFixedCapacityQueueOfStrings

constructs the object. @param capacity initial capacity of the data structure.

src/main/java/com/queues/FixedCapacityQueueOfStrings.java:37

MethodFixedCapacityStackOfStrings

constructs the object. @param capacity the fixed size of the stack object.

src/main/java/com/stacks/FixedCapacityStackOfStrings.java:47

MethodG

()

src/main/java/com/graphs/SymbolGraph.java:94

MethodGraph

creates an empty graph with zero edges with given number of vertices as input. @param totalVertices Total number of vertices in the graph.

src/main/java/com/graphs/Graph.java:64

MethodHeap

()

src/main/java/com/sorting/Heap.java:36

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