docstring stringlengths 3 2.38k | code stringlengths 9 99.4k |
|---|---|
class added two 0 push the current ui component this to the faces context attribute map using the key current component saving the previous ui <unk> with current component for a subsequent call to pop component from el | ArrayDeque . push Boolean . valueOf Map < Object , Object > . put ArrayDeque . push Map < Object , Object > . put |
return an array containing all of the elements in this deque in proper sequence from first to last element ; the runtime type of the returned array is that of the specified array | ArrayDeque . size Array . <unk> ArrayDeque . copyElements |
return an array containing all of the elements in this deque in proper sequence from first to last element ; the runtime type of the returned array is that of the specified array | ArrayDeque . size Array . newInstance ArrayDeque . copyElements |
put the specified object in the pool , making it eligible to be returned by obtain | ArrayDeque . size ArrayDeque . add ArrayDeque . size Math . max |
add a new value , which becomes the current generation | ArrayDeque . size ArrayDeque . getFirst ArrayDeque . addFirst ArrayDeque . size ArrayDeque . removeLast |
send message to <unk> socket , destroys contents after sending if destroy param is set to true | ArrayDeque . size ArrayDeque . iterator Iterator . hasNext Iterator . next Iterator . hasNext |
send message to <unk> socket , destroys contents after sending if destroy param is set to true | ArrayDeque . size ArrayDeque . iterator Iterator . hasNext Iterator . next |
compute the age of the current generation , defined to be the number of preceding values that are equal , or 1 if no different value exists | ArrayDeque . size ArrayDeque . iterator Iterator . next Iterator . hasNext |
send message to <unk> socket , destroys contents after sending if destroy param is set to true | ArrayDeque . size ArrayDeque . iterator Iterator . next Iterator . hasNext |
compare only the type and filter portion and not the property evaluation portion | ArrayDeque . size ArrayDeque . iterator Iterator . next |
get next <unk> according to issue order , returns the next station ready to be executed or null if none are currently ready | ArrayDeque . size ArrayDeque . peek |
return an object from this pool | ArrayDeque . size ArrayDeque . pop |
trim the buffer pool to the correct capacity | ArrayDeque . size ArrayDeque . removeLast |
this method updates child views and clears the batch of events | ArrayDeque . size ArrayDeque . toArray ArrayDeque . isEmpty ArrayDeque . size ArrayDeque . toArray ArrayDeque . <init> |
return an array containing all of the elements in this deque in proper sequence from first to last element ; the runtime type of the returned array is that of the specified array | ArrayDeque . size ArrayList . <init> ArrayList . add |
return an array containing all of the elements in this deque in proper sequence from first to last element ; the runtime type of the returned array is that of the specified array | ArrayDeque . size ArrayList . toArray ArrayDeque . copyElements |
return an array containing all of the elements in this deque in proper sequence from first to last element ; the runtime type of the returned array is that of the specified array | ArrayDeque . size Object [] . cast ArrayDeque . copyElements |
this method updates child views and clears the batch of events | ArrayDeque . toArray ArrayDeque . isEmpty ArrayDeque . size ArrayDeque . toArray ArrayDeque . <init> |
function to update instruction queue | ArrayDeque . toArray ArrayDeque . size |
get the next buffer container from the containers deque | ArrayDeque . wait ArrayDeque . poll ByteBuffer . hasRemaining |
put back a lookup table so that it can be reused | ArrayDeque < < Node > > . add ArrayDeque < Integer > . add |
clear the cached versions | ArrayDeque < < Node > > . clear ArrayDeque < Integer > . clear |
create a deque of <unk> of <unk> | ArrayDeque < ArrayDeque > . <init> ArrayDeque . <init> ArrayDeque . add ArrayDeque < ArrayDeque > . add |
return the next byte buffer for reading or null if the fifo is empty | ArrayDeque < ByteBuffer > . peekFirst ByteBuffer . remaining ArrayDeque < ByteBuffer > . peekFirst ByteBuffer . remaining ByteBuffer . position ByteBuffer . remaining |
allocate a buffer from this source pool | ArrayDeque < ByteBuffer > . pollLast ConcurrentLinkedQueue < ByteBuffer > . poll ByteBufferPool . <unk> |
locate a <unk> inline call site : find , in this instances plain calls call sites , the one <unk> down the given call stack | ArrayDeque < CallSite > . pop ArrayDeque < CallSite > . isEmpty CallSite . <unk> ArrayDeque < CallSite > . push |
construct a deck consisting of the cards in the supplied array | ArrayDeque < Card > . <init> ArrayDeque < Card > . add ArrayDeque < Card > . size |
construct a deck consisting of the cards in the supplied array | ArrayDeque < Card > . <init> Card . getId ArrayDeque < Card > . add ArrayDeque < Card > . size |
draw one card | ArrayDeque < Card > . peekLast ArrayDeque < Card > . removeLast |
solve a maze and marks the shortest path from start to end | ArrayDeque < Cell > . <init> Cell . <init> Queue < Cell > . add Queue < Cell > . isEmpty Queue < Cell > . remove Cell . getX Cell . getY Queue < Cell > . clear Cell . getParent Cell . getX Cell . getY Queue < Cell > . add Cell . <init> Queue < Cell > . add Cell . <init> Queue < Cell > . add Cell . getParent |
calculate the value of a cell by looking at its dependencies | ArrayDeque < Cell > . <init> Deque < Cell > . add Deque < Cell > . isEmpty Deque < Cell > . removeFirst Cell . <unk> Set < Cell > . contains Deque < Cell > . addFirst Set < Cell > . remove Deque < Cell > . addLast |
very similar to the dfs algorithm | ArrayDeque < Cell > . <init> Random . nextInt Cell [] . clone Collections . shuffle Cell . <unk> Deque < Cell > . addFirst List . remove Cell . <unk> Deque < Cell > . isEmpty Random . nextBoolean Deque < Cell > . removeFirst Random . nextInt Deque < Cell > . toArray Random . nextInt Cell . cast Cell . <unk> |
recursive <unk> depth first search algorithm | ArrayDeque < Cell > . <init> Random . nextInt Cell [] . clone Collections . shuffle Cell . <unk> Deque < Cell > . addFirst List . remove Cell . <unk> Deque < Cell > . removeFirst Cell . <unk> |
state <unk> | ArrayDeque < Character > . peek ArrayDeque < Character > . pop |
state <unk> | ArrayDeque < Character > . push String . charAt ArrayDeque < Character > . peek ArrayDeque < Character > . pop String . charAt |
return an array of class objects representing the entire class hierarchy with the most super class as the first element followed by all subclasses in the order they are declared | ArrayDeque < Class > . <init> Class . equals ArrayDeque < Class > . addFirst Class . getSuperclass ArrayDeque < Class > . toArray |
helper <unk> to load distributed row matrices into dense matrix to support tests mainly | ArrayDeque < Closeable > . <init> ArrayList . <init> Iterator < Pair < Vector > > . hasNext Iterator < Pair < Vector > > . next Pair < Vector > . getSecond Vector . size Vector . <unk> Vector . <unk> Element . get List . add List . size List . toArray |
helper <unk> to load distributed row matrices into dense matrix to support tests mainly | ArrayDeque < Closeable > . <init> ArrayList . <init> Iterator < Pair < Vector > > . hasNext Iterator < Pair < Vector > > . next Pair < Vector > . getSecond Vector . size Vector . <unk> Vector . <unk> Vector . <unk> Element . get List . add List . toArray |
helper <unk> to load distributed row matrices into dense matrix to support tests mainly | ArrayDeque < Closeable > . <init> ArrayList . <init> Iterator < Pair < Vector > > . hasNext Iterator < Pair < Vector > > . next Pair < Vector > . getSecond Vector . size Vector . <unk> 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 < Closeable > . <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 . size |
evaluate the postfix expression generated by convert infix to postfix and returns a double object with the answer | ArrayDeque < Double > . <init> ArrayDeque < String > . toArray Arrays . asList ArrayDeque < Double > . pop Object . equals ArrayDeque < Double > . push Double . parseDouble ArrayDeque < Double > . push ArrayDeque < Double > . pop |
store the latest inter arrival time to sampling window | ArrayDeque < Double > . remove Node . <unk> ArrayDeque < Double > . add Node . <unk> |
test whether it is high <unk> or low <unk> expected observed low , expected high | ArrayDeque < Double > . size ArrayDeque < Double > . isEmpty ArrayDeque < Double > . peekFirst ArrayDeque < Double > . remove ArrayDeque < Double > . poll ArrayList < Double > . get ArrayDeque < Double > . peekFirst ArrayDeque < Double > . poll ArrayList < Double > . size |
test whether it is high <unk> or low <unk> expected observed low , expected high | ArrayDeque < Double > . size ArrayDeque < Double > . isEmpty ArrayList < Double > . get ArrayDeque < Double > . peekFirst ArrayDeque < Double > . poll ArrayDeque < Double > . isEmpty ArrayDeque < Double > . peekFirst ArrayList < Double > . get ArrayDeque < Double > . poll ArrayList < Double > . size |
the main test method | ArrayDeque < Double > . size ArrayList < Double > . size ArrayDeque < Double > . isEmpty ArrayDeque < Double > . peekFirst ArrayList < Double > . get ArrayDeque < Double > . remove ArrayDeque < Double > . poll ArrayDeque < Double > . isEmpty ArrayList < Double > . get ArrayDeque < Double > . peekFirst ArrayDeque < Double > . poll ArrayList < Double > . size NormalDistribution . <unk> Math . abs |
test whether it is high <unk> or low <unk> expected observed low , expected high | ArrayDeque < Double > . size ArrayList < Double > . size ArrayDeque < Double > . peekFirst ArrayDeque < Double > . remove ArrayDeque < Double > . poll ArrayDeque < Double > . peekFirst ArrayDeque < Double > . isEmpty ArrayDeque < Double > . remove ArrayDeque < Double > . poll ArrayList < Double > . size |
the main test method | ArrayDeque < Double > . size ArrayList < Double > . size ArrayDeque < Double > . peekFirst ArrayList < Double > . get ArrayDeque < Double > . remove ArrayDeque < Double > . poll ArrayDeque < Double > . isEmpty ArrayDeque < Double > . peekFirst ArrayDeque < Double > . poll NormalDistribution . <init> NormalDistribution . <unk> Math . abs |
the main test method | ArrayDeque < Double > . size ArrayList < Double > . size ArrayList < Double > . get ArrayDeque < Double > . peekFirst ArrayDeque < Double > . remove ArrayDeque < Double > . poll ArrayList < Double > . get ArrayDeque < Double > . isEmpty ArrayDeque < Double > . peekFirst ArrayDeque < Double > . poll ArrayList < Double > . size NormalDistribution . <unk> Math . pow Math . abs |
inter arrival times data as array | ArrayDeque < Double > . toArray ArrayDeque < Double > . size |
inter arrival times data as array | ArrayDeque < Double > . toArray Double [] . cast ArrayDeque < Double > . size |
temporary code mostly copied from vertex random walk packer | ArrayDeque < Edge > . <init> HashSet < Vertex > . <init> ArrayList < Edge > . <init> Collections . shuffle Set < Vertex > . contains Vertex . <unk> Deque < Edge > . size Deque < Edge > . push Set < Vertex > . add Vertex . equals Vertex . <unk> Edge . <unk> Math . pow |
check <unk> constraints | ArrayDeque < Element > . <init> HashSet < Element > . <init> Set < Element > . add Deque < Element > . push Map < String , Element > . get Deque < Element > . push Deque < Element > . pop Set < Element > . add Deque < Element > . push Set < Element > . remove Deque < Element > . push Deque < Element > . pop |
method description | ArrayDeque < Element > . <init> Queue < Element > . offer Element . <init> Element . addChild |
method description | ArrayDeque < Element > . <init> Queue < Element > . offer Element . addChild Element . findChild |
method description | ArrayDeque < Element > . <init> Queue < Element > . offer Element . addChild |
method description | ArrayDeque < Element > . <init> Queue < Element > . offer Element . findChild Element . <init> Element . addChild Element . findChild |
method description | ArrayDeque < Element > . <init> Queue < Element > . offer Element . findChild Element . addChild |
return one element and removed it from the generated set | ArrayDeque < Element > . isEmpty ArrayDeque < Element > . remove |
peek n elements from the generated set | ArrayDeque < Element > . isEmpty ArrayDeque < Element > . removeFirst ArrayDeque < Element > . addFirst |
method description | ArrayDeque < Element > . peek Element . <unk> |
create a new entry graph based on a directed graph | ArrayDeque < Entry > . <init> ArrayList < Entry > . <init> HashMap < Entry > . <init> Entry . <init> ArrayList . <init> HashSet . <init> ArrayList . <init> |
get the current <unk> | ArrayDeque < Entry > . size ArrayDeque < Entry > . peekLast ArrayDeque < Entry > . peekFirst ArrayList < Long > . <init> ArrayList < Long > . add ArrayList < Long > . size |
execute the dispatcher on a thread provided by event dispatcher group | ArrayDeque < Event > . <init> Thread . currentThread EventDispatcher . <unk> EventDispatcher . notifyAll EventDispatcher . poll Queue < Event > . isEmpty EventDispatcher . <unk> EventDispatcher . <unk> Deque < Event > . isEmpty Queue < Event > . offer EventDispatcher . <unk> Queue < Event > . clear Map < Integer > . clear |
attempt to recursively delete a directory | ArrayDeque < File > . <init> Deque < File > . push Deque < File > . peek File . isDirectory File . listFiles Deque < File > . push Deque < File > . pop |
<unk> tutti i file e <unk> <unk> <unk> in un <unk> | ArrayDeque < File > . <init> Deque < File > . push File . listFiles Arrays . asList Queue < File > . addAll Queue < File > . poll Deque < File > . poll File . delete Deque < File > . poll |
uncompress a zip file in a specific path given | ArrayDeque < File > . <init> File . <init> File . exists File . getAbsolutePath FileInputStream . <init> ZipInputStream . <init> ZipInputStream . getNextEntry ZipEntry . getName File . <init> FileOutputStream . <init> ZipInputStream . read FileOutputStream . write FileOutputStream . close ZipInputStream . closeEntry File . getAbsolutePath ArrayDeque < File > . add |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque . pop ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque < Integer > . peek ArrayDeque . pop ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . next ArrayDeque < Integer > . peek ArrayDeque . pop ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . next ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Arrays . asList ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque < Integer > . peek ArrayDeque . pop ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Arrays . asList ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque < Integer > . peek ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Arrays . asList ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Arrays . asList ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . next ArrayDeque . pop ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Arrays . asList ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . next ArrayDeque < Integer > . peek ArrayDeque . pop ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Arrays . asList ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . next ArrayDeque < Integer > . peek Integer . equals ArrayDeque . pop ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Arrays . asList Iterator < Integer > . hasNext ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque < Integer > . peek ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Arrays . asList Iterator < Integer > . hasNext ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . next ArrayDeque . pop ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Arrays . asList Iterator < Integer > . hasNext ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . next ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Arrays . asList Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque . pop ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Arrays . asList Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque < Integer > . peek ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Arrays . asList Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . next ArrayDeque . pop ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Arrays . asList Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . next ArrayDeque < Integer > . peek ArrayDeque . pop ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Arrays . asList Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . next ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Arrays . asList Iterator < Integer > . next ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque < Integer > . peek ArrayDeque . pop ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Arrays . asList Iterator < Integer > . next ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque < Integer > . peek ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Arrays . asList Iterator < Integer > . next ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . next ArrayDeque . pop ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Arrays . asList Iterator < Integer > . next ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . next ArrayDeque < Integer > . peek ArrayDeque . pop ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Iterator < Integer > . hasNext ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . next ArrayDeque < Integer > . peek ArrayDeque . pop ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque . pop ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . next ArrayDeque . pop ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . next ArrayDeque < Integer > . peek ArrayDeque . pop ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . next ArrayDeque < Integer > . peek ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Iterator < Integer > . hasNext Iterator < Integer > . next ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . next ArrayDeque < Integer > . peek Integer . equals ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Iterator < Integer > . next ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . hasNext Iterator < Integer > . next Integer . equals ArrayDeque . pop ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Iterator < Integer > . next ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . next ArrayDeque < Integer > . peek ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return the root hash of a binary tree with leaves at the given depths and with the given hash val in each leaf | ArrayDeque < Integer > . <init> ArrayDeque . <init> Iterator < Integer > . next ArrayDeque < Integer > . push ArrayDeque . push Iterator < Integer > . next ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque . push ArrayDeque . size ArrayDeque . pop |
return a new deque of given size containing consecutive integers 0 | ArrayDeque < Integer > . <init> ArrayDeque < Integer > . isEmpty Integer . <init> ArrayDeque < Integer > . <unk> ArrayDeque < Integer > . isEmpty ArrayDeque < Integer > . size |
check <unk> <unk> max flow | ArrayDeque < Integer > . <init> ArrayDeque < Integer > . offer ArrayDeque < Integer > . isEmpty ArrayDeque < Integer > . poll ArrayDeque < Integer > . push |
check <unk> <unk> max flow | ArrayDeque < Integer > . <init> ArrayDeque < Integer > . offer ArrayDeque < Integer > . poll ArrayDeque < Integer > . push |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.