id stringlengths 9 12 | level int64 1 1 | label stringclasses 2
values | component_pairids listlengths 1 1 | source stringclasses 2
values | side_a_code stringlengths 93 4.5k | side_b_code stringlengths 130 4.52k |
|---|---|---|---|---|---|---|
l1_pos_8852 | 1 | equivalent | [
8852
] | fempd_verified_pairs | byte[] getBytes(byte[] source,int offset,int length){
byte[] bytes=new byte[length];
for (int i=0; i < length; i++) {
if (source.length > offset + i) {
bytes[i]=source[offset + i];
}
}
return bytes;
}
| byte[] copy(byte[] data,int off,int len){
byte[] dd=new byte[len];
for (int si=off, di=0; si < data.length && di < dd.length; si++, di++) dd[di]=data[si];
return dd;
}
|
l1_pos_4399 | 1 | equivalent | [
4399
] | fempd_verified_pairs | String join(String[] array,String delimiter){
int delimiterLength=delimiter.length();
if (array.length == 0) return "";
if (array.length == 1) {
if (array[0] == null) return "";
return array[0];
}
int length=0;
for (int i=0; i < array.length; i++) {
if (array[i] != null) length+=array[... | String join(String[] array,String delimiter){
int delimiterLength=delimiter.length();
if (array.length == 0) {
return "";
}
if (array.length == 1) {
if (array[0] == null) {
return "";
}
return array[0];
}
int length=0;
for (int i=0; i < array.length; i++) {
if (array[i] != null) ... |
l1_neg_8279 | 1 | not_equivalent | [
8279
] | fempd_verified_negative_pairs | boolean firstWordsEqual(String a,String b){
if (a == b) return true;
String aw=a.split(" ",1)[0];
String bw=b.split(" ",1)[0];
return aw.compareTo(bw) == 0;
}
| boolean certificateNamesMatch(String a,String b){
String[] partsA=a.split(", *");
Arrays.sort(partsA);
String[] partsB=b.split(", *");
Arrays.sort(partsB);
if (partsA.length != partsB.length) {
return false;
}
for (int i=0; i < partsA.length; i++) {
if (!partsA[i].equals(partsB[i])) {
return... |
l1_neg_13341 | 1 | not_equivalent | [
13341
] | fempd_verified_negative_pairs | byte[] parseByteArray(String hex){
hex=hex.replaceAll(" ","");
byte[] bytes=new byte[hex.length() / 2];
for (int i=0; i < hex.length(); i+=2) {
int num=Integer.parseInt(hex.substring(i,i + 2),16);
bytes[i / 2]=(byte)num;
}
return bytes;
}
| byte[] getBytes(String hexString){
byte[] bytes=new byte[hexString.length() / 2];
for (int i=0; i < hexString.length(); i=i + 2) {
String hex=hexString.substring(i,i + 2);
int b=Integer.parseInt(hex,16);
bytes[i / 2]=b > 128 ? (byte)(b - 256) : (byte)b;
}
return bytes;
}
|
l1_pos_12921 | 1 | equivalent | [
12921
] | fempd_verified_pairs | String fixedStringLength(String s,int length){
if (s.length() < length) {
StringBuffer str=new StringBuffer(s);
for (int i=0; i < length - s.length(); i++) {
str.append(" ");
}
s=str.toString();
}
else if (s.length() > length) {
s=s.substring(0,length);
}
return s;
}
| String left(String s,int w){
int n=s.length();
if (w < n) return s.substring(0,w);
StringBuilder result=new StringBuilder(s);
for (int i=n; i < w; i++) {
result.append(' ');
}
return result.toString();
}
|
l1_pos_743 | 1 | equivalent | [
743
] | fempd_verified_pairs | long parseValue(String key,long defaultValue){
final String value=System.getProperty(key);
if (null == value) {
return defaultValue;
}
try {
return Long.parseLong(value);
}
catch ( final NumberFormatException e) {
return defaultValue;
}
}
| long getLongProperty(String name,long defaultValue){
String val=System.getProperty(name);
if (val != null) {
try {
return Long.parseLong(val);
}
catch ( NumberFormatException e) {
return defaultValue;
}
}
else {
return defaultValue;
}
}
|
l1_pos_3938 | 1 | equivalent | [
3938
] | fempd_verified_pairs | int compareBytes(byte[] b1,byte[] b2){
int max=Math.min(b1.length,b2.length);
for (int i=0; i < max; i++) {
int byte1=(b1[i] & 0xff);
int byte2=(b2[i] & 0xff);
int diff=byte1 - byte2;
if (diff != 0) return diff;
}
return b1.length - b2.length;
}
| int compareUnsignedBytes(byte[] key1,byte[] key2){
int a1Len=key1.length;
int a2Len=key2.length;
int limit=Math.min(a1Len,a2Len);
for (int i=0; i < limit; i++) {
byte b1=key1[i];
byte b2=key2[i];
if (b1 == b2) {
continue;
}
else {
return (b1 & 0xff) - (b2 & 0xff);
}
}
return... |
l1_neg_10346 | 1 | not_equivalent | [
10346
] | fempd_verified_negative_pairs | boolean startsWith(CharSequence text,CharSequence prefix){
int p_length=prefix.length();
if (p_length > text.length()) {
return false;
}
for (int x=0; x < p_length; x++) {
if (text.charAt(x) != prefix.charAt(x)) return false;
}
return true;
}
| boolean startsWithIgnoreCase(CharSequence s,CharSequence t){
if (s.length() < t.length()) {
return false;
}
for (int i=0; i < t.length(); i++) {
char slc=Character.toLowerCase(s.charAt(i));
char tlc=Character.toLowerCase(t.charAt(i));
if (slc != tlc) {
return false;
}
}
return true;
... |
l1_pos_7110 | 1 | equivalent | [
7110
] | fempd_verified_pairs | int direction(int srcX,int srcY,int destX,int destY){
int dx=destX - srcX;
int dy=destY - srcY;
if (dx < 0) {
if (dy < 0) {
if (dx < dy) return 11;
else if (dx > dy) return 9;
else return 10;
}
else if (dy > 0) {
if (-dx < dy) return 15;
else if (-dx... | int direction(int srcX,int srcY,int destX,int destY){
int dx=destX - srcX, dy=destY - srcY;
if (dx < 0) {
if (dy < 0) {
if (dx < dy) return 11;
else if (dx > dy) return 9;
else return 10;
}
else if (dy > 0) {
if (-dx < dy) return 15;
else if (-dx > dy)... |
l1_neg_5885 | 1 | not_equivalent | [
5885
] | fempd_verified_negative_pairs | int binarySearch(int[] index,int key,int begin,int end){
end--;
while (begin <= end) {
int mid=(end + begin) >>> 1;
if (index[mid] < key) begin=mid + 1;
else if (index[mid] > key) end=mid - 1;
else return mid;
}
return -begin - 1;
}
| int binarySearch(int[] array,int value,int fromIndex,int toIndex){
while (fromIndex < toIndex) {
int i;
int nv;
if ((nv=array[i=(fromIndex + toIndex) >> 1]) < value) {
fromIndex=i + 1;
}
else if (nv > value) {
toIndex=i;
}
else {
return i;
}
}
return ~fromIndex;
}
|
l1_pos_6784 | 1 | equivalent | [
6784
] | fempd_verified_pairs | String numToNth(int num){
int ones=num % 10;
int tens=num % 100;
String suffix=null;
switch (ones) {
case 1: if (tens == 11) suffix="th";
else suffix="st";
break;
case 2:if (tens == 12) suffix="th";
else suffix="nd";
break;
case 3:if (tens == 13) suffix="th";
else suffix="rd";
break;
default:suffi... | String formatNumberAsSequence(int num){
String suffix="th";
switch (num % 10) {
case 1: if (num % 100 != 11) suffix="st";
break;
case 2:if (num % 100 != 12) suffix="nd";
break;
case 3:if (num % 100 != 13) suffix="rd";
break;
}
return num + suffix;
}
|
l1_pos_6774 | 1 | equivalent | [
6774
] | fempd_verified_pairs | byte[] base64Encode(byte[] byteData){
if (byteData == null) {
return null;
}
int iSrcIdx;
int iDestIdx;
byte byteDest[]=new byte[((byteData.length + 2) / 3) * 4];
for (iSrcIdx=0, iDestIdx=0; iSrcIdx < byteData.length - 2; iSrcIdx+=3) {
byteDest[iDestIdx++]=(byte)((byteData[iSrcIdx] >>> 2) & 077);
... | byte[] base64Encode(byte[] byteData){
if (byteData == null) {
return null;
}
int iSrcIdx;
int iDestIdx;
byte byteDest[]=new byte[((byteData.length + 2) / 3) * 4];
for (iSrcIdx=0, iDestIdx=0; iSrcIdx < byteData.length - 2; iSrcIdx+=3) {
byteDest[iDestIdx++]=(byte)((byteData[iSrcIdx] >>> 2) & 077);
... |
l1_neg_6607 | 1 | not_equivalent | [
6607
] | fempd_verified_negative_pairs | double computeAverage(double[] array,int start,int num){
double sum=0;
for (int i=start, stop=start + num; i < stop; i++) {
sum+=array[i];
}
return sum / num;
}
| double avg(double[] list,int current,int period){
double result=0;
for (int i=current; i > current - period; i--) {
result+=list[i];
}
return result / (double)period;
}
|
l1_neg_8951 | 1 | not_equivalent | [
8951
] | fempd_verified_negative_pairs | LinkedHashMap sortHashMapByValuesD(HashMap passedMap){
List mapKeys=new ArrayList(passedMap.keySet());
List mapValues=new ArrayList(passedMap.values());
Collections.sort(mapValues);
Collections.sort(mapKeys);
Collections.reverse(mapValues);
LinkedHashMap sortedMap=new LinkedHashMap();
Iterator valueIt=map... | LinkedHashMap sortHashMapByValues(HashMap passedMap){
List mapKeys=new ArrayList(passedMap.keySet());
List mapValues=new ArrayList(passedMap.values());
Collections.sort(mapValues);
Collections.sort(mapKeys);
LinkedHashMap sortedMap=new LinkedHashMap();
Iterator valueIt=mapValues.iterator();
while (valueIt... |
l1_pos_9100 | 1 | equivalent | [
9100
] | fempd_verified_pairs | int getNbBytes(int length){
if (length >= 0) {
if (length < 128) {
return 1;
}
else if (length < 256) {
return 2;
}
else if (length < 65536) {
return 3;
}
else if (length < 16777216) {
return 4;
}
else {
return 5;
}
}
else {
return 5;
}
}
| int getBERLengthOfLength(int length){
if (length < 0) {
return 5;
}
else if (length < 0x80) {
return 1;
}
else if (length <= 0xFF) {
return 2;
}
else if (length <= 0xFFFF) {
return 3;
}
else if (length <= 0xFFFFFF) {
return 4;
}
return 5;
}
|
l1_neg_7834 | 1 | not_equivalent | [
7834
] | fempd_verified_negative_pairs | boolean nullSafeEquals(Object obj1,Object obj2){
if (obj1 == null) return (obj2 == null);
return ((obj2 != null) && obj1.equals(obj2));
}
| boolean compareMapValues(Object value,Object target){
if ((value == null) && (target == null)) {
return true;
}
else if ((value == null) || (target == null)) {
return false;
}
else if (value.equals(target)) {
return true;
}
else {
return value.toString().equals(target.toString());
}
}
|
l1_pos_13009 | 1 | equivalent | [
13009
] | fempd_verified_pairs | int clamp(long value){
if (value < Integer.MIN_VALUE) return Integer.MIN_VALUE;
if (value > Integer.MAX_VALUE) return Integer.MAX_VALUE;
return (int)value;
}
| int toInt(long value){
if (value < (long)Integer.MIN_VALUE) {
return Integer.MIN_VALUE;
}
else if (value > (long)Integer.MAX_VALUE) {
return Integer.MAX_VALUE;
}
else {
return (int)value;
}
}
|
l1_pos_9917 | 1 | equivalent | [
9917
] | fempd_verified_pairs | int getInt(byte[] arr,int offset,int bytes){
int result=0;
for (int i=0; i < bytes; i++) {
result<<=8;
result|=arr[offset++] & 0xFF;
}
return result;
}
| int bigEndianToUnsignedInt(byte[] b,int offset,int length){
int v=0;
while (length-- > 0) {
v=v << 8 | b[offset++] & 0xff;
}
return v;
}
|
l1_neg_8079 | 1 | not_equivalent | [
8079
] | fempd_verified_negative_pairs | boolean arrayRegionMatches(char[] source,int sourceStart,char[] target,int targetStart,int len){
int sourceEnd=sourceStart + len;
int delta=targetStart - sourceStart;
for (int i=sourceStart; i < sourceEnd; i++) {
if (source[i] != target[i + delta]) return false;
}
return true;
}
| boolean regionMatches(char[] pStringA,int pStartPosInA,char[] pStringB,int pStartPosInB,int pLength){
for (int i=0; i < pLength; i++) {
if (pStringA[i + pStartPosInA] != pStringB[i + pStartPosInB]) {
return false;
}
}
return true;
}
|
l1_neg_5572 | 1 | not_equivalent | [
5572
] | fempd_verified_negative_pairs | boolean getAsBoolean(String val,boolean dfault){
try {
if (val == null) {
return dfault;
}
String s=val.trim().toLowerCase();
if (s.length() == 0) {
return dfault;
}
;
return (s.equals("true") || s.equals("yes") || s.equals("T")|| s.equals("Y"));
}
catch ( Exception e) {
... | boolean isMethodName(String name,boolean emptyDefault){
if (name == null || name.length() == 0) {
return emptyDefault;
}
if (name.startsWith("__") && name.length() > 2) {
return Character.isLowerCase(name.charAt(2));
}
if (name.startsWith("_") && name.length() > 1) {
return Character.isLowerCase(n... |
l1_pos_12411 | 1 | equivalent | [
12411
] | fempd_verified_pairs | String htmlEncode(String text,boolean convertTags){
if (text == null) return "";
StringBuffer out=new StringBuffer(text.length() * 2);
char c;
for (int i=0; i < text.length(); i++) {
c=text.charAt(i);
if (c >= 128 || (convertTags && (c == '<' || c == '>' || c == '&' || c == '"') || c == '\'')) {
switc... | String unicodeHtmlEscape(String text,boolean convertTags){
if (text == null) {
return "";
}
StringBuffer out=new StringBuffer(text.length() * 2);
char c;
for (int i=0; i < text.length(); i++) {
c=text.charAt(i);
if (c >= 128 || (convertTags && (c == '<' || c == '>' || c == '&' || c == '"') || c ==... |
l1_neg_6507 | 1 | not_equivalent | [
6507
] | fempd_verified_negative_pairs | long octet2long(byte[] input,int offset){
long result=0;
for (int i=0; i < 8; i++) {
if (i + offset < input.length) {
result|=(((long)input[i + offset]) & 0xffL) << ((7 - i) * 8);
}
}
return result;
}
| long Long(byte[] buf,int ofs){
long ret=0, reg;
int len=buf.length;
if (8 < len) len=8;
for (int cc=ofs, sh=56; cc < len; cc++, sh-=8) {
reg=(buf[cc] & 0xff);
ret|=reg << sh;
}
return ret;
}
|
l1_neg_4858 | 1 | not_equivalent | [
4858
] | fempd_verified_negative_pairs | String subString(String s,int index,int length){
String returnVal="";
if (index < s.length()) {
int RightIndex=index + length;
if (RightIndex >= s.length()) {
returnVal=s.substring(index);
}
else {
returnVal=s.substring(index,RightIndex);
}
}
return returnVal;
}
| String subStringWith3Point(String inputStr,int beginIndex,int length){
int strLength=inputStr.length();
if (beginIndex >= strLength) {
return "";
}
if (beginIndex + length >= strLength) {
return inputStr.substring(beginIndex);
}
return inputStr.substring(beginIndex,beginIndex + length - 1) + "...";
... |
l1_pos_2953 | 1 | equivalent | [
2953
] | fempd_verified_pairs | boolean areEqual(byte[] a,byte[] b){
if (a == b) {
return true;
}
if (a == null || b == null) {
return false;
}
if (a.length != b.length) {
return false;
}
for (int i=0; i != a.length; i++) {
if (a[i] != b[i]) {
return false;
}
}
return true;
}
| boolean byteArrayEquals(byte[] lhs,byte[] rhs){
if (lhs == null && rhs != null || lhs != null && rhs == null) {
return false;
}
if (lhs == rhs) {
return true;
}
if (lhs.length != rhs.length) {
return false;
}
for (int i=0; i < lhs.length; i++) {
if (lhs[i] != rhs[i]) {
return false;
... |
l1_pos_7202 | 1 | equivalent | [
7202
] | fempd_verified_pairs | long getShapeLength(int ndim,int elementCount,int[] shape){
long length=elementCount;
for (int i=0; i < ndim; i++) {
length*=shape[i];
}
return length;
}
| long arrayLength(int ndim,int elementCount,int[] lengths){
long arrayLength=elementCount;
for (int i=0; i < ndim; i++) arrayLength*=lengths[i];
return arrayLength;
}
|
l1_neg_5384 | 1 | not_equivalent | [
5384
] | fempd_verified_negative_pairs | int[] Tri(int[] pertinence,int taille){
boolean change=true;
int tmp;
while (change) {
change=false;
for (int i=0; i < taille - 2; i++) {
if (pertinence[i] < pertinence[i + 1]) {
tmp=pertinence[i];
pertinence[i]=pertinence[i + 1];
pertinence[i + 1]=tmp;
change=true;
... | int[] insertionSort(int[] list,int length){
int indx, location, temp;
for (indx=1; indx < length; indx++) {
if (list[indx] < list[indx - 1]) {
temp=list[indx];
location=indx;
do {
list[location]=list[location - 1];
location--;
}
while (location > 0 && list[location - 1] ... |
l1_pos_9925 | 1 | equivalent | [
9925
] | fempd_verified_pairs | int findBefore(String text,int position){
int counter=0;
int foundPos=-1;
int lastspacePos=0;
while ((counter < 16) && (position > 0) && (position < text.length())) {
position--;
if (text.charAt(position) == '\n') {
break;
}
if (text.charAt(position) == '\t') {
break;
}
if (t... | int findBefore(String text,int position){
int counter=0;
while ((counter < 16) && (position > 0) && (position < text.length())) {
position--;
if (text.charAt(position) == '\n') {
break;
}
if (text.charAt(position) == '\t') {
break;
}
if (text.charAt(position) == ' ') {
brea... |
l1_pos_98 | 1 | equivalent | [
98
] | fempd_verified_pairs | int[] decode(byte[] input,int start,int len){
int[] output=new int[len / 4];
for (int i=0, j=start; j < (start + len); i++, j+=4) output[i]=(input[j] & 0xff) | ((input[j + 1] & 0xff) << 8) | ((input[j + 2] & 0xff) << 16)| ((input[j + 3] & 0xff) << 24);
return output;
}
| int[] decode(byte[] input,int start,int len){
int[] output=new int[len / 4];
for (int i=0, j=start; j < start + len; i++, j+=4) output[i]=(input[j] & 0xff) | ((input[j + 1] & 0xff) << 8) | ((input[j + 2] & 0xff) << 16)| ((input[j + 3] & 0xff) << 24);
return output;
}
|
l1_neg_10556 | 1 | not_equivalent | [
10556
] | fempd_verified_negative_pairs | int getHashCode(byte[] data,int off,int len){
if (len <= 0) return 0;
int hashCode=0;
for (int dIndex=off; dIndex < (off + len); dIndex++) hashCode+=(data[dIndex] & 0x00FF);
return hashCode;
}
| int maxAbsPcm(byte[] pcmBuf,int offset,int length){
int max=0;
for (int i=0; i < length; i++) {
int pcm=(0xff & pcmBuf[offset++]) + (pcmBuf[offset++] << 8);
if (pcm < 0) pcm=-pcm;
if (pcm > max) max=pcm;
}
return max;
}
|
l1_pos_13665 | 1 | equivalent | [
13665
] | fempd_verified_pairs | byte[] decode(String s){
byte[] b=new byte[s.length() / 2];
for (int i=0; i < s.length(); i+=2) {
String j=String.valueOf(s.charAt(i));
j=j + String.valueOf(s.charAt(i + 1));
b[i / 2]=(byte)Integer.parseInt(j,16);
}
return b;
}
| byte[] parseHexString(String byteString){
byte result[]=new byte[byteString.length() / 2];
for (int i=0; i < byteString.length(); i+=2) {
String toParse=byteString.substring(i,i + 2);
result[i / 2]=(byte)Integer.parseInt(toParse,16);
}
return result;
}
|
l1_pos_9196 | 1 | equivalent | [
9196
] | fempd_verified_pairs | int indexOf(byte[] bytes,int start,byte value){
if (start > bytes.length) return -1;
for (int i=start; i != bytes.length; i++) {
if (bytes[i] == value) return i;
}
return -1;
}
| int indexOf(byte[] buf,int begin,byte b){
for (int i=begin; i < buf.length; i++) {
if (buf[i] == b) return i;
}
return -1;
}
|
l1_pos_879 | 1 | equivalent | [
879
] | fempd_verified_pairs | boolean compareByteArrays(byte[] b1,byte[] b2){
for (int i=0; i < b2.length && i < b1.length; i++) {
if (b2[i] != b1[i]) {
return false;
}
}
return true;
}
| boolean equals(byte[] x,byte[] y){
int len=x.length < y.length ? x.length : y.length;
int offset=0;
while (len > 0) {
if (x[offset] != y[offset]) return false;
offset++;
len--;
}
return true;
}
|
l1_pos_10026 | 1 | equivalent | [
10026
] | fempd_verified_pairs | int compare(Long o1,Long o2){
if (o1 == o2) return 0;
if (o1 == null) return -1;
if (o2 == null) return 1;
if (o1.longValue() < o2.longValue()) return -1;
if (o1.longValue() > o2.longValue()) return 1;
return 0;
}
| int compare(Long l1,Long l2){
if (l1 == null) {
return l2 == null ? 0 : -1;
}
else if (l2 == null) {
return 1;
}
return l1.longValue() < l2.longValue() ? -1 : l1.longValue() > l2.longValue() ? 1 : 0;
}
|
l1_pos_11317 | 1 | equivalent | [
11317
] | fempd_verified_pairs | int compte(String chaine,String partie){
if (chaine == null || partie == null || chaine.equals("") || partie.equals("")) {
return 0;
}
int nb=0;
int indice=0;
while ((indice=chaine.indexOf(partie,indice)) >= 0) {
indice+=partie.length();
nb++;
}
return nb;
}
| int compte(String chaine,String partie){
if ((chaine == null) || (partie == null) || (chaine.equals(""))|| (partie.equals(""))) {
return 0;
}
int nb=0;
int indice=0;
while ((indice=chaine.indexOf(partie,indice)) >= 0) {
indice+=partie.length();
nb++;
}
return nb;
}
|
l1_neg_13014 | 1 | not_equivalent | [
13014
] | fempd_verified_negative_pairs | long TryParseHex(String s){
if (s == null || s.isEmpty()) {
return 0L;
}
try {
return Long.parseLong(s,16);
}
catch ( Throwable t) {
return 0L;
}
}
| long toLong(String value){
try {
if (value == null || value.length() == 0) {
return 0;
}
else {
if (value.charAt(0) == '+') {
value=value.substring(1);
}
return Long.parseLong(value);
}
}
catch ( Exception e) {
return 0;
}
}
|
l1_neg_13328 | 1 | not_equivalent | [
13328
] | fempd_verified_negative_pairs | boolean isNextNil(byte[] dat,int start){
if (start < dat.length - 3) {
return dat[start] == 'N' && dat[start + 1] == 'I' && dat[start + 2] == 'L';
}
return false;
}
| boolean isExifMarkerPrefixed(byte[] data,int pos){
if (data.length >= 6 + pos && data[pos + 0] == 'E' && data[pos + 1] == 'x' && data[pos + 2] == 'i' && data[pos + 3] == 'f' && data[pos + 4] == '\0' && data[pos + 5] == '\0') return true;
return false;
}
|
l1_pos_7974 | 1 | equivalent | [
7974
] | fempd_verified_pairs | boolean stringEquals(String a,String b){
if ((a == null || a.length() == 0) && (b == null || b.length() == 0)) return true;
if (a == null) return false;
return a.equals(b);
}
| boolean isEqual(String string1,String string2){
boolean bIsEmpty1=(string1 == null || string1.length() == 0);
boolean bIsEmpty2=(string2 == null || string2.length() == 0);
if (bIsEmpty1 && bIsEmpty2) return true;
if (bIsEmpty1 || bIsEmpty2) return false;
return string1.equals(string2);
}
|
l1_neg_5735 | 1 | not_equivalent | [
5735
] | fempd_verified_negative_pairs | boolean controlNumber(String s,boolean b){
char c[];
int i, j, k;
c=s.toCharArray();
if (c.length != 2 && b == false) return false;
if (c.length != 4 && b == true) return false;
for (i=0, k=0; i < c.length; i++) if (c[i] - '0' < 0 || c[i] - '0' > 9) return false;
return true;
}
| boolean isNumber(String str,boolean allowSign){
int i=0;
if (str.length() == 0) return false;
if (str.charAt(0) == '+' || str.charAt(0) == '-') i=1;
for (; i < str.length(); i++) {
if (str.charAt(i) < '0' || str.charAt(i) > '9') return false;
}
return true;
}
|
l1_pos_6985 | 1 | equivalent | [
6985
] | fempd_verified_pairs | int min(int a,int b,int c){
if (a <= b && a <= c) return a;
else if (b <= c && b <= a) return b;
else return c;
}
| int minimum(int a,int b,int c){
if ((a <= b) && (a <= c)) {
return a;
}
if ((b <= a) && (b <= c)) {
return b;
}
return c;
}
|
l1_pos_10559 | 1 | equivalent | [
10559
] | fempd_verified_pairs | int computeColorDepth(int colorcount){
if (colorcount <= 2) {
return 1;
}
if (colorcount <= 4) {
return 2;
}
if (colorcount <= 16) {
return 4;
}
return 8;
}
| int computeColorDepth(int colorcount){
if (colorcount <= 2) return 1;
if (colorcount <= 4) return 2;
if (colorcount <= 16) return 4;
return 8;
}
|
l1_neg_1579 | 1 | not_equivalent | [
1579
] | fempd_verified_negative_pairs | boolean areEqual(byte[] a,byte[] b){
if (a == b) {
return true;
}
if (a.length != b.length) {
return false;
}
for (int i=0; i != a.length; i++) {
if (a[i] != b[i]) {
return false;
}
}
return true;
}
| boolean verify(byte[] a,byte[] b){
boolean v=a.length == b.length;
for (int i=0; i < a.length && v; i++) {
if (a[i] != b[i]) v=false;
}
return v;
}
|
l1_pos_368 | 1 | equivalent | [
368
] | fempd_verified_pairs | boolean equals(byte[] x,byte[] y){
if (x == y) {
return true;
}
if (x == null) {
return false;
}
if (x.length != y.length) {
return false;
}
for (int i=0; i < x.length; i++) {
if (y[i] != x[i]) {
return false;
}
}
return true;
}
| boolean contentEquals(byte[] content1,byte[] content2){
if (content1 == null) return (content2 == null);
if (content1.length != content2.length) return false;
for (int i=0; i < content1.length; i++) if (content1[i] != content2[i]) return false;
return true;
}
|
l1_neg_3654 | 1 | not_equivalent | [
3654
] | fempd_verified_negative_pairs | int compareObjects(Object o1,Object o2){
int result=0;
if (o1 != null && o2 != null) {
if (o1 instanceof Number && o2 instanceof Number) {
result=Double.compare(((Number)o1).doubleValue(),((Number)o2).doubleValue());
}
else if (o1.getClass() == o2.getClass() && o1 instanceof Comparable) {
r... | int compare(Object o1,Object o2){
if (o1 == null && o2 == null) {
return 0;
}
else if (o1 == null) {
return -1;
}
else if (o2 == null) {
return 1;
}
else if (o1 == o2 || o1.equals(o2)) {
return 0;
}
else if (!o1.getClass().equals(o2.getClass())) {
return o1.getClass().getName()... |
l1_neg_5035 | 1 | not_equivalent | [
5035
] | fempd_verified_negative_pairs | int clip(int val,int limit){
if (val > limit && limit != 0) {
return limit;
}
else if (val < 0) {
return 0;
}
return val;
}
| int clip(int val,int limit){
if (val >= limit && limit != 0) {
return limit;
}
else if (val < 0) {
return 0;
}
return val;
}
|
l1_neg_8967 | 1 | not_equivalent | [
8967
] | fempd_verified_negative_pairs | boolean isValidDefinedNameChar(char ch){
if (Character.isLetterOrDigit(ch)) {
return true;
}
switch (ch) {
case '.':case '_':case '?':case '\\': return true;
}
return false;
}
| boolean isLegalURLCharacter(char c){
switch (c) {
case '<':case '>':case '(':case ')':case '[':case ']':case '{':case '}': return false;
}
return true;
}
|
l1_neg_6121 | 1 | not_equivalent | [
6121
] | fempd_verified_negative_pairs | float[] toFloatArray(byte[] in_buff,int in_offset,float[] out_buff,int out_offset,int out_len){
int ix=in_offset;
int ox=out_offset;
for (int i=0; i < out_len; i++) {
int x=((in_buff[ix++] & 0xFF) << 24) | ((in_buff[ix++] & 0xFF) << 16) | ((in_buff[ix++] & 0xFF) << 8)| (in_buff[ix++] & 0xFF);
x-=0x7FFFFFF... | float[] toFloatArray(byte[] in_buff,int in_offset,float[] out_buff,int out_offset,int out_len){
int ix=in_offset;
int len=out_offset + out_len;
for (int ox=out_offset; ox < len; ox++) {
out_buff[ox]=((short)((in_buff[ix++] & 0xFF) | (in_buff[ix++] << 8))) * (1.0f / 32767.0f);
}
return out_buff;
}
|
l1_neg_12582 | 1 | not_equivalent | [
12582
] | fempd_verified_negative_pairs | boolean inRangeExclusive(int lowerBound,int value,int upperBound){
if (lowerBound >= value) return false;
if (upperBound <= value) return false;
return true;
}
| boolean areOverlapping(int destination,int source,int length){
if (source + length <= destination || destination + length <= source) {
return false;
}
return true;
}
|
l1_neg_11553 | 1 | not_equivalent | [
11553
] | fempd_verified_negative_pairs | String truncateString(String s,int maxLength){
if (s.length() < maxLength) {
return s;
}
return s.substring(0,maxLength - 3) + "...";
}
| String trim(String s,int length){
if (s.length() >= length) {
return s.substring(0,length - 1);
}
else {
return s;
}
}
|
l1_neg_4228 | 1 | not_equivalent | [
4228
] | fempd_verified_negative_pairs | float lerp(float floor,float ceil,float value){
if (value <= floor) {
return 0;
}
else if (value >= ceil) {
return 1;
}
else {
return (value - floor) / (ceil - floor);
}
}
| float smoothStep(float a,float b,float x){
if (x < a) {
return 0;
}
if (x >= b) {
return 1;
}
x=(x - a) / (b - a);
return x * x * (3 - 2 * x);
}
|
l1_neg_11739 | 1 | not_equivalent | [
11739
] | fempd_verified_negative_pairs | String fill(String s,int n){
if (s == null) return null;
if (s.equals("") || n <= 0) return "";
final StringBuilder r=new StringBuilder(n);
for (int i=0; i < n; i++) {
r.append(s.charAt(i % s.length()));
}
return r.toString();
}
| String left(String s,int count){
if (s == null) {
return null;
}
return s.substring(0,((count < 0) ? 0 : (count < s.length()) ? count : s.length()));
}
|
l1_neg_9179 | 1 | not_equivalent | [
9179
] | fempd_verified_negative_pairs | double poz(double z){
double y, x, w;
double Z_MAX=6.0;
if (z == 0.0) {
x=0.0;
}
else {
y=0.5 * Math.abs(z);
if (y >= (Z_MAX * 0.5)) {
x=1.0;
}
else if (y < 1.0) {
w=y * y;
x=((((((((0.000124818987 * w - 0.001075204047) * w + 0.005198775019) * w - 0.019198292004) * w + 0.... | double normp(double z){
double zabs;
double p;
double expntl, pdf;
final double p0=220.2068679123761;
final double p1=221.2135961699311;
final double p2=112.0792914978709;
final double p3=33.91286607838300;
final double p4=6.373962203531650;
final double p5=.7003830644436881;
final double p6=.352624... |
l1_pos_6667 | 1 | equivalent | [
6667
] | fempd_verified_pairs | float ease(float t,float b,float c,float d){
if (t == 0) return b;
if (t == d) return b + c;
if ((t/=d / 2) < 1) return c / 2 * (float)Math.pow(2,10 * (t - 1)) + b;
return c / 2 * (-(float)Math.pow(2,-10 * --t) + 2) + b;
}
| float easeInOut(float t,float b,float c,float d){
if (t == 0) return b;
if (t == d) return b + c;
if ((t/=d * 0.5f) < 1f) return c * 0.5f * (float)Math.pow(2,10 * (t - 1)) + b;
return c * 0.5f * (-(float)Math.pow(2f,-10f * --t) + 2) + b;
}
|
l1_pos_4054 | 1 | equivalent | [
4054
] | fempd_verified_pairs | char _findMnemonic(String string){
if (string == null) {
return '\0';
}
int index=0;
int length=string.length();
do {
while (index < length && string.charAt(index) != '&') {
index++;
}
if (++index >= length) {
return '\0';
}
if (string.charAt(index) != '&') {
return C... | char _findMnemonic(String string){
if (string == null) return '\0';
int index=0;
int length=string.length();
do {
while (index < length && string.charAt(index) != '&') index++;
if (++index >= length) return '\0';
if (string.charAt(index) != '&') return Character.toLowerCase(string.char... |
l1_neg_5795 | 1 | not_equivalent | [
5795
] | fempd_verified_negative_pairs | boolean equalsBytes(byte[] xbs,int xoff,byte[] ybs,int yoff,int len){
if (xbs.length - xoff < len || ybs.length - yoff < len) {
return false;
}
for (int i=0; i < len; i++) {
if (xbs[xoff + i] != ybs[yoff + i]) {
return false;
}
}
return true;
}
| boolean byteArrayEquals(byte[] buf1,int off1,byte[] buf2,int off2,int len){
if ((off1 + len > buf1.length) || (off2 + len > buf2.length)) {
return (false);
}
for (int i=0; i < len; i++) {
if (buf1[off1 + i] != buf2[off2 + i]) {
return (false);
}
}
return (true);
}
|
l1_pos_8378 | 1 | equivalent | [
8378
] | fempd_verified_pairs | boolean compareBytes(byte[] lhs,byte[] rhs,int rhsOffset){
boolean result=true;
for (int loop=0; loop < lhs.length; loop++) {
if (lhs[loop] != rhs[rhsOffset + loop]) {
result=false;
break;
}
}
return (result);
}
| boolean equalsChv(byte[] chv1,byte[] chv2,int pos2){
for (int i=0; i < chv1.length; i++) {
if (chv1[i] != chv2[pos2 + i]) {
return false;
}
}
return true;
}
|
l1_pos_8861 | 1 | equivalent | [
8861
] | fempd_verified_pairs | boolean isSame(String one,String two){
if (one == null && two == null) {
return true;
}
if (one == null || two == null) {
return false;
}
return one.compareTo(two) == 0;
}
| boolean sameStringValue(String stringA,String stringB){
if (stringA == null) {
if (stringB == null) {
return true;
}
else {
return false;
}
}
if (stringB == null) return false;
if (stringA.compareTo(stringB) == 0) {
return true;
}
else {
return false;
}
}
|
l1_pos_12522 | 1 | equivalent | [
12522
] | fempd_verified_pairs | int strcmp(String str,char[] a,int start){
int i, d, len=str.length();
for (i=0; i < len; i++) {
d=str.charAt(i) - a[start + i];
if (d != 0) {
return d;
}
if (a[start + i] == 0) {
return d;
}
}
if (a[start + i] != 0) {
return -a[start + i];
}
return 0;
}
| int strcmp(String str,char[] a,int start){
int i, d, len=str.length();
for (i=0; i < len; i++) {
d=(int)str.charAt(i) - a[start + i];
if (d != 0) return d;
if (a[start + i] == 0) return d;
}
if (a[start + i] != 0) return (int)-a[start + i];
return 0;
}
|
l1_pos_5310 | 1 | equivalent | [
5310
] | fempd_verified_pairs | boolean isPrime(int n){
if (n <= 0 || n == 1) {
return false;
}
else if (n == 2) {
return true;
}
else {
int i=2;
while (i < n) {
if ((n % i) == 0) {
return false;
}
i++;
}
return true;
}
}
| boolean isPrime(int i){
if (i == 2) return true;
if (i < 2 || i % 2 == 0) return false;
for (int stop=i, j=3; j < stop; stop=i / j, j+=2) if (i % j == 0) return false;
return true;
}
|
l1_pos_8533 | 1 | equivalent | [
8533
] | fempd_verified_pairs | Double string2Double(String dValue){
Double result=null;
if (dValue != null && dValue.trim().length() > 0) {
result=Double.valueOf(dValue);
}
return result;
}
| Double makeDouble(String token){
if (token != null && !"".equals(token.trim())) {
return Double.valueOf(token);
}
else {
return null;
}
}
|
l1_neg_12135 | 1 | not_equivalent | [
12135
] | fempd_verified_negative_pairs | boolean isFixedType(String type){
if (type == null) {
return false;
}
String str=type.trim().toUpperCase();
return "CHAR".equals(str) || "VARCHAR".equals(str) || "NVARCHAR".equals(str)|| "DECIMAL".equals(str)|| "NUMERIC".equals(str);
}
| boolean isSafeFileName(String name){
if (name == null) return false;
if (name.length() == 0) return false;
boolean safeChars=name.matches("[a-zA-Z0-9-_.]*");
boolean doubleDot=(name.indexOf("..") >= 0);
boolean hidden=name.startsWith(".");
boolean root=name.startsWith("/");
boolean legal=safeChars & !... |
l1_pos_9439 | 1 | equivalent | [
9439
] | fempd_verified_pairs | int Maximum(int[] vet){
int max=vet[0];
for (int i=1; i < vet.length; i++) {
if (vet[i] > max) {
max=vet[i];
}
}
return (max);
}
| int max(int[] _d){
int max=_d[0];
for (int i=1; i < _d.length; i++) {
if (_d[i] > max) max=_d[i];
}
return max;
}
|
l1_neg_8669 | 1 | not_equivalent | [
8669
] | fempd_verified_negative_pairs | int intCeil(double n){
double ceil=Math.ceil(n);
if (ceil >= Integer.MAX_VALUE) return Integer.MAX_VALUE;
if (ceil <= Integer.MIN_VALUE) return Integer.MIN_VALUE;
return (int)ceil;
}
| int intFloor(double n){
double floor=Math.floor(n);
if (floor >= Integer.MAX_VALUE) return Integer.MAX_VALUE;
if (floor <= Integer.MIN_VALUE) return Integer.MIN_VALUE;
return (int)floor;
}
|
l1_neg_8117 | 1 | not_equivalent | [
8117
] | fempd_verified_negative_pairs | String appendSpaceBefore(int level,String value){
StringBuilder dest=new StringBuilder(value.length() + level);
for (int pad=0; pad < level; pad++) {
dest.append(' ').append(' ');
}
value=dest.append(value).toString();
return value;
}
| String convertToNonBreakingSpaces(int preSpaces,String s){
StringBuilder b=new StringBuilder(preSpaces + s.length());
for (int i=0; i < preSpaces; i++) b.append(' ');
b.append(s.replace(' ',' '));
return b.toString();
}
|
l1_neg_10321 | 1 | not_equivalent | [
10321
] | fempd_verified_negative_pairs | int toIntNumber(byte[] p,int off,int len){
int ret=0;
int done=off + len;
for (int i=off; i < done; i++) ret=((ret << 8) & 0xffffffff) + (p[i] & 0xff);
return ret;
}
| int extractInteger(byte[] bytes,int pos,int cnt){
int value=0;
for (int i=0; i < cnt; i++) value|=((bytes[pos + cnt - i - 1] & 0xff) << 8 * i);
return value;
}
|
l1_pos_22 | 1 | equivalent | [
22
] | fempd_verified_pairs | Long toLong(String t){
if (t != null) {
return Long.parseLong(t);
}
return null;
}
| Long getLongfromString(String longstring){
Long longresult=null;
if (!(longstring == null)) {
longresult=Long.valueOf(longstring).longValue();
}
return longresult;
}
|
l1_pos_2528 | 1 | equivalent | [
2528
] | fempd_verified_pairs | boolean equals(byte[] bytes1,byte[] bytes2){
if (bytes1 == null && bytes2 == null) {
return true;
}
else if (bytes1 == null || bytes2 == null) {
return false;
}
if (bytes1.length != bytes2.length) {
return false;
}
for (int i=0; i < bytes1.length; i++) {
if (bytes1[i] != bytes2[i]) {
... | boolean equals(byte[] a1,byte[] a2){
if (a1 == a2) {
return true;
}
try {
if (a1.length == a2.length) {
for (int i=0; i < a1.length; i++) {
if (a1[i] != a2[i]) {
return false;
}
}
return true;
}
}
catch ( NullPointerException e) {
}
return false;
}
|
l1_neg_4919 | 1 | not_equivalent | [
4919
] | fempd_verified_negative_pairs | Calendar parseDate(String s){
try {
int year=0, month=0, day=0;
if (s.length() == 8) {
year=Integer.parseInt(s.substring(0,4));
month=Integer.parseInt(s.substring(4,6)) - 1;
day=Integer.parseInt(s.substring(6,8));
}
else if (s.length() == 6) {
year=Integer.parseInt(s.substring... | Calendar getCalendar(String data){
String[] fields=data.split(":");
if (fields.length != 2) return null;
String[] date=fields[0].split("/");
String[] time=fields[1].split("\\.");
if (date.length != 3) return null;
if (time.length != 2) return null;
int year, month, day, hour, minute;
try {
yea... |
l1_pos_6589 | 1 | equivalent | [
6589
] | fempd_verified_pairs | boolean equals(long[] a1,long[] a2){
if (a1 == a2) {
return true;
}
try {
if (a1.length == a2.length) {
for (int i=0; i < a1.length; i++) {
if (a1[i] != a2[i]) {
return false;
}
}
return true;
}
}
catch ( NullPointerException e) {
}
return false;
}
| boolean equals(long[] a1,long[] a2){
if (a1 == a2) return true;
if (null == a1 || null == a2) return false;
if (a1.length == a2.length) {
int i=a1.length;
while (--i >= 0) if (a1[i] != a2[i]) return false;
return true;
}
return false;
}
|
l1_pos_3110 | 1 | equivalent | [
3110
] | fempd_verified_pairs | String[] split(String in,String sp){
Vector vecTmp=new Vector();
String strTmp="";
String[] out=null;
int pointer=0, p2=0;
if (in.indexOf(sp) < 0) {
out=new String[1];
out[0]=in;
return out;
}
if (!in.endsWith(sp)) in=in + sp;
while ((p2=in.indexOf(sp,pointer)) >= 0) {
vecTmp.addElemen... | String[] split(String text,String run){
int n=1;
int i=text.indexOf(run);
String[] lines;
int runLen=run.length();
if (i < 0 || runLen == 0) {
lines=new String[1];
lines[0]=text;
return lines;
}
int len=text.length() - runLen;
for (; i >= 0 && i < len; n++) i=text.indexOf(run,i + runLen);
... |
l1_pos_2704 | 1 | equivalent | [
2704
] | fempd_verified_pairs | boolean areEqual(byte[] a,byte[] b){
int aLength=a.length;
if (aLength != b.length) return false;
for (int i=0; i < aLength; i++) if (a[i] != b[i]) return false;
return true;
}
| boolean comparePassword(byte[] text,byte[] password){
if (text.length != password.length) return false;
for (int i=0; i < text.length && i < password.length; i++) {
if (text[i] != password[i]) return false;
}
return true;
}
|
l1_neg_13254 | 1 | not_equivalent | [
13254
] | fempd_verified_negative_pairs | String generateRandomString(String charPool,int length){
final Random rnd=new Random();
final int charPoolLength=charPool.length();
char c;
double r;
int pos;
final StringBuilder sb=new StringBuilder(length);
for (int i=0; i < length; i++) {
r=rnd.nextDouble();
pos=(int)Math.abs(r * (charPoolLengt... | String generateRandomString(String chars,int length){
StringBuffer result=new StringBuffer(length);
int charsLength=chars.length();
for (int i=0; i < length; i++) {
result.append(chars.charAt((int)(Math.random() * charsLength)));
}
return result.toString();
}
|
l1_pos_6114 | 1 | equivalent | [
6114
] | fempd_verified_pairs | byte SumCheck(byte[] buf,int len){
byte sum_check=0;
for (int i=0; i < len; i++) {
sum_check^=buf[i] & 0xff;
}
return sum_check;
}
| byte packetCRC(byte[] buffer,int bufSize){
byte tmpCRC=0;
int i;
for (i=0; i < bufSize; i++) {
tmpCRC^=buffer[i];
}
return tmpCRC;
}
|
l1_pos_12070 | 1 | equivalent | [
12070
] | fempd_verified_pairs | String getDay(int day){
if (day == Calendar.MONDAY) return "MONDAY";
else if (day == Calendar.TUESDAY) return "TUESDAY";
else if (day == Calendar.WEDNESDAY) return "WEDNESDAY";
else if (day == Calendar.THURSDAY) return "THURSDAY";
else if (day == Calendar.FRIDAY) return "FRIDAY";
else if (day... | String num2dow(int num){
String retval=null;
switch (num) {
case Calendar.SUNDAY: retval="SUNDAY";
break;
case Calendar.MONDAY:retval="MONDAY";
break;
case Calendar.TUESDAY:retval="TUESDAY";
break;
case Calendar.WEDNESDAY:retval="WEDNESDAY";
break;
case Calendar.THURSDAY:retval="THURSDAY";
break;
case Calendar.F... |
l1_neg_3848 | 1 | not_equivalent | [
3848
] | fempd_verified_negative_pairs | double manhattanDistance(double[] doubleArray,double[] d2Array){
double temp=0;
double sum=0;
for (int i=0; i < doubleArray.length; i++) {
temp=doubleArray[i] - d2Array[i];
if (temp < 0) {
sum-=temp;
}
else {
sum+=temp;
}
}
return sum;
}
| double calculateDistance(double[] value1,double[] value2){
double max=Double.NEGATIVE_INFINITY;
for (int i=0; i < value1.length; i++) {
double v1=value1[i];
double v2=value2[i];
if ((!Double.isNaN(v1)) && (!Double.isNaN(v2))) {
double d=Math.abs(v1 - v2);
if (d > max) max=d;
}
}
... |
l1_neg_11457 | 1 | not_equivalent | [
11457
] | fempd_verified_negative_pairs | Date dateExtractor(String a){
if (a.equalsIgnoreCase("")) {
return new Date();
}
String dateString=null;
String hourString=null;
if (a.indexOf(" ") > 0) {
dateString=a.substring(0,a.indexOf(" "));
hourString=a.substring(a.indexOf(" "));
}
else {
dateString=a.trim();
}
Date date=new Date... | Date dateExtractor(String a){
if (a.equalsIgnoreCase("")) {
return new Date();
}
String dateString=null;
if (a.indexOf(" ") > 0) {
dateString=a.substring(0,a.indexOf(" "));
}
else {
dateString=a.trim();
}
Date date=new Date();
StringTokenizer st=new StringTokenizer(dateString.trim(),"-");
... |
l1_neg_9955 | 1 | not_equivalent | [
9955
] | fempd_verified_negative_pairs | int hashCode(byte[] array,int start,int end){
int code=0;
for (int i=end - 1; i >= start; i--) code=code * 31 + array[i];
return code;
}
| int sum(byte[] bytes,int start,int end){
int sum=0;
for (int i=start; i < end; i++) {
byte b=bytes[i];
sum+=b;
}
return sum;
}
|
l1_neg_10402 | 1 | not_equivalent | [
10402
] | fempd_verified_negative_pairs | boolean isRecognizedSectionType(char sectionType){
switch (Character.toLowerCase(sectionType)) {
case ' ':case 'r':case 'e':case 'c':case 'u':case 's':case 'd':{
return true;
}
default:{
return false;
}
}
}
| boolean isChar(char x){
boolean b=true;
switch (x) {
case '1':case '2':case '3':case '4':case '5':case '6':case '7':case '8':case '9':case '0': b=false;
break;
default:b=true;
}
return b;
}
|
l1_neg_7862 | 1 | not_equivalent | [
7862
] | fempd_verified_negative_pairs | boolean hasEmpty(String[] list){
if (list == null || list.length == 0) {
return true;
}
String str=null;
int len=list.length;
for (int i=0; i < len; i++) {
str=list[i];
if (str == null || "".equals(str)) {
return true;
}
}
return false;
}
| boolean isUniversalMatch(String[] sa){
if (sa == null || sa.length == 0) return true;
for (int i=0; i < sa.length; i++) {
if (sa[i] == null || sa[i].equals("*")) return true;
}
return false;
}
|
l1_pos_10052 | 1 | equivalent | [
10052
] | fempd_verified_pairs | String getDelimitedSubstring(String text,String startDelimiter,String endDelimiter){
int start;
int stop;
String subStr="";
if ((text != null) && (startDelimiter != null) && (endDelimiter != null)) {
start=text.indexOf(startDelimiter);
if (start >= 0) {
stop=text.indexOf(endDelimiter,start + 1);
... | String getDelimitedSubstring(String text,String startDelimiter,String endDelimiter){
int start;
int stop;
String subStr="";
if ((text != null) && (startDelimiter != null) && (endDelimiter != null)) {
start=text.indexOf(startDelimiter);
if (start >= 0) {
stop=text.indexOf(endDelimiter,start + 1);
... |
l1_pos_8141 | 1 | equivalent | [
8141
] | fempd_verified_pairs | float Dot(float[] row,float[] col,int size){
float result=0;
for (int i=0; i < size; i++) result+=row[i] * col[i];
return result;
}
| float dotProduct(float[] row,float[] col,int size){
float result=0.0f;
for (int i=0; i < size; i++) {
result+=row[i] * col[i];
}
return result;
}
|
l1_pos_4464 | 1 | equivalent | [
4464
] | fempd_verified_pairs | double aritmetickaSredina(double[] polje){
if (polje.length == 0) return 0;
double zbroj=0;
for (int i=0; i < polje.length; i++) {
zbroj+=polje[i];
}
return zbroj / polje.length;
}
| double execute(double[] values){
int len=values.length;
if (len > 0) {
double sum=0;
for ( double v : values) {
sum+=v;
}
return sum / len;
}
else {
return 0;
}
}
|
l1_neg_12413 | 1 | not_equivalent | [
12413
] | fempd_verified_negative_pairs | String doso(String content,int length){
if (null != content && !"".equals(content)) {
if (content.length() > length) {
content=content.substring(0,length) + "...";
}
return content;
}
else {
return "";
}
}
| String trimToSize(String orig,int length){
if (orig == null) return "";
if (orig.length() < length) return orig;
else return orig.substring(0,length);
}
|
l1_neg_8905 | 1 | not_equivalent | [
8905
] | fempd_verified_negative_pairs | double normalRelativeAngle(double angle){
if (angle > 180) return ((angle + 180) % 360) - 180;
if (angle < -180) return ((angle - 180) % 360) + 180;
return angle;
}
| double normalize_longitude(double lon){
double times;
if (lon >= -180.0 && lon <= 180.0) {
return (lon);
}
else {
times=Math.floor((Math.abs(lon) + 180.0) / 360.0);
if (lon < 0.0) {
return (lon + 360.0 * times);
}
else {
return (lon - 360.0 * times);
}
}
}
|
l1_pos_6213 | 1 | equivalent | [
6213
] | fempd_verified_pairs | boolean isEqual(boolean[] a,boolean[] b){
if (a == null) {
return b == null;
}
if (b == null) {
return false;
}
if (a.length != b.length) {
return false;
}
for (int i=a.length - 1; i >= 0; i--) {
if (a[i] != b[i]) {
return false;
}
}
return true;
}
| boolean areEqual(boolean[] a,boolean[] b){
if (a == b) {
return true;
}
if (a == null || b == null) {
return false;
}
if (a.length != b.length) {
return false;
}
for (int i=0; i != a.length; i++) {
if (a[i] != b[i]) {
return false;
}
}
return true;
}
|
l1_neg_8326 | 1 | not_equivalent | [
8326
] | fempd_verified_negative_pairs | int findClosingBracket(String str,int start){
int pos=start;
int open=1;
while (open > 0 && pos < str.length()) {
if (str.charAt(pos) == '(') open++;
if (str.charAt(pos) == ')') open--;
pos++;
}
if (open > 0) return -1;
return pos;
}
| int getBracketBlockEndPos(String expr,int offset){
int depth=1, i, len=expr.length();
for (i=offset + 1; i < len && depth != 0; i++) {
char c=expr.charAt(i);
if (c == ')') depth--;
else if (c == '(') depth++;
}
return (i < len || depth == 0) ? i : -1;
}
|
l1_neg_1929 | 1 | not_equivalent | [
1929
] | fempd_verified_negative_pairs | Byte toByte(Object value){
if (value == null) {
return null;
}
if (value instanceof Byte) {
return (Byte)value;
}
return Byte.valueOf(value.toString());
}
| Byte toByte(Object value){
if (value != null) {
if (value instanceof Byte) {
return (Byte)value;
}
else if (value instanceof Number) {
return Byte.valueOf(((Number)value).byteValue());
}
else {
byte byteValue=Byte.parseByte(value.toString());
return Byte.valueOf(byteValue);
... |
l1_neg_6623 | 1 | not_equivalent | [
6623
] | fempd_verified_negative_pairs | double round(double v,int a){
double p=1;
for (int i=0; i < java.lang.Math.abs(a); i++) {
p*=10;
}
return a < 0 ? ((long)(v / p)) * p : ((long)(v * p)) / p;
}
| double r(double x,int precision){
double ret;
if (precision == 0) {
ret=(long)x;
}
else {
ret=(long)(x * Math.pow(10,precision));
ret=ret / (Math.pow(10,precision));
}
return ret;
}
|
l1_neg_6262 | 1 | not_equivalent | [
6262
] | fempd_verified_negative_pairs | String dummy_quality_value(int value,int line_length,int total_length){
StringBuffer buff=new StringBuffer();
for (int i=0; i < total_length; i+=line_length) {
for (int j=0; j < line_length && i + j < total_length; j++) {
buff.append(value + " ");
}
buff.append("\n");
}
return buff.toString();... | String generaContrasena(int cars,int nums,int esps){
StringBuffer sb=new StringBuffer("");
int c=0, n=0, e=0, tmp;
Random r=new Random(Calendar.getInstance().getTimeInMillis());
char ch;
while (true) {
tmp=r.nextInt(126);
if (tmp < 33) {
continue;
}
ch=(char)tmp;
if (Character.isWhit... |
l1_neg_8753 | 1 | not_equivalent | [
8753
] | fempd_verified_negative_pairs | boolean isNumberChar(char c){
if (Character.isDigit(c)) return true;
switch (c) {
case '.':case '+':case '-':case 'd':case 'D':case 'e':case 'E':case 'f':case 'F': return true;
default: return false;
}
}
| boolean isProto(char c){
if (Character.isLetterOrDigit(c)) {
return true;
}
if (c == '+' || c == '-' || c == '.') {
return true;
}
return false;
}
|
l1_pos_523 | 1 | equivalent | [
523
] | fempd_verified_pairs | boolean equals(byte[] arr1,byte[] arr2){
if (arr1 == null || arr2 == null) return arr1 == arr2;
if (arr1.length != arr2.length) return false;
for (int i=0; i < arr1.length; i++) {
if (arr1[i] != arr2[i]) return false;
}
return true;
}
| boolean compareSecure(byte[] test,byte[] good){
if ((test == null) || (good == null)) {
return (test == null) && (good == null);
}
if (test.length != good.length) {
return false;
}
if (test.length == 0) {
return true;
}
int bits=0;
for (int i=0; i < good.length; i++) {
bits|=test[i] ^ go... |
l1_pos_1812 | 1 | equivalent | [
1812
] | fempd_verified_pairs | String getData(byte[] data){
StringBuilder sb=new StringBuilder();
for ( byte b : data) {
if (b < 0) sb.append(Integer.toHexString(256 + b));
else if (b < 16) sb.append("0").append(Integer.toHexString(b));
else sb.append(Integer.toHexString(b));
}
return sb.toString();
}
| String encodeHexBinary(byte[] bytes){
StringBuilder sb=new StringBuilder();
for (int i=0; i < bytes.length; i++) {
byte b=bytes[i];
if (b < 0) sb.append(Integer.toHexString(256 + b));
else if (b < 16) sb.append("0").append(Integer.toHexString(b));
else sb.append(Integer.toHexString(b));
... |
l1_neg_9408 | 1 | not_equivalent | [
9408
] | fempd_verified_negative_pairs | String MonthtoGoogle(Calendar cal){
String month=null;
if (cal.get(Calendar.MONTH) == Calendar.JANUARY) month="Jan";
else if (cal.get(Calendar.MONTH) == Calendar.FEBRUARY) month="Feb";
else if (cal.get(Calendar.MONTH) == Calendar.MARCH) month="Mar";
else if (cal.get(Calendar.MONTH) == Calendar.APRIL)... | String getMonth(Calendar d){
String month="";
switch (d.get(Calendar.MONTH)) {
case 0: month="Jan";
break;
case 1:month="Feb";
break;
case 2:month="Mar";
break;
case 3:month="Apr";
break;
case 4:month="May";
break;
case 5:month="Jun";
break;
case 6:month="Jul";
break;
case 7:month="Aug";
break;
case 8:month="Sep... |
l1_pos_10906 | 1 | equivalent | [
10906
] | fempd_verified_pairs | boolean isSchemeChar(char c){
if (c == '+' || c == '.' || c == '-') {
return true;
}
if (Character.isLetterOrDigit(c)) {
return true;
}
return false;
}
| boolean isProto(char c){
if (Character.isLetterOrDigit(c)) {
return true;
}
if ((c == '+') || (c == '-') || (c == '.')) {
return true;
}
return false;
}
|
l1_neg_7871 | 1 | not_equivalent | [
7871
] | fempd_verified_negative_pairs | boolean validateName(String name,int minLength){
boolean validated=true;
if (!(name.matches("^[a-zA-Z.]+$"))) {
validated=false;
}
if (name.length() > 15 || name.length() < minLength) {
validated=false;
}
if ((minLength == 0) && (name.equals(""))) {
validated=true;
}
return validated;
}
| boolean verifiyChecksum(String nmeasentence,int checksum){
int sum=0;
for (int i=0; i < nmeasentence.length(); i++) {
char value=nmeasentence.charAt(i);
if (value != '$' && value != '*') {
sum^=value;
}
}
if (sum == checksum) return true;
return false;
}
|
l1_neg_899 | 1 | not_equivalent | [
899
] | fempd_verified_negative_pairs | double[] setLengthFromEnd(double[] data,int length){
double[] ans=new double[length];
int debut;
if (length - data.length < 0) debut=data.length - length;
else debut=0;
System.arraycopy(data,debut,ans,-data.length + length + debut,data.length - debut);
return (ans);
}
| double[] setLengthFromBeginning(double[] data,int length){
double[] ans=new double[length];
int debut;
if (length - data.length < 0) debut=data.length - length;
else debut=0;
System.arraycopy(data,0,ans,0,data.length - debut);
return (ans);
}
|
l1_pos_3951 | 1 | equivalent | [
3951
] | fempd_verified_pairs | double getAngle(double xHaarResponse,double yHaarResponse){
if (xHaarResponse >= 0 && yHaarResponse >= 0) return Math.atan(yHaarResponse / xHaarResponse);
if (xHaarResponse < 0 && yHaarResponse >= 0) return Math.PI - Math.atan(-yHaarResponse / xHaarResponse);
if (xHaarResponse < 0 && yHaarResponse < 0) retu... | double getAngle(double xDiff,double yDiff){
double angle=0;
if ((xDiff >= 0) && (yDiff >= 0)) {
angle=Math.atan(yDiff / xDiff);
}
else if ((xDiff < 0) && (yDiff >= 0)) {
angle=Math.PI + Math.atan(yDiff / xDiff);
}
else if ((xDiff < 0) && (yDiff < 0)) {
angle=Math.PI + Math.atan(yDiff / xDiff);... |
l1_neg_1040 | 1 | not_equivalent | [
1040
] | fempd_verified_negative_pairs | boolean arrayEquals(byte[] b1,byte[] b2){
if (b1 == null || b2 == null || b1.length != b2.length) {
return false;
}
for (int i=0; i < b1.length; i++) {
if (b1[i] != b2[i]) {
return false;
}
}
return true;
}
| boolean isEquals(byte[] b1,byte[] b2){
if (b1 == b2) return true;
if (b1 == null || b2 == null) return false;
int length=b1.length;
if (length != b2.length) return false;
for (int index=0; index < length; index++) {
if (!(b1[index] == b2[index])) return false;
}
return true;
}
|
l1_neg_4860 | 1 | not_equivalent | [
4860
] | fempd_verified_negative_pairs | String newValueToInsert(String w,int length,int index){
if (w.length() < length) return w;
else {
String newValue=w.substring(w.length() - length,w.length());
return newValue;
}
}
| String newValueToInsert(String w,int length,int index){
if (w.length() < length) return w;
else {
return w.substring(0,length);
}
}
|
l1_pos_11162 | 1 | equivalent | [
11162
] | fempd_verified_pairs | int diff_commonSuffix(String text1,String text2){
int text1_length=text1.length();
int text2_length=text2.length();
int n=Math.min(text1_length,text2_length);
for (int i=1; i <= n; i++) {
if (text1.charAt(text1_length - i) != text2.charAt(text2_length - i)) {
return i - 1;
}
}
return n;
}
| int longestCommonSuffixLength(String s,String t){
int i=s.length() - 1;
int j=t.length() - 1;
for (; i >= 0 && j >= 0; --i, --j) if (s.charAt(i) != t.charAt(j)) return s.length() - (i + 1);
return s.length() - (i + 1);
}
|
l1_pos_5989 | 1 | equivalent | [
5989
] | fempd_verified_pairs | float atof(String in){
if (in == null || in.length() == 0) return 0;
try {
return Float.parseFloat(in);
}
catch ( Exception e) {
return 0;
}
}
| float TryParseFloat(String s){
if (s == null || s.isEmpty()) {
return 0.0f;
}
try {
return Float.parseFloat(s);
}
catch ( Throwable t) {
return 0.0f;
}
}
|
CodeWalk — Clone Equivalence
Decide whether two composite Java programs are semantically equivalent. A level-N
task chains N method pairs on each side; the composition is equivalent only if every
constituent pair is equivalent, and not_equivalent when exactly one non-equivalent pair is
injected. Part of the CodeWalk benchmark suite.
- 100 tasks per level for L1–L3, balanced 50
equivalent/ 50not_equivalent. - Single-call classification task (no tool access): the model reads both programs and emits one verdict.
Note on splits. These are the balanced 100-per-level sample sets. The accompanying paper reports results on its held-out evaluation splits (86 / 82 / 84 / 166 tasks at N = 1/2/3/10); confirm which split you intend to publish as canonical before release. L10 is not included in this package.
Schema
| field | description |
|---|---|
id |
unique task id (e.g. l2_pos_3204_11908) |
level |
composition depth N (1/2/3) |
label |
equivalent | not_equivalent (the target) |
component_pairids |
list of the atomic FEMPD pair ids composing the task |
source |
provenance tag (*_accepted_positive / *_accepted_negative, etc.) |
side_a_code |
first composite Java program |
side_b_code |
second composite Java program |
(Schema normalized across levels: L1's original single pairid is represented here as a
one-element component_pairids list.)
Loading
from datasets import load_dataset
ds = load_dataset("CodeWalk/clone-equivalence", split="level_2")
Provenance, license & attribution
Atomic pairs are drawn from FEMPD
(YoshikiHigo/FEMPDataset, MIT), a
database of human-labeled functionally-equivalent Java method pairs, re-verified by
execution under two independent test-generation methods. This composed dataset is
distributed under MIT. Please also cite the FEMPD paper (Higo, IEICE Transactions on
Information and Systems, E107.D(6), 2024) as requested by the upstream repository.
Citation
@misc{codewalk2026,
title = {CodeWalk: Generating Coding Benchmarks by Walking a Problem Graph},
author = {CodeWalk Team},
year = {2026},
howpublished = {arXiv preprint (forthcoming)}
}
- Downloads last month
- 56