docstring stringlengths 3 2.38k | code stringlengths 9 99.4k |
|---|---|
be empty is true before add , false after | ArrayDeque . <init> ArrayDeque . isEmpty Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add ArrayDeque . removeFirst |
offer x succeeds | ArrayDeque . <init> ArrayDeque . offer ArrayDeque . peekFirst |
method description | ArrayDeque . <init> ArrayDeque . offer ConcurrentLinkedQueue . size ArrayDeque . offer |
this method compares two argument trees with one another | ArrayDeque . <init> ArrayDeque . push ArrayDeque . poll ArrayDeque . addAll ArrayDeque . isEmpty HashMap . keySet ArrayDeque . push HashMap . get ArrayDeque . push ArrayDeque . <unk> ArrayDeque . isEmpty ArrayDeque . push ArrayDeque . <unk> ArrayDeque . clear ArrayDeque . isEmpty |
new deque is empty | ArrayDeque . <init> ArrayDeque . size |
print binary tree in level order | ArrayDeque . <init> ArrayDeque < < Integer , Integer > > . add ArrayDeque < < Integer , Integer > > . poll ArrayDeque < < Integer , Integer > > . add ArrayDeque < < Integer , Integer > > . isEmpty ArrayDeque < < Integer , Integer > > . add |
locate a <unk> inline call site in the tree spanned by all this instances plain calls call sites , and return the sequence of call sites scopes leading to that <unk> inline call site | ArrayDeque . <init> ArrayDeque < CallSite > . push CallSite . <unk> ArrayDeque < CallSite > . push |
print out a parsed tree | ArrayDeque . <init> ArrayDeque < String > . <init> ArrayDeque . add ArrayDeque < String > . add ArrayDeque < String > . pollLast Util . <unk> ArrayList . size ArrayDeque . <unk> ArrayDeque < String > . <unk> |
print out a parsed tree | ArrayDeque . <init> ArrayDeque < String > . <init> ArrayDeque . add ArrayDeque < String > . add ArrayDeque < String > . pollLast Util . <unk> ArrayList . size ArrayList . get ArrayDeque . <unk> ArrayDeque < String > . <unk> |
evaluate an expression that contains variables | ArrayDeque . <init> ArrayDeque < Token > . <init> Map < String , Function > . isEmpty ArrayDeque < Integer > . <init> Iterator < String > . next Deque < Token > . push Token . <unk> Token . <unk> Deque < Token > . isEmpty Deque < Token > . pop Token . <unk> Deque < Token > . peek Deque . size Deque < Integer > . pop Deque < Token > . pop Token . <unk> Token . <unk> Token . <unk> Deque < Token > . peek Deque < Token > . pop Token . isFunction Deque < Token > . push Deque < Integer > . push Token . <unk> Deque < Token > . peek Token . <unk> Token . <unk> Deque < Token > . pop Deque < Token > . push Deque < Token > . isEmpty Deque < Token > . pop Deque . pop |
get the all neighbors of a given vertex on the map | ArrayDeque . <init> ArrayDeque < Vertex > . add |
find the shortest path from vertex path | ArrayDeque . <init> ArrayDeque < Vertex > . push Vertex . equals Vertex . getPath Vertex . <unk> ArrayDeque < Vertex > . push Vertex . getPath ArrayDeque < Vertex > . push Vertex . <unk> |
helper <unk> to load distributed row matrices into dense matrix to support tests mainly | ArrayDeque . <init> ArrayList . <init> Iterator < Pair < Vector > > . hasNext Iterator < Pair < Vector > > . next Pair < Vector > . getSecond Vector . size Vector . <unk> Element . get List . add List . size |
helper <unk> to load distributed row matrices into dense matrix to support tests mainly | ArrayDeque . <init> ArrayList . <init> Iterator < Pair < Vector > > . hasNext Iterator < Pair < Vector > > . next Pair < Vector > . getSecond Vector . size Vector . <unk> Vector . size Vector . <unk> Vector . <unk> Element . get List . add List . toArray |
constructor to get source map class to use | ArrayDeque . <init> ArrayList . <init> Map < Predicate > . get |
create internal structures of the executor | ArrayDeque . <init> ArrayList < Message > . <init> |
give a binary tree , print all paths that sum to a certain value | ArrayDeque . <init> BinaryTree . checkPath |
ln main loop : the neighborhood operators are applied in turn to the solutions in the pool if <unk> is improved , then the impact of the operator is incremented and the new <unk> solution is added to the pool otherwise the impact of the operator is <unk> | ArrayDeque . <init> Collection . isEmpty Collection . iterator Iterator . next Queue . add Iterator . remove Queue . isEmpty Collection . add |
base on the comparison list and the other list of messages to compare , this will find all messages that occur after the last message in current and return a sorted queue of all the messages sorted by time | ArrayDeque . <init> Collections . sort List . get ArrayList . <init> Timestamp . after List . add List . isEmpty Collections . sort Queue . addAll |
base on the comparison list and the other list of messages to compare , this will find all messages that occur after the last message in current and return a sorted queue of all the messages sorted by time | ArrayDeque . <init> Collections . sort List . size List . get ArrayList . <init> Timestamp . after List . add List . isEmpty Collections . sort Queue . addAll |
check if the specified key is the key of at least one ofthe elements in this heap , or false if it isnt | ArrayDeque . <init> Comparable . cast Comparable . compareTo Deque < Element > . push Deque < Element > . pop Deque < Element > . push Deque < Element > . isEmpty Deque < Element > . pop |
do pre order <unk> and check if a binary tree is a binary search tree | ArrayDeque . <init> Comparator . compare Deque < Node > . push Deque < Node > . pollFirst |
traverse the object graph referenced by the passed in root | ArrayDeque . <init> Deque . add Deque . removeFirst Map < Object , Object > . containsKey Object . getClass Traverser . <unk> Map < Object , Object > . put Visitor . process Class . isArray Array . getLength Class . getComponentType Class . isPrimitive Traverser . <unk> Array . get Deque . add Collection . instance Traverser . <unk> Traverser . <unk> Traverser . <unk> |
populate a set with the nodes reachable from a given node | ArrayDeque . <init> Deque . add Set . add Deque . isEmpty Deque . removeFirst Deque . addLast |
add a length delimited value | ArrayDeque . <init> Deque . add |
add an embedded group | ArrayDeque . <init> Deque . add |
return the service name that is the nearest common ancestor of the this name and the given one | ArrayDeque . <init> Deque . addFirst Deque . iterator Iterator . next |
set the stack to only contain the given item | ArrayDeque . <init> Deque . addFirst ThreadLocal < Deque > . set |
initiate a stack containing , in left to right order , the child nodes covered by this <unk> | ArrayDeque . <init> Deque . addFirst |
return a mask tree decoded from the uri formatted string input | ArrayDeque . <init> Deque . addLast StringBuilder . length StringBuilder . delete StringBuilder . <init> StringBuilder . charAt StringBuilder . length StringBuilder . delete StringBuilder . length StringBuilder . delete Deque . peekLast Deque . addLast StringBuilder . delete Deque . removeLast Deque . size Deque . removeLast |
return a mask tree decoded from the uri formatted string input | ArrayDeque . <init> Deque . addLast StringBuilder . length StringBuilder . indexOf StringBuilder . delete StringBuilder . <init> StringBuilder . length StringBuilder . charAt StringBuilder . length StringBuilder . delete StringBuilder . length StringBuilder . delete Deque . peekLast Deque . addLast Deque . peekLast StringBuilder . indexOf Deque . isEmpty StringBuilder . delete Deque . removeLast |
get all the dependencies of the given roots | ArrayDeque . <init> Deque . pop Map < String > . get Deque . add Builder . add Builder . build |
get all the dependencies of the given roots | ArrayDeque . <init> Deque . pop Map < String > . get Deque . add Set . contains Builder . add Builder . build |
get all the dependencies of the given roots | ArrayDeque . <init> Deque . pop Set . add Map < String > . get Deque . add Set . contains Builder . add Builder . build |
return a json ml element with the specified number from the tree in pre order walk | ArrayDeque . <init> Deque . push Deque . isEmpty Deque . pop Deque . push |
evaluate a node with an environment specified | ArrayDeque . <init> Deque . push Deque . isEmpty Deque . pop Thread . sleep |
a client for the deque collection interface that has the element in the collection being of type classification | ArrayDeque . <init> Deque . push Deque . iterator Iterator . next |
implement interface | ArrayDeque . <init> Deque . push Deque . pop Deque . peek Deque . pop Deque . peek Deque . push Deque . pop Deque . peek Deque . push |
implement interface | ArrayDeque . <init> Deque . push Deque . pop Deque . peek Deque . pop Deque . push Deque . pop Deque . push |
build a list of node by adding parents <unk> | ArrayDeque . <init> Deque . push |
return the iterators n : th item from the end of the iteration | ArrayDeque . <init> Deque . removeLast Deque . addFirst Deque . getLast Deque . size Deque . getLast |
return the iterators n : th item from the end of the iteration | ArrayDeque . <init> Deque . size Deque . removeLast Iterator . next Deque . addFirst Deque . size Deque . getLast |
check if the specified value is the value of at least <unk> the elements in this heap , or false if it isnt | ArrayDeque . <init> Deque < Element > . push Deque < Element > . isEmpty Deque < Element > . pop |
return an array of all elements in this heap | ArrayDeque . <init> Deque < Element > . push Deque < Element > . pop |
construct a new iterator for the parent pairing <unk> | ArrayDeque . <init> Deque < Element > . push |
create a new entry set from a <unk> | ArrayDeque . <init> Deque < Entry > . add Deque < Entry > . isEmpty Deque < Entry > . removeFirst Deque < Entry > . addFirst |
create a new key set from a <unk> | ArrayDeque . <init> Deque < Entry > . add Deque < Entry > . removeFirst Deque < Entry > . addFirst |
attempt to recursively delete a directory | ArrayDeque . <init> Deque < File > . push Deque < File > . isEmpty Deque < File > . peek File . listFiles Deque < File > . push Deque < File > . pop |
attempt to recursively delete a directory | ArrayDeque . <init> Deque < File > . push Deque < File > . peek File . listFiles Deque < File > . push Deque < File > . pop |
get the mapping of the open parentheses to the open parentheses that immediately enclose them | ArrayDeque . <init> Deque < Integer > . isEmpty Deque < Integer > . peek Deque < Integer > . push Deque < Integer > . pop |
n disks count time : o 2 ^ n space : o one | ArrayDeque . <init> Deque < Integer > . push ArrayDeque . <init> Deque < Integer > . size |
visit all items in the set , connecting them to their the best neighbour which is also in the set see connect item for detail on selection of best neighbour | ArrayDeque . <init> Deque < Line2D > . clear Arrays . sort Deque < Line2D > . addAll Deque . add |
for each qualified name n in the global scope , we check if : a no ancestor of n is ever aliased or assigned an unknown value type | ArrayDeque . <init> Deque < Name > . isEmpty Deque < Name > . pop Name . <unk> ArrayList . <init> Name . <unk> Scope . <unk> Ref . <unk> Name . <unk> Deque < Name > . addAll |
do bfs to find node | ArrayDeque . <init> Deque < Node > . add Deque < Node > . isEmpty Deque < Node > . pollFirst Node . getChildren Deque < Node > . addAll |
time o n space : o n | ArrayDeque . <init> Deque < Node > . add Deque < Node > . poll Deque < Node > . addAll |
do bfs to find node | ArrayDeque . <init> Deque < Node > . add Deque < Node > . pollFirst Node . hasChildren Deque < Node > . addAll |
breadth first <unk> | ArrayDeque . <init> Entry < String , Object > . setValue Entry < String , Object > . getValue Entry < String , Object > . setValue |
breadth first <unk> | ArrayDeque . <init> Entry < String , Object > > . poll Entry < String , Object > . getValue Entry < String , Object > . setValue |
move the environment one phase : all agents receive the <unk> that they sense , they decide the what action they will do and update the environment with these decisions | ArrayDeque . <init> Environment . <unk> Environment . <unk> ArrayDeque . add ArrayDeque . poll Collection . add Environment . update |
recursively creates parent directories in case they dont exist yet | ArrayDeque . <init> File . getParent File . exists Deque < String > . push File . <init> File . getParent Files . createFile |
list all files in the given directory , including files in all folder | ArrayDeque . <init> Files . walkFileTree <unk> < Path > . <init> Path . toFile ArrayDeque < File > . add ArrayDeque < File > . size ArrayDeque < File > . toArray |
reset all buffers to zero | ArrayDeque . <init> Float > . <init> Float > . add Float . <init> Float > . add Math . max |
print out all possible randomized search orders starting from pre defined root to the given vertex <unk> : http : stackoverflow | ArrayDeque . <init> Graph . get ArrayList < Vertex > . <init> ArrayList < Vertex > . add ArrayDeque . add ArrayDeque . isEmpty ArrayDeque . poll ArrayList < Vertex > . cast ArrayList < Vertex > . get Vertex . <unk> TreeMap < String , Vertex > . keySet TreeMap < String , Vertex > . get String . cast TreeMap < String , Vertex > . get ArrayList < Vertex > . contains ArrayList < Vertex > . <init> ArrayList < Vertex > . addAll ArrayList < Vertex > . add String . equals ArrayList < Vertex > . size ArrayList < Vertex > . get ArrayDeque . add |
calculate a path to a location note : can be very expensive | ArrayDeque . <init> HashMap . <init> PriorityQueue . <init> HashMap . <init> PriorityQueue . add Map . containsKey PriorityQueue . isEmpty PriorityQueue . remove Map . put Map . get PriorityQueue . remove Map . put PriorityQueue . add Map . get Deque . addLast |
calculate a path to a location note : can be very expensive | ArrayDeque . <init> HashMap . <init> PriorityQueue . <init> HashMap . <init> PriorityQueue . add PriorityQueue . isEmpty PriorityQueue . remove Map . put Map . get PriorityQueue . remove Map . put PriorityQueue . add Map . get Deque . addLast |
problem graph clone an undirected graph | ArrayDeque . <init> HashMap . <init> Queue . add Map . put Queue . poll Map . get Map . put Map . get Queue . add Map . get |
create new player entry | ArrayDeque . <init> HashMap < Integer > . <init> |
attempt to insert the node only if there are no overlaps with existing nodes | ArrayDeque . <init> HashSet . <init> Deque . add Deque . pop Deque . push Set . addAll Deque . isEmpty Set . addAll List . size |
print the thread roots and add them to a stack for processing | ArrayDeque . <init> HashSet . <init> Deque . addAll Deque . isEmpty Deque . pop Set . add Deque . addAll |
this is the generic function that drives the searching algorithm | ArrayDeque . <init> Hashtable < Position , Boolean > . <init> Position . <init> ArrayDeque . push ArrayDeque . isEmpty ArrayDeque . remove Arrays . asList Collections . shuffle Hashtable < Position , Boolean > . put ArrayDeque . add String . equals ArrayDeque < Action > . <init> Math . random ArrayDeque < Action > . add |
offer last succeeds | ArrayDeque . <init> Integer . <init> ArrayDeque . <unk> Integer . <init> ArrayDeque . <unk> |
descend iterator ordering is reverse fifo | ArrayDeque . <init> Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Iterator . next ArrayDeque . remove |
be empty is true before add , false after | ArrayDeque . <init> Integer . <init> ArrayDeque . add ArrayDeque . isEmpty Integer . <init> ArrayDeque . add ArrayDeque . removeFirst ArrayDeque . isEmpty |
iterator ordering is fifo | ArrayDeque . <init> Integer . <init> ArrayDeque . add ArrayDeque . iterator Iterator . next |
descend iterator ordering is reverse fifo | ArrayDeque . <init> Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Integer . cast Integer . intValue ArrayDeque . remove |
descend iterator ordering is reverse fifo | ArrayDeque . <init> Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Iterator . next ArrayDeque . remove |
iterator ordering is fifo | ArrayDeque . <init> Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add ArrayDeque . iterator Iterator . next |
be empty is true before add , false after | ArrayDeque . <init> Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add ArrayDeque . removeFirst ArrayDeque . isEmpty |
descend iterator ordering is reverse fifo | ArrayDeque . <init> Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Iterator . hasNext Iterator . next ArrayDeque . remove |
iterator ordering is fifo | ArrayDeque . <init> Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add ArrayDeque . iterator Iterator . next |
iterator ordering is fifo | ArrayDeque . <init> Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add Iterator . hasNext Iterator . next |
descend iterator ordering is reverse fifo | ArrayDeque . <init> Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add Iterator . hasNext Iterator . next Integer . cast Integer . intValue ArrayDeque . remove |
iterator ordering is fifo | ArrayDeque . <init> Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add Iterator . hasNext Iterator . next |
descend iterator ordering is reverse fifo | ArrayDeque . <init> Integer . <init> ArrayDeque . add Iterator . hasNext Iterator . next ArrayDeque . remove |
add succeeds | ArrayDeque . <init> Integer . <init> ArrayDeque . add |
return the iterators n : th item from the end of the iteration | ArrayDeque . <init> Iterator . hasNext Deque . removeLast Deque . addFirst Deque . getLast Deque . size Deque . getLast |
return the iterators n : th item from the end of the iteration | ArrayDeque . <init> Iterator . hasNext Deque . removeLast Deque . addFirst Deque . getLast Deque . size |
return the iterators n : th item from the end of the iteration | ArrayDeque . <init> Iterator . hasNext Deque . size Deque . removeLast Deque . addFirst Deque . getLast Deque . size Deque . getLast |
create a new <unk> pane | ArrayDeque . <init> JPanel . <init> BorderFactory . createEmptyBorder JPanel . setBorder JPanel . add JButton . <init> JPanel . add JButton . <init> JPanel . add JButton . <init> JPanel . add JLabel . <init> JLabel . setFont JLabel . setHorizontalAlignment BorderFactory . createEmptyBorder JLabel . setBorder JLabel . setForeground JPanel . <init> JPanel . getBackground JPanel . setBackground JPanel . add BorderLayout . <init> JPanel . <init> JPanel . setBorder JDialog . <init> JDialog . getContentPane JDialog . setDefaultCloseOperation JDialog . addWindowListener |
main abstract algorithm that build statements from queries | ArrayDeque . <init> Lexer . <unk> Deque < Statement > . addLast |
find a word whose prefixes including the word conform to a given predicate and which itself also conforms to a second predicate | ArrayDeque . <init> LinkedList . <init> Deque < Pair < Iterator < Symbol > > > . add Deque < Pair < Iterator < Symbol > > > . peekLast Pair < Iterator < Symbol > > . getSecond Deque < Pair < Iterator < Symbol > > > . removeLast LinkedList < String > . pollLast Symbol . getEvent LinkedList < String > . add Predicate < List < String > > . evaluate Pair . <init> Deque < Pair < Iterator < Symbol > > > . addLast Predicate < List < String > > . evaluate LinkedList < String > . removeLast |
return as a list the topological sort of the vertices ; null for no such sort | ArrayDeque . <init> LinkedList . <init> Map < Integer > . entrySet Entry < Integer > . getValue Deque . push Deque . isEmpty Deque . pop LinkedList . push Map < List > . get Map < Integer > . get Map < Integer > . put Map < Integer > . get Deque . push Map < List > . size |
fill distance array up using breadth first search | ArrayDeque . <init> Map . getWidth Map . getHeight Position . getX Position . getY Queue < Position > . poll Position . getY Position . getInstance Queue < Position > . add Position . getY Queue < Position > . poll |
follow the path for q starting from the root | ArrayDeque . <init> Map < Character > . get Deque . addLast Deque . removeFirst Deque . addAll |
cut <unk> link and trunk link ways into three parts to be able to get a hint on <unk> gps | ArrayDeque . <init> Map < Long > . values Queue . addAll Map < Long > . size Queue . isEmpty Queue . poll Element . getTag Element . <unk> List . get IdentityHashMap < Set > . get Element . getTag Element . <unk> List . get List . isEmpty Element . getTag String . endsWith String . equals Element . getId Map < Long > . remove Element . <unk> Map < Long > . size LinkedHashMap . <init> HashSet . <init> Map < String , Set > . put Map < Long > . values Element . getTag Map < String , Set > . get Set . addAll Area . contains Node . getLocation Area . contains Node . getLocation Entry < String , Set > . getKey Node . <unk> IdentityHashMap < Set > . get String . equals Entry . getValue Entry . getKey Element . getId Map < Long > . remove Element . getTag String . endsWith List . size Math . min Node . getLocation Element . <unk> Element . <unk> Node . getTag Element . <unk> Map < Long > . remove Element . getTag String . endsWith List . get Entry . getValue Math . abs Entry . getKey Math . min Element . <unk> Element . <unk> Element . <unk> |
cut <unk> link and trunk link ways into three parts to be able to get a hint on <unk> gps | ArrayDeque . <init> Map < Long > . values Queue . addAll Map < Long > . size Queue . isEmpty Queue . poll Element . getTag Element . <unk> List . size List . get IdentityHashMap < Set > . get Element . getTag Element . <unk> List . get List . isEmpty Element . getTag String . endsWith String . equals Element . getId Map < Long > . remove Element . <unk> Element . getId LinkedHashMap . <init> Map < String , Set > . put Map < Long > . values Element . getTag Map < String , Set > . get Set . addAll Map < Long , Node > . values Node . getLocation Area . contains Node . getLocation Entry < String , Set > . getValue Entry < String , Set > . getKey Node . <unk> Node . <unk> IdentityHashMap < Set > . get String . equals Entry . getValue Entry . getKey Element . getId Map < Long > . remove Element . getTag String . endsWith List . size Math . min Element . <unk> Element . <unk> Node . getTag Element . <unk> Node . getTag Element . <unk> Map < Long > . values Map < Long > . remove Element . getTag String . endsWith List . get Math . abs Entry . getKey Math . min Element . <unk> |
calculate <unk> | ArrayDeque . <init> Math . min Queue . add Queue . poll Queue . add |
breadth first or level order traversal of a tree | ArrayDeque . <init> Node . <init> Deque < Node > . offer Deque < Node > . isEmpty Deque < Node > . poll Deque < Node > . isEmpty Deque < Node > . offer |
<unk> <unk> | ArrayDeque . <init> Object > > . add Object > > . addAll Object > > . isEmpty Object > > . pop Object > . getChildren Object > > . addAll |
queue an upload for later submission to S3 | ArrayDeque . <init> Pair . <init> ArrayDeque < Pair < String , File > > . add |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.