docstring stringlengths 3 2.38k | code stringlengths 9 99.4k |
|---|---|
create a <unk> client connected to the hive <unk> | ArrayList . <init> Collections . shuffle List . size |
sample n elements randomly without replacement | ArrayList . <init> Collections . shuffle List . subList ArrayList . <init> |
caller responsibility to remove <unk> from the list | ArrayList . <init> Collections . shuffle List . subList |
base on the passed in working set , creates n shuffled variants | ArrayList . <init> Collections . shuffle List < List > . add |
shuffle around the items in the input sequence | ArrayList . <init> Collections . shuffle List < Object > . toArray |
obtain up to quantity related <unk> to show random related <unk> <unk> <unk> by the given user | ArrayList . <init> Collections . shuffle Math . min HashSet . <init> Set . add |
if we dont want the ordered list , clone the list of questions , then shuffle and return the clone | ArrayList . <init> Collections . shuffle |
load list of <unk> use data from database prepare lists for sequential and random view | ArrayList . <init> Collections . shuffle |
randomly chooses any incorrect answer from possible ones | ArrayList . <init> Collections . shuffle |
return the given set of students in a random order | ArrayList . <init> Collections . shuffle |
use the card storage to shuffle a new <unk> card deck of playing cards | ArrayList . <init> Collections . shuffle |
<unk> should not group sstables for <unk> this can mix new and old data | ArrayList . <init> Collections . singleton Collection < Collection > . add |
get rules implied by wiki owners , document <unk> , and global rights documents | ArrayList . <init> Collections . singleton List . add EntityReference . getName List . add Collections . singleton List . add |
get rules implied by wiki owners , document <unk> , and global rights documents | ArrayList . <init> Collections . singleton List . add String . equals Collections . singleton List . add |
make a list of trees by storing their root , loops over all commands tokenized by the parse method , and calls <unk> , putting the root in an array of roots | ArrayList . <init> Collections . singleton List < String > . removeAll List < String > . size Parser . getClass List < String > . remove Parser . <unk> Parser . <unk> List < String > . remove List . add |
make a list of trees by storing their root , loops over all commands tokenized by the parse method , and calls <unk> , putting the root in an array of roots | ArrayList . <init> Collections . singleton List < String > . removeAll Parser . getClass List < String > . remove Parser . <unk> Parser . <unk> List < String > . remove List . add |
return all the available <unk> for the specified <unk> id | ArrayList . <init> Collections . singletonList ArrayList . <init> ResultSet . getInt ResultSet . getDate ResultSet . getInt ResultSet . getFloat ResultSet . getInt ArrayList . add |
return a list of results <unk> rows for passed lab entry | ArrayList . <init> Collections . singletonList ArrayList . add ResultSet . getInt ResultSet . getString |
find all the music impl styles by lang impl | ArrayList . <init> Collections . singletonList List . addAll |
get all content elements that are available to the given content element to reference to | ArrayList . <init> Collections . singletonList List . size List . get Object . cast Class . isInstance List . add Collections . sort |
return an array of i virtual reference for all ofthe utility modules contributed by classpath dependencies | ArrayList . <init> Collections . singletonList List < String > . contains List . add List . size List . toArray |
return an array of i virtual reference for all ofthe utility modules contributed by classpath dependencies | ArrayList . <init> Collections . singletonList List < String > . contains List . add List . toArray |
return the version of the running hub | ArrayList . <init> Collections . singletonList Map . get String . cast Float . parseFloat |
return all the available <unk> for the specified <unk> id | ArrayList . <init> Collections . singletonList ResultSet . <unk> ArrayList . <init> ResultSet . getInt ResultSet . getDate ResultSet . getInt ResultSet . getFloat ResultSet . getInt ArrayList . add |
return a list of results <unk> rows for passed lab entry | ArrayList . <init> Collections . singletonList ResultSet . next ArrayList . add ResultSet . getInt ResultSet . getString |
get all the <unk> associated to specified <unk> | ArrayList . <init> Collections . singletonList StringBuilder . <init> StringBuilder . append ResultSet . getDouble ArrayList . add |
get all the <unk> associated to specified <unk> | ArrayList . <init> Collections . singletonList StringBuilder . <init> StringBuilder . append ResultSet . next ArrayList . add |
constructor for a synthetic collector | ArrayList . <init> Collections . singletonList |
return a set of fields that are members of the source type record and that are <unk> with the required output type the set maybe empty if there are no such fields | ArrayList . <init> Collections . singletonMap List . add |
get variables list returns a list of all variables , sorted by variable name | ArrayList . <init> Collections . sort <unk> . <init> <unk> . compare |
determine the player s with the best face up hand in this round | ArrayList . <init> Collections . sort ArrayList . <init> ArrayList . get ArrayList . size ArrayList . get ArrayList . add |
determine the player s with the best face up hand in this round | ArrayList . <init> Collections . sort ArrayList . <init> ArrayList . size ArrayList . get ArrayList . size ArrayList . add |
group similar ss tables together , this will be used by anti compaction to determine which ss tables should be <unk> as a group | ArrayList . <init> Collections . sort ArrayList . <init> Collection . add Collection < Collection > . add ArrayList . <init> Collection . size Collection < Collection > . add |
set m test package list to the list of test packages to run filtered by <unk> | ArrayList . <init> Collections . sort ArrayList . <init> Collection . size List . add List . size Math . min ArrayList . <init> List . add List . addAll |
set up spinner for the transfer to account selection | ArrayList . <init> Collections . sort ArrayList . <init> Collections . sort ArrayList . <init> ArrayList < String > . addAll Resources . getString ArrayList < String > . indexOf ArrayList < String > . toArray |
create a string representation of a graph in <unk> graph text format | ArrayList . <init> Collections . sort ArrayList . <init> Collections . sort |
loop through daily price history and creates a sublist containing the weekly or monthly price records | ArrayList . <init> Collections . sort ArrayList . <init> GregorianCalendar . getInstance Calendar . setTime Calendar . get List . add Calendar . get List . add |
period list loop through daily history and create list containing period ending weekly or monthly days | ArrayList . <init> Collections . sort ArrayList . <init> GregorianCalendar . getInstance Calendar . setTime Calendar . get List . add Calendar . get List . add |
remove positions in <unk> positions from positions , and <unk> the remaining positions accordingly | ArrayList . <init> Collections . sort ArrayList . <init> Iterator < Integer > . hasNext Iterator < Integer > . next Iterator < Integer > . remove Collection < Integer > . add Iterator < Integer > . remove Collection < Integer > . add Collection < Integer > . clear Collection < Integer > . addAll Collection < Integer > ... |
return the available dynamic service providers of the given type | ArrayList . <init> Collections . sort ArrayList . <init> List . add ArrayList . <init> |
create an ordered list of tokens | ArrayList . <init> Collections . sort ArrayList . <init> List . add Collections . unmodifiableList |
<unk> find collision sorts the entities in the list by their minimum <unk> <unk> x boundary | ArrayList . <init> Collections . sort ArrayList . <init> List . add List . iterator Iterator . next Iterator . hasNext Iterator . next |
process all the entries in this queue | ArrayList . <init> Collections . sort ArrayList . <init> List . add |
provide the enabled nodes | ArrayList . <init> Collections . sort ArrayList . <init> List . add |
this method generates a list of <unk> element objects describing the attributes allowed under a complex type | ArrayList . <init> Collections . sort ArrayList . <init> List . get List < Element > . add |
optimize the list of vfs source files by removing all resources that have a parent resource already included in the list | ArrayList . <init> Collections . sort ArrayList . <init> List . iterator Iterator . hasNext Iterator . next String . cast List . size String . cast List . add |
return all layers attached to this canvas | ArrayList . <init> Collections . sort ArrayList . <init> Map . values ArrayList . <init> |
create and displays a table for the given <unk> | ArrayList . <init> Collections . sort ArrayList . <init> Map < String , Double > . get List < TableRow > . add |
create and displays a table for the given <unk> | ArrayList . <init> Collections . sort ArrayList . <init> Map < String , Double > . get TableRow . <init> List < TableRow > . add |
process all the entries in this queue | ArrayList . <init> Collections . sort ArrayList . <init> Predicate . apply List . add |
put the registered scope session attribute handlers in an ordered list based on their order id property | ArrayList . <init> Collections . sort ArrayList . <init> |
return the list of top n similar historical <unk> pairs | ArrayList . <init> Collections . sort ArrayList . add |
sort and return top n <unk> results | ArrayList . <init> Collections . sort ArrayList . add |
take a hash amp of fill messages and determine if it contains what the last sale price is | ArrayList . <init> Collections . sort ArrayList . get Collections . reverse ArrayList . get |
take a hash map of fill messages and determine if it contains what the last sale quantity is | ArrayList . <init> Collections . sort ArrayList . get Collections . reverse ArrayList . get |
return an array of cluster seeds , ranked in decreasing order of number of <unk> in the specified collection of candidate clusters | ArrayList . <init> Collections . sort ArrayList . get Map . get |
close the stop | ArrayList . <init> Collections . sort ArrayList . get |
return the child package nodes of this node | ArrayList . <init> Collections . sort ArrayList . iterator Iterator . next ArrayList . add |
keep only non overlapping matches alignments while <unk> alignments with high score <unk> TODO : this is a heuristic , is the problem np complete ? = probably , see maximum set packing | ArrayList . <init> Collections . sort ArrayList . size ArrayList . <init> ArrayList . add ArrayList . remove ArrayList . size ArrayList . get ArrayList . set ArrayList . add |
show selected candidates | ArrayList . <init> Collections . sort ArrayList . size ArrayList . get ArrayList . add ArrayList . clear |
this is the standard k s test for determining if the given data were generated by the given cdf | ArrayList . <init> Collections . sort ArrayList . size ArrayList . get ArrayList . set ArrayList . size ArrayList . get Math . abs Math . max |
the <unk> chain algorithm for getting the convex hull of a set of 2D points | ArrayList . <init> Collections . sort ArrayList . size ArrayList . get ArrayList . size ArrayList . remove ArrayList . add ArrayList . size ArrayList . get ArrayList . size ArrayList . get ArrayList . size ArrayList . remove ArrayList . add |
<unk> os n <unk> <unk> <unk> | ArrayList . <init> Collections . sort ArrayList . size ArrayList . get Collection . add |
show the add or edit domain page | ArrayList . <init> Collections . sort ArrayList . size ArrayList . get HashMap . <init> HashMap . put ArrayList . add Request . getParameter ArrayList . clear Map . keySet Iterator . hasNext Iterator . next String . endsWith String . substring HashMap . <init> Request . getParameter HashMap . put Request . getParameter... |
<unk> den median der elemente der collection <unk> | ArrayList . <init> Collections . sort ArrayList . size ArrayList . get |
metodo che <unk> la <unk> di hold | ArrayList . <init> Collections . sort ArrayList . size ArrayList . get |
retrieve the given number of top players as given by the comparator | ArrayList . <init> Collections . sort ArrayList . size ArrayList . remove |
return the all config names | ArrayList . <init> Collections . sort ArrayList . size ArrayList . toArray |
call by equal , which has already checked for null and size mismatch , but <unk> check them again in case i ever want to re use this function | ArrayList . <init> Collections . sort ArrayList . size List . get |
return transforms an array of random vertexes in vec format to the vertexes of good looking polygon | ArrayList . <init> Collections . sort ArrayList . size Math . min ArrayList . get ArrayList . add ArrayList . size ArrayList . get ArrayList . add ArrayList . size ArrayList . get ArrayList . size ArrayList . get ArrayList . add Math . max ArrayList . size ArrayList . get ArrayList . add ArrayList . get ArrayList . add |
close the stop | ArrayList . <init> Collections . sort ArrayList . size |
devuelve una lista con los <unk> <unk> <unk> | ArrayList . <init> Collections . sort ArrayList . subList |
load and returns the bootstrap extensions whose configuration was added to this bootstrap extension dependency manager | ArrayList . <init> Collections . sort ArrayList . toArray LinkedList < String > . <init> System . exit |
retrieve all attribute processors for the given project | ArrayList . <init> Collections . sort ArrayList . trimToSize HashMap < ArrayList > . put HashMap < ArrayList > . get |
retrieve all element processors for the given project | ArrayList . <init> Collections . sort ArrayList . trimToSize HashMap < ArrayList > . put HashMap < ArrayList > . get |
generate the graphviz code for the given projects and dependencies | ArrayList . <init> Collections . sort ArrayList < > . <init> List < > . add ArrayList < > . <init> List < > . removeAll Collections . sort List < > . addAll StringBuilder . <init> StringBuilder . append |
determine which value , <unk> , <unk> or <unk> falls in the middle of the other two | ArrayList . <init> Collections . sort ArrayList < Double > . get Math . abs ArrayList < Double > . get Math . abs |
merge the attributes of two maps , where the first map can contain <unk> names | ArrayList . <init> Collections . sort ArrayList < Instruction > . <init> List . iterator Iterator . next Iterator . remove Instruction . matches Instruction . <unk> Iterator . remove Instruction . <unk> Set < Instruction > . add Set < Instruction > . iterator Iterator < Instruction > . next Instruction . <unk> Instruct... |
the primary method for <unk> shape <unk> <unk> | ArrayList . <init> Collections . sort ArrayList < Integer > . <init> ArrayList < Integer > . add ArrayList . size ArrayList . get ArrayList < Integer > . add System . currentTimeMillis Node . <init> Stack < Node > . <init> Stack < Node > . push Stack < Node > . pop Node . getElement Node . getDepth ArrayList . size Arr... |
return the value that is n : th biggest in the given list of values | ArrayList . <init> Collections . sort ArrayList < Number > . get |
generate sorted strings from a map key set | ArrayList . <init> Collections . sort ArrayList < String > . <init> Map . get List < String > . add List < String > . size |
generate sorted strings from a map key set | ArrayList . <init> Collections . sort ArrayList < String > . <init> Map . get List < String > . add List < String > . toArray |
reconstruct finger table from a set of contacts | ArrayList . <init> Collections . sort BigInteger . <init> BigInteger . pow BigInteger . <init> BigInteger . pow BigInteger . add ArrayList . get ArrayList . size ArrayList . get |
reconstruct finger table from a set of contacts | ArrayList . <init> Collections . sort BigInteger . <init> BigInteger . pow BigInteger . add ArrayList . size ArrayList . get |
take a bit set as input and <unk> a list with the possible agent ids that could manage resources | ArrayList . <init> Collections . sort BitSet . cardinality List < String > . addAll BitSet . cast HashMap . <init> HashMap . containsKey HashMap . put Integer . cast Integer . intValue HashMap . put List < String > . add |
construct a new type panel | ArrayList . <init> Collections . sort Box . createRigidArea Dimension . <init> JButton . <init> JButton . setVerticalAlignment JComboBox . getPreferredSize JComboBox . setPreferredSize JButton . setEnabled JComboBox . setSelectedIndex JComboBox . setBorder ActionListener . <init> JButton . addActionListener JComboBox .... |
construct a new type panel | ArrayList . <init> Collections . sort BoxLayout . <init> Dimension . <init> JButton . setVerticalAlignment JComboBox . getPreferredSize JComboBox . setPreferredSize JButton . setEnabled JComboBox . setSelectedIndex JComboBox . setBorder Util . <unk> ActionListener . <init> JButton . addActionListener JComboBox . getSel... |
construct a new type panel | ArrayList . <init> Collections . sort BoxLayout . <init> JButton . <init> Dimension . <init> Box . createRigidArea Dimension . <init> JButton . <init> JButton . setVerticalAlignment JComboBox . getPreferredSize Util . <unk> JComboBox . setMinimumSize JComboBox . setPreferredSize JButton . setEnabled JComboBox . setSele... |
print reaction names and formulas , separated by colon and tab | ArrayList . <init> Collections . sort Collator . getInstance Output . <unk> Output . flush |
print <unk> names for the network | ArrayList . <init> Collections . sort Collator . getInstance PrintWriter . print PrintWriter . println PrintWriter . print Output . flush |
display all games from a collection in a j list format | ArrayList . <init> Collections . sort Collection . size DefaultListModel . addElement JList . setSelectedIndex |
to be compatible with version control systems , we need to sort properties before storing them to disk | ArrayList . <init> Collections . sort Collections . enumeration |
sort the list based on two criteria to create clusters segments within the list | ArrayList . <init> Collections . sort Collections . reverse ArrayList . <init> ArrayList . size ArrayList . get ArrayList . <init> ArrayList . addAll Collections . sort ArrayList . addAll ArrayList . <init> ArrayList . size ArrayList . subList Collections . sort ArrayList . addAll Collections . reverse |
sort the list based on two criteria to create clusters segments within the list | ArrayList . <init> Collections . sort Collections . reverse ArrayList . <init> ArrayList . size ArrayList . get ArrayList . <init> ArrayList . subList ArrayList . addAll Collections . sort ArrayList . addAll ArrayList . <init> ArrayList . size Collections . sort ArrayList . addAll Collections . reverse |
sort the list based on two criteria to create clusters segments within the list | ArrayList . <init> Collections . sort Collections . reverse ArrayList . <init> ArrayList . size ArrayList . get ArrayList . <init> ArrayList . subList ArrayList . addAll Collections . sort ArrayList . addAll ArrayList . <init> ArrayList . subList Collections . sort ArrayList . addAll Collections . reverse |
return the best price in the book side | ArrayList . <init> Collections . sort Collections . reverse ArrayList . get |
calculate which version transitions to test given the current version , and the list of versions to consider | ArrayList . <init> Collections . sort Collections . reverse HashSet . <init> List . add Set . clear List . add Set . add Collections . reverse |
calculate which version transitions to test given the current version , and the list of versions to consider | ArrayList . <init> Collections . sort Collections . reverse HashSet . <init> List . add Set . clear Set . contains List . add Set . add Collections . reverse |
this private method sorts the result of the <unk> , in order to see which letter has the highest probability | ArrayList . <init> Collections . sort Collections . reverse LinkedHashMap . <init> List . iterator Iterator . hasNext Iterator . next List . iterator Iterator . next Object . toString String . equals HashMap . remove List . remove Object . toString Character . valueOf Double . cast LinkedHashMap . put |
this private method sorts the result of the <unk> , in order to see which letter has the highest probability | ArrayList . <init> Collections . sort Collections . reverse LinkedHashMap . <init> List . iterator Iterator . next List . iterator Iterator . next HashMap . get Object . toString HashMap . remove List . remove Character . valueOf LinkedHashMap . put |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.