rem stringlengths 2 226k | add stringlengths 0 227k | context stringlengths 8 228k | meta stringlengths 156 215 | input_ids list | attention_mask list | labels list |
|---|---|---|---|---|---|---|
def read_group(self, cr, uid, domain, fields, groupby, offset=0, limit=None, orderby=False, context=None): | def read_group(self, cr, uid, domain, fields, groupby, offset=0, limit=None, context=None, orderby=False): | def read_group(self, cr, uid, domain, fields, groupby, offset=0, limit=None, orderby=False, context=None): """ Get the list of records in list view grouped by the given ``groupby`` fields | 9c12251ed4ef7c74113be0eea3882ea11342a906 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/12853/9c12251ed4ef7c74113be0eea3882ea11342a906/orm.py | [
1,
8585,
326,
22398,
316,
326,
981,
30,
1652,
855,
67,
1655,
12,
2890,
16,
4422,
16,
4555,
16,
2461,
16,
1466,
16,
13126,
16,
1384,
33,
20,
16,
1800,
33,
7036,
16,
819,
33,
7036,
16,
20519,
33,
8381,
4672,
3536,
968,
326,
666,
... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0... | [
1,
8585,
326,
22398,
316,
326,
981,
30,
1652,
855,
67,
1655,
12,
2890,
16,
4422,
16,
4555,
16,
2461,
16,
1466,
16,
13126,
16,
1384,
33,
20,
16,
1800,
33,
7036,
16,
819,
33,
7036,
16,
20519,
33,
8381,
4672,
3536,
968,
326,
666,
... |
dc.SetPen(wx.Pen(wx.BLACK, 1, wx.SOLID)) | dc.SetPen(wx.BLACK_PEN) | def DrawMonth(self, dc, startDate, y, highlightDate = False): """ draw a single month return the updated value of y """ dc.SetTextForeground(wx.BLACK); | b4bffc7cad7daee9a037b7296130e65ad5d69367 /local1/tlutelli/issta_data/temp/all_python//python/2006_temp/2006/9228/b4bffc7cad7daee9a037b7296130e65ad5d69367/minical.py | [
1,
8585,
326,
22398,
316,
326,
981,
30,
1652,
10184,
5445,
12,
2890,
16,
6744,
16,
12572,
16,
677,
16,
8839,
1626,
273,
1083,
4672,
3536,
3724,
279,
2202,
3138,
327,
326,
3526,
460,
434,
677,
3536,
6744,
18,
694,
1528,
23206,
12,
... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
8585,
326,
22398,
316,
326,
981,
30,
1652,
10184,
5445,
12,
2890,
16,
6744,
16,
12572,
16,
677,
16,
8839,
1626,
273,
1083,
4672,
3536,
3724,
279,
2202,
3138,
327,
326,
3526,
460,
434,
677,
3536,
6744,
18,
694,
1528,
23206,
12,
... |
def createBranch(self, newBranch, where, troveName = None): | def createBranch(self, newBranch, where, troveList = []): | def createBranch(self, newBranch, where, troveName = None): | 54c9d9bb5cd277170a2275bd866438b49910d258 /local1/tlutelli/issta_data/temp/all_python//python/2006_temp/2006/8747/54c9d9bb5cd277170a2275bd866438b49910d258/repository.py | [
1,
8585,
326,
22398,
316,
326,
981,
30,
1652,
752,
7108,
12,
2890,
16,
394,
7108,
16,
1625,
16,
23432,
537,
461,
273,
599,
4672,
2,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
8585,
326,
22398,
316,
326,
981,
30,
1652,
752,
7108,
12,
2890,
16,
394,
7108,
16,
1625,
16,
23432,
537,
461,
273,
599,
4672,
2,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100... |
selected = 0 | def _changeItemSelected(combobox, name): """ Change the selected item of a combobox. """ if combobox.count(): selected = 0 for i in xrange(combobox.count()): if name == unicode(combobox.itemText(i)): selected = i combobox.setCurrentIndex(selected) | 845e5b4de5d1a131f28332cb98a331f613feab18 /local1/tlutelli/issta_data/temp/all_python//python/2008_temp/2008/8560/845e5b4de5d1a131f28332cb98a331f613feab18/gui_option.py | [
1,
8585,
326,
22398,
316,
326,
981,
30,
1652,
389,
3427,
1180,
7416,
12,
9301,
27570,
16,
508,
4672,
3536,
7576,
326,
3170,
761,
434,
279,
3894,
27570,
18,
3536,
225,
309,
3894,
27570,
18,
1883,
13332,
364,
277,
316,
12314,
12,
9301... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | [
1,
8585,
326,
22398,
316,
326,
981,
30,
1652,
389,
3427,
1180,
7416,
12,
9301,
27570,
16,
508,
4672,
3536,
7576,
326,
3170,
761,
434,
279,
3894,
27570,
18,
3536,
225,
309,
3894,
27570,
18,
1883,
13332,
364,
277,
316,
12314,
12,
9301... | |
colwidths.append(colwidth) totwidth += colwidth + len(colsep) if totwidth > displaywidth: ncols = col | if totwidth <= displaywidth and i >= size: | def columnize(array, displaywidth=80, colsep = ' ', arrange_vertical=True): """Return a list of strings as a compact set of columns arranged horizontally or vertically. For example, for a line width of 4 characters (arranged vertically): ['1', '2,', '3', '4'] => '1 3\n2 4\n' or arranged horizontally: ['1', '2,', '3', '4'] => '1 2\n3 4\n' Each column is only as wide as necessary. By default, columns are separated by two spaces - one was not legible enough. Set "colsep" to adjust the string separate columns. Set `displaywidth' to set the line width. Normally, consecutive items go down from the top to bottom from the left-most column to the right-most. If "arrange_vertical" is set false, consecutive items will go across, left to right, top to bottom.""" if not isinstance(array, list) and not isinstance(array, tuple): raise TypeError, ( 'array needs to be an instance of a list or a tuple') nonstrings = [i for i in range(len(array)) if not isinstance(array[i], str)] if nonstrings: raise TypeError, ("array[i] not a string for i in %s" % ", ".join(map(str, nonstrings))) # Some degenerate cases size = len(array) if 0 == size: return "<empty>\n" elif size == 1: return '%s\n' % str(array[0]) if arrange_vertical: array_index = lambda nrows, row, col: nrows*col + row else: array_index = lambda nrows, row, col: nrows*row + col pass # Try every row count from 1 upwards ncols = size for nrows in range(1, len(array)): colwidths = [] totwidth = -len(colsep) for col in range(ncols): # get max column width for column "col" colwidth = 0 for row in range(nrows): i = array_index(nrows, row, col) if i >= size: break x = array[i] colwidth = max(colwidth, len(x)) pass colwidths.append(colwidth) totwidth += colwidth + len(colsep) if totwidth > displaywidth: ncols = col break pass if totwidth <= displaywidth: break pass else: nrows = len(array) ncols = 1 colwidths = [0] pass # The smallest number of rows computed and the # max widths for each column has been obtained. # Now we just have to format each of the # rows. s = '' for row in range(nrows): texts = [] for col in range(ncols): i = array_index(nrows, row, col) if i >= size: if arrange_vertical: x = "" else: break else: x = array[i] pass texts.append(x) pass while texts and not texts[-1]: del texts[-1] pass if len(texts) > 0: for col in range(len(texts)): texts[col] = texts[col].ljust(colwidths[col]) pass s += "%s\n" % str(colsep.join(texts)) pass pass pass return s | d5e3c662de79c0b024a03990b1fdcaa692798236 /local1/tlutelli/issta_data/temp/all_python//python/2009_temp/2009/5485/d5e3c662de79c0b024a03990b1fdcaa692798236/columnize.py | [
1,
8585,
326,
22398,
316,
326,
981,
30,
1652,
1057,
554,
12,
1126,
16,
2562,
2819,
33,
3672,
16,
645,
10814,
273,
296,
225,
2265,
2454,
726,
67,
17824,
33,
5510,
4672,
3536,
990,
279,
666,
434,
2064,
487,
279,
6739,
444,
434,
2168... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | [
1,
8585,
326,
22398,
316,
326,
981,
30,
1652,
1057,
554,
12,
1126,
16,
2562,
2819,
33,
3672,
16,
645,
10814,
273,
296,
225,
2265,
2454,
726,
67,
17824,
33,
5510,
4672,
3536,
990,
279,
666,
434,
2064,
487,
279,
6739,
444,
434,
2168... |
prevexact = context.flags[Inexact] | def _rescale(self, exp, rounding=None, context=None, watchexp=1): """Rescales so that the exponent is exp. | 1ed35120311fad235121c44f5d777a7f152b6bc9 /local1/tlutelli/issta_data/temp/all_python//python/2006_temp/2006/8125/1ed35120311fad235121c44f5d777a7f152b6bc9/decimal.py | [
1,
8585,
326,
22398,
316,
326,
981,
30,
1652,
389,
455,
1869,
12,
2890,
16,
1329,
16,
13885,
33,
7036,
16,
819,
33,
7036,
16,
4267,
2749,
33,
21,
4672,
3536,
607,
21177,
1427,
716,
326,
9100,
353,
1329,
18,
2,
0,
0,
0,
0,
0,
... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
8585,
326,
22398,
316,
326,
981,
30,
1652,
389,
455,
1869,
12,
2890,
16,
1329,
16,
13885,
33,
7036,
16,
819,
33,
7036,
16,
4267,
2749,
33,
21,
4672,
3536,
607,
21177,
1427,
716,
326,
9100,
353,
1329,
18,
2,
-100,
-100,
-100,
... | |
'should not happen.' % (self.__class__.__name__, str(documentId), str(self.id)), | 'should not happen.' % (self.__class__.__name__, str(documentId), str(self.id)), | def removeForwardIndexEntry(self, entry, documentId): """Take the entry provided and remove any reference to documentId in its entry in the index. """ indexRow = self._index.get(entry, _marker) if indexRow is not _marker: try: indexRow.remove(documentId) if not indexRow: del self._index[entry] self._length.change(-1) except AttributeError: # index row is an int del self._index[entry] self._length.change(-1) except: LOG.error('%s: unindex_object could not remove ' 'documentId %s from index %s. This ' 'should not happen.' % (self.__class__.__name__, str(documentId), str(self.id)), exc_info=sys.exc_info()) else: LOG.error('%s: unindex_object tried to retrieve set %s ' 'from index %s but couldn\'t. This ' 'should not happen.' % (self.__class__.__name__, repr(entry), str(self.id))) | cfe412921b994df2e17061a3f3e4e9eacb886c4e /local1/tlutelli/issta_data/temp/all_python//python/2006_temp/2006/9658/cfe412921b994df2e17061a3f3e4e9eacb886c4e/UnIndex.py | [
1,
8585,
326,
22398,
316,
326,
981,
30,
1652,
1206,
8514,
1016,
1622,
12,
2890,
16,
1241,
16,
28573,
4672,
3536,
13391,
326,
1241,
2112,
471,
1206,
1281,
2114,
358,
28573,
316,
2097,
1241,
316,
326,
770,
18,
3536,
770,
1999,
273,
36... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | [
1,
8585,
326,
22398,
316,
326,
981,
30,
1652,
1206,
8514,
1016,
1622,
12,
2890,
16,
1241,
16,
28573,
4672,
3536,
13391,
326,
1241,
2112,
471,
1206,
1281,
2114,
358,
28573,
316,
2097,
1241,
316,
326,
770,
18,
3536,
770,
1999,
273,
36... |
[classes[i].append(e) for e in g.edge_iterator() for i in xrange(k) | [classes[i].append(e) for e in g.edge_iterator() for i in xrange(k) | def edge_coloring(g, value_only=False, vizing=False, hex_colors=False, log=0): r""" Properly colors the edges of a graph. See the URL http://en.wikipedia.org/wiki/Edge_coloring for further details on edge coloring. INPUT: - ``g`` -- a graph. - ``value_only`` -- (default: ``False``): - When set to ``True``, only the chromatic index is returned. - When set to ``False``, a partition of the edge set into matchings is returned if possible. - ``vizing`` -- (default: ``False``): - When set to ``True``, tries to find a `\Delta + 1`-edge-coloring, where `\Delta` is equal to the maximum degree in the graph. - When set to ``False``, tries to find a `\Delta`-edge-coloring, where `\Delta` is equal to the maximum degree in the graph. If impossible, tries to find and returns a `\Delta + 1`-edge-coloring. This implies that ``value_only=False``. - ``hex_colors`` -- (default: ``False``) when set to ``True``, the partition returned is a dictionary whose keys are colors and whose values are the color classes (ideal for plotting). - ``log`` -- (default: ``0``) as edge-coloring is an `NP`-complete problem, this function may take some time depending on the graph. Use ``log`` to define the level of verbosity you wantfrom the linear program solver. By default ``log=0``, meaning that there will be no message printed by the solver. OUTPUT: In the following, `\Delta` is equal to the maximum degree in the graph ``g``. - If ``vizing=True`` and ``value_only=False``, return a partition of the edge set into `\Delta + 1` matchings. - If ``vizing=False`` and ``value_only=True``, return the chromatic index. - If ``vizing=False`` and ``value_only=False``, return a partition of the edge set into the minimum number of matchings. - If ``vizing=True`` and ``value_only=True``, should return something, but mainly you are just trying to compute the maximum degree of the graph, and this is not the easiest way. By Vizing's theorem, a graph has a chromatic index equal to `\Delta` or to `\Delta + 1`. EXAMPLE:: sage: from sage.graphs.graph_coloring import edge_coloring sage: g = graphs.PetersenGraph() sage: edge_coloring(g, value_only=True) # optional - requires GLPK or CBC 4 Complete graphs are colored using the linear-time round-robin coloring:: sage: from sage.graphs.graph_coloring import edge_coloring sage: len(edge_coloring(graphs.CompleteGraph(20))) 19 """ from sage.numerical.mip import MixedIntegerLinearProgram from sage.plot.colors import rainbow if g.is_clique(): if value_only: return g.order() if g.order() % 2 == 0 else g.order() + 1 vertices = g.vertices() r = round_robin(g.order()) classes = [[] for v in g] if g.order() % 2 == 0 and not vizing: classes.pop() for (u, v, c) in r.edge_iterator(): classes[c].append((vertices[u], vertices[v])) if hex_colors: return zip(rainbow(len(classes)), classes) else: return classes p = MixedIntegerLinearProgram(maximization=True) color = p.new_variable(dim=2) obj = {} k = max(g.degree()) # reorders the edge if necessary... R = lambda x: x if (x[0] <= x[1]) else (x[1], x[0], x[2]) # Vizing's coloring uses Delta + 1 colors if vizing: value_only = False k += 1 # A vertex can not have two incident edges with the same color. [p.add_constraint( sum([color[R(e)][i] for e in g.edges_incident(v)]), max=1) for v in g.vertex_iterator() for i in xrange(k)] # an edge must have a color [p.add_constraint(sum([color[R(e)][i] for i in xrange(k)]), max=1, min=1) for e in g.edge_iterator()] # anything is good as an objective value as long as it is satisfiable e = g.edge_iterator().next() p.set_objective(color[R(e)][0]) p.set_binary(color) try: if value_only: p.solve(objective_only=True, log=log) else: chi = p.solve(log=log) except: if value_only: return k + 1 else: # if the coloring with Delta colors fails, tries Delta + 1 return edge_coloring(g, vizing=True, hex_colors=hex_colors, log=log) if value_only: return k # Builds the color classes color = p.get_values(color) classes = [[] for i in xrange(k)] [classes[i].append(e) for e in g.edge_iterator() for i in xrange(k) if color[R(e)][i] == 1] # if needed, builds a dictionary from the color classes adding colors if hex_colors: return dict(zip(rainbow(len(classes)), classes)) else: return classes | 0d7c50e7966c0248757876bb79ed98d62c5f0550 /local1/tlutelli/issta_data/temp/all_python//python/2009_temp/2009/9890/0d7c50e7966c0248757876bb79ed98d62c5f0550/graph_coloring.py | [
1,
8585,
326,
22398,
316,
326,
981,
30,
1652,
3591,
67,
3266,
310,
12,
75,
16,
460,
67,
3700,
33,
8381,
16,
331,
6894,
33,
8381,
16,
3827,
67,
9724,
33,
8381,
16,
613,
33,
20,
4672,
436,
8395,
1186,
457,
715,
5740,
326,
5231,
... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | [
1,
8585,
326,
22398,
316,
326,
981,
30,
1652,
3591,
67,
3266,
310,
12,
75,
16,
460,
67,
3700,
33,
8381,
16,
331,
6894,
33,
8381,
16,
3827,
67,
9724,
33,
8381,
16,
613,
33,
20,
4672,
436,
8395,
1186,
457,
715,
5740,
326,
5231,
... |
if not line or line == '\012' and tt == '\012': lexer.whitepace = ' \t\r\n' | if not line or line == '\012': lexer.whitespace = ' \t\r\n' | # Look for a machine, default, or macdef top-level keyword | 497ec60f8026a1c85dc136dad1a40ccfc822ced7 /local1/tlutelli/issta_data/temp/all_python//python/2006_temp/2006/8125/497ec60f8026a1c85dc136dad1a40ccfc822ced7/netrc.py | [
1,
8585,
326,
22398,
316,
326,
981,
30,
468,
10176,
364,
279,
5228,
16,
805,
16,
578,
5318,
536,
1760,
17,
2815,
4932,
2,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
8585,
326,
22398,
316,
326,
981,
30,
468,
10176,
364,
279,
5228,
16,
805,
16,
578,
5318,
536,
1760,
17,
2815,
4932,
2,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-1... |
when the <a href="?VARHELP=general/reply_goes_to_list">reply_goes_to_list</a> option is set to <em>Explicit address</em>. <p>There are many reasons not to introduce or override the <tt>Reply-To:</tt> header. One is that some posters depend on their own <tt>Reply-To:</tt> settings to convey their valid return address. Another is that modifying <tt>Reply-To:</tt> makes it much more difficult to send private replies. See <a href="http://www.unicom.com/pw/reply-to-harmful.html">`Reply-To' Munging Considered Harmful</a> for a general discussion of this issue. See <a href="http://www.metasystema.org/essays/reply-to-useful.mhtml">Reply-To Munging Considered Useful</a> for a dissenting opinion. <p>Some mailing lists have restricted posting privileges, with a parallel list devoted to discussions. Examples are `patches' or `checkin' lists, where software changes are posted by a revision control system, but discussion about the changes occurs on a developers mailing list. To support these types of mailing lists, specify the explicit <tt>Reply-To:</tt> address here. You must also specify <tt>Explicit address</tt> in the <tt>reply_goes_to_list</tt> variable. <p>Note that if the original message contains a <tt>Reply-To:</tt> header, it will not be changed.""")), | when the <a href="?VARHELP=general/reply_goes_to_list">reply_goes_to_list</a> option is set to <em>Explicit address</em>. <p>There are many reasons not to introduce or override the <tt>Reply-To:</tt> header. One is that some posters depend on their own <tt>Reply-To:</tt> settings to convey their valid return address. Another is that modifying <tt>Reply-To:</tt> makes it much more difficult to send private replies. See <a href="http://www.unicom.com/pw/reply-to-harmful.html">`Reply-To' Munging Considered Harmful</a> for a general discussion of this issue. See <a href="http://www.metasystema.org/essays/reply-to-useful.mhtml">Reply-To Munging Considered Useful</a> for a dissenting opinion. <p>Some mailing lists have restricted posting privileges, with a parallel list devoted to discussions. Examples are `patches' or `checkin' lists, where software changes are posted by a revision control system, but discussion about the changes occurs on a developers mailing list. To support these types of mailing lists, specify the explicit <tt>Reply-To:</tt> address here. You must also specify <tt>Explicit address</tt> in the <tt>reply_goes_to_list</tt> variable. <p>Note that if the original message contains a <tt>Reply-To:</tt> header, it will not be changed.""")), | def GetConfigInfo(self): langs = self.GetAvailableLanguages() | d4117e2559487604b13fa55121d903681fad00c3 /local1/tlutelli/issta_data/temp/all_python//python/2006_temp/2006/2120/d4117e2559487604b13fa55121d903681fad00c3/MailList.py | [
1,
8585,
326,
22398,
316,
326,
981,
30,
1652,
26666,
966,
12,
2890,
4672,
26467,
273,
365,
18,
967,
5268,
12912,
1435,
2,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
8585,
326,
22398,
316,
326,
981,
30,
1652,
26666,
966,
12,
2890,
4672,
26467,
273,
365,
18,
967,
5268,
12912,
1435,
2,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.