Download data/level_1.json from CodeWalk/clone-equivalence: direct link, hf CLI and curl.
- Browser
- Download file 91.6 kB
-
https://huggingface.co/datasets/CodeWalk/clone-equivalence/resolve/main/data/level_1.json
- Command line
-
hf download hf://datasets/CodeWalk/clone-equivalence/data/level_1.json
-
curl -L -o level_1.json https://huggingface.co/datasets/CodeWalk/clone-equivalence/resolve/main/data/level_1.json
91.6 kB
| [{"id": "l1_pos_8852", "level": 1, "label": "equivalent", "component_pairids": [8852], "source": "fempd_verified_pairs", "side_a_code": "byte[] getBytes(byte[] source,int offset,int length){\n byte[] bytes=new byte[length];\n for (int i=0; i < length; i++) {\n if (source.length > offset + i) {\n bytes[i]=source[offset + i];\n }\n }\n return bytes;\n}\n", "side_b_code": "byte[] copy(byte[] data,int off,int len){\n byte[] dd=new byte[len];\n for (int si=off, di=0; si < data.length && di < dd.length; si++, di++) dd[di]=data[si];\n return dd;\n}\n"}, {"id": "l1_pos_4399", "level": 1, "label": "equivalent", "component_pairids": [4399], "source": "fempd_verified_pairs", "side_a_code": "String join(String[] array,String delimiter){\n int delimiterLength=delimiter.length();\n if (array.length == 0) return \"\";\n if (array.length == 1) {\n if (array[0] == null) return \"\";\n return array[0];\n }\n int length=0;\n for (int i=0; i < array.length; i++) {\n if (array[i] != null) length+=array[i].length();\n if (i < array.length - 1) length+=delimiterLength;\n }\n StringBuffer result=new StringBuffer(length);\n for (int i=0; i < array.length; i++) {\n if (array[i] != null) result.append(array[i]);\n if (i < array.length - 1) result.append(delimiter);\n }\n return result.toString();\n}\n", "side_b_code": "String join(String[] array,String delimiter){\n int delimiterLength=delimiter.length();\n if (array.length == 0) {\n return \"\";\n }\n if (array.length == 1) {\n if (array[0] == null) {\n return \"\";\n }\n return array[0];\n }\n int length=0;\n for (int i=0; i < array.length; i++) {\n if (array[i] != null) {\n length+=array[i].length();\n }\n if (i < array.length - 1) {\n length+=delimiterLength;\n }\n }\n StringBuffer result=new StringBuffer(length);\n for (int i=0; i < array.length; i++) {\n if (array[i] != null) {\n result.append(array[i]);\n }\n if (i < array.length - 1) {\n result.append(delimiter);\n }\n }\n return result.toString();\n}\n"}, {"id": "l1_neg_8279", "level": 1, "label": "not_equivalent", "component_pairids": [8279], "source": "fempd_verified_negative_pairs", "side_a_code": "boolean firstWordsEqual(String a,String b){\n if (a == b) return true;\n String aw=a.split(\" \",1)[0];\n String bw=b.split(\" \",1)[0];\n return aw.compareTo(bw) == 0;\n}\n", "side_b_code": "boolean certificateNamesMatch(String a,String b){\n String[] partsA=a.split(\", *\");\n Arrays.sort(partsA);\n String[] partsB=b.split(\", *\");\n Arrays.sort(partsB);\n if (partsA.length != partsB.length) {\n return false;\n }\n for (int i=0; i < partsA.length; i++) {\n if (!partsA[i].equals(partsB[i])) {\n return false;\n }\n }\n return true;\n}\n"}, {"id": "l1_neg_13341", "level": 1, "label": "not_equivalent", "component_pairids": [13341], "source": "fempd_verified_negative_pairs", "side_a_code": "byte[] parseByteArray(String hex){\n hex=hex.replaceAll(\" \",\"\");\n byte[] bytes=new byte[hex.length() / 2];\n for (int i=0; i < hex.length(); i+=2) {\n int num=Integer.parseInt(hex.substring(i,i + 2),16);\n bytes[i / 2]=(byte)num;\n }\n return bytes;\n}\n", "side_b_code": "byte[] getBytes(String hexString){\n byte[] bytes=new byte[hexString.length() / 2];\n for (int i=0; i < hexString.length(); i=i + 2) {\n String hex=hexString.substring(i,i + 2);\n int b=Integer.parseInt(hex,16);\n bytes[i / 2]=b > 128 ? (byte)(b - 256) : (byte)b;\n }\n return bytes;\n}\n"}, {"id": "l1_pos_12921", "level": 1, "label": "equivalent", "component_pairids": [12921], "source": "fempd_verified_pairs", "side_a_code": "String fixedStringLength(String s,int length){\n if (s.length() < length) {\n StringBuffer str=new StringBuffer(s);\n for (int i=0; i < length - s.length(); i++) {\n str.append(\" \");\n }\n s=str.toString();\n }\n else if (s.length() > length) {\n s=s.substring(0,length);\n }\n return s;\n}\n", "side_b_code": "String left(String s,int w){\n int n=s.length();\n if (w < n) return s.substring(0,w);\n StringBuilder result=new StringBuilder(s);\n for (int i=n; i < w; i++) {\n result.append(' ');\n }\n return result.toString();\n}\n"}, {"id": "l1_pos_743", "level": 1, "label": "equivalent", "component_pairids": [743], "source": "fempd_verified_pairs", "side_a_code": "long parseValue(String key,long defaultValue){\n final String value=System.getProperty(key);\n if (null == value) {\n return defaultValue;\n }\n try {\n return Long.parseLong(value);\n }\n catch ( final NumberFormatException e) {\n return defaultValue;\n }\n}\n", "side_b_code": "long getLongProperty(String name,long defaultValue){\n String val=System.getProperty(name);\n if (val != null) {\n try {\n return Long.parseLong(val);\n }\n catch ( NumberFormatException e) {\n return defaultValue;\n }\n }\n else {\n return defaultValue;\n }\n}\n"}, {"id": "l1_pos_3938", "level": 1, "label": "equivalent", "component_pairids": [3938], "source": "fempd_verified_pairs", "side_a_code": "int compareBytes(byte[] b1,byte[] b2){\n int max=Math.min(b1.length,b2.length);\n for (int i=0; i < max; i++) {\n int byte1=(b1[i] & 0xff);\n int byte2=(b2[i] & 0xff);\n int diff=byte1 - byte2;\n if (diff != 0) return diff;\n }\n return b1.length - b2.length;\n}\n", "side_b_code": "int compareUnsignedBytes(byte[] key1,byte[] key2){\n int a1Len=key1.length;\n int a2Len=key2.length;\n int limit=Math.min(a1Len,a2Len);\n for (int i=0; i < limit; i++) {\n byte b1=key1[i];\n byte b2=key2[i];\n if (b1 == b2) {\n continue;\n }\n else {\n return (b1 & 0xff) - (b2 & 0xff);\n }\n }\n return (a1Len - a2Len);\n}\n"}, {"id": "l1_neg_10346", "level": 1, "label": "not_equivalent", "component_pairids": [10346], "source": "fempd_verified_negative_pairs", "side_a_code": "boolean startsWith(CharSequence text,CharSequence prefix){\n int p_length=prefix.length();\n if (p_length > text.length()) {\n return false;\n }\n for (int x=0; x < p_length; x++) {\n if (text.charAt(x) != prefix.charAt(x)) return false;\n }\n return true;\n}\n", "side_b_code": "boolean startsWithIgnoreCase(CharSequence s,CharSequence t){\n if (s.length() < t.length()) {\n return false;\n }\n for (int i=0; i < t.length(); i++) {\n char slc=Character.toLowerCase(s.charAt(i));\n char tlc=Character.toLowerCase(t.charAt(i));\n if (slc != tlc) {\n return false;\n }\n }\n return true;\n}\n"}, {"id": "l1_pos_7110", "level": 1, "label": "equivalent", "component_pairids": [7110], "source": "fempd_verified_pairs", "side_a_code": "int direction(int srcX,int srcY,int destX,int destY){\n int dx=destX - srcX;\n int dy=destY - srcY;\n if (dx < 0) {\n if (dy < 0) {\n if (dx < dy) return 11;\n else if (dx > dy) return 9;\n else return 10;\n }\n else if (dy > 0) {\n if (-dx < dy) return 15;\n else if (-dx > dy) return 13;\n else return 14;\n }\n else {\n return 12;\n }\n }\n else if (dx > 0) {\n if (dy < 0) {\n if (dx < -dy) return 7;\n else if (dx > -dy) return 5;\n else return 6;\n }\n else if (dy > 0) {\n if (dx < dy) return 1;\n else if (dx > dy) return 3;\n else return 2;\n }\n else {\n return 4;\n }\n }\n else {\n if (dy < 0) {\n return 8;\n }\n else if (dy > 0) {\n return 0;\n }\n else {\n return -1;\n }\n }\n}\n", "side_b_code": "int direction(int srcX,int srcY,int destX,int destY){\n int dx=destX - srcX, dy=destY - srcY;\n if (dx < 0) {\n if (dy < 0) {\n if (dx < dy) return 11;\n else if (dx > dy) return 9;\n else return 10;\n }\n else if (dy > 0) {\n if (-dx < dy) return 15;\n else if (-dx > dy) return 13;\n else return 14;\n }\n else {\n return 12;\n }\n }\n else if (dx > 0) {\n if (dy < 0) {\n if (dx < -dy) return 7;\n else if (dx > -dy) return 5;\n else return 6;\n }\n else if (dy > 0) {\n if (dx < dy) return 1;\n else if (dx > dy) return 3;\n else return 2;\n }\n else {\n return 4;\n }\n }\n else {\n if (dy < 0) {\n return 8;\n }\n else if (dy > 0) {\n return 0;\n }\n else {\n return -1;\n }\n }\n}\n"}, {"id": "l1_neg_5885", "level": 1, "label": "not_equivalent", "component_pairids": [5885], "source": "fempd_verified_negative_pairs", "side_a_code": "int binarySearch(int[] index,int key,int begin,int end){\n end--;\n while (begin <= end) {\n int mid=(end + begin) >>> 1;\n if (index[mid] < key) begin=mid + 1;\n else if (index[mid] > key) end=mid - 1;\n else return mid;\n }\n return -begin - 1;\n}\n", "side_b_code": "int binarySearch(int[] array,int value,int fromIndex,int toIndex){\n while (fromIndex < toIndex) {\n int i;\n int nv;\n if ((nv=array[i=(fromIndex + toIndex) >> 1]) < value) {\n fromIndex=i + 1;\n }\n else if (nv > value) {\n toIndex=i;\n }\n else {\n return i;\n }\n }\n return ~fromIndex;\n}\n"}, {"id": "l1_pos_6784", "level": 1, "label": "equivalent", "component_pairids": [6784], "source": "fempd_verified_pairs", "side_a_code": "String numToNth(int num){\n int ones=num % 10;\n int tens=num % 100;\n String suffix=null;\nswitch (ones) {\ncase 1: if (tens == 11) suffix=\"th\";\n else suffix=\"st\";\n break;\ncase 2:if (tens == 12) suffix=\"th\";\n else suffix=\"nd\";\nbreak;\ncase 3:if (tens == 13) suffix=\"th\";\n else suffix=\"rd\";\nbreak;\ndefault:suffix=\"th\";\n}\nreturn num + suffix;\n}\n", "side_b_code": "String formatNumberAsSequence(int num){\n String suffix=\"th\";\nswitch (num % 10) {\ncase 1: if (num % 100 != 11) suffix=\"st\";\n break;\ncase 2:if (num % 100 != 12) suffix=\"nd\";\nbreak;\ncase 3:if (num % 100 != 13) suffix=\"rd\";\nbreak;\n}\nreturn num + suffix;\n}\n"}, {"id": "l1_pos_6774", "level": 1, "label": "equivalent", "component_pairids": [6774], "source": "fempd_verified_pairs", "side_a_code": "byte[] base64Encode(byte[] byteData){\n if (byteData == null) {\n return null;\n }\n int iSrcIdx;\n int iDestIdx;\n byte byteDest[]=new byte[((byteData.length + 2) / 3) * 4];\n for (iSrcIdx=0, iDestIdx=0; iSrcIdx < byteData.length - 2; iSrcIdx+=3) {\n byteDest[iDestIdx++]=(byte)((byteData[iSrcIdx] >>> 2) & 077);\n byteDest[iDestIdx++]=(byte)((byteData[iSrcIdx + 1] >>> 4) & 017 | (byteData[iSrcIdx] << 4) & 077);\n byteDest[iDestIdx++]=(byte)((byteData[iSrcIdx + 2] >>> 6) & 003 | (byteData[iSrcIdx + 1] << 2) & 077);\n byteDest[iDestIdx++]=(byte)(byteData[iSrcIdx + 2] & 077);\n }\n if (iSrcIdx < byteData.length) {\n byteDest[iDestIdx++]=(byte)((byteData[iSrcIdx] >>> 2) & 077);\n if (iSrcIdx < byteData.length - 1) {\n byteDest[iDestIdx++]=(byte)((byteData[iSrcIdx + 1] >>> 4) & 017 | (byteData[iSrcIdx] << 4) & 077);\n byteDest[iDestIdx++]=(byte)((byteData[iSrcIdx + 1] << 2) & 077);\n }\n else byteDest[iDestIdx++]=(byte)((byteData[iSrcIdx] << 4) & 077);\n }\n for (iSrcIdx=0; iSrcIdx < iDestIdx; iSrcIdx++) {\n if (byteDest[iSrcIdx] < 26) byteDest[iSrcIdx]=(byte)(byteDest[iSrcIdx] + 'A');\n else if (byteDest[iSrcIdx] < 52) byteDest[iSrcIdx]=(byte)(byteDest[iSrcIdx] + 'a' - 26);\n else if (byteDest[iSrcIdx] < 62) byteDest[iSrcIdx]=(byte)(byteDest[iSrcIdx] + '0' - 52);\n else if (byteDest[iSrcIdx] < 63) byteDest[iSrcIdx]='+';\n else byteDest[iSrcIdx]='/';\n }\n for (; iSrcIdx < byteDest.length; iSrcIdx++) byteDest[iSrcIdx]='=';\n return byteDest;\n}\n", "side_b_code": "byte[] base64Encode(byte[] byteData){\n if (byteData == null) {\n return null;\n }\n int iSrcIdx;\n int iDestIdx;\n byte byteDest[]=new byte[((byteData.length + 2) / 3) * 4];\n for (iSrcIdx=0, iDestIdx=0; iSrcIdx < byteData.length - 2; iSrcIdx+=3) {\n byteDest[iDestIdx++]=(byte)((byteData[iSrcIdx] >>> 2) & 077);\n byteDest[iDestIdx++]=(byte)((byteData[iSrcIdx + 1] >>> 4) & 017 | (byteData[iSrcIdx] << 4) & 077);\n byteDest[iDestIdx++]=(byte)((byteData[iSrcIdx + 2] >>> 6) & 003 | (byteData[iSrcIdx + 1] << 2) & 077);\n byteDest[iDestIdx++]=(byte)(byteData[iSrcIdx + 2] & 077);\n }\n if (iSrcIdx < byteData.length) {\n byteDest[iDestIdx++]=(byte)((byteData[iSrcIdx] >>> 2) & 077);\n if (iSrcIdx < byteData.length - 1) {\n byteDest[iDestIdx++]=(byte)((byteData[iSrcIdx + 1] >>> 4) & 017 | (byteData[iSrcIdx] << 4) & 077);\n byteDest[iDestIdx++]=(byte)((byteData[iSrcIdx + 1] << 2) & 077);\n }\n else {\n byteDest[iDestIdx++]=(byte)((byteData[iSrcIdx] << 4) & 077);\n }\n }\n for (iSrcIdx=0; iSrcIdx < iDestIdx; iSrcIdx++) {\n if (byteDest[iSrcIdx] < 26) byteDest[iSrcIdx]=(byte)(byteDest[iSrcIdx] + 'A');\n else if (byteDest[iSrcIdx] < 52) byteDest[iSrcIdx]=(byte)(byteDest[iSrcIdx] + 'a' - 26);\n else if (byteDest[iSrcIdx] < 62) byteDest[iSrcIdx]=(byte)(byteDest[iSrcIdx] + '0' - 52);\n else if (byteDest[iSrcIdx] < 63) byteDest[iSrcIdx]='+';\n else byteDest[iSrcIdx]='/';\n }\n for (; iSrcIdx < byteDest.length; iSrcIdx++) {\n byteDest[iSrcIdx]='=';\n }\n return byteDest;\n}\n"}, {"id": "l1_neg_6607", "level": 1, "label": "not_equivalent", "component_pairids": [6607], "source": "fempd_verified_negative_pairs", "side_a_code": "double computeAverage(double[] array,int start,int num){\n double sum=0;\n for (int i=start, stop=start + num; i < stop; i++) {\n sum+=array[i];\n }\n return sum / num;\n}\n", "side_b_code": "double avg(double[] list,int current,int period){\n double result=0;\n for (int i=current; i > current - period; i--) {\n result+=list[i];\n }\n return result / (double)period;\n}\n"}, {"id": "l1_neg_8951", "level": 1, "label": "not_equivalent", "component_pairids": [8951], "source": "fempd_verified_negative_pairs", "side_a_code": "LinkedHashMap sortHashMapByValuesD(HashMap passedMap){\n List mapKeys=new ArrayList(passedMap.keySet());\n List mapValues=new ArrayList(passedMap.values());\n Collections.sort(mapValues);\n Collections.sort(mapKeys);\n Collections.reverse(mapValues);\n LinkedHashMap sortedMap=new LinkedHashMap();\n Iterator valueIt=mapValues.iterator();\n while (valueIt.hasNext()) {\n Object val=valueIt.next();\n Iterator keyIt=mapKeys.iterator();\n while (keyIt.hasNext()) {\n Object key=keyIt.next();\n String comp1=passedMap.get(key).toString();\n String comp2=val.toString();\n if (comp1.equals(comp2)) {\n passedMap.remove(key);\n mapKeys.remove(key);\n sortedMap.put((String)key,(Double)val);\n break;\n }\n }\n }\n return sortedMap;\n}\n", "side_b_code": "LinkedHashMap sortHashMapByValues(HashMap passedMap){\n List mapKeys=new ArrayList(passedMap.keySet());\n List mapValues=new ArrayList(passedMap.values());\n Collections.sort(mapValues);\n Collections.sort(mapKeys);\n LinkedHashMap sortedMap=new LinkedHashMap();\n Iterator valueIt=mapValues.iterator();\n while (valueIt.hasNext()) {\n Object val=valueIt.next();\n Iterator keyIt=mapKeys.iterator();\n while (keyIt.hasNext()) {\n Object key=keyIt.next();\n String comp1=passedMap.get(key).toString();\n String comp2=val.toString();\n if (comp1.equals(comp2)) {\n passedMap.remove(key);\n mapKeys.remove(key);\n sortedMap.put((String)key,(Double)val);\n break;\n }\n }\n }\n return sortedMap;\n}\n"}, {"id": "l1_pos_9100", "level": 1, "label": "equivalent", "component_pairids": [9100], "source": "fempd_verified_pairs", "side_a_code": "int getNbBytes(int length){\n if (length >= 0) {\n if (length < 128) {\n return 1;\n }\n else if (length < 256) {\n return 2;\n }\n else if (length < 65536) {\n return 3;\n }\n else if (length < 16777216) {\n return 4;\n }\n else {\n return 5;\n }\n }\n else {\n return 5;\n }\n}\n", "side_b_code": "int getBERLengthOfLength(int length){\n if (length < 0) {\n return 5;\n }\n else if (length < 0x80) {\n return 1;\n }\n else if (length <= 0xFF) {\n return 2;\n }\n else if (length <= 0xFFFF) {\n return 3;\n }\n else if (length <= 0xFFFFFF) {\n return 4;\n }\n return 5;\n}\n"}, {"id": "l1_neg_7834", "level": 1, "label": "not_equivalent", "component_pairids": [7834], "source": "fempd_verified_negative_pairs", "side_a_code": "boolean nullSafeEquals(Object obj1,Object obj2){\n if (obj1 == null) return (obj2 == null);\n return ((obj2 != null) && obj1.equals(obj2));\n}\n", "side_b_code": "boolean compareMapValues(Object value,Object target){\n if ((value == null) && (target == null)) {\n return true;\n }\n else if ((value == null) || (target == null)) {\n return false;\n }\n else if (value.equals(target)) {\n return true;\n }\n else {\n return value.toString().equals(target.toString());\n }\n}\n"}, {"id": "l1_pos_13009", "level": 1, "label": "equivalent", "component_pairids": [13009], "source": "fempd_verified_pairs", "side_a_code": "int clamp(long value){\n if (value < Integer.MIN_VALUE) return Integer.MIN_VALUE;\n if (value > Integer.MAX_VALUE) return Integer.MAX_VALUE;\n return (int)value;\n}\n", "side_b_code": "int toInt(long value){\n if (value < (long)Integer.MIN_VALUE) {\n return Integer.MIN_VALUE;\n }\n else if (value > (long)Integer.MAX_VALUE) {\n return Integer.MAX_VALUE;\n }\n else {\n return (int)value;\n }\n}\n"}, {"id": "l1_pos_9917", "level": 1, "label": "equivalent", "component_pairids": [9917], "source": "fempd_verified_pairs", "side_a_code": "int getInt(byte[] arr,int offset,int bytes){\n int result=0;\n for (int i=0; i < bytes; i++) {\n result<<=8;\n result|=arr[offset++] & 0xFF;\n }\n return result;\n}\n", "side_b_code": "int bigEndianToUnsignedInt(byte[] b,int offset,int length){\n int v=0;\n while (length-- > 0) {\n v=v << 8 | b[offset++] & 0xff;\n }\n return v;\n}\n"}, {"id": "l1_neg_8079", "level": 1, "label": "not_equivalent", "component_pairids": [8079], "source": "fempd_verified_negative_pairs", "side_a_code": "boolean arrayRegionMatches(char[] source,int sourceStart,char[] target,int targetStart,int len){\n int sourceEnd=sourceStart + len;\n int delta=targetStart - sourceStart;\n for (int i=sourceStart; i < sourceEnd; i++) {\n if (source[i] != target[i + delta]) return false;\n }\n return true;\n}\n", "side_b_code": "boolean regionMatches(char[] pStringA,int pStartPosInA,char[] pStringB,int pStartPosInB,int pLength){\n for (int i=0; i < pLength; i++) {\n if (pStringA[i + pStartPosInA] != pStringB[i + pStartPosInB]) {\n return false;\n }\n }\n return true;\n}\n"}, {"id": "l1_neg_5572", "level": 1, "label": "not_equivalent", "component_pairids": [5572], "source": "fempd_verified_negative_pairs", "side_a_code": "boolean getAsBoolean(String val,boolean dfault){\n try {\n if (val == null) {\n return dfault;\n }\n String s=val.trim().toLowerCase();\n if (s.length() == 0) {\n return dfault;\n }\n ;\n return (s.equals(\"true\") || s.equals(\"yes\") || s.equals(\"T\")|| s.equals(\"Y\"));\n }\n catch ( Exception e) {\n return dfault;\n }\n}\n", "side_b_code": "boolean isMethodName(String name,boolean emptyDefault){\n if (name == null || name.length() == 0) {\n return emptyDefault;\n }\n if (name.startsWith(\"__\") && name.length() > 2) {\n return Character.isLowerCase(name.charAt(2));\n }\n if (name.startsWith(\"_\") && name.length() > 1) {\n return Character.isLowerCase(name.charAt(1));\n }\n return Character.isLowerCase(name.charAt(0));\n}\n"}, {"id": "l1_pos_12411", "level": 1, "label": "equivalent", "component_pairids": [12411], "source": "fempd_verified_pairs", "side_a_code": "String htmlEncode(String text,boolean convertTags){\n if (text == null) return \"\";\n StringBuffer out=new StringBuffer(text.length() * 2);\n char c;\n for (int i=0; i < text.length(); i++) {\n c=text.charAt(i);\n if (c >= 128 || (convertTags && (c == '<' || c == '>' || c == '&' || c == '\"') || c == '\\'')) {\nswitch (c) {\ncase 8222:case 8220: out.append('\\\"');\n break;\ncase '\\'':case 8217: out.append(\"'\");\n break;\ncase '\"':out.append(\""\");\nbreak;\ncase '&':out.append(\"&\");\nbreak;\ncase '<':out.append(\"<\");\nbreak;\ncase '>':out.append(\">\");\nbreak;\ncase '\u00a0':out.append(\" \");\nbreak;\ncase '\u00a1':out.append(\"¡\");\nbreak;\ncase '\u00a2':out.append(\"¢\");\nbreak;\ncase '\u00a3':out.append(\"£\");\nbreak;\ncase '\u00a4':out.append(\"¤\");\nbreak;\ncase '\u00a5':out.append(\"¥\");\nbreak;\ncase '\u00a6':out.append(\"¦\");\nbreak;\ncase '\u00a7':out.append(\"§\");\nbreak;\ncase '\u00a8':out.append(\"¨\");\nbreak;\ncase '\u00a9':out.append(\"©\");\nbreak;\ncase '\u00aa':out.append(\"ª\");\nbreak;\ncase '\u00ab':out.append(\"«\");\nbreak;\ncase '\u00ac':out.append(\"¬\");\nbreak;\ncase '\u00ad':out.append(\"­\");\nbreak;\ncase '\u00ae':out.append(\"®\");\nbreak;\ncase '\u00af':out.append(\"¯\");\nbreak;\ncase '\u00b0':out.append(\"°\");\nbreak;\ncase '\u00b1':out.append(\"±\");\nbreak;\ncase '\u00b2':out.append(\"²\");\nbreak;\ncase '\u00b3':out.append(\"³\");\nbreak;\ncase '\u00b4':out.append(\"´\");\nbreak;\ncase '\u00b5':out.append(\"µ\");\nbreak;\ncase '\u00b6':out.append(\"¶\");\nbreak;\ncase '\u00b7':out.append(\"·\");\nbreak;\ncase '\u00b8':out.append(\"¸\");\nbreak;\ncase '\u00b9':out.append(\"¹\");\nbreak;\ncase '\u00ba':out.append(\"º\");\nbreak;\ncase '\u00bb':out.append(\"»\");\nbreak;\ncase '\u00bc':out.append(\"¼\");\nbreak;\ncase '\u00bd':out.append(\"½\");\nbreak;\ncase '\u00be':out.append(\"¾\");\nbreak;\ncase '\u00bf':out.append(\"¿\");\nbreak;\ncase '\u00c0':out.append(\"À\");\nbreak;\ncase '\u00c1':out.append(\"Á\");\nbreak;\ncase '\u00c2':out.append(\"Â\");\nbreak;\ncase '\u00c3':out.append(\"Ã\");\nbreak;\ncase '\u00c4':out.append(\"Ä\");\nbreak;\ncase '\u00c5':out.append(\"Å\");\nbreak;\ncase '\u00c6':out.append(\"Æ\");\nbreak;\ncase '\u00c7':out.append(\"Ç\");\nbreak;\ncase '\u00c8':out.append(\"È\");\nbreak;\ncase '\u00c9':out.append(\"É\");\nbreak;\ncase '\u00ca':out.append(\"Ê\");\nbreak;\ncase '\u00cb':out.append(\"Ë\");\nbreak;\ncase '\u00cc':out.append(\"Ì\");\nbreak;\ncase '\u00cd':out.append(\"Í\");\nbreak;\ncase '\u00ce':out.append(\"Î\");\nbreak;\ncase '\u00cf':out.append(\"Ï\");\nbreak;\ncase '\u00d0':out.append(\"Ð\");\nbreak;\ncase '\u00d1':out.append(\"Ñ\");\nbreak;\ncase '\u00d2':out.append(\"Ò\");\nbreak;\ncase '\u00d3':out.append(\"Ó\");\nbreak;\ncase '\u00d4':out.append(\"Ô\");\nbreak;\ncase '\u00d5':out.append(\"Õ\");\nbreak;\ncase '\u00d6':out.append(\"Ö\");\nbreak;\ncase '\u00d7':out.append(\"×\");\nbreak;\ncase '\u00d8':out.append(\"Ø\");\nbreak;\ncase '\u00d9':out.append(\"Ù\");\nbreak;\ncase '\u00da':out.append(\"Ú\");\nbreak;\ncase '\u00db':out.append(\"Û\");\nbreak;\ncase '\u00dc':out.append(\"Ü\");\nbreak;\ncase '\u00dd':out.append(\"Ý\");\nbreak;\ncase '\u00de':out.append(\"Þ\");\nbreak;\ncase '\u00df':out.append(\"ß\");\nbreak;\ncase '\u00e0':out.append(\"à\");\nbreak;\ncase '\u00e1':out.append(\"á\");\nbreak;\ncase '\u00e2':out.append(\"â\");\nbreak;\ncase '\u00e3':out.append(\"ã\");\nbreak;\ncase '\u00e4':out.append(\"ä\");\nbreak;\ncase '\u00e5':out.append(\"å\");\nbreak;\ncase '\u00e6':out.append(\"æ\");\nbreak;\ncase '\u00e7':out.append(\"ç\");\nbreak;\ncase '\u00e8':out.append(\"è\");\nbreak;\ncase '\u00e9':out.append(\"é\");\nbreak;\ncase '\u00ea':out.append(\"ê\");\nbreak;\ncase '\u00eb':out.append(\"ë\");\nbreak;\ncase '\u00ec':out.append(\"ì\");\nbreak;\ncase '\u00ed':out.append(\"í\");\nbreak;\ncase '\u00ee':out.append(\"î\");\nbreak;\ncase '\u00ef':out.append(\"ï\");\nbreak;\ncase '\u00f0':out.append(\"ð\");\nbreak;\ncase '\u00f1':out.append(\"ñ\");\nbreak;\ncase '\u00f2':out.append(\"ò\");\nbreak;\ncase '\u00f3':out.append(\"ó\");\nbreak;\ncase '\u00f4':out.append(\"ô\");\nbreak;\ncase '\u00f5':out.append(\"õ\");\nbreak;\ncase '\u00f6':out.append(\"ö\");\nbreak;\ncase '\u00f7':out.append(\"÷\");\nbreak;\ncase '\u00f8':out.append(\"ø\");\nbreak;\ncase '\u00f9':out.append(\"ù\");\nbreak;\ncase '\u00fa':out.append(\"ú\");\nbreak;\ncase '\u00fb':out.append(\"û\");\nbreak;\ncase '\u00fc':out.append(\"ü\");\nbreak;\ncase '\u00fd':out.append(\"ý\");\nbreak;\ncase '\u00fe':out.append(\"þ\");\nbreak;\ncase '\u00ff':out.append(\"ÿ\");\nbreak;\ncase 8364:case 128:out.append(\"€\");\nbreak;\ndefault:out.append(\"&#\").append((int)c).append(';');\nbreak;\n}\n}\n else {\nout.append(c);\n}\n}\nreturn out.toString();\n}\n", "side_b_code": "String unicodeHtmlEscape(String text,boolean convertTags){\n if (text == null) {\n return \"\";\n }\n StringBuffer out=new StringBuffer(text.length() * 2);\n char c;\n for (int i=0; i < text.length(); i++) {\n c=text.charAt(i);\n if (c >= 128 || (convertTags && (c == '<' || c == '>' || c == '&' || c == '\"') || c == '\\'')) {\nswitch (c) {\ncase 8222:case 8220: out.append('\\\"');\n break;\ncase '\\'':case 8217: out.append(\"'\");\n break;\ncase '\"':out.append(\""\");\nbreak;\ncase '&':out.append(\"&\");\nbreak;\ncase '<':out.append(\"<\");\nbreak;\ncase '>':out.append(\">\");\nbreak;\ncase '\u00a0':out.append(\" \");\nbreak;\ncase '\u00a1':out.append(\"¡\");\nbreak;\ncase '\u00a2':out.append(\"¢\");\nbreak;\ncase '\u00a3':out.append(\"£\");\nbreak;\ncase '\u00a4':out.append(\"¤\");\nbreak;\ncase '\u00a5':out.append(\"¥\");\nbreak;\ncase '\u00a6':out.append(\"¦\");\nbreak;\ncase '\u00a7':out.append(\"§\");\nbreak;\ncase '\u00a8':out.append(\"¨\");\nbreak;\ncase '\u00a9':out.append(\"©\");\nbreak;\ncase '\u00aa':out.append(\"ª\");\nbreak;\ncase '\u00ab':out.append(\"«\");\nbreak;\ncase '\u00ac':out.append(\"¬\");\nbreak;\ncase '\u00ad':out.append(\"­\");\nbreak;\ncase '\u00ae':out.append(\"®\");\nbreak;\ncase '\u00af':out.append(\"¯\");\nbreak;\ncase '\u00b0':out.append(\"°\");\nbreak;\ncase '\u00b1':out.append(\"±\");\nbreak;\ncase '\u00b2':out.append(\"²\");\nbreak;\ncase '\u00b3':out.append(\"³\");\nbreak;\ncase '\u00b4':out.append(\"´\");\nbreak;\ncase '\u00b5':out.append(\"µ\");\nbreak;\ncase '\u00b6':out.append(\"¶\");\nbreak;\ncase '\u00b7':out.append(\"·\");\nbreak;\ncase '\u00b8':out.append(\"¸\");\nbreak;\ncase '\u00b9':out.append(\"¹\");\nbreak;\ncase '\u00ba':out.append(\"º\");\nbreak;\ncase '\u00bb':out.append(\"»\");\nbreak;\ncase '\u00bc':out.append(\"¼\");\nbreak;\ncase '\u00bd':out.append(\"½\");\nbreak;\ncase '\u00be':out.append(\"¾\");\nbreak;\ncase '\u00bf':out.append(\"¿\");\nbreak;\ncase '\u00c0':out.append(\"À\");\nbreak;\ncase '\u00c1':out.append(\"Á\");\nbreak;\ncase '\u00c2':out.append(\"Â\");\nbreak;\ncase '\u00c3':out.append(\"Ã\");\nbreak;\ncase '\u00c4':out.append(\"Ä\");\nbreak;\ncase '\u00c5':out.append(\"Å\");\nbreak;\ncase '\u00c6':out.append(\"Æ\");\nbreak;\ncase '\u00c7':out.append(\"Ç\");\nbreak;\ncase '\u00c8':out.append(\"È\");\nbreak;\ncase '\u00c9':out.append(\"É\");\nbreak;\ncase '\u00ca':out.append(\"Ê\");\nbreak;\ncase '\u00cb':out.append(\"Ë\");\nbreak;\ncase '\u00cc':out.append(\"Ì\");\nbreak;\ncase '\u00cd':out.append(\"Í\");\nbreak;\ncase '\u00ce':out.append(\"Î\");\nbreak;\ncase '\u00cf':out.append(\"Ï\");\nbreak;\ncase '\u00d0':out.append(\"Ð\");\nbreak;\ncase '\u00d1':out.append(\"Ñ\");\nbreak;\ncase '\u00d2':out.append(\"Ò\");\nbreak;\ncase '\u00d3':out.append(\"Ó\");\nbreak;\ncase '\u00d4':out.append(\"Ô\");\nbreak;\ncase '\u00d5':out.append(\"Õ\");\nbreak;\ncase '\u00d6':out.append(\"Ö\");\nbreak;\ncase '\u00d7':out.append(\"×\");\nbreak;\ncase '\u00d8':out.append(\"Ø\");\nbreak;\ncase '\u00d9':out.append(\"Ù\");\nbreak;\ncase '\u00da':out.append(\"Ú\");\nbreak;\ncase '\u00db':out.append(\"Û\");\nbreak;\ncase '\u00dc':out.append(\"Ü\");\nbreak;\ncase '\u00dd':out.append(\"Ý\");\nbreak;\ncase '\u00de':out.append(\"Þ\");\nbreak;\ncase '\u00df':out.append(\"ß\");\nbreak;\ncase '\u00e0':out.append(\"à\");\nbreak;\ncase '\u00e1':out.append(\"á\");\nbreak;\ncase '\u00e2':out.append(\"â\");\nbreak;\ncase '\u00e3':out.append(\"ã\");\nbreak;\ncase '\u00e4':out.append(\"ä\");\nbreak;\ncase '\u00e5':out.append(\"å\");\nbreak;\ncase '\u00e6':out.append(\"æ\");\nbreak;\ncase '\u00e7':out.append(\"ç\");\nbreak;\ncase '\u00e8':out.append(\"è\");\nbreak;\ncase '\u00e9':out.append(\"é\");\nbreak;\ncase '\u00ea':out.append(\"ê\");\nbreak;\ncase '\u00eb':out.append(\"ë\");\nbreak;\ncase '\u00ec':out.append(\"ì\");\nbreak;\ncase '\u00ed':out.append(\"í\");\nbreak;\ncase '\u00ee':out.append(\"î\");\nbreak;\ncase '\u00ef':out.append(\"ï\");\nbreak;\ncase '\u00f0':out.append(\"ð\");\nbreak;\ncase '\u00f1':out.append(\"ñ\");\nbreak;\ncase '\u00f2':out.append(\"ò\");\nbreak;\ncase '\u00f3':out.append(\"ó\");\nbreak;\ncase '\u00f4':out.append(\"ô\");\nbreak;\ncase '\u00f5':out.append(\"õ\");\nbreak;\ncase '\u00f6':out.append(\"ö\");\nbreak;\ncase '\u00f7':out.append(\"÷\");\nbreak;\ncase '\u00f8':out.append(\"ø\");\nbreak;\ncase '\u00f9':out.append(\"ù\");\nbreak;\ncase '\u00fa':out.append(\"ú\");\nbreak;\ncase '\u00fb':out.append(\"û\");\nbreak;\ncase '\u00fc':out.append(\"ü\");\nbreak;\ncase '\u00fd':out.append(\"ý\");\nbreak;\ncase '\u00fe':out.append(\"þ\");\nbreak;\ncase '\u00ff':out.append(\"ÿ\");\nbreak;\ncase 8364:case 128:out.append(\"€\");\nbreak;\ndefault:out.append(\"&#\").append((int)c).append(';');\nbreak;\n}\n}\n else {\nout.append(c);\n}\n}\nreturn out.toString();\n}\n"}, {"id": "l1_neg_6507", "level": 1, "label": "not_equivalent", "component_pairids": [6507], "source": "fempd_verified_negative_pairs", "side_a_code": "long octet2long(byte[] input,int offset){\n long result=0;\n for (int i=0; i < 8; i++) {\n if (i + offset < input.length) {\n result|=(((long)input[i + offset]) & 0xffL) << ((7 - i) * 8);\n }\n }\n return result;\n}\n", "side_b_code": "long Long(byte[] buf,int ofs){\n long ret=0, reg;\n int len=buf.length;\n if (8 < len) len=8;\n for (int cc=ofs, sh=56; cc < len; cc++, sh-=8) {\n reg=(buf[cc] & 0xff);\n ret|=reg << sh;\n }\n return ret;\n}\n"}, {"id": "l1_neg_4858", "level": 1, "label": "not_equivalent", "component_pairids": [4858], "source": "fempd_verified_negative_pairs", "side_a_code": "String subString(String s,int index,int length){\n String returnVal=\"\";\n if (index < s.length()) {\n int RightIndex=index + length;\n if (RightIndex >= s.length()) {\n returnVal=s.substring(index);\n }\n else {\n returnVal=s.substring(index,RightIndex);\n }\n }\n return returnVal;\n}\n", "side_b_code": "String subStringWith3Point(String inputStr,int beginIndex,int length){\n int strLength=inputStr.length();\n if (beginIndex >= strLength) {\n return \"\";\n }\n if (beginIndex + length >= strLength) {\n return inputStr.substring(beginIndex);\n }\n return inputStr.substring(beginIndex,beginIndex + length - 1) + \"...\";\n}\n"}, {"id": "l1_pos_2953", "level": 1, "label": "equivalent", "component_pairids": [2953], "source": "fempd_verified_pairs", "side_a_code": "boolean areEqual(byte[] a,byte[] b){\n if (a == b) {\n return true;\n }\n if (a == null || b == null) {\n return false;\n }\n if (a.length != b.length) {\n return false;\n }\n for (int i=0; i != a.length; i++) {\n if (a[i] != b[i]) {\n return false;\n }\n }\n return true;\n}\n", "side_b_code": "boolean byteArrayEquals(byte[] lhs,byte[] rhs){\n if (lhs == null && rhs != null || lhs != null && rhs == null) {\n return false;\n }\n if (lhs == rhs) {\n return true;\n }\n if (lhs.length != rhs.length) {\n return false;\n }\n for (int i=0; i < lhs.length; i++) {\n if (lhs[i] != rhs[i]) {\n return false;\n }\n }\n return true;\n}\n"}, {"id": "l1_pos_7202", "level": 1, "label": "equivalent", "component_pairids": [7202], "source": "fempd_verified_pairs", "side_a_code": "long getShapeLength(int ndim,int elementCount,int[] shape){\n long length=elementCount;\n for (int i=0; i < ndim; i++) {\n length*=shape[i];\n }\n return length;\n}\n", "side_b_code": "long arrayLength(int ndim,int elementCount,int[] lengths){\n long arrayLength=elementCount;\n for (int i=0; i < ndim; i++) arrayLength*=lengths[i];\n return arrayLength;\n}\n"}, {"id": "l1_neg_5384", "level": 1, "label": "not_equivalent", "component_pairids": [5384], "source": "fempd_verified_negative_pairs", "side_a_code": "int[] Tri(int[] pertinence,int taille){\n boolean change=true;\n int tmp;\n while (change) {\n change=false;\n for (int i=0; i < taille - 2; i++) {\n if (pertinence[i] < pertinence[i + 1]) {\n tmp=pertinence[i];\n pertinence[i]=pertinence[i + 1];\n pertinence[i + 1]=tmp;\n change=true;\n }\n }\n }\n return pertinence;\n}\n", "side_b_code": "int[] insertionSort(int[] list,int length){\n int indx, location, temp;\n for (indx=1; indx < length; indx++) {\n if (list[indx] < list[indx - 1]) {\n temp=list[indx];\n location=indx;\n do {\n list[location]=list[location - 1];\n location--;\n }\n while (location > 0 && list[location - 1] > temp);\n list[location]=temp;\n }\n }\n return list;\n}\n"}, {"id": "l1_pos_9925", "level": 1, "label": "equivalent", "component_pairids": [9925], "source": "fempd_verified_pairs", "side_a_code": "int findBefore(String text,int position){\n int counter=0;\n int foundPos=-1;\n int lastspacePos=0;\n while ((counter < 16) && (position > 0) && (position < text.length())) {\n position--;\n if (text.charAt(position) == '\\n') {\n break;\n }\n if (text.charAt(position) == '\\t') {\n break;\n }\n if (text.charAt(position) == '\u00a0') {\n break;\n }\n if (text.charAt(position) == ' ') {\n if (!(((position - 2) >= 0) && (text.charAt(position - 2) == ' ') && (text.charAt(position - 1) >= 'A')&& (text.charAt(position - 1) <= 'Z'))) {\n counter++;\n }\n }\n }\n if (text.charAt(position) == ' ') {\n position++;\n }\n return position;\n}\n", "side_b_code": "int findBefore(String text,int position){\n int counter=0;\n while ((counter < 16) && (position > 0) && (position < text.length())) {\n position--;\n if (text.charAt(position) == '\\n') {\n break;\n }\n if (text.charAt(position) == '\\t') {\n break;\n }\n if (text.charAt(position) == '\u00a0') {\n break;\n }\n if (text.charAt(position) == ' ') {\n if (!(((position - 2) >= 0) && (text.charAt(position - 2) == ' ') && (text.charAt(position - 1) >= 'A')&& (text.charAt(position - 1) <= 'Z'))) {\n counter++;\n }\n }\n }\n if (text.charAt(position) == ' ') {\n position++;\n }\n return position;\n}\n"}, {"id": "l1_pos_98", "level": 1, "label": "equivalent", "component_pairids": [98], "source": "fempd_verified_pairs", "side_a_code": "int[] decode(byte[] input,int start,int len){\n int[] output=new int[len / 4];\n 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);\n return output;\n}\n", "side_b_code": "int[] decode(byte[] input,int start,int len){\n int[] output=new int[len / 4];\n 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);\n return output;\n}\n"}, {"id": "l1_neg_10556", "level": 1, "label": "not_equivalent", "component_pairids": [10556], "source": "fempd_verified_negative_pairs", "side_a_code": "int getHashCode(byte[] data,int off,int len){\n if (len <= 0) return 0;\n int hashCode=0;\n for (int dIndex=off; dIndex < (off + len); dIndex++) hashCode+=(data[dIndex] & 0x00FF);\n return hashCode;\n}\n", "side_b_code": "int maxAbsPcm(byte[] pcmBuf,int offset,int length){\n int max=0;\n for (int i=0; i < length; i++) {\n int pcm=(0xff & pcmBuf[offset++]) + (pcmBuf[offset++] << 8);\n if (pcm < 0) pcm=-pcm;\n if (pcm > max) max=pcm;\n }\n return max;\n}\n"}, {"id": "l1_pos_13665", "level": 1, "label": "equivalent", "component_pairids": [13665], "source": "fempd_verified_pairs", "side_a_code": "byte[] decode(String s){\n byte[] b=new byte[s.length() / 2];\n for (int i=0; i < s.length(); i+=2) {\n String j=String.valueOf(s.charAt(i));\n j=j + String.valueOf(s.charAt(i + 1));\n b[i / 2]=(byte)Integer.parseInt(j,16);\n }\n return b;\n}\n", "side_b_code": "byte[] parseHexString(String byteString){\n byte result[]=new byte[byteString.length() / 2];\n for (int i=0; i < byteString.length(); i+=2) {\n String toParse=byteString.substring(i,i + 2);\n result[i / 2]=(byte)Integer.parseInt(toParse,16);\n }\n return result;\n}\n"}, {"id": "l1_pos_9196", "level": 1, "label": "equivalent", "component_pairids": [9196], "source": "fempd_verified_pairs", "side_a_code": "int indexOf(byte[] bytes,int start,byte value){\n if (start > bytes.length) return -1;\n for (int i=start; i != bytes.length; i++) {\n if (bytes[i] == value) return i;\n }\n return -1;\n}\n", "side_b_code": "int indexOf(byte[] buf,int begin,byte b){\n for (int i=begin; i < buf.length; i++) {\n if (buf[i] == b) return i;\n }\n return -1;\n}\n"}, {"id": "l1_pos_879", "level": 1, "label": "equivalent", "component_pairids": [879], "source": "fempd_verified_pairs", "side_a_code": "boolean compareByteArrays(byte[] b1,byte[] b2){\n for (int i=0; i < b2.length && i < b1.length; i++) {\n if (b2[i] != b1[i]) {\n return false;\n }\n }\n return true;\n}\n", "side_b_code": "boolean equals(byte[] x,byte[] y){\n int len=x.length < y.length ? x.length : y.length;\n int offset=0;\n while (len > 0) {\n if (x[offset] != y[offset]) return false;\n offset++;\n len--;\n }\n return true;\n}\n"}, {"id": "l1_pos_10026", "level": 1, "label": "equivalent", "component_pairids": [10026], "source": "fempd_verified_pairs", "side_a_code": "int compare(Long o1,Long o2){\n if (o1 == o2) return 0;\n if (o1 == null) return -1;\n if (o2 == null) return 1;\n if (o1.longValue() < o2.longValue()) return -1;\n if (o1.longValue() > o2.longValue()) return 1;\n return 0;\n}\n", "side_b_code": "int compare(Long l1,Long l2){\n if (l1 == null) {\n return l2 == null ? 0 : -1;\n }\n else if (l2 == null) {\n return 1;\n }\n return l1.longValue() < l2.longValue() ? -1 : l1.longValue() > l2.longValue() ? 1 : 0;\n}\n"}, {"id": "l1_pos_11317", "level": 1, "label": "equivalent", "component_pairids": [11317], "source": "fempd_verified_pairs", "side_a_code": "int compte(String chaine,String partie){\n if (chaine == null || partie == null || chaine.equals(\"\") || partie.equals(\"\")) {\n return 0;\n }\n int nb=0;\n int indice=0;\n while ((indice=chaine.indexOf(partie,indice)) >= 0) {\n indice+=partie.length();\n nb++;\n }\n return nb;\n}\n", "side_b_code": "int compte(String chaine,String partie){\n if ((chaine == null) || (partie == null) || (chaine.equals(\"\"))|| (partie.equals(\"\"))) {\n return 0;\n }\n int nb=0;\n int indice=0;\n while ((indice=chaine.indexOf(partie,indice)) >= 0) {\n indice+=partie.length();\n nb++;\n }\n return nb;\n}\n"}, {"id": "l1_neg_13014", "level": 1, "label": "not_equivalent", "component_pairids": [13014], "source": "fempd_verified_negative_pairs", "side_a_code": "long TryParseHex(String s){\n if (s == null || s.isEmpty()) {\n return 0L;\n }\n try {\n return Long.parseLong(s,16);\n }\n catch ( Throwable t) {\n return 0L;\n }\n}\n", "side_b_code": "long toLong(String value){\n try {\n if (value == null || value.length() == 0) {\n return 0;\n }\n else {\n if (value.charAt(0) == '+') {\n value=value.substring(1);\n }\n return Long.parseLong(value);\n }\n }\n catch ( Exception e) {\n return 0;\n }\n}\n"}, {"id": "l1_neg_13328", "level": 1, "label": "not_equivalent", "component_pairids": [13328], "source": "fempd_verified_negative_pairs", "side_a_code": "boolean isNextNil(byte[] dat,int start){\n if (start < dat.length - 3) {\n return dat[start] == 'N' && dat[start + 1] == 'I' && dat[start + 2] == 'L';\n }\n return false;\n}\n", "side_b_code": "boolean isExifMarkerPrefixed(byte[] data,int pos){\n 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;\n return false;\n}\n"}, {"id": "l1_pos_7974", "level": 1, "label": "equivalent", "component_pairids": [7974], "source": "fempd_verified_pairs", "side_a_code": "boolean stringEquals(String a,String b){\n if ((a == null || a.length() == 0) && (b == null || b.length() == 0)) return true;\n if (a == null) return false;\n return a.equals(b);\n}\n", "side_b_code": "boolean isEqual(String string1,String string2){\n boolean bIsEmpty1=(string1 == null || string1.length() == 0);\n boolean bIsEmpty2=(string2 == null || string2.length() == 0);\n if (bIsEmpty1 && bIsEmpty2) return true;\n if (bIsEmpty1 || bIsEmpty2) return false;\n return string1.equals(string2);\n}\n"}, {"id": "l1_neg_5735", "level": 1, "label": "not_equivalent", "component_pairids": [5735], "source": "fempd_verified_negative_pairs", "side_a_code": "boolean controlNumber(String s,boolean b){\n char c[];\n int i, j, k;\n c=s.toCharArray();\n if (c.length != 2 && b == false) return false;\n if (c.length != 4 && b == true) return false;\n for (i=0, k=0; i < c.length; i++) if (c[i] - '0' < 0 || c[i] - '0' > 9) return false;\n return true;\n}\n", "side_b_code": "boolean isNumber(String str,boolean allowSign){\n int i=0;\n if (str.length() == 0) return false;\n if (str.charAt(0) == '+' || str.charAt(0) == '-') i=1;\n for (; i < str.length(); i++) {\n if (str.charAt(i) < '0' || str.charAt(i) > '9') return false;\n }\n return true;\n}\n"}, {"id": "l1_pos_6985", "level": 1, "label": "equivalent", "component_pairids": [6985], "source": "fempd_verified_pairs", "side_a_code": "int min(int a,int b,int c){\n if (a <= b && a <= c) return a;\n else if (b <= c && b <= a) return b;\n else return c;\n}\n", "side_b_code": "int minimum(int a,int b,int c){\n if ((a <= b) && (a <= c)) {\n return a;\n }\n if ((b <= a) && (b <= c)) {\n return b;\n }\n return c;\n}\n"}, {"id": "l1_pos_10559", "level": 1, "label": "equivalent", "component_pairids": [10559], "source": "fempd_verified_pairs", "side_a_code": "int computeColorDepth(int colorcount){\n if (colorcount <= 2) {\n return 1;\n }\n if (colorcount <= 4) {\n return 2;\n }\n if (colorcount <= 16) {\n return 4;\n }\n return 8;\n}\n", "side_b_code": "int computeColorDepth(int colorcount){\n if (colorcount <= 2) return 1;\n if (colorcount <= 4) return 2;\n if (colorcount <= 16) return 4;\n return 8;\n}\n"}, {"id": "l1_neg_1579", "level": 1, "label": "not_equivalent", "component_pairids": [1579], "source": "fempd_verified_negative_pairs", "side_a_code": "boolean areEqual(byte[] a,byte[] b){\n if (a == b) {\n return true;\n }\n if (a.length != b.length) {\n return false;\n }\n for (int i=0; i != a.length; i++) {\n if (a[i] != b[i]) {\n return false;\n }\n }\n return true;\n}\n", "side_b_code": "boolean verify(byte[] a,byte[] b){\n boolean v=a.length == b.length;\n for (int i=0; i < a.length && v; i++) {\n if (a[i] != b[i]) v=false;\n }\n return v;\n}\n"}, {"id": "l1_pos_368", "level": 1, "label": "equivalent", "component_pairids": [368], "source": "fempd_verified_pairs", "side_a_code": "boolean equals(byte[] x,byte[] y){\n if (x == y) {\n return true;\n }\n if (x == null) {\n return false;\n }\n if (x.length != y.length) {\n return false;\n }\n for (int i=0; i < x.length; i++) {\n if (y[i] != x[i]) {\n return false;\n }\n }\n return true;\n}\n", "side_b_code": "boolean contentEquals(byte[] content1,byte[] content2){\n if (content1 == null) return (content2 == null);\n if (content1.length != content2.length) return false;\n for (int i=0; i < content1.length; i++) if (content1[i] != content2[i]) return false;\n return true;\n}\n"}, {"id": "l1_neg_3654", "level": 1, "label": "not_equivalent", "component_pairids": [3654], "source": "fempd_verified_negative_pairs", "side_a_code": "int compareObjects(Object o1,Object o2){\n int result=0;\n if (o1 != null && o2 != null) {\n if (o1 instanceof Number && o2 instanceof Number) {\n result=Double.compare(((Number)o1).doubleValue(),((Number)o2).doubleValue());\n }\n else if (o1.getClass() == o2.getClass() && o1 instanceof Comparable) {\n result=(((Comparable)o1).compareTo(o2));\n }\n else {\n System.out.println(String.format(\"Warning: compared values: %s, %s have different types\",o1.toString(),o2.toString()));\n result=(o1.toString()).compareTo(o2.toString());\n }\n }\n else if (o1 != null) {\n result=1;\n }\n else if (o2 != null) {\n result=-1;\n }\n return result;\n}\n", "side_b_code": "int compare(Object o1,Object o2){\n if (o1 == null && o2 == null) {\n return 0;\n }\n else if (o1 == null) {\n return -1;\n }\n else if (o2 == null) {\n return 1;\n }\n else if (o1 == o2 || o1.equals(o2)) {\n return 0;\n }\n else if (!o1.getClass().equals(o2.getClass())) {\n return o1.getClass().getName().compareTo(o2.getClass().getName());\n }\n else if (o1 instanceof Comparable && o2 instanceof Comparable) {\n return ((Comparable)o1).compareTo(o2);\n }\n else {\n int h1=o1.hashCode();\n int h2=o2.hashCode();\n return h1 > h2 ? 1 : -1;\n }\n}\n"}, {"id": "l1_neg_5035", "level": 1, "label": "not_equivalent", "component_pairids": [5035], "source": "fempd_verified_negative_pairs", "side_a_code": "int clip(int val,int limit){\n if (val > limit && limit != 0) {\n return limit;\n }\n else if (val < 0) {\n return 0;\n }\n return val;\n}\n", "side_b_code": "int clip(int val,int limit){\n if (val >= limit && limit != 0) {\n return limit;\n }\n else if (val < 0) {\n return 0;\n }\n return val;\n}\n"}, {"id": "l1_neg_8967", "level": 1, "label": "not_equivalent", "component_pairids": [8967], "source": "fempd_verified_negative_pairs", "side_a_code": "boolean isValidDefinedNameChar(char ch){\n if (Character.isLetterOrDigit(ch)) {\n return true;\n }\nswitch (ch) {\ncase '.':case '_':case '?':case '\\\\': return true;\n}\nreturn false;\n}\n", "side_b_code": "boolean isLegalURLCharacter(char c){\nswitch (c) {\ncase '<':case '>':case '(':case ')':case '[':case ']':case '{':case '}': return false;\n}\nreturn true;\n}\n"}, {"id": "l1_neg_6121", "level": 1, "label": "not_equivalent", "component_pairids": [6121], "source": "fempd_verified_negative_pairs", "side_a_code": "float[] toFloatArray(byte[] in_buff,int in_offset,float[] out_buff,int out_offset,int out_len){\n int ix=in_offset;\n int ox=out_offset;\n for (int i=0; i < out_len; i++) {\n int x=((in_buff[ix++] & 0xFF) << 24) | ((in_buff[ix++] & 0xFF) << 16) | ((in_buff[ix++] & 0xFF) << 8)| (in_buff[ix++] & 0xFF);\n x-=0x7FFFFFFF;\n out_buff[ox++]=x * (1.0f / (float)0x7FFFFFFF);\n }\n return out_buff;\n}\n", "side_b_code": "float[] toFloatArray(byte[] in_buff,int in_offset,float[] out_buff,int out_offset,int out_len){\n int ix=in_offset;\n int len=out_offset + out_len;\n for (int ox=out_offset; ox < len; ox++) {\n out_buff[ox]=((short)((in_buff[ix++] & 0xFF) | (in_buff[ix++] << 8))) * (1.0f / 32767.0f);\n }\n return out_buff;\n}\n"}, {"id": "l1_neg_12582", "level": 1, "label": "not_equivalent", "component_pairids": [12582], "source": "fempd_verified_negative_pairs", "side_a_code": "boolean inRangeExclusive(int lowerBound,int value,int upperBound){\n if (lowerBound >= value) return false;\n if (upperBound <= value) return false;\n return true;\n}\n", "side_b_code": "boolean areOverlapping(int destination,int source,int length){\n if (source + length <= destination || destination + length <= source) {\n return false;\n }\n return true;\n}\n"}, {"id": "l1_neg_11553", "level": 1, "label": "not_equivalent", "component_pairids": [11553], "source": "fempd_verified_negative_pairs", "side_a_code": "String truncateString(String s,int maxLength){\n if (s.length() < maxLength) {\n return s;\n }\n return s.substring(0,maxLength - 3) + \"...\";\n}\n", "side_b_code": "String trim(String s,int length){\n if (s.length() >= length) {\n return s.substring(0,length - 1);\n }\n else {\n return s;\n }\n}\n"}, {"id": "l1_neg_4228", "level": 1, "label": "not_equivalent", "component_pairids": [4228], "source": "fempd_verified_negative_pairs", "side_a_code": "float lerp(float floor,float ceil,float value){\n if (value <= floor) {\n return 0;\n }\n else if (value >= ceil) {\n return 1;\n }\n else {\n return (value - floor) / (ceil - floor);\n }\n}\n", "side_b_code": "float smoothStep(float a,float b,float x){\n if (x < a) {\n return 0;\n }\n if (x >= b) {\n return 1;\n }\n x=(x - a) / (b - a);\n return x * x * (3 - 2 * x);\n}\n"}, {"id": "l1_neg_11739", "level": 1, "label": "not_equivalent", "component_pairids": [11739], "source": "fempd_verified_negative_pairs", "side_a_code": "String fill(String s,int n){\n if (s == null) return null;\n if (s.equals(\"\") || n <= 0) return \"\";\n final StringBuilder r=new StringBuilder(n);\n for (int i=0; i < n; i++) {\n r.append(s.charAt(i % s.length()));\n }\n return r.toString();\n}\n", "side_b_code": "String left(String s,int count){\n if (s == null) {\n return null;\n }\n return s.substring(0,((count < 0) ? 0 : (count < s.length()) ? count : s.length()));\n}\n"}, {"id": "l1_neg_9179", "level": 1, "label": "not_equivalent", "component_pairids": [9179], "source": "fempd_verified_negative_pairs", "side_a_code": "double poz(double z){\n double y, x, w;\n double Z_MAX=6.0;\n if (z == 0.0) {\n x=0.0;\n }\n else {\n y=0.5 * Math.abs(z);\n if (y >= (Z_MAX * 0.5)) {\n x=1.0;\n }\n else if (y < 1.0) {\n w=y * y;\n x=((((((((0.000124818987 * w - 0.001075204047) * w + 0.005198775019) * w - 0.019198292004) * w + 0.059054035642) * w - 0.151968751364) * w + 0.319152932694) * w - 0.531923007300) * w + 0.797884560593) * y * 2.0;\n }\n else {\n y-=2.0;\n x=(((((((((((((-0.000045255659 * y + 0.000152529290) * y - 0.000019538132) * y - 0.000676904986) * y + 0.001390604284) * y - 0.000794620820) * y - 0.002034254874) * y + 0.006549791214) * y - 0.010557625006) * y + 0.011630447319) * y - 0.009279453341) * y + 0.005353579108) * y - 0.002141268741) * y + 0.000535310849) * y + 0.999936657524;\n }\n }\n return z > 0.0 ? ((x + 1.0) * 0.5) : ((1.0 - x) * 0.5);\n}\n", "side_b_code": "double normp(double z){\n double zabs;\n double p;\n double expntl, pdf;\n final double p0=220.2068679123761;\n final double p1=221.2135961699311;\n final double p2=112.0792914978709;\n final double p3=33.91286607838300;\n final double p4=6.373962203531650;\n final double p5=.7003830644436881;\n final double p6=.3526249659989109E-01;\n final double q0=440.4137358247522;\n final double q1=793.8265125199484;\n final double q2=637.3336333788311;\n final double q3=296.5642487796737;\n final double q4=86.78073220294608;\n final double q5=16.06417757920695;\n final double q6=1.755667163182642;\n final double q7=.8838834764831844E-1;\n final double cutoff=7.071;\n final double root2pi=2.506628274631001;\n zabs=Math.abs(z);\n if (z > 37.0) {\n p=1.0;\n return p;\n }\n if (z < -37.0) {\n p=0.0;\n return p;\n }\n expntl=Math.exp(-.5 * zabs * zabs);\n pdf=expntl / root2pi;\n if (zabs < cutoff) {\n p=expntl * ((((((p6 * zabs + p5) * zabs + p4) * zabs + p3) * zabs + p2) * zabs + p1) * zabs + p0) / (((((((q7 * zabs + q6) * zabs + q5) * zabs + q4) * zabs + q3) * zabs + q2) * zabs + q1) * zabs + q0);\n }\n else {\n p=pdf / (zabs + 1.0 / (zabs + 2.0 / (zabs + 3.0 / (zabs + 4.0 / (zabs + 0.65)))));\n }\n if (z < 0.0) {\n return p;\n }\n else {\n p=1.0 - p;\n return p;\n }\n}\n"}, {"id": "l1_pos_6667", "level": 1, "label": "equivalent", "component_pairids": [6667], "source": "fempd_verified_pairs", "side_a_code": "float ease(float t,float b,float c,float d){\n if (t == 0) return b;\n if (t == d) return b + c;\n if ((t/=d / 2) < 1) return c / 2 * (float)Math.pow(2,10 * (t - 1)) + b;\n return c / 2 * (-(float)Math.pow(2,-10 * --t) + 2) + b;\n}\n", "side_b_code": "float easeInOut(float t,float b,float c,float d){\n if (t == 0) return b;\n if (t == d) return b + c;\n if ((t/=d * 0.5f) < 1f) return c * 0.5f * (float)Math.pow(2,10 * (t - 1)) + b;\n return c * 0.5f * (-(float)Math.pow(2f,-10f * --t) + 2) + b;\n}\n"}, {"id": "l1_pos_4054", "level": 1, "label": "equivalent", "component_pairids": [4054], "source": "fempd_verified_pairs", "side_a_code": "char _findMnemonic(String string){\n if (string == null) {\n return '\\0';\n }\n int index=0;\n int length=string.length();\n do {\n while (index < length && string.charAt(index) != '&') {\n index++;\n }\n if (++index >= length) {\n return '\\0';\n }\n if (string.charAt(index) != '&') {\n return Character.toLowerCase(string.charAt(index));\n }\n index++;\n }\n while (index < length);\n return '\\0';\n}\n", "side_b_code": "char _findMnemonic(String string){\n if (string == null) return '\\0';\n int index=0;\n int length=string.length();\n do {\n while (index < length && string.charAt(index) != '&') index++;\n if (++index >= length) return '\\0';\n if (string.charAt(index) != '&') return Character.toLowerCase(string.charAt(index));\n index++;\n }\n while (index < length);\n return '\\0';\n}\n"}, {"id": "l1_neg_5795", "level": 1, "label": "not_equivalent", "component_pairids": [5795], "source": "fempd_verified_negative_pairs", "side_a_code": "boolean equalsBytes(byte[] xbs,int xoff,byte[] ybs,int yoff,int len){\n if (xbs.length - xoff < len || ybs.length - yoff < len) {\n return false;\n }\n for (int i=0; i < len; i++) {\n if (xbs[xoff + i] != ybs[yoff + i]) {\n return false;\n }\n }\n return true;\n}\n", "side_b_code": "boolean byteArrayEquals(byte[] buf1,int off1,byte[] buf2,int off2,int len){\n if ((off1 + len > buf1.length) || (off2 + len > buf2.length)) {\n return (false);\n }\n for (int i=0; i < len; i++) {\n if (buf1[off1 + i] != buf2[off2 + i]) {\n return (false);\n }\n }\n return (true);\n}\n"}, {"id": "l1_pos_8378", "level": 1, "label": "equivalent", "component_pairids": [8378], "source": "fempd_verified_pairs", "side_a_code": "boolean compareBytes(byte[] lhs,byte[] rhs,int rhsOffset){\n boolean result=true;\n for (int loop=0; loop < lhs.length; loop++) {\n if (lhs[loop] != rhs[rhsOffset + loop]) {\n result=false;\n break;\n }\n }\n return (result);\n}\n", "side_b_code": "boolean equalsChv(byte[] chv1,byte[] chv2,int pos2){\n for (int i=0; i < chv1.length; i++) {\n if (chv1[i] != chv2[pos2 + i]) {\n return false;\n }\n }\n return true;\n}\n"}, {"id": "l1_pos_8861", "level": 1, "label": "equivalent", "component_pairids": [8861], "source": "fempd_verified_pairs", "side_a_code": "boolean isSame(String one,String two){\n if (one == null && two == null) {\n return true;\n }\n if (one == null || two == null) {\n return false;\n }\n return one.compareTo(two) == 0;\n}\n", "side_b_code": "boolean sameStringValue(String stringA,String stringB){\n if (stringA == null) {\n if (stringB == null) {\n return true;\n }\n else {\n return false;\n }\n }\n if (stringB == null) return false;\n if (stringA.compareTo(stringB) == 0) {\n return true;\n }\n else {\n return false;\n }\n}\n"}, {"id": "l1_pos_12522", "level": 1, "label": "equivalent", "component_pairids": [12522], "source": "fempd_verified_pairs", "side_a_code": "int strcmp(String str,char[] a,int start){\n int i, d, len=str.length();\n for (i=0; i < len; i++) {\n d=str.charAt(i) - a[start + i];\n if (d != 0) {\n return d;\n }\n if (a[start + i] == 0) {\n return d;\n }\n }\n if (a[start + i] != 0) {\n return -a[start + i];\n }\n return 0;\n}\n", "side_b_code": "int strcmp(String str,char[] a,int start){\n int i, d, len=str.length();\n for (i=0; i < len; i++) {\n d=(int)str.charAt(i) - a[start + i];\n if (d != 0) return d;\n if (a[start + i] == 0) return d;\n }\n if (a[start + i] != 0) return (int)-a[start + i];\n return 0;\n}\n"}, {"id": "l1_pos_5310", "level": 1, "label": "equivalent", "component_pairids": [5310], "source": "fempd_verified_pairs", "side_a_code": "boolean isPrime(int n){\n if (n <= 0 || n == 1) {\n return false;\n }\n else if (n == 2) {\n return true;\n }\n else {\n int i=2;\n while (i < n) {\n if ((n % i) == 0) {\n return false;\n }\n i++;\n }\n return true;\n }\n}\n", "side_b_code": "boolean isPrime(int i){\n if (i == 2) return true;\n if (i < 2 || i % 2 == 0) return false;\n for (int stop=i, j=3; j < stop; stop=i / j, j+=2) if (i % j == 0) return false;\n return true;\n}\n"}, {"id": "l1_pos_8533", "level": 1, "label": "equivalent", "component_pairids": [8533], "source": "fempd_verified_pairs", "side_a_code": "Double string2Double(String dValue){\n Double result=null;\n if (dValue != null && dValue.trim().length() > 0) {\n result=Double.valueOf(dValue);\n }\n return result;\n}\n", "side_b_code": "Double makeDouble(String token){\n if (token != null && !\"\".equals(token.trim())) {\n return Double.valueOf(token);\n }\n else {\n return null;\n }\n}\n"}, {"id": "l1_neg_12135", "level": 1, "label": "not_equivalent", "component_pairids": [12135], "source": "fempd_verified_negative_pairs", "side_a_code": "boolean isFixedType(String type){\n if (type == null) {\n return false;\n }\n String str=type.trim().toUpperCase();\n return \"CHAR\".equals(str) || \"VARCHAR\".equals(str) || \"NVARCHAR\".equals(str)|| \"DECIMAL\".equals(str)|| \"NUMERIC\".equals(str);\n}\n", "side_b_code": "boolean isSafeFileName(String name){\n if (name == null) return false;\n if (name.length() == 0) return false;\n boolean safeChars=name.matches(\"[a-zA-Z0-9-_.]*\");\n boolean doubleDot=(name.indexOf(\"..\") >= 0);\n boolean hidden=name.startsWith(\".\");\n boolean root=name.startsWith(\"/\");\n boolean legal=safeChars & !doubleDot & !hidden& !root;\n return legal;\n}\n"}, {"id": "l1_pos_9439", "level": 1, "label": "equivalent", "component_pairids": [9439], "source": "fempd_verified_pairs", "side_a_code": "int Maximum(int[] vet){\n int max=vet[0];\n for (int i=1; i < vet.length; i++) {\n if (vet[i] > max) {\n max=vet[i];\n }\n }\n return (max);\n}\n", "side_b_code": "int max(int[] _d){\n int max=_d[0];\n for (int i=1; i < _d.length; i++) {\n if (_d[i] > max) max=_d[i];\n }\n return max;\n}\n"}, {"id": "l1_neg_8669", "level": 1, "label": "not_equivalent", "component_pairids": [8669], "source": "fempd_verified_negative_pairs", "side_a_code": "int intCeil(double n){\n double ceil=Math.ceil(n);\n if (ceil >= Integer.MAX_VALUE) return Integer.MAX_VALUE;\n if (ceil <= Integer.MIN_VALUE) return Integer.MIN_VALUE;\n return (int)ceil;\n}\n", "side_b_code": "int intFloor(double n){\n double floor=Math.floor(n);\n if (floor >= Integer.MAX_VALUE) return Integer.MAX_VALUE;\n if (floor <= Integer.MIN_VALUE) return Integer.MIN_VALUE;\n return (int)floor;\n}\n"}, {"id": "l1_neg_8117", "level": 1, "label": "not_equivalent", "component_pairids": [8117], "source": "fempd_verified_negative_pairs", "side_a_code": "String appendSpaceBefore(int level,String value){\n StringBuilder dest=new StringBuilder(value.length() + level);\n for (int pad=0; pad < level; pad++) {\n dest.append(' ').append(' ');\n }\n value=dest.append(value).toString();\n return value;\n}\n", "side_b_code": "String convertToNonBreakingSpaces(int preSpaces,String s){\n StringBuilder b=new StringBuilder(preSpaces + s.length());\n for (int i=0; i < preSpaces; i++) b.append('\u00a0');\n b.append(s.replace(' ','\u00a0'));\n return b.toString();\n}\n"}, {"id": "l1_neg_10321", "level": 1, "label": "not_equivalent", "component_pairids": [10321], "source": "fempd_verified_negative_pairs", "side_a_code": "int toIntNumber(byte[] p,int off,int len){\n int ret=0;\n int done=off + len;\n for (int i=off; i < done; i++) ret=((ret << 8) & 0xffffffff) + (p[i] & 0xff);\n return ret;\n}\n", "side_b_code": "int extractInteger(byte[] bytes,int pos,int cnt){\n int value=0;\n for (int i=0; i < cnt; i++) value|=((bytes[pos + cnt - i - 1] & 0xff) << 8 * i);\n return value;\n}\n"}, {"id": "l1_pos_22", "level": 1, "label": "equivalent", "component_pairids": [22], "source": "fempd_verified_pairs", "side_a_code": "Long toLong(String t){\n if (t != null) {\n return Long.parseLong(t);\n }\n return null;\n}\n", "side_b_code": "Long getLongfromString(String longstring){\n Long longresult=null;\n if (!(longstring == null)) {\n longresult=Long.valueOf(longstring).longValue();\n }\n return longresult;\n}\n"}, {"id": "l1_pos_2528", "level": 1, "label": "equivalent", "component_pairids": [2528], "source": "fempd_verified_pairs", "side_a_code": "boolean equals(byte[] bytes1,byte[] bytes2){\n if (bytes1 == null && bytes2 == null) {\n return true;\n }\n else if (bytes1 == null || bytes2 == null) {\n return false;\n }\n if (bytes1.length != bytes2.length) {\n return false;\n }\n for (int i=0; i < bytes1.length; i++) {\n if (bytes1[i] != bytes2[i]) {\n return false;\n }\n }\n return true;\n}\n", "side_b_code": "boolean equals(byte[] a1,byte[] a2){\n if (a1 == a2) {\n return true;\n }\n try {\n if (a1.length == a2.length) {\n for (int i=0; i < a1.length; i++) {\n if (a1[i] != a2[i]) {\n return false;\n }\n }\n return true;\n }\n }\n catch ( NullPointerException e) {\n }\n return false;\n}\n"}, {"id": "l1_neg_4919", "level": 1, "label": "not_equivalent", "component_pairids": [4919], "source": "fempd_verified_negative_pairs", "side_a_code": "Calendar parseDate(String s){\n try {\n int year=0, month=0, day=0;\n if (s.length() == 8) {\n year=Integer.parseInt(s.substring(0,4));\n month=Integer.parseInt(s.substring(4,6)) - 1;\n day=Integer.parseInt(s.substring(6,8));\n }\n else if (s.length() == 6) {\n year=Integer.parseInt(s.substring(0,2));\n year+=((year > 70) ? 1900 : 2000);\n month=Integer.parseInt(s.substring(2,4)) - 1;\n day=Integer.parseInt(s.substring(4,6));\n }\n else return null;\n Calendar c=new GregorianCalendar(year,month,day);\n return c;\n }\n catch ( NumberFormatException e) {\n return null;\n }\n}\n", "side_b_code": "Calendar getCalendar(String data){\n String[] fields=data.split(\":\");\n if (fields.length != 2) return null;\n String[] date=fields[0].split(\"/\");\n String[] time=fields[1].split(\"\\\\.\");\n if (date.length != 3) return null;\n if (time.length != 2) return null;\n int year, month, day, hour, minute;\n try {\n year=Integer.parseInt(date[0]);\n month=Integer.parseInt(date[1]) - 1;\n day=Integer.parseInt(date[2]);\n hour=Integer.parseInt(time[0]);\n minute=Integer.parseInt(time[1]);\n }\n catch ( Exception e) {\n e.printStackTrace();\n return null;\n }\n Calendar cal=Calendar.getInstance();\n cal.set(Calendar.YEAR,year);\n cal.set(Calendar.MONTH,month);\n cal.set(Calendar.DAY_OF_MONTH,day);\n cal.set(Calendar.HOUR_OF_DAY,hour);\n cal.set(Calendar.MINUTE,minute);\n return cal;\n}\n"}, {"id": "l1_pos_6589", "level": 1, "label": "equivalent", "component_pairids": [6589], "source": "fempd_verified_pairs", "side_a_code": "boolean equals(long[] a1,long[] a2){\n if (a1 == a2) {\n return true;\n }\n try {\n if (a1.length == a2.length) {\n for (int i=0; i < a1.length; i++) {\n if (a1[i] != a2[i]) {\n return false;\n }\n }\n return true;\n }\n }\n catch ( NullPointerException e) {\n }\n return false;\n}\n", "side_b_code": "boolean equals(long[] a1,long[] a2){\n if (a1 == a2) return true;\n if (null == a1 || null == a2) return false;\n if (a1.length == a2.length) {\n int i=a1.length;\n while (--i >= 0) if (a1[i] != a2[i]) return false;\n return true;\n }\n return false;\n}\n"}, {"id": "l1_pos_3110", "level": 1, "label": "equivalent", "component_pairids": [3110], "source": "fempd_verified_pairs", "side_a_code": "String[] split(String in,String sp){\n Vector vecTmp=new Vector();\n String strTmp=\"\";\n String[] out=null;\n int pointer=0, p2=0;\n if (in.indexOf(sp) < 0) {\n out=new String[1];\n out[0]=in;\n return out;\n }\n if (!in.endsWith(sp)) in=in + sp;\n while ((p2=in.indexOf(sp,pointer)) >= 0) {\n vecTmp.addElement(in.substring(pointer,p2));\n pointer=p2 + sp.length();\n if (pointer >= in.length()) break;\n }\n int vl=vecTmp.size();\n out=new String[vl];\n for (int i=0; i < vl; i++) {\n strTmp=(String)vecTmp.elementAt(i);\n out[i]=strTmp;\n }\n return out;\n}\n", "side_b_code": "String[] split(String text,String run){\n int n=1;\n int i=text.indexOf(run);\n String[] lines;\n int runLen=run.length();\n if (i < 0 || runLen == 0) {\n lines=new String[1];\n lines[0]=text;\n return lines;\n }\n int len=text.length() - runLen;\n for (; i >= 0 && i < len; n++) i=text.indexOf(run,i + runLen);\n lines=new String[n];\n i=0;\n int ipt=0;\n int pt=0;\n for (; (ipt=text.indexOf(run,i)) >= 0 && pt + 1 < n; ) {\n lines[pt++]=text.substring(i,ipt);\n i=ipt + runLen;\n }\n if (text.indexOf(run,len) != len) len+=runLen;\n lines[pt]=text.substring(i,len);\n return lines;\n}\n"}, {"id": "l1_pos_2704", "level": 1, "label": "equivalent", "component_pairids": [2704], "source": "fempd_verified_pairs", "side_a_code": "boolean areEqual(byte[] a,byte[] b){\n int aLength=a.length;\n if (aLength != b.length) return false;\n for (int i=0; i < aLength; i++) if (a[i] != b[i]) return false;\n return true;\n}\n", "side_b_code": "boolean comparePassword(byte[] text,byte[] password){\n if (text.length != password.length) return false;\n for (int i=0; i < text.length && i < password.length; i++) {\n if (text[i] != password[i]) return false;\n }\n return true;\n}\n"}, {"id": "l1_neg_13254", "level": 1, "label": "not_equivalent", "component_pairids": [13254], "source": "fempd_verified_negative_pairs", "side_a_code": "String generateRandomString(String charPool,int length){\n final Random rnd=new Random();\n final int charPoolLength=charPool.length();\n char c;\n double r;\n int pos;\n final StringBuilder sb=new StringBuilder(length);\n for (int i=0; i < length; i++) {\n r=rnd.nextDouble();\n pos=(int)Math.abs(r * (charPoolLength - 1));\n c=charPool.charAt(pos);\n sb.append(c);\n }\n return sb.toString();\n}\n", "side_b_code": "String generateRandomString(String chars,int length){\n StringBuffer result=new StringBuffer(length);\n int charsLength=chars.length();\n for (int i=0; i < length; i++) {\n result.append(chars.charAt((int)(Math.random() * charsLength)));\n }\n return result.toString();\n}\n"}, {"id": "l1_pos_6114", "level": 1, "label": "equivalent", "component_pairids": [6114], "source": "fempd_verified_pairs", "side_a_code": "byte SumCheck(byte[] buf,int len){\n byte sum_check=0;\n for (int i=0; i < len; i++) {\n sum_check^=buf[i] & 0xff;\n }\n return sum_check;\n}\n", "side_b_code": "byte packetCRC(byte[] buffer,int bufSize){\n byte tmpCRC=0;\n int i;\n for (i=0; i < bufSize; i++) {\n tmpCRC^=buffer[i];\n }\n return tmpCRC;\n}\n"}, {"id": "l1_pos_12070", "level": 1, "label": "equivalent", "component_pairids": [12070], "source": "fempd_verified_pairs", "side_a_code": "String getDay(int day){\n if (day == Calendar.MONDAY) return \"MONDAY\";\n else if (day == Calendar.TUESDAY) return \"TUESDAY\";\n else if (day == Calendar.WEDNESDAY) return \"WEDNESDAY\";\n else if (day == Calendar.THURSDAY) return \"THURSDAY\";\n else if (day == Calendar.FRIDAY) return \"FRIDAY\";\n else if (day == Calendar.SATURDAY) return \"SATURDAY\";\n else if (day == Calendar.SUNDAY) return \"SUNDAY\";\n else return null;\n}\n", "side_b_code": "String num2dow(int num){\n String retval=null;\nswitch (num) {\ncase Calendar.SUNDAY: retval=\"SUNDAY\";\n break;\ncase Calendar.MONDAY:retval=\"MONDAY\";\nbreak;\ncase Calendar.TUESDAY:retval=\"TUESDAY\";\nbreak;\ncase Calendar.WEDNESDAY:retval=\"WEDNESDAY\";\nbreak;\ncase Calendar.THURSDAY:retval=\"THURSDAY\";\nbreak;\ncase Calendar.FRIDAY:retval=\"FRIDAY\";\nbreak;\ncase Calendar.SATURDAY:retval=\"SATURDAY\";\nbreak;\n}\nreturn retval;\n}\n"}, {"id": "l1_neg_3848", "level": 1, "label": "not_equivalent", "component_pairids": [3848], "source": "fempd_verified_negative_pairs", "side_a_code": "double manhattanDistance(double[] doubleArray,double[] d2Array){\n double temp=0;\n double sum=0;\n for (int i=0; i < doubleArray.length; i++) {\n temp=doubleArray[i] - d2Array[i];\n if (temp < 0) {\n sum-=temp;\n }\n else {\n sum+=temp;\n }\n }\n return sum;\n}\n", "side_b_code": "double calculateDistance(double[] value1,double[] value2){\n double max=Double.NEGATIVE_INFINITY;\n for (int i=0; i < value1.length; i++) {\n double v1=value1[i];\n double v2=value2[i];\n if ((!Double.isNaN(v1)) && (!Double.isNaN(v2))) {\n double d=Math.abs(v1 - v2);\n if (d > max) max=d;\n }\n }\n if (max > Double.NEGATIVE_INFINITY) return max;\n else return Double.NaN;\n}\n"}, {"id": "l1_neg_11457", "level": 1, "label": "not_equivalent", "component_pairids": [11457], "source": "fempd_verified_negative_pairs", "side_a_code": "Date dateExtractor(String a){\n if (a.equalsIgnoreCase(\"\")) {\n return new Date();\n }\n String dateString=null;\n String hourString=null;\n if (a.indexOf(\" \") > 0) {\n dateString=a.substring(0,a.indexOf(\" \"));\n hourString=a.substring(a.indexOf(\" \"));\n }\n else {\n dateString=a.trim();\n }\n Date date=new Date();\n StringTokenizer st=new StringTokenizer(dateString.trim(),\".\");\n date.setDate(Integer.parseInt(st.nextToken()));\n date.setMonth(Integer.parseInt(st.nextToken()) - 1);\n String year=st.nextToken().trim();\n date.setYear(Integer.parseInt(year) - 1900);\n st=new StringTokenizer(hourString.trim(),\":\");\n date.setHours(Integer.parseInt(st.nextToken()));\n date.setMinutes(Integer.parseInt(st.nextToken()));\n date.setSeconds(Integer.parseInt(st.nextToken()));\n return date;\n}\n", "side_b_code": "Date dateExtractor(String a){\n if (a.equalsIgnoreCase(\"\")) {\n return new Date();\n }\n String dateString=null;\n if (a.indexOf(\" \") > 0) {\n dateString=a.substring(0,a.indexOf(\" \"));\n }\n else {\n dateString=a.trim();\n }\n Date date=new Date();\n StringTokenizer st=new StringTokenizer(dateString.trim(),\"-\");\n String year=st.nextToken().trim();\n date.setYear(Integer.parseInt(year) - 1900);\n date.setMonth(Integer.parseInt(st.nextToken()) - 1);\n date.setDate(Integer.parseInt(st.nextToken()));\n return date;\n}\n"}, {"id": "l1_neg_9955", "level": 1, "label": "not_equivalent", "component_pairids": [9955], "source": "fempd_verified_negative_pairs", "side_a_code": "int hashCode(byte[] array,int start,int end){\n int code=0;\n for (int i=end - 1; i >= start; i--) code=code * 31 + array[i];\n return code;\n}\n", "side_b_code": "int sum(byte[] bytes,int start,int end){\n int sum=0;\n for (int i=start; i < end; i++) {\n byte b=bytes[i];\n sum+=b;\n }\n return sum;\n}\n"}, {"id": "l1_neg_10402", "level": 1, "label": "not_equivalent", "component_pairids": [10402], "source": "fempd_verified_negative_pairs", "side_a_code": "boolean isRecognizedSectionType(char sectionType){\nswitch (Character.toLowerCase(sectionType)) {\ncase ' ':case 'r':case 'e':case 'c':case 'u':case 's':case 'd':{\n return true;\n }\ndefault:{\n return false;\n }\n}\n}\n", "side_b_code": "boolean isChar(char x){\n boolean b=true;\nswitch (x) {\ncase '1':case '2':case '3':case '4':case '5':case '6':case '7':case '8':case '9':case '0': b=false;\n break;\ndefault:b=true;\n}\nreturn b;\n}\n"}, {"id": "l1_neg_7862", "level": 1, "label": "not_equivalent", "component_pairids": [7862], "source": "fempd_verified_negative_pairs", "side_a_code": "boolean hasEmpty(String[] list){\n if (list == null || list.length == 0) {\n return true;\n }\n String str=null;\n int len=list.length;\n for (int i=0; i < len; i++) {\n str=list[i];\n if (str == null || \"\".equals(str)) {\n return true;\n }\n }\n return false;\n}\n", "side_b_code": "boolean isUniversalMatch(String[] sa){\n if (sa == null || sa.length == 0) return true;\n for (int i=0; i < sa.length; i++) {\n if (sa[i] == null || sa[i].equals(\"*\")) return true;\n }\n return false;\n}\n"}, {"id": "l1_pos_10052", "level": 1, "label": "equivalent", "component_pairids": [10052], "source": "fempd_verified_pairs", "side_a_code": "String getDelimitedSubstring(String text,String startDelimiter,String endDelimiter){\n int start;\n int stop;\n String subStr=\"\";\n if ((text != null) && (startDelimiter != null) && (endDelimiter != null)) {\n start=text.indexOf(startDelimiter);\n if (start >= 0) {\n stop=text.indexOf(endDelimiter,start + 1);\n if (stop > start) {\n subStr=text.substring(start + 1,stop);\n }\n }\n }\n return subStr;\n}\n", "side_b_code": "String getDelimitedSubstring(String text,String startDelimiter,String endDelimiter){\n int start;\n int stop;\n String subStr=\"\";\n if ((text != null) && (startDelimiter != null) && (endDelimiter != null)) {\n start=text.indexOf(startDelimiter);\n if (start >= 0) {\n stop=text.indexOf(endDelimiter,start + 1);\n if (stop > start) subStr=text.substring(start + 1,stop);\n }\n }\n return subStr;\n}\n"}, {"id": "l1_pos_8141", "level": 1, "label": "equivalent", "component_pairids": [8141], "source": "fempd_verified_pairs", "side_a_code": "float Dot(float[] row,float[] col,int size){\n float result=0;\n for (int i=0; i < size; i++) result+=row[i] * col[i];\n return result;\n}\n", "side_b_code": "float dotProduct(float[] row,float[] col,int size){\n float result=0.0f;\n for (int i=0; i < size; i++) {\n result+=row[i] * col[i];\n }\n return result;\n}\n"}, {"id": "l1_pos_4464", "level": 1, "label": "equivalent", "component_pairids": [4464], "source": "fempd_verified_pairs", "side_a_code": "double aritmetickaSredina(double[] polje){\n if (polje.length == 0) return 0;\n double zbroj=0;\n for (int i=0; i < polje.length; i++) {\n zbroj+=polje[i];\n }\n return zbroj / polje.length;\n}\n", "side_b_code": "double execute(double[] values){\n int len=values.length;\n if (len > 0) {\n double sum=0;\n for ( double v : values) {\n sum+=v;\n }\n return sum / len;\n }\n else {\n return 0;\n }\n}\n"}, {"id": "l1_neg_12413", "level": 1, "label": "not_equivalent", "component_pairids": [12413], "source": "fempd_verified_negative_pairs", "side_a_code": "String doso(String content,int length){\n if (null != content && !\"\".equals(content)) {\n if (content.length() > length) {\n content=content.substring(0,length) + \"...\";\n }\n return content;\n }\n else {\n return \"\";\n }\n}\n", "side_b_code": "String trimToSize(String orig,int length){\n if (orig == null) return \"\";\n if (orig.length() < length) return orig;\n else return orig.substring(0,length);\n}\n"}, {"id": "l1_neg_8905", "level": 1, "label": "not_equivalent", "component_pairids": [8905], "source": "fempd_verified_negative_pairs", "side_a_code": "double normalRelativeAngle(double angle){\n if (angle > 180) return ((angle + 180) % 360) - 180;\n if (angle < -180) return ((angle - 180) % 360) + 180;\n return angle;\n}\n", "side_b_code": "double normalize_longitude(double lon){\n double times;\n if (lon >= -180.0 && lon <= 180.0) {\n return (lon);\n }\n else {\n times=Math.floor((Math.abs(lon) + 180.0) / 360.0);\n if (lon < 0.0) {\n return (lon + 360.0 * times);\n }\n else {\n return (lon - 360.0 * times);\n }\n }\n}\n"}, {"id": "l1_pos_6213", "level": 1, "label": "equivalent", "component_pairids": [6213], "source": "fempd_verified_pairs", "side_a_code": "boolean isEqual(boolean[] a,boolean[] b){\n if (a == null) {\n return b == null;\n }\n if (b == null) {\n return false;\n }\n if (a.length != b.length) {\n return false;\n }\n for (int i=a.length - 1; i >= 0; i--) {\n if (a[i] != b[i]) {\n return false;\n }\n }\n return true;\n}\n", "side_b_code": "boolean areEqual(boolean[] a,boolean[] b){\n if (a == b) {\n return true;\n }\n if (a == null || b == null) {\n return false;\n }\n if (a.length != b.length) {\n return false;\n }\n for (int i=0; i != a.length; i++) {\n if (a[i] != b[i]) {\n return false;\n }\n }\n return true;\n}\n"}, {"id": "l1_neg_8326", "level": 1, "label": "not_equivalent", "component_pairids": [8326], "source": "fempd_verified_negative_pairs", "side_a_code": "int findClosingBracket(String str,int start){\n int pos=start;\n int open=1;\n while (open > 0 && pos < str.length()) {\n if (str.charAt(pos) == '(') open++;\n if (str.charAt(pos) == ')') open--;\n pos++;\n }\n if (open > 0) return -1;\n return pos;\n}\n", "side_b_code": "int getBracketBlockEndPos(String expr,int offset){\n int depth=1, i, len=expr.length();\n for (i=offset + 1; i < len && depth != 0; i++) {\n char c=expr.charAt(i);\n if (c == ')') depth--;\n else if (c == '(') depth++;\n }\n return (i < len || depth == 0) ? i : -1;\n}\n"}, {"id": "l1_neg_1929", "level": 1, "label": "not_equivalent", "component_pairids": [1929], "source": "fempd_verified_negative_pairs", "side_a_code": "Byte toByte(Object value){\n if (value == null) {\n return null;\n }\n if (value instanceof Byte) {\n return (Byte)value;\n }\n return Byte.valueOf(value.toString());\n}\n", "side_b_code": "Byte toByte(Object value){\n if (value != null) {\n if (value instanceof Byte) {\n return (Byte)value;\n }\n else if (value instanceof Number) {\n return Byte.valueOf(((Number)value).byteValue());\n }\n else {\n byte byteValue=Byte.parseByte(value.toString());\n return Byte.valueOf(byteValue);\n }\n }\n return null;\n}\n"}, {"id": "l1_neg_6623", "level": 1, "label": "not_equivalent", "component_pairids": [6623], "source": "fempd_verified_negative_pairs", "side_a_code": "double round(double v,int a){\n double p=1;\n for (int i=0; i < java.lang.Math.abs(a); i++) {\n p*=10;\n }\n return a < 0 ? ((long)(v / p)) * p : ((long)(v * p)) / p;\n}\n", "side_b_code": "double r(double x,int precision){\n double ret;\n if (precision == 0) {\n ret=(long)x;\n }\n else {\n ret=(long)(x * Math.pow(10,precision));\n ret=ret / (Math.pow(10,precision));\n }\n return ret;\n}\n"}, {"id": "l1_neg_6262", "level": 1, "label": "not_equivalent", "component_pairids": [6262], "source": "fempd_verified_negative_pairs", "side_a_code": "String dummy_quality_value(int value,int line_length,int total_length){\n StringBuffer buff=new StringBuffer();\n for (int i=0; i < total_length; i+=line_length) {\n for (int j=0; j < line_length && i + j < total_length; j++) {\n buff.append(value + \" \");\n }\n buff.append(\"\\n\");\n }\n return buff.toString();\n}\n", "side_b_code": "String generaContrasena(int cars,int nums,int esps){\n StringBuffer sb=new StringBuffer(\"\");\n int c=0, n=0, e=0, tmp;\n Random r=new Random(Calendar.getInstance().getTimeInMillis());\n char ch;\n while (true) {\n tmp=r.nextInt(126);\n if (tmp < 33) {\n continue;\n }\n ch=(char)tmp;\n if (Character.isWhitespace(ch)) {\n continue;\n }\n else if (Character.isDigit(ch) && n < nums) {\n n++;\n sb.append(ch);\n }\n else if (Character.isLetter(ch) && c < cars) {\n c++;\n sb.append(ch);\n }\n else if (e < esps) {\n e++;\n sb.append(ch);\n }\n if (c == cars && n == nums && e == esps) {\n break;\n }\n }\n return sb.toString();\n}\n"}, {"id": "l1_neg_8753", "level": 1, "label": "not_equivalent", "component_pairids": [8753], "source": "fempd_verified_negative_pairs", "side_a_code": "boolean isNumberChar(char c){\n if (Character.isDigit(c)) return true;\nswitch (c) {\ncase '.':case '+':case '-':case 'd':case 'D':case 'e':case 'E':case 'f':case 'F': return true;\ndefault: return false;\n}\n}\n", "side_b_code": "boolean isProto(char c){\n if (Character.isLetterOrDigit(c)) {\n return true;\n }\n if (c == '+' || c == '-' || c == '.') {\n return true;\n }\n return false;\n}\n"}, {"id": "l1_pos_523", "level": 1, "label": "equivalent", "component_pairids": [523], "source": "fempd_verified_pairs", "side_a_code": "boolean equals(byte[] arr1,byte[] arr2){\n if (arr1 == null || arr2 == null) return arr1 == arr2;\n if (arr1.length != arr2.length) return false;\n for (int i=0; i < arr1.length; i++) {\n if (arr1[i] != arr2[i]) return false;\n }\n return true;\n}\n", "side_b_code": "boolean compareSecure(byte[] test,byte[] good){\n if ((test == null) || (good == null)) {\n return (test == null) && (good == null);\n }\n if (test.length != good.length) {\n return false;\n }\n if (test.length == 0) {\n return true;\n }\n int bits=0;\n for (int i=0; i < good.length; i++) {\n bits|=test[i] ^ good[i];\n }\n return bits == 0;\n}\n"}, {"id": "l1_pos_1812", "level": 1, "label": "equivalent", "component_pairids": [1812], "source": "fempd_verified_pairs", "side_a_code": "String getData(byte[] data){\n StringBuilder sb=new StringBuilder();\n for ( byte b : data) {\n if (b < 0) sb.append(Integer.toHexString(256 + b));\n else if (b < 16) sb.append(\"0\").append(Integer.toHexString(b));\n else sb.append(Integer.toHexString(b));\n }\n return sb.toString();\n}\n", "side_b_code": "String encodeHexBinary(byte[] bytes){\n StringBuilder sb=new StringBuilder();\n for (int i=0; i < bytes.length; i++) {\n byte b=bytes[i];\n if (b < 0) sb.append(Integer.toHexString(256 + b));\n else if (b < 16) sb.append(\"0\").append(Integer.toHexString(b));\n else sb.append(Integer.toHexString(b));\n }\n return sb.toString();\n}\n"}, {"id": "l1_neg_9408", "level": 1, "label": "not_equivalent", "component_pairids": [9408], "source": "fempd_verified_negative_pairs", "side_a_code": "String MonthtoGoogle(Calendar cal){\n String month=null;\n if (cal.get(Calendar.MONTH) == Calendar.JANUARY) month=\"Jan\";\n else if (cal.get(Calendar.MONTH) == Calendar.FEBRUARY) month=\"Feb\";\n else if (cal.get(Calendar.MONTH) == Calendar.MARCH) month=\"Mar\";\n else if (cal.get(Calendar.MONTH) == Calendar.APRIL) month=\"Apr\";\n else if (cal.get(Calendar.MONTH) == Calendar.MAY) month=\"May\";\n else if (cal.get(Calendar.MONTH) == Calendar.JUNE) month=\"Jun\";\n else if (cal.get(Calendar.MONTH) == Calendar.JULY) month=\"Jul\";\n else if (cal.get(Calendar.MONTH) == Calendar.AUGUST) month=\"Aug\";\n else if (cal.get(Calendar.MONTH) == Calendar.SEPTEMBER) month=\"Sep\";\n else if (cal.get(Calendar.MONTH) == Calendar.OCTOBER) month=\"Oct\";\n else if (cal.get(Calendar.MONTH) == Calendar.NOVEMBER) month=\"Nov\";\n else month=\"Dec\";\n return month;\n}\n", "side_b_code": "String getMonth(Calendar d){\n String month=\"\";\nswitch (d.get(Calendar.MONTH)) {\ncase 0: month=\"Jan\";\n break;\ncase 1:month=\"Feb\";\nbreak;\ncase 2:month=\"Mar\";\nbreak;\ncase 3:month=\"Apr\";\nbreak;\ncase 4:month=\"May\";\nbreak;\ncase 5:month=\"Jun\";\nbreak;\ncase 6:month=\"Jul\";\nbreak;\ncase 7:month=\"Aug\";\nbreak;\ncase 8:month=\"Sep\";\nbreak;\ncase 9:month=\"Oct\";\nbreak;\ncase 10:month=\"Nov\";\nbreak;\ncase 11:month=\"Dec\";\nbreak;\n}\nreturn month;\n}\n"}, {"id": "l1_pos_10906", "level": 1, "label": "equivalent", "component_pairids": [10906], "source": "fempd_verified_pairs", "side_a_code": "boolean isSchemeChar(char c){\n if (c == '+' || c == '.' || c == '-') {\n return true;\n }\n if (Character.isLetterOrDigit(c)) {\n return true;\n }\n return false;\n}\n", "side_b_code": "boolean isProto(char c){\n if (Character.isLetterOrDigit(c)) {\n return true;\n }\n if ((c == '+') || (c == '-') || (c == '.')) {\n return true;\n }\n return false;\n}\n"}, {"id": "l1_neg_7871", "level": 1, "label": "not_equivalent", "component_pairids": [7871], "source": "fempd_verified_negative_pairs", "side_a_code": "boolean validateName(String name,int minLength){\n boolean validated=true;\n if (!(name.matches(\"^[a-zA-Z.]+$\"))) {\n validated=false;\n }\n if (name.length() > 15 || name.length() < minLength) {\n validated=false;\n }\n if ((minLength == 0) && (name.equals(\"\"))) {\n validated=true;\n }\n return validated;\n}\n", "side_b_code": "boolean verifiyChecksum(String nmeasentence,int checksum){\n int sum=0;\n for (int i=0; i < nmeasentence.length(); i++) {\n char value=nmeasentence.charAt(i);\n if (value != '$' && value != '*') {\n sum^=value;\n }\n }\n if (sum == checksum) return true;\n return false;\n}\n"}, {"id": "l1_neg_899", "level": 1, "label": "not_equivalent", "component_pairids": [899], "source": "fempd_verified_negative_pairs", "side_a_code": "double[] setLengthFromEnd(double[] data,int length){\n double[] ans=new double[length];\n int debut;\n if (length - data.length < 0) debut=data.length - length;\n else debut=0;\n System.arraycopy(data,debut,ans,-data.length + length + debut,data.length - debut);\n return (ans);\n}\n", "side_b_code": "double[] setLengthFromBeginning(double[] data,int length){\n double[] ans=new double[length];\n int debut;\n if (length - data.length < 0) debut=data.length - length;\n else debut=0;\n System.arraycopy(data,0,ans,0,data.length - debut);\n return (ans);\n}\n"}, {"id": "l1_pos_3951", "level": 1, "label": "equivalent", "component_pairids": [3951], "source": "fempd_verified_pairs", "side_a_code": "double getAngle(double xHaarResponse,double yHaarResponse){\n if (xHaarResponse >= 0 && yHaarResponse >= 0) return Math.atan(yHaarResponse / xHaarResponse);\n if (xHaarResponse < 0 && yHaarResponse >= 0) return Math.PI - Math.atan(-yHaarResponse / xHaarResponse);\n if (xHaarResponse < 0 && yHaarResponse < 0) return Math.PI + Math.atan(yHaarResponse / xHaarResponse);\n if (xHaarResponse >= 0 && yHaarResponse < 0) return 2 * Math.PI - Math.atan(-yHaarResponse / xHaarResponse);\n return 0;\n}\n", "side_b_code": "double getAngle(double xDiff,double yDiff){\n double angle=0;\n if ((xDiff >= 0) && (yDiff >= 0)) {\n angle=Math.atan(yDiff / xDiff);\n }\n else if ((xDiff < 0) && (yDiff >= 0)) {\n angle=Math.PI + Math.atan(yDiff / xDiff);\n }\n else if ((xDiff < 0) && (yDiff < 0)) {\n angle=Math.PI + Math.atan(yDiff / xDiff);\n }\n else if ((xDiff >= 0) && (yDiff < 0)) {\n angle=(2 * Math.PI) + Math.atan(yDiff / xDiff);\n }\n return angle;\n}\n"}, {"id": "l1_neg_1040", "level": 1, "label": "not_equivalent", "component_pairids": [1040], "source": "fempd_verified_negative_pairs", "side_a_code": "boolean arrayEquals(byte[] b1,byte[] b2){\n if (b1 == null || b2 == null || b1.length != b2.length) {\n return false;\n }\n for (int i=0; i < b1.length; i++) {\n if (b1[i] != b2[i]) {\n return false;\n }\n }\n return true;\n}\n", "side_b_code": "boolean isEquals(byte[] b1,byte[] b2){\n if (b1 == b2) return true;\n if (b1 == null || b2 == null) return false;\n int length=b1.length;\n if (length != b2.length) return false;\n for (int index=0; index < length; index++) {\n if (!(b1[index] == b2[index])) return false;\n }\n return true;\n}\n"}, {"id": "l1_neg_4860", "level": 1, "label": "not_equivalent", "component_pairids": [4860], "source": "fempd_verified_negative_pairs", "side_a_code": "String newValueToInsert(String w,int length,int index){\n if (w.length() < length) return w;\n else {\n String newValue=w.substring(w.length() - length,w.length());\n return newValue;\n }\n}\n", "side_b_code": "String newValueToInsert(String w,int length,int index){\n if (w.length() < length) return w;\n else {\n return w.substring(0,length);\n }\n}\n"}, {"id": "l1_pos_11162", "level": 1, "label": "equivalent", "component_pairids": [11162], "source": "fempd_verified_pairs", "side_a_code": "int diff_commonSuffix(String text1,String text2){\n int text1_length=text1.length();\n int text2_length=text2.length();\n int n=Math.min(text1_length,text2_length);\n for (int i=1; i <= n; i++) {\n if (text1.charAt(text1_length - i) != text2.charAt(text2_length - i)) {\n return i - 1;\n }\n }\n return n;\n}\n", "side_b_code": "int longestCommonSuffixLength(String s,String t){\n int i=s.length() - 1;\n int j=t.length() - 1;\n for (; i >= 0 && j >= 0; --i, --j) if (s.charAt(i) != t.charAt(j)) return s.length() - (i + 1);\n return s.length() - (i + 1);\n}\n"}, {"id": "l1_pos_5989", "level": 1, "label": "equivalent", "component_pairids": [5989], "source": "fempd_verified_pairs", "side_a_code": "float atof(String in){\n if (in == null || in.length() == 0) return 0;\n try {\n return Float.parseFloat(in);\n }\n catch ( Exception e) {\n return 0;\n }\n}\n", "side_b_code": "float TryParseFloat(String s){\n if (s == null || s.isEmpty()) {\n return 0.0f;\n }\n try {\n return Float.parseFloat(s);\n }\n catch ( Throwable t) {\n return 0.0f;\n }\n}\n"}] |