docstring stringlengths 3 2.38k | code stringlengths 9 99.4k |
|---|---|
remove num requests and store them in a csv format | ArrayDeque < String > . <init> ArrayDeque < String > . add BufferedWriter . <init> ArrayDeque < String > . poll BufferedWriter . write BufferedWriter . newLine BufferedWriter . flush |
create a queue from a sublist of a given array | ArrayDeque < String > . <init> Arrays . asList |
process command line arguments , set up file <unk> , and call required post processing method | ArrayDeque < String > . <init> Deque < String > . add Deque < String > . removeFirst String . equals Deque < String > . removeFirst String . contains FileReader . <init> BufferedReader . <init> File . getName String . length String . substring File . getAbsolutePath Deque < String > . removeFirst BufferedWriter . <init> Integer . parseInt Deque < String > . isEmpty String . equals BufferedReader . close BufferedWriter . close Deque < String > . size Deque < String > . removeFirst File . <init> FileWriter . <init> BufferedWriter . <init> BufferedWriter . close File . getAbsolutePath String . equals Deque < String > . removeFirst File . <init> FileWriter . <init> BufferedWriter . <init> BufferedWriter . close File . getAbsolutePath |
a client for the deque collection interface that has the element in the collection being of type string | ArrayDeque < String > . <init> Deque < String > . addFirst Deque < String > . addLast Deque < String > . getFirst Deque < String > . getLast Deque < String > . <unk> Deque < String > . <unk> Deque < String > . removeFirst Deque < String > . removeLast Deque < String > . push Deque < String > . pop Deque < String > . peek Deque < String > . iterator Iterator . hasNext Iterator . next |
take a given corpus and makes a count of the n grams that are present in the current count table | ArrayDeque < String > . <init> Deque < String > . clear Deque < String > . push Integer . intValue |
generate a path to this file , based on labels in the div tree | ArrayDeque < String > . <init> Deque < String > . push StringBuilder . <init> Deque < String > . poll StringBuilder . append StringBuilder . toString |
return a string containing the moves required to traverse the path from the solution node to the initial state | ArrayDeque < String > . <init> Deque < String > . push StringBuilder . <init> Deque < String > . pop StringBuilder . append StringBuilder . toString |
adjust an fs file to remove | ArrayDeque < String > . <init> Deque < String > . removeLast Deque < String > . addLast |
reverse the order of color deque | ArrayDeque < String > . <init> Deque < String > . size Deque < String > . peekFirst Deque < String > . removeFirst Deque < String > . addLast Deque < String > . addFirst Deque < String > . removeAll Deque < String > . addAll |
clean up old elements | ArrayDeque < String > . <init> HashMap < String > . entrySet Entry < String > . getKey Entry < String > . getValue HashMap < String > . keySet String . contains ArrayDeque < String > . add ArrayDeque < String > . isEmpty ArrayDeque < String > . removeFirst HashMap < String > . remove ArrayDeque < String > . removeFirst HashMap < String > . remove |
update the semantic vectors based on the words in the document | ArrayDeque < String > . <init> Iterator < String > . hasNext Iterator < String > . next Queue < String > . offer Queue < String > . isEmpty Queue < String > . remove Iterator < String > . hasNext Iterator < String > . next Queue < String > . offer Set < String > . contains Set < String > . isEmpty String . equals Queue < String > . size String . equals Map < String > . get Queue < String > . offer Queue < String > . size Queue < String > . remove BufferedReader . close |
update the semantic vectors based on the words in the document | ArrayDeque < String > . <init> Iterator < String > . hasNext Iterator < String > . next Queue < String > . offer Queue < String > . isEmpty Queue < String > . remove Iterator < String > . next Queue < String > . offer Set < String > . contains Set < String > . isEmpty String . equals Queue < String > . size String . equals Queue < String > . offer Queue < String > . size Queue < String > . remove BufferedReader . close |
note that this method is not thread safe | ArrayDeque < String > . <init> Iterator < String > . hasNext Iterator < String > . next Queue < String > . offer Queue < String > . remove Iterator < String > . hasNext Iterator < String > . next Queue < String > . offer String . equals Queue < String > . size Map < String > . get String . equals Map < String > . get Queue < String > . offer Map < String , Integer > . get Map < String , Integer > . put Queue < String > . size Queue < String > . remove BufferedReader . close |
update the semantic vectors based on the words in the document | ArrayDeque < String > . <init> Iterator < String > . hasNext Iterator < String > . next Queue < String > . offer Queue < String > . remove Iterator < String > . next Queue < String > . offer Set < String > . contains Set < String > . isEmpty String . equals Queue < String > . size String . equals Queue < String > . offer Queue < String > . remove BufferedReader . close |
update the semantic vectors based on the words in the document | ArrayDeque < String > . <init> Iterator < String > . hasNext Iterator < String > . next Queue < String > . offer Queue < String > . remove Iterator < String > . next Queue < String > . offer Set < String > . isEmpty Set < String > . contains String . equals Queue < String > . size Map < String > . get String . equals Map < String > . get Queue < String > . offer Queue < String > . size Queue < String > . remove BufferedReader . close |
update the semantic vectors based on the words in the document | ArrayDeque < String > . <init> Iterator < String > . hasNext Queue < String > . offer Queue < String > . isEmpty Queue < String > . remove Iterator < String > . next Queue < String > . offer Set < String > . contains Set < String > . isEmpty String . equals Queue < String > . size String . equals Map < String > . get String . equals Map < String > . get Queue < String > . offer Queue < String > . size Queue < String > . remove BufferedReader . close |
note that this method is not thread safe | ArrayDeque < String > . <init> Iterator < String > . hasNext Queue < String > . offer Queue < String > . remove Iterator < String > . hasNext Iterator < String > . next Queue < String > . offer Queue < String > . size String . equals Map < String > . get Queue < String > . offer Map < String , Integer > . get Map < String , Integer > . put Queue < String > . size Queue < String > . remove BufferedReader . close |
note that this method is <unk> i thread safe | ArrayDeque < String > . <init> Iterator < String > . next Queue < String > . offer Queue < String > . isEmpty Queue < String > . remove Iterator < String > . hasNext Iterator < String > . next Queue < String > . offer String . equals Queue < String > . size Map < String > . get String . equals Map < String > . get Queue < String > . offer Map < String , Integer > . get Map < String , Integer > . put Queue < String > . size Queue < String > . remove BufferedReader . close |
list all certificate aliases and key aliases saved on current key store | ArrayDeque < String > . <init> KeyStore . aliases Enumeration . hasMoreElements Enumeration . nextElement Object . toString ArrayDeque < String > . add ArrayDeque < String > . toArray |
list all certificate aliases saved on current key store | ArrayDeque < String > . <init> KeyStore . aliases Enumeration . hasMoreElements Enumeration . nextElement Object . toString KeyStore . isCertificateEntry ArrayDeque < String > . add ArrayDeque < String > . toArray |
list all key aliases saved on current key store | ArrayDeque < String > . <init> KeyStore . aliases Enumeration . nextElement Object . toString ArrayDeque < String > . add ArrayDeque < String > . toArray |
determine if a dimension matches a specific type | ArrayDeque < String > . <init> Map < String , Type > . get Queue < String > . addAll Queue < String > . poll |
utility method returns queue instance with stock values | ArrayDeque < String > . <init> Queue < String > . add |
update the semantic vectors based on the words in the document | ArrayDeque < String > . <init> Queue < String > . offer Queue < String > . remove Iterator < String > . hasNext Iterator < String > . next Queue < String > . offer Set < String > . isEmpty Set < String > . contains String . equals Queue < String > . size String . equals Queue < String > . offer Queue < String > . size Queue < String > . remove BufferedReader . close |
return null if something goes wrong | ArrayDeque < String > . <init> Scanner . <init> ClassLoader . getSystemResourceAsStream Scanner . hasNextLine ArrayDeque < String > . addLast Scanner . <init> ClassLoader . getSystemResourceAsStream ArrayDeque < String > . toArray Parser . <init> Checker . <init> |
walk the specified subtree dir tree to try to locate file | dir named filename | ArrayDeque < String > . <init> String . substring String . length String . endsWith String . length String . substring Deque < String > . addFirst Deque < String > . poll File . <init> File . listFiles File . getName File . isDirectory File . isFile File . getAbsolutePath File . getName Deque < String > . addFirst |
return all the valid words starting with prefix in the trie | ArrayDeque < String > . <init> String . toCharArray Trie . get Trie . collect |
walk the specified subtree dir tree to try to locate file | dir named filename | ArrayDeque < String > . <init> String . trim String . substring String . charAt String . substring String . endsWith String . substring Deque < String > . addFirst Deque < String > . poll File . <init> File . listFiles String . equals File . isDirectory File . isFile File . getAbsolutePath File . isDirectory File . getName Deque < String > . addFirst |
walk the specified subtree dir tree to try to locate file | dir named filename | ArrayDeque < String > . <init> String . trim String . substring String . length String . endsWith String . substring String . endsWith Deque < String > . addFirst Deque < String > . poll File . <init> File . listFiles File . getName File . isFile File . isDirectory Deque < String > . addFirst |
return all the valid words in the trie | ArrayDeque < String > . <init> StringBuffer . <init> Trie . collect |
convert an infix expression to postfix by using queues and stacks | ArrayDeque < String > . <init> StringTokenizer . hasMoreTokens ArrayDeque < String > . addLast ArrayDeque < String > . removeFirst String . equals ArrayDeque < String > . push Arrays . asList ArrayDeque < String > . peek ArrayDeque < String > . push ArrayDeque < String > . isEmpty ArrayDeque < String > . peek ArrayDeque < String > . pop ArrayDeque < String > . add ArrayDeque < String > . push ArrayDeque < String > . add Double . toString ArrayDeque < String > . add ArrayDeque < String > . isEmpty ArrayDeque < String > . peek ArrayDeque < String > . add ArrayDeque < String > . pop ArrayDeque < String > . add |
take the document and writes a set of tuples mapping a word tothe other words it co occurs with and the relative position of those co occurrences | ArrayDeque < String > . <init> Text . <init> Iterator < String > . next Queue < String > . offer HashMap < Integer > . <init> Queue < String > . isEmpty Queue < String > . remove Text . set Iterator < String > . hasNext Iterator < String > . next Queue < String > . offer Set < String > . isEmpty Set < String > . contains String . equals Queue < String > . size String . equals Context . write String . equals Context . write Queue < String > . offer Queue < String > . remove |
take the document and writes a set of tuples mapping a word tothe other words it co occurs with and the relative position of those co occurrences | ArrayDeque < String > . <init> Text . toString Text . <init> Iterator < String > . hasNext Queue < String > . offer HashMap < Integer > . <init> Queue < String > . remove Text . set Iterator < String > . hasNext Iterator < String > . next Queue < String > . offer Set < String > . isEmpty Set < String > . contains String . equals Queue < String > . size Context . write String . equals Context . write Queue < String > . offer Queue < String > . size Queue < String > . remove |
enqueue all of the elements of this <unk> , not using the cache | ArrayDeque < String > . <init> Trie . <unk> |
enqueue all of the elements of this trie | ArrayDeque < String > . <init> Trie . enqueue |
tell the server the user role that was determined for this user | ArrayDeque < String > . add Semaphore . release |
update the current activity and notify the server | ArrayDeque < String > . add Semaphore . release |
update the current room state and notify the server | ArrayDeque < String > . add Semaphore . release |
construct a list of all <unk> in the hierarchy leading up to <unk> | ArrayDeque < String > . addFirst List < String > . size Map < String > . get ArrayList < String > . <init> List < List < String > > . add ArrayDeque < String > . removeFirst |
return subpath of this path from and to given vertices | ArrayDeque < String > . getFirst ArrayDeque < String > . getLast ArrayDeque < String > . contains Path . <init> Path . <unk> ArrayDeque < String > . iterator Path . <init> Iterator < String > . hasNext ArrayDeque < String > . contains Iterator < String > . next String . equals |
get current path in folder hierarchy | ArrayDeque < String > . iterator StringBuilder . <init> Iterator < String > . next StringBuilder . toString |
pre sentence , token , and exp are defined , exp already contains a list of end nodes POST : sentence has been parsed as a passive voice expression and returned | ArrayDeque < String > . pop Parser . <unk> ArrayDeque < String > . isEmpty ArrayDeque < String > . pop ArrayList < String > . <init> Parser . <unk> |
pre sentence , token , and exp are defined , exp already contains a list of end nodes POST : sentence has been parsed as a passive voice expression and returned | ArrayDeque < String > . pop Parser . <unk> ArrayDeque < String > . pop Parser . <unk> ArrayDeque < String > . isEmpty ArrayDeque < String > . pop Parser . <unk> ArrayDeque < String > . pop ArrayList < String > . <init> Parser . <unk> |
shift the bits back by one and adds a new bit to the end | ArrayDeque < String > . removeFirst ArrayDeque < String > . addLast |
get current path in folder hierarchy | ArrayDeque < String > . size ArrayDeque < String > . iterator Iterator < String > . next StringBuilder . <init> StringBuilder . append Iterator < String > . next StringBuilder . toString |
get current path in folder hierarchy | ArrayDeque < String > . size ArrayDeque < String > . iterator StringBuilder . <init> Iterator < String > . hasNext Iterator < String > . next StringBuilder . append StringBuilder . toString |
get current path in folder hierarchy | ArrayDeque < String > . size ArrayDeque < String > . iterator StringBuilder . <init> Iterator < String > . hasNext Iterator < String > . next StringBuilder . toString |
get current path in folder hierarchy | ArrayDeque < String > . size ArrayDeque < String > . iterator StringBuilder . <init> Iterator < String > . next StringBuilder . toString |
get current path in folder hierarchy | ArrayDeque < String > . size ArrayDeque < String > . iterator StringBuilder . <init> StringBuilder . append Iterator < String > . next StringBuilder . toString |
get private data member colors | ArrayDeque < String > . size ArrayDeque < String > . toArray |
convert a valid and well formed list of symbol objects into aan ast | ArrayDeque < Symbol > . <init> ArrayDeque . <init> Parser . <unk> Deque < Symbol > . push Deque < Symbol > . isEmpty Deque < Symbol > . pop Parser . <unk> Deque . add Expression . cast Deque < Symbol > . push Parser . <unk> Deque . pop |
convert a valid and well formed list of symbol objects into aan ast | ArrayDeque < Symbol > . <init> ArrayDeque . <init> Parser . <unk> Deque < Symbol > . push Deque < Symbol > . isEmpty Deque < Symbol > . pop Parser . <unk> MessageFormat . format Deque . add Deque < Symbol > . push Deque < Symbol > . isEmpty Parser . <unk> Deque . pop |
convert a valid and well formed list of symbol objects into a queue in postfix notation | ArrayDeque < Symbol > . <init> LinkedList . <init> Parser . <unk> Deque < Symbol > . isEmpty Deque < Symbol > . peek Deque < Symbol > . pop Queue . add Deque < Symbol > . push Deque < Symbol > . isEmpty Deque < Symbol > . peek Queue . add MessageFormat . format Deque < Symbol > . pop Queue . add Deque < Symbol > . isEmpty Deque < Symbol > . peek Deque < Symbol > . pop Queue . add |
convert a valid and well formed list of symbol objects into a queue in postfix notation | ArrayDeque < Symbol > . <init> LinkedList . <init> Parser . <unk> Deque < Symbol > . peek Deque < Symbol > . pop Queue . add Deque < Symbol > . push Deque < Symbol > . isEmpty Deque < Symbol > . peek Queue . add Deque < Symbol > . pop Queue . add Deque < Symbol > . isEmpty Deque < Symbol > . peek Queue . add Deque < Symbol > . pop |
execute the queue of pending tasks | ArrayDeque < Task > . poll Task . execute |
return the next lookahead th token , or null <unk> is none | ArrayDeque < Token > . <init> ArrayDeque < Token > . push ArrayDeque < Token > . peek ArrayDeque < Token > . isEmpty ArrayDeque < Token > . pop |
return the next lookahead th token , or null <unk> is none | ArrayDeque < Token > . <init> ArrayDeque < Token > . push ArrayDeque < Token > . peek ArrayDeque < Token > . pop |
find a common ancestor of two tokens in the syntactic tree | ArrayDeque < Token > . <init> Deque < Token > . add Deque < Token > . addAll Deque < Token > . add Deque < Token > . addAll Deque < Token > . getLast Deque < Token > . peekLast Deque < Token > . removeLast |
get the siblings children of parent of some token , including that token | ArrayDeque < Token > . <init> Deque < Token > . add Deque < Token > . addAll |
get the siblings that appear after some token , inclusive | ArrayDeque < Token > . <init> Deque < Token > . add |
get the siblings that appear before some token , inclusive | ArrayDeque < Token > . <init> Deque < Token > . add |
return the shortest path along the syntactic tree from token a to b | ArrayDeque < Token > . <init> Deque < Token > . addAll Deque < Token > . removeLast Deque < Token > . isEmpty Deque < Token > . removeLast Deque < Token > . add |
change 9 \ 8 7 \ \ 6 one two 5 to 9 8 7 6 one two 5 | ArrayDeque < TreeNode < Integer > > . <init> Queue < TreeNode < Integer > > . add Queue < TreeNode < Integer > > . poll TreeNode < Integer > . getRight TreeNode < Integer > . setLeft TreeNode < Integer > . setRight Queue < TreeNode < Integer > > . peek TreeNode < Integer > . setLeft TreeNode < Integer > . setRight Queue < TreeNode < Integer > > . peek |
call from subclasses in order to define streams and the sources they are fed by e | ArrayDeque < Triple > . <init> Map < String , Queue < Triple > > . put String . split |
build the search starting from the given vertex | ArrayDeque < Vertex > . <init> Deque < Vertex > . addLast Deque < Vertex > . removeFirst Deque < Vertex > . addLast |
check that coordinate is valid , if not , returns the closest valid coordinate | ArrayDeque < Vertex > . pop Vertex . getY Vertex . getX ArrayDeque < Vertex > . pop Vertex . setClosed Vertex . <unk> Vertex . <unk> Vertex . <unk> Vertex . <unk> |
offer this shift to workers in the order specified by workers q handling conflicts within availability by <unk> | ArrayDeque < Worker > . <init> ArrayDeque < Worker > . isEmpty ArrayDeque < Worker > . removeFirst Worker . <unk> Worker . <unk> ArrayDeque < Worker > . <init> ArrayDeque < Worker > . removeLast Worker . <unk> |
return the worker with the lowest <unk> | ArrayDeque < Worker > . <init> ArrayDeque < Worker > . pop ArrayDeque < Worker > . isEmpty ArrayDeque < Worker > . peek ArrayDeque < Worker > . pop |
return an easily readable string of this queues contents | ArrayDeque < Worker > . <init> ArrayDeque < Worker > . size ArrayDeque < Worker > . pop |
assign week is responsible for calling assign shift on all days of the given week | ArrayDeque < Worker > . <init> ArrayList . size ArrayDeque < Worker > . remove ArrayDeque < Worker > . addLast |
construct an size length vector with preset values | ArrayFieldVector . <init> Arrays . fill |
find the orthogonal projection of this vector onto another vector | ArrayFieldVector . <unk> ArrayFieldVector . cast ArrayFieldVector . dotProduct ArrayFieldVector . cast ArrayFieldVector . dotProduct |
find the orthogonal projection of this vector onto another vector | ArrayFieldVector . <unk> ArrayFieldVector . cast ArrayFieldVector . dotProduct ArrayFieldVector . cast |
find the orthogonal projection of this vector onto another vector | ArrayFieldVector . <unk> ArrayFieldVector . dotProduct ArrayFieldVector . <unk> ArrayFieldVector . dotProduct ArrayFieldVector . cast |
find the orthogonal projection of this vector onto another vector | ArrayFieldVector . <unk> ArrayFieldVector . dotProduct ArrayFieldVector . cast ArrayFieldVector . dotProduct |
find the orthogonal projection of this vector onto another vector | ArrayFieldVector . <unk> ArrayFieldVector . dotProduct ArrayFieldVector . cast |
visit but does not alter some entries of this vector in default order increasing index | ArrayFieldVector . <unk> ArrayFieldVector . getDimension <unk> . start <unk> . visit <unk> . end |
visit but does not alter some entries of this vector in default order increasing index | ArrayFieldVector . <unk> ArrayFieldVector . getDimension <unk> . start ArrayFieldVector . getEntry <unk> . visit <unk> . end |
visit and possibly alters some entries of this vector in default order increasing index | ArrayFieldVector . <unk> ArrayFieldVector . getDimension <unk> . start ArrayFieldVector . getEntry ArrayFieldVector . setEntry <unk> . end |
visit and possibly alters some entries of this vector in default order increasing index | ArrayFieldVector . <unk> ArrayFieldVector . getDimension <unk> . start ArrayFieldVector . setEntry ArrayFieldVector . getEntry ArrayFieldVector . setEntry <unk> . end |
construct a size length vector of zeros | ArrayFieldVector . buildArray Arrays . fill |
construct a vector of zeroes | ArrayFieldVector . buildArray Field . getZero Arrays . fill |
find the orthogonal projection of this vector onto another vector | ArrayFieldVector . cast ArrayFieldVector . dotProduct |
construct a vector by appending one vector to another vector | ArrayFieldVector . cast FieldVector . toArray ArrayFieldVector . instance ArrayFieldVector . cast FieldVector . toArray System . arraycopy |
construct a vector by appending one vector to another vector | ArrayFieldVector . cast FieldVector . toArray System . arraycopy |
find the orthogonal projection of this vector onto another vector | ArrayFieldVector . dotProduct ArrayFieldVector . <unk> ArrayFieldVector . cast ArrayFieldVector . dotProduct |
find the orthogonal projection of this vector onto another vector | ArrayFieldVector . dotProduct ArrayFieldVector . <unk> ArrayFieldVector . dotProduct ArrayFieldVector . cast |
find the orthogonal projection of this vector onto another vector | ArrayFieldVector . dotProduct ArrayFieldVector . dotProduct ArrayFieldVector . <unk> ArrayFieldVector . cast |
visit but does not alter all entries of this vector in default order increasing index | ArrayFieldVector . getDimension <unk> . start <unk> . visit <unk> . end |
visit and possibly alters all entries of this vector in default order increasing index | ArrayFieldVector . getDimension <unk> . start <unk> . visit ArrayFieldVector . setEntry <unk> . end |
visit but does not alter all entries of this vector in default order increasing index | ArrayFieldVector . getDimension <unk> . start ArrayFieldVector . getEntry <unk> . visit <unk> . end |
visit and possibly alters all entries of this vector in default order increasing index | ArrayFieldVector . getDimension <unk> . start ArrayFieldVector . getEntry ArrayFieldVector . setEntry <unk> . end |
construct a vector by appending one vector to another vector | ArrayFieldVector . instance FieldVector . toArray ArrayFieldVector . cast System . arraycopy |
return a new linear program with a new objective function made of the given coefficients | ArrayFieldVector < BigFraction > . <init> ArrayFieldVector < BigFraction > . <unk> |
transition from phase one to phase two of the simplex method by <unk> an updated objective function based on the original objective function according to the <unk> dictionary | ArrayFieldVector < BigFraction > . <init> FieldVector < BigFraction > . getDimension <unk> < BigFraction > . <init> <unk> < BigFraction > . <unk> FieldVector < BigFraction > . getEntry FieldMatrix < BigFraction > . getEntry FieldVector < BigFraction > . setEntry FieldVector < BigFraction > . getEntry FieldVector < BigFraction > . setEntry |
transition from phase one to phase two of the simplex method by <unk> an updated objective function based on the original objective function according to the <unk> dictionary | ArrayFieldVector < BigFraction > . <init> FieldVector < BigFraction > . getDimension <unk> < BigFraction > . <init> FieldVector < BigFraction > . getEntry FieldMatrix < BigFraction > . getEntry FieldVector < BigFraction > . getEntry FieldVector < BigFraction > . setEntry FieldVector < BigFraction > . getEntry FieldVector < BigFraction > . setEntry |
return a new linear program with a new objective function making the program <unk> feasible | ArrayFieldVector < BigFraction > . <init> FieldVector < BigFraction > . getDimension |
shortcut for building a vector out of all real components | ArrayFieldVector < Complex > . <init> FieldVector < Complex > . setEntry |
return a trace see match <unk> from $ root to the match matching the last specification see below from $ <unk> | ArrayIterator . <init> ArrayIterator . hasNext Collections . emptyList ArrayIterator . <unk> ArrayIterator . <unk> ArrayIterator . current ArrayIterator . <unk> ArrayIterator . <unk> |
to support iterative objects used in a foreach loop | ArrayIterator . <init> Collection . cast Collection . iterator Map . cast Iterator . instance Iterator . cast Enumeration . cast EnumerationIterator . <init> Object . getClass Class . getMethod Method . getReturnType Method . invoke Iterator . cast |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.