docstring
stringlengths
3
2.38k
code
stringlengths
9
99.4k
load all the default modules from directory defaults
ArrayList . <init> ArrayList . add Class . cast
use reflection to get a list of all the submitted <unk> in the <unk> folder
ArrayList . <init> ArrayList . add Class . forName ArrayList . add ArrayList . <init> ArrayList . add
return the cached injector instance for this application , or create a new one if necessary
ArrayList . <init> ArrayList . add Class . forName ArrayList . add Class . getDeclaredConstructor ArrayList . add ArrayList . size WeakHashMap . put
return the cached injector instance for this application , or create a new one if necessary
ArrayList . <init> ArrayList . add Class . forName ArrayList . add Class . getDeclaredConstructor ArrayList . add ArrayList . toArray WeakHashMap . put
return the cached injector instance for this application , or create a new one if necessary
ArrayList . <init> ArrayList . add Class . forName ArrayList . add Class . getDeclaredConstructor Class . newInstance ArrayList . add ArrayList . size ArrayList . toArray WeakHashMap . put
return the cached injector instance for this application , or create a new one if necessary
ArrayList . <init> ArrayList . add Class . forName Class . getDeclaredConstructor ArrayList . add Class . newInstance ArrayList . add ArrayList . size WeakHashMap . put
return the first instance of the annotation , on the class or any superclass , or interfaces implemented
ArrayList . <init> ArrayList . add Class . getAnnotation ArrayList . add Class . getSuperclass ArrayList . add Class . getAnnotation ArrayList . add Class . getSuperclass Class . getInterfaces Class . isAnnotationPresent Class . getAnnotation ArrayList . add
return the first instance of the annotation , on the class or any superclass , or interfaces implemented
ArrayList . <init> ArrayList . add Class . getAnnotation ArrayList . add Class . getSuperclass Class . isAnnotationPresent ArrayList . add Class . getAnnotation ArrayList . add Class . getInterfaces Class . isAnnotationPresent ArrayList . add Class . getSuperclass Class . isAnnotationPresent ArrayList . add Class . getAnnotation ArrayList . add
return the first instance of the annotation , on the class or any superclass , or interfaces implemented
ArrayList . <init> ArrayList . add Class . getAnnotation ArrayList . add Class . getSuperclass Class . isAnnotationPresent Class . getAnnotation ArrayList . add Class . getInterfaces Class . isAnnotationPresent ArrayList . add Class . getSuperclass Class . getInterfaces ArrayList . add
if the given form bean can accept multiple form file objects but the user only uploaded a single , then the property will not match the form bean type
ArrayList . <init> ArrayList . add Class . getComponentType
return a list of the found annotations <unk>
ArrayList . <init> ArrayList . add Class . getSuperclass ArrayList . add Class . getAnnotation ArrayList . add Class . isAnnotationPresent Class . getAnnotation ArrayList . add Class . getSuperclass Class . isAnnotationPresent ArrayList . add
return the first instance of the annotation , on the class or any superclass , or interfaces implemented
ArrayList . <init> ArrayList . add Class . getSuperclass Class . getAnnotation ArrayList . add Class . isAnnotationPresent Class . getAnnotation ArrayList . add Class . getSuperclass ArrayList . add Class . getAnnotation ArrayList . add
return a list of the found annotations <unk>
ArrayList . <init> ArrayList . add Class . getSuperclass Class . isAnnotationPresent Class . getAnnotation ArrayList . add Class . getInterfaces ArrayList . add Class . getSuperclass Class . getInterfaces ArrayList . add
retrieve the mappings that are <unk> to a given class
ArrayList . <init> ArrayList . add Class . getSuperclass String [] . cast ArrayList . size String . lastIndexOf String . substring ArrayList . <init> ArrayList . add ArrayList . size ArrayList . toArray Arrays . sort
retrieve all attributes for the given class
ArrayList . <init> ArrayList . add Class . getSuperclass String [] . cast ArrayList . size String [] . cast String . lastIndexOf String . substring ArrayList . <init> ArrayList . add ArrayList . size ArrayList . toArray Arrays . sort ArrayList . size Arrays . sort System . arraycopy
return the class search order starting with extensible class code
ArrayList . <init> ArrayList . add Class . getSuperclass
return the cached injector instance for this application , or create a new one if necessary
ArrayList . <init> ArrayList . add Class . newInstance ArrayList . add ArrayList . size WeakHashMap . put
return class representing expected result if non null , that means that an exception must be thrown of returned type
ArrayList . <init> ArrayList . add Class [] . cast ArrayList . size Class [] . cast ArrayList . toArray Class [] . cast
attempt to convert the array of objects strings actually to <unk> types
ArrayList . <init> ArrayList . add Class [] . cast ArrayList . size Class [] . cast
not <unk>
ArrayList . <init> ArrayList . add ClassFactory . <unk>
not <unk>
ArrayList . <init> ArrayList . add ClassFactory . getInstance ClassFactory . <unk>
return a list of optional packages formerly standard extensions that have been declared to be available in the repositories associated with this class loader , plus any parent class loader implemented with the same class
ArrayList . <init> ArrayList . add ClassLoader . getParent ArrayList . add ArrayList . size Extension [] . cast
return a list of optional packages formerly standard extensions that have been declared to be required in the repositories associated with this class loader , plus any parent class loader implemented with the same class
ArrayList . <init> ArrayList . add ClassLoader . getParent ArrayList . add ArrayList . size Extension [] . cast
get all of the url class loaders from cl on up the hierarchy
ArrayList . <init> ArrayList . add ClassLoader . getParent ArrayList . size ArrayList . toArray
fail messages that have been tried more then the configured amount of times
ArrayList . <init> ArrayList . add Collection . removeAll
return the remaining tokens in an array of strings
ArrayList . <init> ArrayList . add Collections . <unk>
this method displays the calculations of dijkstras algorithm , by returning the shortest path to a village desired by the user
ArrayList . <init> ArrayList . add Collections . reverse ArrayList . <init> ArrayList . size ArrayList . add ArrayList . get
make a path of transport <unk> to take from the origin to the destination after the use of <unk> to find the path
ArrayList . <init> ArrayList . add Collections . reverse ArrayList . remove
process the blog entries
ArrayList . <init> ArrayList . add Collections . reverse ArrayList . size Entry [] . cast
process the blog entries
ArrayList . <init> ArrayList . add Collections . reverse Entry [] . cast ArrayList . size Entry [] . cast
build a list of move <unk> start to arrival , from the chain of <unk>
ArrayList . <init> ArrayList . add Collections . reverse
create <unk> <unk> for the wait list queue
ArrayList . <init> ArrayList . add Collections . reverse
get the shortest path to a target city returns a list of the cities visited in the shortest path
ArrayList . <init> ArrayList . add Collections . reverse
gibt eine liste an <unk> <unk> ein <unk> aus
ArrayList . <init> ArrayList . add Collections . reverse
return a list of all app <unk> results from all builds previous to the build that this result is tied to
ArrayList . <init> ArrayList . add Collections . reverse
predict items for a given user
ArrayList . <init> ArrayList . add Collections . reverseOrder Collections . sort ArrayList < Integer > . <init> ArrayList . get List < Integer > . add
visual manager <unk> the various <unk> and orders them from easy to hard
ArrayList . <init> ArrayList . add Collections . shuffle ArrayList . addAll ArrayList . size ArrayList . toArray
create a random line up
ArrayList . <init> ArrayList . add Collections . shuffle ArrayList . get
query the ntp servers , returning the current time from first one we find
ArrayList . <init> ArrayList . add Collections . shuffle ArrayList . get
shuffle an array list containing the directions and returns the first value
ArrayList . <init> ArrayList . add Collections . shuffle ArrayList . get
query the ntp servers , returning the current time from first one we find
ArrayList . <init> ArrayList . add Collections . shuffle ArrayList . size ArrayList . get String . cast
query the ntp servers , returning the current time from first one we find hack to return time and stratum
ArrayList . <init> ArrayList . add Collections . shuffle ArrayList . size ArrayList . get
query the ntp servers , returning the current time from first one we find
ArrayList . <init> ArrayList . add Collections . shuffle ArrayList . size ArrayList . get
return an initial assignment
ArrayList . <init> ArrayList . add Collections . shuffle ArrayList . size ArrayList . get
randomly generates a possible solution for a game
ArrayList . <init> ArrayList . add Collections . shuffle ArrayList . size ArrayList . remove
detection based closure scheme
ArrayList . <init> ArrayList . add Collections . shuffle ArrayList < Integer > . <init> ArrayList < Integer > . add Collections . shuffle ArrayList < Integer > . get ArrayList . get
query the ntp servers , returning the current time from first one we find
ArrayList . <init> ArrayList . add Collections . shuffle String . cast
return a sorted bag based on the comparator
ArrayList . <init> ArrayList . add Collections . sort <unk> . <init>
only list stops once if they share the same location
ArrayList . <init> ArrayList . add Collections . sort ArrayList . <init> ArrayList . add ArrayList . toArray
check <unk> a is a <unk> of b or not
ArrayList . <init> ArrayList . add Collections . sort ArrayList . <init> ArrayList . add Collections . sort ArrayList . size ArrayList . get ArrayList . size
give a pair and a list of <unk> , returns the list of <unk> sorted by quality index
ArrayList . <init> ArrayList . add Collections . sort ArrayList . <init> ArrayList . add
give a team and a list of teams , returns the list of teams sorted by quality index
ArrayList . <init> ArrayList . add Collections . sort ArrayList . <init> ArrayList . add
create a symbol table by loading the <unk> sym array from the given <unk> file
ArrayList . <init> ArrayList . add Collections . sort ArrayList . <init> ArrayList . get ArrayList . add ArrayList . size ArrayList . toArray
create a symbol table by loading the <unk> sym array from the given <unk> file
ArrayList . <init> ArrayList . add Collections . sort ArrayList . <init> ArrayList . get ArrayList . remove ArrayList . add ArrayList . size ArrayList . toArray
get distinct column names
ArrayList . <init> ArrayList . add Collections . sort ArrayList . <init> ArrayList . get Collections . binarySearch ArrayList . get ArrayList . add Collections . sort ArrayList . size ArrayList . toArray
get distinct column names
ArrayList . <init> ArrayList . add Collections . sort ArrayList . <init> ArrayList . size ArrayList . get Collections . binarySearch ArrayList . add Collections . sort ArrayList . size ArrayList . toArray
call the generate normal people method
ArrayList . <init> ArrayList . add Collections . sort ArrayList . add ArrayList . clear ArrayList < ArrayList > . clear
separate given array into two arrays with one containing comments with pictures , and the other without
ArrayList . <init> ArrayList . add Collections . sort ArrayList . clear ArrayList . addAll
<unk> of a <unk> simplex <unk> that finds the log normal parameters mu and sigma that <unk> the error between measured expectation and <unk> and the resulting expectation and <unk>
ArrayList . <init> ArrayList . add Collections . sort ArrayList . get ArrayList . remove ArrayList . add ArrayList . remove ArrayList . add ArrayList . remove ArrayList . add ArrayList . get Collections . sort ArrayList . get
<unk> is used to return the rank of the <unk> part of the hand
ArrayList . <init> ArrayList . add Collections . sort ArrayList . get Card . cast ArrayList . get Card . cast
recursively finds the k nearest boxes among this nodes children
ArrayList . <init> ArrayList . add Collections . sort ArrayList . get Node . <unk> Node . cast
assert that a given collection of names is already sorted correctly
ArrayList . <init> ArrayList . add Collections . sort ArrayList . get
call during expanding of <unk> where we see that we use too much memory and need to release some windows
ArrayList . <init> ArrayList . add Collections . sort ArrayList . get
order the card data by the given field number
ArrayList . <init> ArrayList . add Collections . sort ArrayList . get
return a peak class object matched to the given <unk> <unk> value
ArrayList . <init> ArrayList . add Collections . sort ArrayList . get
we store an array of <unk> amounts corresponding to the <unk> levels
ArrayList . <init> ArrayList . add Collections . sort ArrayList . indexOf
find the row that contains the <unk> value
ArrayList . <init> ArrayList . add Collections . sort ArrayList . isEmpty ArrayList . get
return the set of property names for which at least one message has been recorded
ArrayList . <init> ArrayList . add Collections . sort ArrayList . iterator Iterator . hasNext ArrayList . add ArrayList . iterator
return the set of all recorded messages , without <unk> by which property the messages are associated with
ArrayList . <init> ArrayList . add Collections . sort ArrayList . iterator Iterator . next List . iterator Iterator . hasNext ArrayList . add ArrayList . iterator
list string keys of messages in repository
ArrayList . <init> ArrayList . add Collections . sort ArrayList . iterator
<unk> of a <unk> simplex <unk> that finds the log normal parameters mu and sigma that <unk> the error between measured expectation and <unk> and the resulting expectation and <unk>
ArrayList . <init> ArrayList . add Collections . sort ArrayList . remove ArrayList . add ArrayList . remove ArrayList . add ArrayList . remove ArrayList . add ArrayList . get Collections . sort ArrayList . get
construct the huffman coding tree
ArrayList . <init> ArrayList . add Collections . sort ArrayList . remove ArrayList . add ArrayList . remove
build a tree from a frequency table
ArrayList . <init> ArrayList . add Collections . sort ArrayList . remove Node . cast ArrayList . remove Node . cast Arrays . sort Node . <init> ArrayList . add Collections . sort Node . cast
this method sorts tiles in order and returns move count to zero
ArrayList . <init> ArrayList . add Collections . sort ArrayList . remove
assert that a given collection of names is already sorted correctly
ArrayList . <init> ArrayList . add Collections . sort ArrayList . size ArrayList . get
call during expanding of <unk> where we see that we use too much memory and need to release some windows
ArrayList . <init> ArrayList . add Collections . sort ArrayList . size ArrayList . get
find threshold value for a <unk> section and set <unk> threshold variable
ArrayList . <init> ArrayList . add Collections . sort ArrayList . size ArrayList . get
get the <unk> with the highest preference
ArrayList . <init> ArrayList . add Collections . sort ArrayList . size ArrayList . get
this method
ArrayList . <init> ArrayList . add Collections . sort ArrayList . size ArrayList . get
construct the huffman coding tree
ArrayList . <init> ArrayList . add Collections . sort ArrayList . size ArrayList . remove ArrayList . add Collections . sort ArrayList . remove
this method sorts tiles in order and returns move count to zero
ArrayList . <init> ArrayList . add Collections . sort ArrayList . size ArrayList . remove
i created to order the tasks in the scheduled task according to the invariant
ArrayList . <init> ArrayList . add Collections . sort ArrayList . size ArrayList . toArray
obtain the list of delivers of a certain user for a certain activity
ArrayList . <init> ArrayList . add Collections . sort ArrayList . size ArrayList . toArray
predict items for a given user
ArrayList . <init> ArrayList . add Collections . sort ArrayList . size ArrayList < Integer > . <init> ArrayList . size List < Integer > . add
build a tree from a frequency table
ArrayList . <init> ArrayList . add Collections . sort ArrayList . size Node . cast ArrayList . remove Node . cast Arrays . sort Node . <init> ArrayList . add Collections . sort ArrayList . get Node . cast
get the <unk> with the highest preference
ArrayList . <init> ArrayList . add Collections . sort ArrayList . size
convert the list of methods to a sorted array of proxy methods
ArrayList . <init> ArrayList . add Collections . sort ArrayList . toArray
return all actions in the specified container
ArrayList . <init> ArrayList . add Collections . sort ArrayList . toArray
drop all goals x from the goal base for which x = = goal
ArrayList . <init> ArrayList . add Collections . sort ArrayList . toString ArrayList . <init> Query . clone ArrayList . add Collections . sort ArrayList . add ArrayList . remove
find the top x largest countries by square <unk> , where x is the limit parameter
ArrayList . <init> ArrayList . add Collections . sort ArrayList < String > . <init> ArrayList . get ArrayList < String > . add
find the top x countries that have the highest <unk> consumption per <unk> , where x is the limit parameter
ArrayList . <init> ArrayList . add Collections . sort ArrayList < String > . <init> ArrayList < String > . add ArrayList . get ArrayList < String > . add
take in the json array and returns a sorted array list
ArrayList . <init> ArrayList . add Collections . sort ArrayList < String > . <init> ArrayList < String > . add
<unk> is used to return the rank of the <unk> part of the hand
ArrayList . <init> ArrayList . add Collections . sort Card . cast ArrayList . get Card . cast ArrayList . get Card . cast
be straight is used to determine if the hand is or can be a straight
ArrayList . <init> ArrayList . add Collections . sort Card . cast Card . getRank ArrayList . get Card . getRank ArrayList . get Card . cast Card . getRank Math . min ArrayList . get Math . min
be straight is used to determine if the hand is or can be a straight
ArrayList . <init> ArrayList . add Collections . sort Card . getRank ArrayList . get Card . getRank ArrayList . get Card . cast Card . getRank ArrayList . get Card . getRank ArrayList . get Card . cast
be straight is used to determine if the hand is or can be a straight
ArrayList . <init> ArrayList . add Collections . sort Card . getRank ArrayList . get Card . getRank ArrayList . get Card . getRank ArrayList . get Card . cast Math . min
be straight is used to determine if the hand is or can be a straight
ArrayList . <init> ArrayList . add Collections . sort Card . getRank ArrayList . get Card . getRank Card . cast Card . getRank ArrayList . get Card . getRank ArrayList . get Card . cast Math . min
return a list of sorted and filtered derby releases
ArrayList . <init> ArrayList . add Collections . sort Collections . reverse ArrayList . size ArrayList . toArray
return the original array with all the elements sorted incrementally
ArrayList . <init> ArrayList . add Collections . sort Comparator . <init> Integer . cast Integer . intValue Integer . cast Integer . intValue ArrayList . size ArrayList . get Integer . intValue
return the original array with all the elements sorted incrementally
ArrayList . <init> ArrayList . add Collections . sort Comparator . <init> Integer . cast Integer . intValue Integer . cast Integer . intValue ArrayList . size Integer . intValue ArrayList . get