docstring stringlengths 3 2.38k | code stringlengths 9 99.4k |
|---|---|
http <unk> | ArrayDeque < Integer > . <init> ArrayDeque < Integer > . peekLast ArrayDeque < Integer > . isEmpty ArrayDeque < Integer > . pollLast ArrayDeque < Integer > . addLast ArrayDeque < Integer > . peekFirst ArrayDeque < Integer > . peekLast ArrayDeque < Integer > . isEmpty ArrayDeque < Integer > . pollLast ArrayDeque < Integer > . pollFirst ArrayDeque < Integer > . addFirst ArrayDeque < Integer > . peekFirst |
bench for pushing the data to the array deque | ArrayDeque < Integer > . <init> ArrayDeque < Integer > . push |
parse json text into java object from the input source | ArrayDeque < Integer > . <init> ArrayDeque < Object > . <init> Deque < Integer > . addFirst Deque < Object > . addFirst Deque < Integer > . addFirst Deque < Object > . addFirst Deque < Integer > . addFirst Deque < Object > . addFirst Deque < Object > . removeFirst String . instance String . cast Deque < Object > . addFirst Deque < Integer > . addFirst Deque < Integer > . removeFirst Deque < Object > . removeFirst Deque < Integer > . removeFirst Deque < Object > . removeFirst String . cast Map < String , Object > . cast Deque < Integer > . removeFirst String . cast Deque < Object > . getFirst Map < String , Object > . cast Deque < Integer > . addFirst Deque < Object > . addFirst Deque < Integer > . removeFirst Deque < Object > . removeFirst String . cast Deque < Object > . getFirst Map < String , Object > . cast Deque < Integer > . addFirst Deque < Object > . addFirst List < Object > . cast Deque < Integer > . removeFirst Deque < Object > . removeFirst Deque < Object > . getFirst List < Object > . cast Integer . valueOf Deque < Integer > . addFirst Deque < Object > . addFirst Deque < Object > . getFirst List < Object > . cast Integer . valueOf Deque < Integer > . addFirst Deque < Object > . addFirst |
parse json text into java object from the input source | ArrayDeque < Integer > . <init> ArrayDeque < Object > . <init> Integer . valueOf Deque < Integer > . addFirst Deque < Object > . addFirst Deque < Integer > . addFirst Deque < Object > . addFirst Deque < Integer > . addFirst Deque < Object > . addFirst Deque < Object > . removeFirst String . instance String . cast Deque < Object > . addFirst Integer . valueOf Deque < Integer > . addFirst Deque < Integer > . removeFirst Deque < Object > . removeFirst Deque < Integer > . removeFirst String . cast Deque < Object > . getFirst Map < String , Object > . cast Deque < Integer > . removeFirst Deque < Object > . removeFirst String . cast Deque < Object > . getFirst Map < String , Object > . cast Integer . valueOf Deque < Integer > . addFirst Deque < Object > . addFirst Deque < Integer > . removeFirst String . cast Deque < Object > . getFirst Map < String , Object > . cast Deque < Integer > . addFirst Deque < Object > . addFirst Deque < Object > . getFirst List < Object > . cast Deque < Object > . size Deque < Integer > . removeFirst Deque < Object > . removeFirst Deque < Object > . getFirst List < Object > . cast Deque < Integer > . addFirst Deque < Object > . addFirst Deque < Object > . getFirst List < Object > . cast Integer . valueOf Deque < Integer > . addFirst Deque < Object > . addFirst |
init a random sequence which has no match | ArrayDeque < Integer > . <init> ArrayList < Pair < Integer , Integer > > . clear SecureRandom . nextInt Integer . valueOf Deque < Integer > . addLast Deque < Integer > . size Deque < Integer > . pop SecureRandom . nextInt Deque < Integer > . contains Integer . valueOf Deque < Integer > . addLast Deque < Integer > . pop ArrayList < Pair < Integer , Integer > > . add Integer . valueOf |
stream processing of json text | ArrayDeque < Integer > . <init> ContentHandler . <unk> ArrayDeque < Integer > . addFirst ContentHandler . <unk> Integer . valueOf ArrayDeque < Integer > . addFirst ContentHandler . <unk> Integer . valueOf ArrayDeque < Integer > . addFirst ContentHandler . <unk> ContentHandler . <unk> String . cast Integer . valueOf ArrayDeque < Integer > . addFirst ArrayDeque < Integer > . size ArrayDeque < Integer > . removeFirst ContentHandler . <unk> ArrayDeque < Integer > . removeFirst Integer . valueOf ArrayDeque < Integer > . addFirst ContentHandler . <unk> ArrayDeque < Integer > . removeFirst ArrayDeque < Integer > . addFirst ArrayDeque < Integer > . removeFirst ArrayDeque < Integer > . size ArrayDeque < Integer > . removeFirst Integer . valueOf ArrayDeque < Integer > . addFirst |
stream processing of json text | ArrayDeque < Integer > . <init> ContentHandler . <unk> ArrayDeque < Integer > . addFirst ContentHandler . <unk> Integer . valueOf ArrayDeque < Integer > . addFirst ContentHandler . <unk> String . cast Integer . valueOf ArrayDeque < Integer > . addFirst ContentHandler . <unk> ArrayDeque < Integer > . removeFirst ContentHandler . <unk> ArrayDeque < Integer > . removeFirst ContentHandler . <unk> ArrayDeque < Integer > . removeFirst Integer . valueOf ArrayDeque < Integer > . addFirst Integer . valueOf ArrayDeque < Integer > . addFirst ContentHandler . <unk> ArrayDeque < Integer > . removeFirst Integer . valueOf ArrayDeque < Integer > . addFirst ContentHandler . <unk> ArrayDeque < Integer > . removeFirst ContentHandler . <unk> ArrayDeque < Integer > . removeFirst ArrayDeque < Integer > . addFirst ContentHandler . <unk> |
give a directed graph , design an algorithm to find out whether there is a route between two nodes | ArrayDeque < Integer > . <init> Deque < Integer > . add Deque < Integer > . removeLast Deque < Integer > . addFirst |
add a <unk> value | ArrayDeque < Integer > . <init> Deque < Integer > . add |
return a number of most recent preferences | ArrayDeque < Integer > . <init> Deque < Integer > . descendingIterator ArrayDeque < Integer > . add Iterator . next |
output the length of the maximum path through the graph | ArrayDeque < Integer > . <init> Deque < Integer > . offer Deque < Integer > . size Deque < Integer > . poll Graph . getEdge Deque < Integer > . offer |
\ public string shortest int <unk> , int <unk> \ brief metodo que <unk> o <unk> <unk> de uma <unk> a <unk> e <unk> <unk> | ArrayDeque < Integer > . <init> Deque < Integer > . push String . <init> Deque < Integer > . isEmpty String . concat Deque < Integer > . pop String . concat |
perform a breadth first search of a graph | ArrayDeque < Integer > . <init> Graph . <unk> Queue < Integer > . offer Queue < Integer > . isEmpty Queue < Integer > . remove Graph . <unk> Iterator < Edge > . hasNext Iterator < Edge > . next Edge . <unk> Queue < Integer > . offer |
simulate the clock by keeping queues for all the respective different queue in the clock | ArrayDeque < Integer > . <init> Queue < Integer > . add Queue < Integer > . remove Queue < Integer > . add Queue < Integer > . size ArrayList < Integer > . <init> ArrayList < Integer > . get Queue < Integer > . add Queue < Integer > . size ArrayList < Integer > . <init> Queue < Integer > . add Queue < Integer > . remove Queue < Integer > . add Queue < Integer > . size ArrayList < Integer > . <init> Queue < Integer > . add |
truncate s to the given length or to closest space tag depending on chop | ArrayDeque < Integer > . <init> String . toCharArray StringBuilder . <init> Deque < Integer > . push StringBuilder . append Deque < Integer > . pop StringBuilder . append StringBuilder . lastIndexOf StringBuilder . setLength Deque < Integer > . pop StringBuilder . setLength StringBuilder . append Deque < Integer > . isEmpty Deque < Integer > . pop StringBuilder . append StringBuilder . toString |
there is a sliding window of size k | ArrayDeque < Integer > . addLast ArrayDeque < Integer > . removeFirst ArrayDeque < Integer > . getLast ArrayDeque < Integer > . addLast ArrayDeque < Integer > . getLast ArrayDeque < Integer > . size ArrayDeque < Integer > . removeLast ArrayDeque < Integer > . addLast |
simulate the ongoing checking in process as everyone waits in line | ArrayDeque < Integer > . isEmpty ArrayDeque < Integer > . peek ArrayDeque < Integer > . pop ArrayDeque < Integer > . push ArrayDeque < Integer > . peek ArrayDeque < Integer > . pop |
discard the current number of <unk> in the <unk> and replace it with the last value from the stack | ArrayDeque < Integer > . isEmpty ArrayDeque < Integer > . pop |
discard the current score to the recorded values | ArrayDeque < Integer > . isEmpty ArrayDeque < Integer > . pop |
get a lookup table | ArrayDeque < Integer > . poll ArrayDeque < < Node > > . poll Node . <unk> ArrayDeque < < Node > > . poll |
get the strings of the <unk> | ArrayDeque < Iterable > . <init> Deque < Iterable > . addFirst |
join the iterators of all the provided iterables as one unified iterator | ArrayDeque < Iterator > . <init> Queue < Iterator > . add |
create a list of all inspectors which match the specified type | ArrayDeque < JComponent > . <init> Deque < JComponent > . push Class . getSuperclass Deque < JComponent > . toArray |
add a contribution of an arbitrary area made of straight line segments to all points in a given area | ArrayDeque < Line2D > . <init> Area . getPathIterator PathIterator . currentSegment System . arraycopy Deque < Line2D > . add System . arraycopy PathIterator . next Rectangle2D . getX Math . max Math . min Rectangle2D . getY Math . max Math . min Math . max Rectangle2D . getX Rectangle2D . getWidth Math . min Math . max Rectangle2D . getX Rectangle2D . getY |
add a contribution of an arbitrary area made of straight line segments to all points in a given area | ArrayDeque < Line2D > . <init> Area . getPathIterator PathIterator . isDone PathIterator . currentSegment System . arraycopy Double . <init> Deque < Line2D > . add Double . <init> Deque < Line2D > . add System . arraycopy PathIterator . next Rectangle2D . getX Math . max Math . min Math . max Math . min Rectangle2D . getY Math . min Rectangle2D . getX Math . max Math . min Math . max Rectangle2D . getX Rectangle2D . getY Area . contains |
add a contribution of an arbitrary area made of straight line segments to all points in a given area | ArrayDeque < Line2D > . <init> Area . getPathIterator PathIterator . isDone PathIterator . currentSegment System . arraycopy Double . <init> Deque < Line2D > . add System . arraycopy PathIterator . next Math . max Rectangle2D . getX Math . min Math . max Rectangle2D . getX Rectangle2D . getWidth Math . max Math . min Math . max Rectangle2D . getHeight Rectangle2D . getY Rectangle2D . getX Rectangle2D . getY Area . contains |
return the line fragments of the specified shape | ArrayDeque < Line2D > . <init> FlatteningPathIterator . <init> PathIterator . currentSegment Double . <init> Deque < Line2D > . addLast Double . <init> Deque < Line2D > . addFirst Deque < Line2D > . isEmpty Deque < Line2D > . getFirst Deque < Line2D > . getLast Point2D . equals Double . <init> Point2D . getY Deque < Line2D > . addLast Double . <init> Point2D . getY Deque < Line2D > . addFirst System . arraycopy PathIterator . next Deque < Line2D > . size Deque < Line2D > . toArray |
return the line fragments of the specified shape | ArrayDeque < Line2D > . <init> FlatteningPathIterator . <init> PathIterator . currentSegment Double . <init> Deque < Line2D > . addLast Double . <init> Deque < Line2D > . addFirst Deque < Line2D > . isEmpty Deque < Line2D > . getLast Point2D . equals Double . <init> Point2D . getY Deque < Line2D > . addLast Double . <init> Point2D . getY Deque < Line2D > . addFirst System . arraycopy PathIterator . next Deque < Line2D > . size Deque < Line2D > . toArray |
return the line fragments of the specified shape | ArrayDeque < Line2D > . <init> FlatteningPathIterator . <init> PathIterator . isDone PathIterator . currentSegment Double . <init> Deque < Line2D > . addLast Double . <init> Deque < Line2D > . addFirst Deque < Line2D > . getLast Point2D . equals Double . <init> Point2D . getY Deque < Line2D > . addLast Double . <init> Point2D . getX Point2D . getY Deque < Line2D > . addFirst System . arraycopy PathIterator . next Deque < Line2D > . size Deque < Line2D > . toArray |
return the line fragments of the specified shape | ArrayDeque < Line2D > . <init> FlatteningPathIterator . <init> PathIterator . isDone PathIterator . currentSegment Double . <init> Deque < Line2D > . addLast Double . <init> Deque < Line2D > . addFirst Deque < Line2D > . isEmpty Deque < Line2D > . getLast Point2D . equals Double . <init> Point2D . getY Deque < Line2D > . addLast Double . <init> Point2D . getX Point2D . getY Deque < Line2D > . addFirst System . arraycopy PathIterator . next Deque < Line2D > . size Deque < Line2D > . toArray |
return the line fragments of the specified shape | ArrayDeque < Line2D > . <init> Shape . getPathIterator FlatteningPathIterator . <init> PathIterator . currentSegment Double . <init> Deque < Line2D > . addLast Double . <init> Deque < Line2D > . addFirst Deque < Line2D > . getFirst Deque < Line2D > . getLast Point2D . equals Double . <init> Point2D . getY Deque < Line2D > . addLast Double . <init> Point2D . getX Point2D . getY Deque < Line2D > . addFirst System . arraycopy PathIterator . next Deque < Line2D > . size Deque < Line2D > . toArray |
expand the last <unk> edge in a list thereof to find <unk> paths | ArrayDeque < List > . <init> ArrayDeque < List > . push ArrayDeque < List > . isEmpty ArrayDeque < List > . pop List . get S . <unk> Collection . size ArrayList . <init> List . add ArrayDeque < List > . push List . add ArrayDeque < List > . push Builder . add |
expand the last <unk> edge in a list thereof to find <unk> paths | ArrayDeque < List > . <init> ArrayDeque < List > . push ArrayDeque < List > . pop List . get S . <unk> Collection . size ArrayList . <init> List . add ArrayDeque < List > . push List . add ArrayDeque < List > . push Builder . add |
update the <unk> position | ArrayDeque < Location > . addLast ArrayDeque < Location > . pop |
assume gps is tracking at low speed | ArrayDeque < Location > . size ArrayDeque < Location > . getFirst Location . distanceTo String . format |
assume gps is tracking at high speed | ArrayDeque < Location > . size String . format Location . <unk> String . format |
expand the root node using dfs | ArrayDeque < Long > . <init> Deque < Long > . add Deque < Long > . isEmpty Deque < Long > . pop HashMap < Long > . containsKey SortedMap . get HashMap < Long > . put HashMap < Long > . containsKey Deque < Long > . add HashMap < Long > . containsKey Deque < Long > . add |
add a <unk> value | ArrayDeque < Long > . <init> Deque < Long > . add |
add a varint value | ArrayDeque < Long > . <init> Deque < Long > . add |
return the current timers value in milliseconds | ArrayDeque < Long > . getFirst System . nanoTime |
generate a new unique id used for assigning it to a entity | ArrayDeque < Long > . size ArrayDeque < Long > . pop Error . <init> |
im using null object pattern here , for attributes that not existing in the <unk> , a predefined null attribute node is pushed to the stack | ArrayDeque < Map < String > > . peekLast Map < String > . containsKey Map < String > . get Type . <unk> Map < Class > . get ArrayDeque . addLast |
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 < Name > . <init> Deque < Name > . isEmpty Deque < Name > . pop Name . <unk> Scope . isLocal Name . <unk> Deque < Name > . addAll |
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 < Name > . <init> Deque < Name > . isEmpty Deque < Name > . pop Name . <unk> Scope . isLocal Name . <unk> Scope . <unk> Ref . <unk> Name . <unk> Deque < Name > . addAll |
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 < Name > . <init> Deque < Name > . pop Name . <unk> Name . <unk> Ref . <unk> Name . <unk> Deque < Name > . addAll |
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 < Name > . <init> Deque < Name > . pop Name . <unk> Name . <unk> Scope . <unk> Ref . <unk> Name . <unk> Deque < Name > . addAll |
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 < Name > . <init> Deque < Name > . pop Name . <unk> Scope . isLocal Name . <unk> Deque < Name > . addAll |
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 < Name > . <init> Deque < Name > . pop Scope . isLocal Name . <unk> Deque < Name > . addAll |
breadth first search not <unk> sets node discover and process times accordingly | ArrayDeque < Node > . <init> ArrayDeque < Node > . add ArrayDeque < Node > . isEmpty ArrayDeque < Node > . pop ArrayList < Node > . get ArrayDeque < Node > . add |
need the depth for console visual | ArrayDeque < Node > . <init> ArrayDeque < Node > . add ArrayDeque < Node > . isEmpty ArrayDeque < Node > . size ArrayDeque < Node > . removeFirst Node . getLeft ArrayDeque < Node > . add Node . getRight ArrayDeque < Node > . add |
visual representation is <unk> in testing | ArrayDeque < Node > . <init> ArrayDeque < Node > . add ArrayDeque < Node > . iterator Iterator < Node > . next ArrayDeque < Node > . size ArrayDeque < Node > . removeFirst ArrayDeque < Node > . add Node . getRight ArrayDeque < Node > . add |
minimize memory by <unk> trimming the queue | ArrayDeque < Node > . <init> ArrayDeque < Node > . add ArrayDeque < Node > . size ArrayDeque < Node > . removeFirst ArrayDeque < Node > . add |
bfs doing a breadth first approach with a queue | ArrayDeque < Node > . <init> ArrayDeque < Node > . add ArrayDeque < Node > . size ArrayDeque < Node > . removeFirst Node . getLeft ArrayDeque < Node > . add Node . getRight ArrayDeque < Node > . add |
need the depth for console visual | ArrayDeque < Node > . <init> ArrayDeque < Node > . add ArrayDeque < Node > . size ArrayDeque < Node > . removeFirst Node . getLeft ArrayDeque < Node > . add |
the process of visiting each node in a tree data structure | ArrayDeque < Node > . <init> ArrayList . <init> Queue < Node > . add Queue < Node > . isEmpty Queue < Node > . poll List . add Node . getLeftChild Queue < Node > . add |
the process of visiting each node in a tree data structure | ArrayDeque < Node > . <init> ArrayList . <init> Queue < Node > . add Queue < Node > . isEmpty Queue < Node > . poll List . add Queue < Node > . add Node . getRightChild Queue < Node > . add |
perform a uniform cost search of the tile sequence problem | ArrayDeque < Node > . <init> ArrayList . <init> State . <init> Node . <init> System . nanoTime ArrayDeque < Node > . add ArrayDeque < Node > . remove State . <unk> Node . <unk> Node . getState Node . expand ArrayDeque < Node > . add ArrayDeque < Node > . remove Node . <unk> ArrayDeque < Node > . push Node . <unk> ArrayDeque < Node > . add ArrayDeque < Node > . isEmpty ArrayDeque < Node > . remove ArrayDeque < Node > . add System . nanoTime |
perform a depth first search of the tile sequence problem | ArrayDeque < Node > . <init> ArrayList . <init> State . <init> Node . <init> System . nanoTime ArrayDeque < Node > . push ArrayDeque < Node > . pop Node . <unk> State . <unk> Node . <unk> Node . getState Node . expand ArrayDeque < Node > . push System . nanoTime |
find and returns a list of all nodes in a tree rooted at root | ArrayDeque < Node > . <init> ArrayList < Node > . <init> Deque < Node > . addFirst Deque < Node > . removeFirst List < Node > . add Node . getRight Deque < Node > . addFirst Node . getLeft Deque < Node > . addFirst |
use double ended queue add to either end depending on the level | ArrayDeque < Node > . <init> Deque < Node > . addFirst Deque < Node > . removeFirst Deque < Node > . addLast Deque < Node > . removeLast Deque < Node > . addFirst |
construct a path from the final search node back to the start node | ArrayDeque < Node > . <init> Deque < Node > . addFirst Node . toString |
return whether nodes value is a descendant of any of the values in node set | ArrayDeque < Node > . <init> HashSet < Node > . <init> ArrayDeque < Node > . add ArrayDeque < Node > . isEmpty ArrayDeque < Node > . pop ArrayDeque < Node > . add |
return whether nodes value is a descendant of any of the values in node set | ArrayDeque < Node > . <init> HashSet < Node > . <init> ArrayDeque < Node > . add ArrayDeque < Node > . pop Set < Node > . add ArrayDeque < Node > . add |
for a given node , returns a list representing the <unk> of node | ArrayDeque < Node > . <init> Node . getParent Deque < Node > . push Node . getParent |
this method performs a normalization of the tree by removing all the multi edges due to a node having multiple parents | ArrayDeque < Node > . <init> Queue < Node > . add Queue < Node > . poll HashMap < Node , List < Integer > > . <init> Map < Node , List < Integer > > . get ArrayList < Integer > . <init> Map < Node , List < Integer > > . put List < Integer > . add Map < Node , List < Integer > > . get List < Integer > . size Node . <init> Node . <unk> Node . getChildren Set < String > . addAll Node . getChildren Set < String > . set Node . getChildren Queue < Node > . add |
get an array representation of the tree in <unk> first search order | ArrayDeque < Node > . <init> Queue < Node > . add Queue < Node > . remove Queue < Node > . isEmpty |
perform a breadth first search of the tile sequence problem | ArrayDeque < Node > . <init> State . <init> Node . <init> System . nanoTime ArrayDeque < Node > . add ArrayDeque < Node > . remove Node . <unk> State . <unk> Node . <unk> Node . getState Node . expand ArrayDeque < Node > . add System . nanoTime |
<unk> traversal of the trie | ArrayDeque < Node > . <init> StringBuffer . <init> Queue < Node > . add Queue < Node > . isEmpty Queue < Node > . poll Node . keys StringBuffer . append Queue < Node > . add StringBuffer . toString |
build binary expr term from re a , [ <unk> , b , <unk> , c , | ArrayDeque < Object > . <init> ArrayDeque . <init> ArrayDeque . push List < Pair < Object > > . remove ArrayDeque < Object > . push ArrayDeque . push List < Pair < Object > > . isEmpty ArrayDeque < Object > . peek List < Pair < Object > > . remove ArrayDeque < Object > . push ArrayDeque . push ArrayDeque . pop ArrayDeque < Object > . pop ArrayDeque . push ArrayDeque . pop ArrayDeque < Object > . pop ArrayDeque . pop |
parse a string representation of an expression into its arguments args and create the corresponding symbol expression representation | ArrayDeque < Object > . <init> Deque < Object > . add String . trim String . substring Deque < Object > . size String . length String . substring Deque < Object > . push String . substring String . length String . substring Deque < Object > . push Deque < Object > . size |
parse the given split configuration string and removes splits , file names , and remote file names bases on the settings for this parser | ArrayDeque < Object > . <init> StreamTokenizer . <init> StreamTokenizer . whitespaceChars StreamTokenizer . wordChars StreamTokenizer . commentChar StreamTokenizer . quoteChar StreamTokenizer . eolIsSignificant StreamTokenizer . nextToken Deque < Object > . pop Split . <init> Split . setLeft Split . setRight Split . setDirection Deque < Object > . pop Integer . cast Split . setOffset Deque < Object > . push Deque < Object > . pop Deque < Object > . push StreamTokenizer . nextToken StringBuilder . <init> StringBuilder . append Deque < Object > . pop StringBuilder . append StringBuilder . toString |
parse the given split configuration string and removes splits , file names , and remote file names bases on the settings for this parser | ArrayDeque < Object > . <init> StreamTokenizer . <init> StreamTokenizer . whitespaceChars StreamTokenizer . wordChars StreamTokenizer . commentChar StreamTokenizer . quoteChar StreamTokenizer . eolIsSignificant StreamTokenizer . nextToken Deque < Object > . pop Split . <init> Split . setLeft Split . setRight Split . setDirection Integer . cast Split . setOffset Deque < Object > . push Deque < Object > . pop Object . toString Deque < Object > . push StreamTokenizer . nextToken StringBuilder . <init> Deque < Object > . isEmpty Deque < Object > . pop StringBuilder . append Deque < Object > . pop StringBuilder . append StringBuilder . toString |
parse the given split configuration string and removes splits , file names , and remote file names bases on the settings for this parser | ArrayDeque < Object > . <init> StringReader . <init> StreamTokenizer . <init> StreamTokenizer . whitespaceChars StreamTokenizer . wordChars StreamTokenizer . commentChar StreamTokenizer . quoteChar StreamTokenizer . eolIsSignificant StreamTokenizer . nextToken Deque < Object > . pop Split . <init> Split . setLeft Split . setRight Split . setDirection Integer . cast Split . setOffset Deque < Object > . push Deque < Object > . pop Deque < Object > . push StreamTokenizer . nextToken StringBuilder . <init> StringBuilder . append Deque < Object > . pop StringBuilder . append Deque < Object > . pop StringBuilder . append |
return one message , if any is available | ArrayDeque < Object > . peek Message . instance Message . cast Queue < Message > . cast Queue < Message > . poll Queue < Message > . isEmpty ArrayDeque < Object > . offer ArrayDeque < Object > . poll Message . cast Queue < Message > . cast Queue < Message > . poll ArrayDeque < Object > . poll |
handle <unk> x instructions | ArrayDeque < Object > . removeFirst Object . getClass Field . get ArrayDeque < Object > . addFirst <unk> . <init> |
handle <unk> x instructions | ArrayDeque < Object > . removeFirst Object . getClass Field . set <unk> . <init> |
handle method invocation | ArrayDeque < Object > . removeFirst String . cast ArrayDeque < Object > . removeFirst StringBuffer . <init> Object . getClass StringBuffer . append StringBuffer . toString NoSuchMethodError . <init> Object . getClass NoSuchMethodError . <init> Method . invoke Method . getReturnType ArrayDeque < Object > . addFirst |
return and remove events in time slots earlier less then the timestamp passed in , returning the list of events expired | ArrayDeque < Pair < Long , ArrayDeque > > . getFirst Pair < Long , ArrayDeque > . getFirst ArrayDeque . <init> ArrayDeque . addAll ArrayDeque < Pair < Long , ArrayDeque > > . removeFirst ArrayDeque < Pair < Long , ArrayDeque > > . isEmpty ArrayDeque < Pair < Long , ArrayDeque > > . getFirst Pair < Long , ArrayDeque > . getFirst ArrayDeque < Pair < Long , ArrayDeque > > . isEmpty Pair < Long , ArrayDeque > . getFirst Map < ArrayDeque > . remove |
return and remove events in time slots earlier less then the timestamp passed in , returning the list of events expired | ArrayDeque < Pair < Long , ArrayDeque > > . getFirst Pair < Long , ArrayDeque > . getFirst ArrayDeque . <init> Pair < Long , ArrayDeque > . getSecond ArrayDeque . addAll ArrayDeque < Pair < Long , ArrayDeque > > . removeFirst ArrayDeque < Pair < Long , ArrayDeque > > . isEmpty ArrayDeque < Pair < Long , ArrayDeque > > . getFirst Pair < Long , ArrayDeque > . getFirst Map < ArrayDeque > . remove |
return and remove events in time slots earlier less then the timestamp passed in , returning the list of events expired | ArrayDeque < Pair < Long , ArrayDeque > > . isEmpty ArrayDeque < Pair < Long , ArrayDeque > > . getFirst ArrayDeque . <init> ArrayDeque . addAll ArrayDeque < Pair < Long , ArrayDeque > > . removeFirst ArrayDeque < Pair < Long , ArrayDeque > > . isEmpty ArrayDeque < Pair < Long , ArrayDeque > > . getFirst Pair < Long , ArrayDeque > . getFirst ArrayDeque < Pair < Long , ArrayDeque > > . isEmpty Pair < Long , ArrayDeque > . getFirst Map < ArrayDeque > . remove |
get the prefix sets | ArrayDeque < Pair < Node , HashSet > > . <init> ArrayDeque < Pair < Node , HashSet > > . addFirst LinkedList < Pair < HashSet , String > > . <init> ArrayDeque < Pair < Node , HashSet > > . pop HashMap < Integer , Character > . get HashSet . <init> Pair < Node , HashSet > . getSecond HashSet . addAll ArrayDeque < Pair < Node , HashSet > > . push Pair < Node , HashSet > . getSecond Node . getTags Pair < Node , HashSet > . getSecond String . <init> LinkedList < Pair < HashSet , String > > . push Pair < Node , HashSet > . getSecond |
get the prefix sets | ArrayDeque < Pair < Node , HashSet > > . <init> ArrayDeque < Pair < Node , HashSet > > . addFirst LinkedList < Pair < HashSet , String > > . <init> ArrayDeque < Pair < Node , HashSet > > . pop HashMap < Integer , Character > . get Pair < Node , HashSet > . getFirst HashSet . <init> Pair < Node , HashSet > . getSecond HashSet . addAll Node . getTags HashSet . addAll ArrayDeque < Pair < Node , HashSet > > . push Pair < Node , HashSet > . getFirst ArrayDeque < Pair < Node , HashSet > > . push Pair < Node , HashSet > . getFirst Pair < Node , HashSet > . getSecond Node . getTags String . <init> Pair < Node , HashSet > . getSecond LinkedList < Pair < HashSet , String > > . push |
traverse the tree according to directory filter and node process strategies | ArrayDeque < Path > . <init> Queue < Path > . add Queue < Path > . poll <unk> < Path > . iterator Iterator < Path > . next Queue < Path > . add <unk> < Path > . close |
place a piece on the board and return locations where we placed something in array deque | ArrayDeque < Point > . <init> ArrayDeque < Point > . add |
generate this maze | ArrayDeque < Point > . <init> Deque < Point > . push Random . <init> Deque < Point > . isEmpty Deque < Point > . peek Queue < Point > . poll Point . <init> Cell . <unk> Deque < Point > . push Cell . mark Deque < Point > . pop |
implement interface | ArrayDeque < Point2D > . <init> Deque < Point2D > . push Deque < Point2D > . pop Deque < Point2D > . peek Deque < Point2D > . pop Deque < Point2D > . peek Deque < Point2D > . push Deque < Point2D > . pop Deque < Point2D > . push |
setup create a production stack | ArrayDeque < Position > . <init> Node . getFirst Engine . parse Node . <unk> |
perform physics updates on queued blocks | ArrayDeque < Position > . <init> Queue < Position > . clear Level . getBlock Position . getX Position . getZ Position . getY Position . getX Map < Integer , ArrayDeque < Position > > . get Level . getBlock Position . getZ Position . getY Position . getX Position . getZ Position . getX System . currentTimeMillis Map < Integer , Long > . put |
perform physics updates on queued blocks | ArrayDeque < Position > . <init> Queue < Position > . clear Position . getX Position . getY Position . getZ Position . getX Level . getBlock Position . getZ Map < Integer , Long > . get Map < Integer , ArrayDeque < Position > > . get Position . getY Position . getX Position . getZ Map < Integer , Long > . put |
overloaded constructor for accepted peers from the server | ArrayDeque < Request > . <init> Socket . getInputStream Socket . getOutputStream System . currentTimeMillis Thread . <init> Thread . start |
this is a constructor for a peer taking the address and port as parameters | ArrayDeque < Request > . <init> System . currentTimeMillis Thread . <init> Thread . start |
cancel the invocation , causing all future responses to be closed without being read | ArrayDeque < Response > . isEmpty ArrayDeque < Response > . notifyAll |
get the next queued response , waiting if necessary | ArrayDeque < Response > . wait ArrayDeque < Response > . pollFirst |
create a thread that continuously <unk> thread local items from work queue at once and <unk> them sequentially | ArrayDeque < Runnable > . <init> WorkerThread . setDaemon WorkerThread . setName |
start the thread to get audio , the thread to make animations and the thread to write the audio on storage | ArrayDeque < Short > . clear Thread . <init> Thread . start Thread . <init> Thread . start |
find the solution for the initial state | ArrayDeque < State > . <init> Deque < State > . addFirst Deque < State > . removeFirst State . <unk> |
overriden to remove type bindings from statement list after scope traversal has added them to type bindings map | ArrayDeque < Statement > . <init> ArrayDeque < Statement > . pop Statement . <unk> Statement . dump List < Statement > . add Iterator < Statement > . hasNext Scope . getBody Iterator < Statement > . next Iterator < Statement > . remove |
create an iterator over the files listed in the provided file | ArrayDeque < String > . <init> ArrayBlockingQueue < Document > . <init> Queue < String > . offer AtomicInteger . <init> Thread . <init> Thread . setDaemon Thread . start |
create an iterator over the files listed in the provided file | ArrayDeque < String > . <init> ArrayBlockingQueue < Document > . <init> String . trim Queue < String > . offer AtomicInteger . <init> Thread . <init> Thread . setDaemon Thread . start |
convert infix notation to reverse <unk> notation | ArrayDeque < String > . <init> ArrayDeque < Character > . <init> String . toCharArray Deque < Character > . push Deque < Character > . pop Character . isLetter Deque < String > . push Deque < Character > . pop Deque < Character > . push Deque < Character > . pop Deque < String > . pop |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.