docstring stringlengths 3 2.38k | code stringlengths 9 99.4k |
|---|---|
yet another path extraction algorithm | ArrayDeque . <init> PriorityQueue < ArrayDeque > . <init> HashMap < Integer , Double > . <init> HashMap < Integer , Double > . containsKey HashMap < Integer , Double > . put OpenMapRealMatrix . cast OpenMapRealMatrix . <unk> PriorityQueue < ArrayDeque > . remove ArrayDeque . peekLast HashMap < Integer , Double > . put OpenMapRealMatrix . cast OpenMapRealMatrix . <unk> PriorityQueue < ArrayDeque > . isEmpty ArrayList < Edge > . <init> PriorityQueue < ArrayDeque > . remove ArrayDeque . peekLast ArrayList < Edge > . <init> Math . max Graph . getNode Graph . getEdge Node . setDouble Edge . setDouble ArrayList < Edge > . add |
problem next right pointers in each node given a binary tree struct tree link node tree link node left ; tree link node right ; tree link node next ; populate each next pointer to point to its next right node | ArrayDeque . <init> Queue . add ArrayList . <init> Queue . isEmpty List . clear ArrayDeque . <init> Queue . isEmpty Queue . poll List . add Queue . add List . get |
determine polygon and corner types : <unk> , <unk> , land | ArrayDeque . <init> Queue . add List . size Queue . isEmpty Queue . poll Queue . add List . size |
method description | ArrayDeque . <init> Queue . add |
remove all unsupported features from the enabled feature set | ArrayDeque . <init> Queue . isEmpty Queue . poll |
time o n space : o n 2 | ArrayDeque . <init> Queue < Node > . add Queue < Node > . poll Queue < Node > . add |
return all of the keys in the set that start with prefix | ArrayDeque . <init> Queue < String > . add StringBuilder . <init> |
get an array representation of the tree in <unk> first search order | ArrayDeque . <init> Queue < TreeNode > . add Queue < TreeNode > . remove |
implementation of breadth first search algorithm from : algorithms <unk> | ArrayDeque . <init> Queue < Vertex > . add Queue < Vertex > . remove Hashtable < Vertex , Integer > . keySet Queue < Vertex > . add |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . next Iterator . remove Iterator . next Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Integer . <init> Iterator . remove ArrayDeque . isEmpty |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . remove Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Integer . <init> Iterator . remove Iterator . hasNext ArrayDeque . isEmpty |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . remove Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Integer . <init> Iterator . remove |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . remove Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Iterator . next Integer . <init> Iterator . remove ArrayDeque . isEmpty |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . remove Integer . <init> Iterator . next Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Integer . <init> Iterator . remove Iterator . hasNext ArrayDeque . isEmpty |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . remove Iterator . next Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Integer . <init> Iterator . next Iterator . remove Iterator . hasNext |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt ArrayDeque . add ArrayDeque . descendingIterator Iterator . next Integer . <init> Iterator . remove Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Integer . <init> Iterator . remove Iterator . hasNext ArrayDeque . isEmpty |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt ArrayDeque . add ArrayDeque . descendingIterator Iterator . next Integer . <init> Iterator . remove Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Iterator . next Integer . <init> Iterator . remove ArrayDeque . isEmpty |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt ArrayDeque . add ArrayDeque . descendingIterator Iterator . next Integer . <init> Iterator . remove Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Iterator . next Integer . <init> Iterator . remove Iterator . hasNext ArrayDeque . isEmpty |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . next Iterator . remove Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Integer . <init> Iterator . remove Iterator . hasNext |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . next Iterator . remove Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Iterator . next Integer . <init> Iterator . remove Iterator . hasNext |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . remove Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Integer . <init> Iterator . next Iterator . remove ArrayDeque . isEmpty |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . remove Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Integer . <init> Iterator . next Iterator . remove Iterator . hasNext ArrayDeque . isEmpty |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . remove Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Integer . <init> Iterator . next Iterator . remove |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . remove Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Integer . <init> Iterator . remove ArrayDeque . isEmpty |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . remove Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Integer . <init> Iterator . remove Iterator . hasNext |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . remove Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Integer . <init> Iterator . remove |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . remove Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Iterator . next Integer . <init> Iterator . remove Iterator . hasNext ArrayDeque . isEmpty |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . remove Integer . <init> Iterator . next Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Iterator . next Integer . <init> Iterator . remove ArrayDeque . isEmpty |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . remove Iterator . next Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Integer . <init> Iterator . next Iterator . remove |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . remove Iterator . next Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Integer . <init> Iterator . remove Iterator . hasNext ArrayDeque . isEmpty |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . remove Iterator . next Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Integer . <init> Iterator . remove Iterator . hasNext |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . remove Iterator . next Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Iterator . next Integer . <init> Iterator . remove Iterator . hasNext ArrayDeque . isEmpty |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Integer . <init> Iterator . remove Iterator . next Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Iterator . next Integer . <init> Iterator . remove |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Iterator . next Integer . <init> Iterator . remove Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Integer . <init> Iterator . remove Iterator . hasNext |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Iterator . next Integer . <init> Iterator . remove Iterator . next Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Integer . <init> Iterator . remove Iterator . hasNext ArrayDeque . isEmpty |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Iterator . next Integer . <init> Iterator . remove Iterator . next Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Integer . <init> Iterator . remove Iterator . hasNext |
descend iterator | ArrayDeque . <init> Random . <init> Random . nextInt Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Iterator . next Integer . <init> Iterator . remove Iterator . next Integer . <init> ArrayDeque . remove ArrayDeque . descendingIterator Iterator . next Integer . <init> Iterator . remove Iterator . hasNext ArrayDeque . isEmpty |
instantiate a new scheduler | ArrayDeque . <init> Scheduler . <unk> Thread . start |
return a set of all entries in this heap | ArrayDeque . <init> Set < Element > . add Deque < Element > . push Deque < Element > . pop |
asynchronously loads all script sources that will be referenced from a new debug context from its stack frames | ArrayDeque . <init> Set < String > . size HashMap < String > . <init> Map < String > . put Queue . add |
convert xml formatted rich text and set it inside the text run | ArrayDeque . <init> String . length Pattern . matcher Matcher . find Matcher . start String . substring Deque . descendingIterator Iterator . hasNext Iterator . next Matcher . end Deque . isEmpty StringBuilder . <init> StringBuilder . append StringBuilder . toString |
<unk> uma formula com base <unk> <unk> reverse <unk> notation | ArrayDeque . <init> String . split Deque . push Deque . pop Deque . push Deque . pop |
get the neighbors of a given vertex on the map | ArrayDeque . <init> String . toCharArray ArrayDeque < Vertex > . add |
write the java object json value to the appendable out <unk> <unk> , a to json policy | ArrayDeque . <init> StringBuilder . <init> Appendable . append Boolean . cast Appendable . append Object . toString Appendable . append ArrayDeque . push StringBuilder . append Appendable . append ArrayDeque . push StringBuilder . append Appendable . append ArrayDeque . isEmpty ArrayDeque . peek Iterator < Object > . cast Appendable . append Iterator < Object > . next ArrayDeque . peek Iterator < Object > . cast Iterator < Object > . hasNext Appendable . append ArrayDeque . pop StringBuilder . length StringBuilder . delete StringBuilder . length Appendable . append ArrayDeque . peek Entry < String , Object > > . cast Entry < String , Object > > . hasNext Appendable . append Entry < String , Object > > . next Entry < String , Object > . cast Appendable . append Entry < String , Object > . getValue ArrayDeque . peek Entry < String , Object > > . cast Entry < String , Object > > . hasNext Appendable . append ArrayDeque . pop StringBuilder . delete StringBuilder . length Appendable . append |
return all keys in the symbol table as an iterable | ArrayDeque . <init> StringBuilder . <init> |
perform a depth first search on a given node | ArrayDeque . <init> Trees . <unk> |
add the specified item to the front of the deque | ArrayDeque . <unk> ArrayDeque . <unk> |
add new event and return expired events | ArrayDeque . add ArrayDeque . size ArrayList . <init> List . add Collections . emptyList |
add an item to the processing queue | ArrayDeque . add Semaphore . release |
inserts the specified element at the end of this deque . | ArrayDeque . add |
add a new value , which becomes the current generation | ArrayDeque . addFirst ArrayDeque . removeLast |
inserts the specified element at the front of this deque . | ArrayDeque . addFirst |
synchronously collect memory stats | ArrayDeque . addLast ArrayDeque . removeFirst ArrayDeque . addLast ArrayDeque . removeFirst ArrayDeque . addLast ArrayDeque . removeFirst |
synchronously collect memory stats | ArrayDeque . addLast ArrayDeque . removeFirst ArrayDeque . size ArrayDeque . removeFirst ArrayDeque . addLast ArrayDeque . size ArrayDeque . removeFirst ArrayDeque . addLast ArrayDeque . removeFirst ArrayDeque . size |
synchronously collect memory stats | ArrayDeque . addLast ArrayDeque . size ArrayDeque . removeFirst ArrayDeque . addLast ArrayDeque . removeFirst ArrayDeque . addLast ArrayDeque . size ArrayDeque . removeFirst |
synchronously collect memory stats | ArrayDeque . addLast ArrayDeque . size ArrayDeque . removeFirst ArrayDeque . addLast ArrayDeque . removeFirst ArrayDeque . size ArrayDeque . removeFirst ArrayDeque . addLast ArrayDeque . removeFirst ArrayDeque . size ArrayDeque . removeFirst |
synchronously collect memory stats | ArrayDeque . addLast ArrayDeque . size ArrayDeque . removeFirst ArrayDeque . addLast ArrayDeque . removeFirst ArrayDeque . size ArrayDeque . removeFirst ArrayDeque . addLast ArrayDeque . removeFirst |
inserts the specified element at the end of this deque . | ArrayDeque . addLast |
return a copy of this deque | ArrayDeque . cast Array . newInstance System . arraycopy AssertionError . <init> |
return a copy of this deque | ArrayDeque . cast Object [] . cast System . arraycopy AssertionError . <init> |
clear removes all elements | ArrayDeque . clear ArrayDeque . isEmpty ArrayDeque . size Integer . <init> ArrayDeque . add ArrayDeque . isEmpty ArrayDeque . clear ArrayDeque . isEmpty |
call after a <unk> if this source wasnt the first to find the new block | ArrayDeque . clear ArrayDeque . notifyAll |
do something to the elements | ArrayDeque . clear ArrayList . get ArrayDeque . add ArrayDeque . isEmpty ArrayDeque . peek ArrayDeque . push ArrayDeque . pop |
reset the loop stack so it is ready to be <unk> through | ArrayDeque . clear ArrayList . size ArrayList . get ArrayDeque . add |
notify this source that a block change has happened | ArrayDeque . clear System . currentTimeMillis |
this is called by a window or a scroll pane when it has become invalid | ArrayDeque . contains ArrayDeque . addLast |
post one size = size + one two deque = deque with value in back | ArrayDeque . ensureCapacity ArrayDeque . mod |
post one size = size + one two deque = deque with value in front | ArrayDeque . ensureCapacity ArrayDeque . mod |
get the historical value at some generation , 0 is current | ArrayDeque . getFirst ArrayDeque . iterator Iterator . hasNext Iterator . next |
get first returns next <unk> , or throws nsee if empty | ArrayDeque . getFirst Integer . intValue Integer . cast ArrayDeque . pollFirst ArrayDeque . getFirst |
get last returns next element , or throws nsee if empty | ArrayDeque . getLast Integer . intValue Integer . cast ArrayDeque . pollLast ArrayDeque . getLast ArrayDeque . peekLast |
close pops all directories on the stack | ArrayDeque . isEmpty <unk> . pop |
be next event available ? | ArrayDeque . isEmpty ArrayBlockingQueue . drainTo ArrayDeque . addLast |
remove and return the item at the <unk> of the deque throws <unk> exception if deque is empty | ArrayDeque . isEmpty ArrayDeque . <unk> |
remove all of the elements from this stack | ArrayDeque . isEmpty ArrayDeque . clear |
return and remove events in time slots earlier less then the timestamp passed in , returning the list of events expired | ArrayDeque . isEmpty ArrayDeque . getFirst ArrayDeque . <init> ArrayDeque . add ArrayDeque . addAll ArrayDeque . removeFirst ArrayDeque . getFirst Map . remove |
return the next token in the input stream and drop it | ArrayDeque . isEmpty ArrayDeque . peekFirst ArrayDeque . removeFirst |
swap the two queues of deferred <unk> and serialize everything into the queue of pending buffers | ArrayDeque . isEmpty ArrayDeque . poll ArrayDeque . peekLast ArrayDeque . offer ByteBuffer . limit ByteBuffer . slice ByteBuffer . position ByteBuffer . remaining ByteBuffer . position ByteBuffer . limit ByteBuffer . allocate ByteBuffer . position ByteBuffer . remaining ByteBuffer . hasRemaining ByteBuffer . clear ArrayDeque . offer ByteBuffer . remaining ByteBuffer . put ByteBuffer . limit ByteBuffer . put ByteBuffer . limit |
find the next tree range | ArrayDeque . isEmpty ArrayDeque . pop ArrayDeque . isEmpty ArrayDeque . addLast Range . <unk> ArrayDeque . addLast ArrayDeque . addFirst |
find the next tree range | ArrayDeque . isEmpty ArrayDeque . pop ArrayDeque . isEmpty Range . <unk> ArrayDeque . addLast Range . <unk> ArrayDeque . addLast ArrayDeque . addFirst |
pop the directory node that is the current top of the stack so that there are no more events for the directory including no end directory event | ArrayDeque . isEmpty ArrayDeque . pop |
remove a marker from the list of available ones | ArrayDeque . isEmpty ArrayDeque . pop |
pre ! deque | ArrayDeque . isEmpty ArrayDeque . size ArrayDeque . removeFirst Integer . cast Math . min ArrayDeque . addLast |
this method updates child views and clears the batch of events | ArrayDeque . isEmpty ArrayDeque . size ArrayDeque . toArray ArrayDeque . isEmpty ArrayDeque . toArray ArrayDeque . isEmpty ArrayDeque . <init> |
do the work of queueing <unk> buffers that have been serialized and choosing between gathering and regular writes to the channel | ArrayDeque . offer ArrayDeque . isEmpty ArrayDeque . size ArrayDeque . peek ArrayDeque . push ByteBuffer . position Math . min ByteBuffer . limit ByteBuffer . position ArrayDeque . push ByteBuffer . position ByteBuffer . limit ByteBuffer . position ByteBuffer . hasRemaining ArrayDeque . peek ArrayDeque . size ByteBuffer . remaining ByteBuffer . isDirect <unk> . write ByteBuffer . hasRemaining <unk> . write ByteBuffer . hasRemaining ArrayDeque . poll ArrayDeque . size |
add the tweet into the right similar documents list | ArrayDeque . offer ArrayDeque . poll ArrayDeque . offer |
do the work of queueing <unk> buffers that have been serialized and choosing between gathering and regular writes to the channel | ArrayDeque . offer ArrayDeque . size ArrayDeque . peek ArrayDeque . push ByteBuffer . position ByteBuffer . remaining Math . min ByteBuffer . position ByteBuffer . slice ArrayDeque . push ByteBuffer . limit ByteBuffer . position ByteBuffer . hasRemaining ArrayDeque . peek ArrayDeque . size ByteBuffer . remaining ByteBuffer . isDirect <unk> . write ArrayDeque . poll <unk> . write ByteBuffer . hasRemaining ArrayDeque . isEmpty |
do the work of queueing <unk> buffers that have been serialized and choosing between gathering and regular writes to the channel | ArrayDeque . offer ArrayDeque . size ArrayDeque . peek ByteBuffer . isDirect ArrayDeque . push ByteBuffer . position Math . min ByteBuffer . position ArrayDeque . push ByteBuffer . limit ByteBuffer . position ByteBuffer . hasRemaining ArrayDeque . peek ArrayDeque . size ByteBuffer . remaining <unk> . write ByteBuffer . hasRemaining ArrayDeque . isEmpty |
enqueue a new state transition to the given value with two optional callbacks to be executed before and after the transition | ArrayDeque . offer State . update |
return the next event or null if there are no more events orthe walker is closed | ArrayDeque . peek Iterator < Path > . hasNext Iterator < Path > . next Throwable . <unk> ArrayDeque . pop Event . <init> <unk> . visit |
peek first returns next element , or null if empty | ArrayDeque . peekFirst Integer . cast Integer . intValue ArrayDeque . pollFirst ArrayDeque . peekFirst Integer . intValue ArrayDeque . peekFirst Integer . cast ArrayDeque . peekFirst |
peek first returns next element , or null if empty | ArrayDeque . peekFirst Integer . intValue Integer . cast ArrayDeque . pollFirst ArrayDeque . peekFirst Integer . intValue Integer . cast ArrayDeque . peekFirst |
should return the minimum <unk> along the path passed as parameter | ArrayDeque . peekFirst OpenMapRealMatrix . getEntry |
read from the assigned literals stack and <unk> all literals that have been added after s literal s | ArrayDeque . peekLast ArrayDeque . removeLast |
peek last returns next element , or null if empty | ArrayDeque . peekLast Integer . cast ArrayDeque . pollLast ArrayDeque . peekLast Integer . cast Integer . intValue ArrayDeque . peekLast |
build name attribute node map from the current entity graph were visiting | ArrayDeque . peekLast List . isEmpty Collections . emptyMap HashMap < String > . <init> List . size Map < String > . put |
swap the two queues of deferred <unk> and serialize everything into the queue of pending buffers | ArrayDeque . poll ArrayDeque . peekLast ArrayDeque . offer ByteBuffer . remaining ByteBuffer . limit ByteBuffer . position ByteBuffer . limit ByteBuffer . slice ByteBuffer . position ByteBuffer . remaining ByteBuffer . position ByteBuffer . limit ByteBuffer . allocate ByteBuffer . position ByteBuffer . remaining ByteBuffer . hasRemaining ByteBuffer . clear ArrayDeque . offer ByteBuffer . remaining ByteBuffer . put ByteBuffer . limit ByteBuffer . put ByteBuffer . limit |
fetch the next transition from the queue and applies it | ArrayDeque . poll Runnable . run Factory . <unk> Runnable . run State . update Runnable . run Runnable . <init> Factory . <unk> Runnable . run State . update Factory . post Factory . <unk> |
pop the top <unk> waiting for the <unk> and try to board | ArrayDeque . pop ArrayDeque . addFirst |
push the pixel onto the heap | ArrayDeque . push BitSet . set |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.