Upload proj4_all_labs.csv
Browse files- proj4_all_labs.csv +187 -0
proj4_all_labs.csv
ADDED
@@ -0,0 +1,187 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
sentence,label
|
2 |
+
" perms = all_permutations_substrings(string)\n return set(''.join(perm) for word in words for perm in perms if word == perm)",0
|
3 |
+
" perms = all_permutations_substrings(string)\n out = set()\n for w in words:\n for s in perms:\n if w == s:\n out.add(w)\n return out",0
|
4 |
+
" perms = all_permutations_substrings(string)\n return set(word for word in words if word in perms)",0
|
5 |
+
" perms = all_permutations_substrings(string)\n return {word for word in words if word in perms}",0
|
6 |
+
" perms = all_permutations_substrings(string)\n return {word for word in words for perm in perms if word in perm}",0
|
7 |
+
" perms = all_permutations_substrings(string)\n return {perm for perm in words if perm in perms}",0
|
8 |
+
" perms = all_permutations_substrings(string)\n return {word for word in words if word in set(perms)}",0
|
9 |
+
" perms = all_permutations_substrings(string)\n return set(x for x in words if x in perms)",0
|
10 |
+
" perms = all_permutations_substrings(string)\n return set(perm for perm in perms if perm in words)",0
|
11 |
+
" perms = all_permutations_substrings(string)\n return {x for x in words if x in perms}",0
|
12 |
+
" perms = all_permutations_substrings(string)\n return {w for w in words if w in perms}",0
|
13 |
+
" perms = all_permutations_substrings(string)\n return {i for i in perms if (i in words)",0
|
14 |
+
" perms = all_permutations_substrings(string)\n return {item for item in perms if item in words}",0
|
15 |
+
" perms = all_permutations_substrings(string)\n return {x for x in perms for y in words if x == y}",0
|
16 |
+
" perms = all_permutations_substrings(string)\n return set([perm for perm in perms if perm in words])",0
|
17 |
+
" perms = all_permutations_substrings(string)\n set = {} \n set = {i for i in perms if i in words}",0
|
18 |
+
" perms = all_permutations_substrings(string)\n p = {items for items in words if items in perms}\n return p",0
|
19 |
+
" perms = all_permutations_substrings(string)\n return set([x for x in list(perms) + words if x in list(perms) and x in words])",0
|
20 |
+
" perms = all_permutations_substrings(string)\n all_permutations_list = []\n [all_permutations_list.append(permutation) for permutation in perms if permutation in words]\n return set(all_permutations_list)",0
|
21 |
+
" perms = all_permutations_substrings(string)\n return set([perm for perm in perms for word in words if perm == word])",0
|
22 |
+
" perms = all_permutations_substrings(string)\n out = set()\n for w in words:\n for s in perms:\n if w == s :\n out.add(w)\n return out",0
|
23 |
+
" perms = all_permutations_substrings(string)\n match_words = []\n for i in words:\n for j in perms:\n if i==j:\n match_words.append(i)\n return set(match_words)",0
|
24 |
+
" perms = all_permutations_substrings(string)\n to_return = []\n for w in words:\n if w in perms:\n to_return.append(w)\n to_return = set(to_return)\n return to_return",0
|
25 |
+
" perms = all_permutations_substrings(string)\n list1 = []\n for p in perms:\n if p not in list1:\n if p in words:\n list1.append(p)\n return set(list1)",0
|
26 |
+
" perms = all_permutations_substrings(string)\n items = set()\n for word in words:\n if hash(word) in {hash(item) for item in perms}:\n items.add(word)\n return items",0
|
27 |
+
" perms = all_permutations_substrings(string)\n return {word for word in words if hash(word) in {hash(looking) for looking in perms}}",0
|
28 |
+
" perms = all_permutations_substrings(string)\n return {letters for letters in words if hash(letters) in {hash(find) for find in perms}}",0
|
29 |
+
" perms = all_permutations_substrings(string)\n return {each for each in words if hash(each) in {hash(find) for find in perms }}",0
|
30 |
+
" perms = all_permutations_substrings(string)\n return set({item:None for item in perms if item in words}.keys()) ",0
|
31 |
+
" perms = all_permutations_substrings(string)\n return set(filter(lambda x: x in perms, words))",0
|
32 |
+
" counter = defaultdict(int)\n for character in string:\n counter[character] += 1\n result = set()\n for word in words:\n word_counter = defaultdict(int)\n for character in word:\n word_counter[character] += 1\n for key, count in word_counter.items():\n if counter[key] < count:\n break\n else:\n result.add(word)\n return result",0
|
33 |
+
" perms = all_permutations_substrings(string)\n matching_words = set()\n for i in range(1, len(string)+1):\n for perm in permutations(string, i):\n if ''.join(perm) in words:\n matching_words.add(''.join(perm))\n return matching_words",0
|
34 |
+
" perms = all_permutations_substrings(string)\n return set(list(set(perms) & set(words)))",0
|
35 |
+
" perms = all_permutations_substrings(string)\n for x in perms:\n words.append(x)\n dupes = [x for n, x in enumerate(words) if x in words[:n]] \n return set(dupes)",0
|
36 |
+
" perms = all_permutations_substrings(string)\n result = perms & set(words)\n return set(i for i in words if i in perms)",0
|
37 |
+
" perms = all_permutations_substrings(string)\n return perms.intersection(words)",1
|
38 |
+
" perms = all_permutations_substrings(string)\n return set.intersection(perms,words)",1
|
39 |
+
" perms = all_permutations_substrings(string)\n return set(perms).intersection(words)",1
|
40 |
+
" perms = all_permutations_substrings(string)\n return set(words) & set(perms)",1
|
41 |
+
" perms = all_permutations_substrings(string)\n return set(perms) & set(words)",1
|
42 |
+
" perms = all_permutations_substrings(string)\n if set(words) & set(perms):\n res = (set(words) & set(perms))\n return res",1
|
43 |
+
" perms = all_permutations_substrings(string)\n return set(words)&perms",1
|
44 |
+
" perms = all_permutations_substrings(string)\n return set( perms.intersection(words))",1
|
45 |
+
" perms = all_permutations_substrings(string)\n combined = set(perms)&set(words)\n return combined",1
|
46 |
+
" perms = all_permutations_substrings(string)\n p2 = set(words)\n p1 = all_permutations_substrings(string)\n return p1.intersection(p2)",1
|
47 |
+
" perms = all_permutations_substrings(string)\n return perms.intersection(set(words))",1
|
48 |
+
" perms = all_permutations_substrings(string)\n return set(set(perms).intersection(words)) ",1
|
49 |
+
" perms = all_permutations_substrings(string)\n x2 = set(words)\n x1 = all_permutations_substrings(string)\n return x1.intersection(x2)",1
|
50 |
+
" perms = all_permutations_substrings(string)\n list = []\n return set(words).intersection(perms)",1
|
51 |
+
" it = list(dict.fromkeys(it))
|
52 |
+
it.sort()
|
53 |
+
return it",3
|
54 |
+
" sequence = []
|
55 |
+
for i in it:
|
56 |
+
if i in sequence:
|
57 |
+
pass
|
58 |
+
else:
|
59 |
+
sequence.append(i)
|
60 |
+
sequence.sort()
|
61 |
+
return sequence",3
|
62 |
+
" unique = list(set(it))
|
63 |
+
unique.sort()
|
64 |
+
return unique",3
|
65 |
+
" ordered_items = []
|
66 |
+
for i in it:
|
67 |
+
if i not in ordered_items:
|
68 |
+
ordered_items.append(i)
|
69 |
+
ordered_items.sort()
|
70 |
+
return ordered_items",3
|
71 |
+
" sorted_list = []
|
72 |
+
for a in it:
|
73 |
+
if a not in sorted_list:
|
74 |
+
sorted_list.append(a)
|
75 |
+
sorted_list.sort()
|
76 |
+
return sorted_list",3
|
77 |
+
" it = list(set(it))
|
78 |
+
it.sort()
|
79 |
+
return it ",3
|
80 |
+
" nonUniqueList = list(it)
|
81 |
+
uniqueList = list(set(nonUniqueList))
|
82 |
+
uniqueList.sort()
|
83 |
+
return uniqueList",3
|
84 |
+
" out = set(it)
|
85 |
+
out = list(out)
|
86 |
+
out.sort()
|
87 |
+
return out ",3
|
88 |
+
" uniq_list = list(set(it))
|
89 |
+
uniq_list.sort()
|
90 |
+
return uniq_list",3
|
91 |
+
" values = set()
|
92 |
+
for thing in it:
|
93 |
+
values.add(thing)
|
94 |
+
values = [*values,]
|
95 |
+
values.sort()
|
96 |
+
return values",3
|
97 |
+
"return sorted(list({word : it.count(word) for (word) in set(it)}.keys())) ",2
|
98 |
+
"return list(dict.fromkeys(sorted(it)))",2
|
99 |
+
"return sorted((list(dict.fromkeys(it)))) ",2
|
100 |
+
"return sorted({k for k in list(it)})",2
|
101 |
+
" it = sorted(it)
|
102 |
+
outputSequence = []
|
103 |
+
for input in it:
|
104 |
+
found = 0
|
105 |
+
for output in outputSequence:
|
106 |
+
if output == input:
|
107 |
+
found = 1
|
108 |
+
break
|
109 |
+
if not found:
|
110 |
+
outputSequence.append(input)
|
111 |
+
return outputSequence",2
|
112 |
+
"return sorted(list(dict.fromkeys(it).keys()))",2
|
113 |
+
" sequence_list = list(it)
|
114 |
+
unique_list = list(set(sequence_list))
|
115 |
+
sorted_list = sorted(unique_list, reverse=False)
|
116 |
+
return sorted_list",2
|
117 |
+
" seen = set()
|
118 |
+
unique_elems = (elem for elem in it if elem not in seen and not seen.add(elem))
|
119 |
+
return sorted(unique_elems)",2
|
120 |
+
" unique_items = set(it)
|
121 |
+
return sorted(list(unique_items))",4
|
122 |
+
" letters = set(it)
|
123 |
+
sorted_letters = sorted(letters)
|
124 |
+
return sorted_letters",4
|
125 |
+
"return list(sorted(set(it)))",4
|
126 |
+
"it=sorted(set(list(it)))
|
127 |
+
return it",4
|
128 |
+
" return sorted(list({x for x in it})) ",4
|
129 |
+
"return sorted(set(list(it))) ",4
|
130 |
+
"return sorted(list(set(it)))",4
|
131 |
+
"return sorted(set(it)) ",4
|
132 |
+
"return sorted([*set(it)]) ",4
|
133 |
+
" outputSequence = []
|
134 |
+
for input in it:
|
135 |
+
found = 0
|
136 |
+
for output in outputSequence:
|
137 |
+
if output == input:
|
138 |
+
found = 1
|
139 |
+
break
|
140 |
+
if not found:
|
141 |
+
outputSequence.append(input)
|
142 |
+
return outputSequence",5
|
143 |
+
" uniq = []
|
144 |
+
for char in it:
|
145 |
+
if not char in uniq:
|
146 |
+
uniq.append(char)
|
147 |
+
return uniq",5
|
148 |
+
"return sorted(set(it), key=lambda y: it.index(y)) ",5
|
149 |
+
" d={}
|
150 |
+
res=[]
|
151 |
+
for x in it:
|
152 |
+
d[x]=0
|
153 |
+
for k in d:
|
154 |
+
res.append(k)
|
155 |
+
return res",5
|
156 |
+
" registered = set()
|
157 |
+
register = registered.add
|
158 |
+
return [x for x in it if not (x in registered or register(x))]",5
|
159 |
+
" array=[]
|
160 |
+
for i in it:
|
161 |
+
if i not in array:
|
162 |
+
array.append(i)
|
163 |
+
return array ",5
|
164 |
+
" seen = set()
|
165 |
+
return [x for x in it if not (x in seen or seen.add(x))]",5
|
166 |
+
" seen = set()
|
167 |
+
seen_add = seen.add
|
168 |
+
return [x for x in it if not (x in seen or seen_add(x))]",5
|
169 |
+
"return [l for i, l in enumerate(it) if i == it.index(l)]",5
|
170 |
+
" seen = set()
|
171 |
+
result = []
|
172 |
+
for word in it:
|
173 |
+
if word not in seen:
|
174 |
+
result.append(word)
|
175 |
+
seen.add(word)
|
176 |
+
return result",5
|
177 |
+
"return (x for y, x in enumerate(it) if it.index(x) == y)",5
|
178 |
+
"return [value for key, value in enumerate(it) if value not in it[:key]]",5
|
179 |
+
"return sorted(set(it), key=it.index)",5
|
180 |
+
"return [tmp for tmp in dict.fromkeys(it).keys()]",6
|
181 |
+
"return [i for i in dict.fromkeys(it)]",6
|
182 |
+
"return list(dict.fromkeys(it))",6
|
183 |
+
"return list(dict.fromkeys(it).keys())",6
|
184 |
+
"return list(dict.fromkeys(it))",6
|
185 |
+
"return [x for x in dict.fromkeys(it).keys()]",6
|
186 |
+
"return list(dict.fromkeys(it).keys()) ",6
|
187 |
+
"return list(dict.fromkeys(it))",6
|