Datasets:
Mlxa
/
java_methods

Dataset card Data Studio Files
xet
 Community
1
Unnamed: 0
int64
0
305k
body
stringlengths
7
52.9k
name
stringlengths
1
185
39,600
int[] () { return data; }
getData
39,601
int[] () { return next; }
getNext
39,602
FastSparseSetFactory<E> () { return factory; }
getFactory
39,603
int (int index) { index++; int bindex = index >>> 5; int dindex = index & 0x1F; while (bindex < data.length) { int block = data[bindex]; if (block != 0) { block >>>= dindex; while (dindex < 32) { if ((block & 1) != 0) { return (bindex << 5) + dindex; } block >>>= 1; dindex++; } } dindex = 0; bindex = next[bindex]; if (...
getNextIndex
39,604
boolean () { next_pointer = getNextIndex(pointer); return (next_pointer >= 0); }
hasNext
39,605
E () { if (next_pointer >= 0) { pointer = next_pointer; } else { pointer = getNextIndex(pointer); if (pointer == -1) { pointer = size; } } next_pointer = -1; return pointer < size ? colValuesInternal.getKey(pointer) : null; }
next
39,606
void () { int[] index = colValuesInternal.get(pointer); data[index[0]] &= ~index[1]; }
remove
39,607
FastFixedSet<E> () { return new FastFixedSet<>(this); }
spawnEmptySet
39,608
int () { return dataLength; }
getDataLength
39,609
FastFixedSet<E> () { FastFixedSet<E> copy = new FastFixedSet<>(factory); int arrlength = data.length; int[] cpdata = Arrays.copyOf(data, arrlength); copy.setData(cpdata); return copy; }
getCopy
39,610
void () { int[] lastindex = colValuesInternal.get(colValuesInternal.size() - 1); for (int i = lastindex[0] - 1; i >= 0; i--) { data[i] = 0xFFFFFFFF; } data[lastindex[0]] = lastindex[1] | (lastindex[1] - 1); }
setAllElements
39,611
void (E element) { int[] index = colValuesInternal.getWithKey(element); data[index[0]] |= index[1]; }
add
39,612
void (Collection<E> set) { for (E element : set) { add(element); } }
addAll
39,613
void (E element) { int[] index = colValuesInternal.getWithKey(element); data[index[0]] &= ~index[1]; }
remove
39,614
boolean (E element) { int[] index = colValuesInternal.getWithKey(element); return (data[index[0]] & index[1]) != 0; }
contains
39,615
boolean (FastFixedSet<E> set) { int[] extdata = set.getData(); int[] intdata = data; for (int i = intdata.length - 1; i >= 0; i--) { if ((extdata[i] & ~intdata[i]) != 0) { return false; } } return true; }
contains
39,616
void (FastFixedSet<E> set) { int[] extdata = set.getData(); int[] intdata = data; for (int i = intdata.length - 1; i >= 0; i--) { intdata[i] |= extdata[i]; } }
union
39,617
void (FastFixedSet<E> set) { int[] extdata = set.getData(); int[] intdata = data; for (int i = intdata.length - 1; i >= 0; i--) { intdata[i] &= extdata[i]; } }
intersection
39,618
void (FastFixedSet<E> set) { int[] extdata = set.getData(); int[] intdata = data; for (int i = intdata.length - 1; i >= 0; i--) { intdata[i] &= ~extdata[i]; } }
complement
39,619
boolean (Object o) { if (o == this) return true; if (!(o instanceof FastFixedSet)) return false; int[] extdata = ((FastFixedSet<?>)o).getData(); int[] intdata = data; for (int i = intdata.length - 1; i >= 0; i--) { if (intdata[i] != extdata[i]) { return false; } } return true; }
equals
39,620
boolean () { int[] intdata = data; for (int i = intdata.length - 1; i >= 0; i--) { if (intdata[i] != 0) { return false; } } return true; }
isEmpty
39,621
Iterator<E> () { return new FastFixedSetIterator<>(this); }
iterator
39,622
Set<E> () { return toPlainCollection(new HashSet<>()); }
toPlainSet
39,623
String () { StringBuilder buffer = new StringBuilder("{"); int[] intdata = data; boolean first = true; for (int i = colValuesInternal.size() - 1; i >= 0; i--) { int[] index = colValuesInternal.get(i); if ((intdata[index[0]] & index[1]) != 0) { if (first) { first = false; } else { buffer.append(","); } buffer.append(col...
toString
39,624
int[] () { return data; }
getData
39,625
void (int[] data) { this.data = data; }
setData
39,626
FastFixedSetFactory<E> () { return factory; }
getFactory
39,627
int (int index) { index++; int ret = index; int bindex = index / 32; int dindex = index % 32; while (bindex < data.length) { int block = data[bindex]; if (block != 0) { block >>>= dindex; while (dindex < 32) { if ((block & 1) != 0) { return ret; } block >>>= 1; dindex++; ret++; } } else { ret += (32 - dindex); } dindex...
getNextIndex
39,628
boolean () { next_pointer = getNextIndex(pointer); return (next_pointer >= 0); }
hasNext
39,629
E () { if (next_pointer >= 0) { pointer = next_pointer; } else { pointer = getNextIndex(pointer); if (pointer == -1) { pointer = size; } } next_pointer = -1; return pointer < size ? colValuesInternal.getKey(pointer) : null; }
next
39,630
void () { int[] index = colValuesInternal.get(pointer); data[index[0]] &= ~index[1]; }
remove
39,631
void (TextBuffer buf, String qualifier) { ClassesProcessor.ClassNode classNode = (ClassesProcessor.ClassNode)DecompilerContext.getProperty(DecompilerContext.CURRENT_CLASS_NODE); if (!qualifier.equals(classNode.classStruct.qualifiedName)) { buf.append(DecompilerContext.getImportCollector().getNestedName(ExprProcessor.bu...
writeQualifiedSuper
39,632
String (int length) { if (length == 0) return ""; StringBuilder buf = new StringBuilder(); String indent = (String)DecompilerContext.getProperty(IFernflowerPreferences.INDENT_STRING); append(buf, indent, length); return buf.toString(); }
getIndentString
39,633
void (StringBuilder buf, String string, int times) { while (times-- > 0) buf.append(string); }
append
39,634
boolean (char c) { int t = Character.getType(c); return t != Character.UNASSIGNED && t != Character.LINE_SEPARATOR && t != Character.PARAGRAPH_SEPARATOR && t != Character.CONTROL && t != Character.FORMAT && t != Character.PRIVATE_USE && t != Character.SURROGATE; }
isPrintableUnicode
39,635
String (int value) { String sTemp = Integer.toHexString(value); sTemp = ("0000" + sTemp).substring(sTemp.length()); return "\\u" + sTemp; }
charToUnicodeLiteral
39,636
boolean (String id, int version) { return isJavaIdentifier(id) && !isKeyword(id, version); }
isValidIdentifier
39,637
boolean (String id) { if (id.isEmpty() || !Character.isJavaIdentifierStart(id.charAt(0))) { return false; } for (int i = 1; i < id.length(); i++) { if (!Character.isJavaIdentifierPart(id.charAt(i))) { return false; } } return true; }
isJavaIdentifier
39,638
boolean (String id, int version) { return KEYWORDS.contains(id) || version >= CodeConstants.BYTECODE_JAVA_5 && "enum".equals(id); }
isKeyword
39,639
String (int opcode) { return opcodeNames[opcode]; }
getInstructionName
39,640
ListStack<T> () { ListStack<T> copy = new ListStack<>(this); copy.pointer = this.pointer; return copy; }
copy
39,641
void (T item) { this.add(item); pointer++; }
push
39,642
T () { pointer--; T o = this.get(pointer); this.remove(pointer); return o; }
pop
39,643
T (int count) { T o = null; for (int i = count; i > 0; i--) { o = this.pop(); } return o; }
pop
39,644
void (int count) { while (count > 0) { pointer--; this.remove(pointer); count--; } }
removeMultiple
39,645
T (int offset) { return this.get(pointer + offset); }
getByOffset
39,646
void (int offset, T item) { this.add(pointer + offset, item); pointer++; }
insertByOffset
39,647
void () { super.clear(); pointer = 0; }
clear
39,648
SFormsFastMapDirect () { SFormsFastMapDirect map = new SFormsFastMapDirect(false); map.size = size; FastSparseSet[][] mapelements = map.elements; int[][] mapnext = map.next; for (int i = 2; i >= 0; i--) { FastSparseSet<Integer>[] arr = elements[i]; int length = arr.length; if (length > 0) { int[] arrnext = next[i]; @Su...
getCopy
39,649
int () { return size; }
size
39,650
boolean () { return size == 0; }
isEmpty
39,651
void (int key, FastSparseSet<Integer> value) { putInternal(key, value, false); }
put
39,652
void () { FastSparseSet<Integer>[] arr = elements[2]; int[] arrnext = next[2]; for (int i = arr.length - 1; i >= 0; i--) { FastSparseSet<Integer> val = arr[i]; if (val != null) { arr[i] = null; size--; } arrnext[i] = 0; } }
removeAllFields
39,653
void (final int key, final FastSparseSet<Integer> value, boolean remove) { int index = 0; int ikey = key; if (ikey < 0) { index = 2; ikey = -ikey; } else if (ikey >= VarExprent.STACK_BASE) { index = 1; ikey -= VarExprent.STACK_BASE; } FastSparseSet<Integer>[] arr = elements[index]; if (ikey >= arr.length) { if (remove)...
putInternal
39,654
void (int[] arrnext, int key, int oldnext, int newnext) { for (int i = key - 1; i >= 0; i--) { if (arrnext[i] == oldnext) { arrnext[i] = newnext; } else { break; } } }
changeNext
39,655
boolean (int key) { return get(key) != null; }
containsKey
39,656
FastSparseSet<Integer> (int key) { int index = 0; if (key < 0) { index = 2; key = -key; } else if (key >= VarExprent.STACK_BASE) { index = 1; key -= VarExprent.STACK_BASE; } FastSparseSet<Integer>[] arr = elements[index]; if (key < arr.length) { return arr[key]; } return null; }
get
39,657
void (SFormsFastMapDirect map) { for (int i = 2; i >= 0; i--) { FastSparseSet<Integer>[] lstOwn = elements[i]; if (lstOwn.length == 0) { continue; } FastSparseSet<Integer>[] lstExtern = map.elements[i]; int[] arrnext = next[i]; int pointer = 0; do { FastSparseSet<Integer> first = lstOwn[pointer]; if (first != null) { i...
complement
39,658
void (SFormsFastMapDirect map) { for (int i = 2; i >= 0; i--) { FastSparseSet<Integer>[] lstOwn = elements[i]; if (lstOwn.length == 0) { continue; } FastSparseSet<Integer>[] lstExtern = map.elements[i]; int[] arrnext = next[i]; int pointer = 0; do { FastSparseSet<Integer> first = lstOwn[pointer]; if (first != null) { F...
intersection
39,659
void (SFormsFastMapDirect map) { for (int i = 2; i >= 0; i--) { FastSparseSet<Integer>[] lstExtern = map.elements[i]; if (lstExtern.length == 0) { continue; } FastSparseSet<Integer>[] lstOwn = elements[i]; int[] arrnext = next[i]; int[] arrnextExtern = map.next[i]; int pointer = 0; do { if (pointer >= lstOwn.length) { ...
union
39,660
String () { StringBuilder buffer = new StringBuilder("{"); List<Entry<Integer, FastSparseSet<Integer>>> lst = entryList(); if (lst != null) { boolean first = true; for (Entry<Integer, FastSparseSet<Integer>> entry : lst) { if (!first) { buffer.append(", "); } else { first = false; } Set<Integer> set = entry.getValue()....
toString
39,661
Integer () { return var; }
getKey
39,662
FastSparseSet<Integer> () { return val; }
getValue
39,663
FastSparseSet<Integer> (FastSparseSet<Integer> newvalue) { return null; }
setValue
39,664
FastSparseSet<Integer>[] (int index, int size, boolean exact) { FastSparseSet<Integer>[] arr = elements[index]; int[] arrnext = next[index]; int minsize = size; if (!exact) { minsize = 2 * arr.length / 3 + 1; if (size > minsize) { minsize = size; } } @SuppressWarnings("unchecked") FastSparseSet<Integer>[] arrnew = new ...
ensureCapacity
39,665
boolean (E element) { lstKeys.add(null); super.add(element); return true; }
add
39,666
boolean (Object element) { // TODO: error on void remove(E element) throw new RuntimeException("not implemented!"); }
remove
39,667
boolean (Collection<? extends E> c) { for (int i = c.size() - 1; i >= 0; i--) { lstKeys.add(null); } return super.addAll(c); }
addAll
39,668
void (Collection<E> elements, Collection<K> keys) { int index = super.size(); for (K key : keys) { map.put(key, index++); } super.addAll(elements); lstKeys.addAll(keys); }
addAllWithKey
39,669
void (E element, K key) { map.put(key, super.size()); super.add(element); lstKeys.add(key); }
addWithKey
39,670
E (E element, K key) { Integer index = map.get(key); if (index == null) { addWithKey(element, key); } else { return super.set(index, element); } return null; }
putWithKey
39,671
void (int index, E element) { addToListIndex(index, 1); lstKeys.add(index, null); super.add(index, element); }
add
39,672
void (int index, E element, K key) { addToListIndex(index, 1); map.put(key, index); super.add(index, element); lstKeys.add(index, key); }
addWithKeyAndIndex
39,673
void (K key) { int index = map.get(key); addToListIndex(index + 1, -1); super.remove(index); lstKeys.remove(index); map.remove(key); }
removeWithKey
39,674
E (int index) { addToListIndex(index + 1, -1); K obj = lstKeys.get(index); if (obj != null) { map.remove(obj); } lstKeys.remove(index); return super.remove(index); }
remove
39,675
E (K key) { Integer index = map.get(key); if (index == null) { return null; } return super.get(index); }
getWithKey
39,676
int (K key) { return map.get(key); }
getIndexByKey
39,677
E () { return super.get(super.size() - 1); }
getLast
39,678
boolean (K key) { return map.containsKey(key); }
containsKey
39,679
void () { map.clear(); lstKeys.clear(); super.clear(); }
clear
39,680
void (HashMap<K, Integer> map) { this.map = map; }
setMap
39,681
K (int index) { return lstKeys.get(index); }
getKey
39,682
ArrayList<K> () { return lstKeys; }
getLstKeys
39,683
void (ArrayList<K> lstKeys) { this.lstKeys = lstKeys; }
setLstKeys
39,684
void (int index, int diff) { for (int i = lstKeys.size() - 1; i >= index; i--) { K obj = lstKeys.get(i); if (obj != null) { map.put(obj, i + diff); } } }
addToListIndex
39,685
SimpleInstructionSequence () { SimpleInstructionSequence newseq = new SimpleInstructionSequence(collinstr.clone()); newseq.setPointer(this.getPointer()); return newseq; }
clone
39,686
InstructionSequence () { return null; }
clone
39,687
void () { collinstr.clear(); pointer = 0; exceptionTable = ExceptionTable.EMPTY; }
clear
39,688
void (Instruction inst, int offset) { collinstr.addWithKey(inst, offset); }
addInstruction
39,689
void (int index, Instruction inst, int offset) { collinstr.addWithKeyAndIndex(index, inst, offset); }
addInstruction
39,690
void (InstructionSequence seq) { for (int i = 0; i < seq.length(); i++) { addInstruction(seq.getInstr(i), -1); // TODO: any sensible value possible? } }
addSequence
39,691
void (int index) { collinstr.remove(index); }
removeInstruction
39,692
void () { if (!collinstr.isEmpty()) { collinstr.remove(collinstr.size() - 1); } }
removeLast
39,693
Instruction (int index) { return collinstr.get(index); }
getInstr
39,694
Instruction () { return collinstr.getLast(); }
getLastInstr
39,695
int (int index) { return collinstr.getKey(index); }
getOffset
39,696
int (int offset) { Integer absoffset = offset; if (collinstr.containsKey(absoffset)) { return collinstr.getIndexByKey(absoffset); } else { return -1; } }
getPointerByAbsOffset
39,697
int (int offset) { Integer absoffset = collinstr.getKey(pointer) + offset; if (collinstr.containsKey(absoffset)) { return collinstr.getIndexByKey(absoffset); } else { return -1; } }
getPointerByRelOffset
39,698
int () { return collinstr.size(); }
length
39,699
boolean () { return collinstr.isEmpty(); }
isEmpty