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, 434, 3853, 316, 666, 1476, 10303, 635, 326, 864, 12176, 1655, 1637, 10335, 1466, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 434, 3853, 316, 666, 1476, 10303, 635, 326, 864, 12176, 1655, 1637, 10335, 1466, 2, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100 ]
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, 27226, 18, 14618, 3649, 1769, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 27226, 18, 14618, 3649, 1769, 2, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100 ]
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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -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, 27570, 18, 1883, 1435, 4672, 309, 508, 422, 5252, 12, 9301, 27570, 18, 1726, 1528, 12, 77, 3719, 30, 3170, 273, 277, 3894, 27570, 18, 542, 3935, 1016, 12, 8109, 13, 282, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ]
[ 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, 27570, 18, 1883, 1435, 4672, 309, 508, 422, 5252, 12, 9301, 27570, 18, 1726, 1528, 12, 77, 3719, 30, 3170, 273, 277, 3894, 27570, 18, 542, 3935, 1016, 12, 8109, 13, 282, 2, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100 ]
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, 2454, 2330, 366, 6157, 1230, 578, 3173, 6478, 18, 225, 2457, 3454, 16, 364, 279, 980, 1835, 434, 1059, 3949, 261, 5399, 2330, 3173, 6478, 4672, 10228, 21, 2187, 296, 22, 16, 2187, 296, 23, 2187, 296, 24, 3546, 516, 296, 21, 225, 890, 64, 82, 22, 225, 1059, 64, 82, 11, 225, 578, 2454, 2330, 366, 6157, 1230, 30, 10228, 21, 2187, 296, 22, 16, 2187, 296, 23, 2187, 296, 24, 3546, 516, 296, 21, 225, 576, 64, 82, 23, 225, 1059, 64, 82, 11, 225, 8315, 1057, 353, 1338, 487, 14812, 487, 4573, 18, 225, 2525, 805, 16, 2168, 854, 8936, 635, 2795, 7292, 300, 1245, 1703, 486, 4553, 1523, 7304, 18, 1000, 315, 1293, 10814, 6, 358, 5765, 326, 533, 9004, 2168, 18, 1000, 1375, 5417, 2819, 11, 358, 444, 326, 980, 1835, 18, 225, 24773, 1230, 16, 18221, 1516, 1960, 2588, 628, 326, 1760, 358, 5469, 628, 326, 2002, 17, 10329, 1057, 358, 326, 2145, 17, 10329, 18, 971, 315, 297, 3676, 67, 17824, 6, 353, 444, 629, 16, 18221, 1516, 903, 1960, 10279, 16, 2002, 358, 2145, 16, 1760, 358, 5469, 12123, 309, 486, 1549, 12, 1126, 16, 666, 13, 471, 486, 1549, 12, 1126, 16, 3193, 4672, 1002, 3580, 16, 261, 296, 1126, 4260, 358, 2 ]
[ 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, 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, 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, 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, 2454, 2330, 366, 6157, 1230, 578, 3173, 6478, 18, 225, 2457, 3454, 16, 364, 279, 980, 1835, 434, 1059, 3949, 261, 5399, 2330, 3173, 6478, 4672, 10228, 21, 2187, 296, 22, 16, 2187, 296, 23, 2187, 296, 24, 3546, 516, 296, 21, 225, 890, 64, 82, 22, 225, 1059, 64, 82, 11, 225, 578, 2454, 2330, 366, 6157, 1230, 30, 10228, 21, 2187, 296, 22, 16, 2187, 296, 23, 2187, 296, 24, 3546, 516, 296, 21, 225, 576, 64, 82, 23, 225, 1059, 2 ]
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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -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, 365, 6315, 1615, 18, 588, 12, 4099, 16, 389, 11145, 13, 309, 770, 1999, 353, 486, 389, 11145, 30, 775, 30, 770, 1999, 18, 4479, 12, 5457, 548, 13, 309, 486, 770, 1999, 30, 1464, 365, 6315, 1615, 63, 4099, 65, 365, 6315, 2469, 18, 3427, 19236, 21, 13, 225, 1335, 6394, 30, 468, 770, 1027, 353, 392, 509, 1464, 365, 6315, 1615, 63, 4099, 65, 365, 6315, 2469, 18, 3427, 19236, 21, 13, 225, 1335, 30, 2018, 18, 1636, 29909, 87, 30, 640, 1615, 67, 1612, 3377, 486, 1206, 296, 296, 5457, 548, 738, 87, 628, 770, 738, 87, 18, 225, 1220, 296, 296, 13139, 486, 5865, 1093, 738, 261, 2890, 16186, 1106, 972, 16186, 529, 972, 16, 609, 12, 5457, 548, 3631, 609, 12, 2890, 18, 350, 13, 3631, 3533, 67, 1376, 33, 9499, 18, 10075, 67, 1376, 10756, 469, 30, 2018, 18, 1636, 29909, 87, 30, 640, 1615, 67, 1612, 12928, 358, 4614, 444, 738, 87, 296, 296, 2080, 770, 738, 87, 1496, 17991, 3730, 88, 18, 225, 1220, 296, 296, 13139, 486, 5865, 1093, 738, 261, 2890, 16186, 1106, 972, 16186, 529, 972, 16, 8480, 12, 4099, 3631, 609, 12, 2890, 18, 350, 20349, 2, 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, 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, 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, 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, 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, 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, 365, 6315, 1615, 18, 588, 12, 4099, 16, 389, 11145, 13, 309, 770, 1999, 353, 486, 389, 11145, 30, 775, 30, 770, 1999, 18, 4479, 12, 5457, 548, 13, 309, 486, 770, 1999, 30, 1464, 365, 6315, 1615, 63, 4099, 65, 365, 6315, 2469, 18, 3427, 19236, 21, 13, 225, 1335, 6394, 30, 468, 770, 1027, 353, 392, 509, 1464, 365, 6315, 1615, 63, 4099, 65, 365, 6315, 2469, 18, 3427, 19236, 21, 13, 225, 1335, 30, 2018, 18, 1636, 29909, 87, 30, 640, 1615, 2 ]
[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, 434, 279, 2667, 18, 2164, 326, 1976, 1062, 2207, 275, 18, 11999, 13744, 18, 3341, 19, 13044, 19, 6098, 67, 3266, 310, 364, 9271, 3189, 603, 3591, 2036, 310, 18, 225, 12943, 30, 225, 300, 12176, 75, 10335, 1493, 279, 2667, 18, 225, 300, 12176, 1132, 67, 3700, 10335, 1493, 261, 1886, 30, 12176, 8381, 10335, 4672, 225, 300, 5203, 444, 358, 12176, 5510, 68, 9191, 1338, 326, 8123, 2126, 770, 353, 2106, 18, 225, 300, 5203, 444, 358, 12176, 8381, 68, 9191, 279, 3590, 434, 326, 3591, 444, 1368, 845, 899, 353, 2106, 309, 3323, 18, 225, 300, 12176, 90, 6894, 10335, 1493, 261, 1886, 30, 12176, 8381, 10335, 4672, 225, 300, 5203, 444, 358, 12176, 5510, 68, 9191, 9327, 358, 1104, 279, 1375, 64, 9242, 397, 404, 68, 17, 7126, 17, 3266, 310, 16, 1625, 1375, 64, 9242, 68, 353, 3959, 358, 326, 4207, 10782, 316, 326, 2667, 18, 225, 300, 5203, 444, 358, 12176, 8381, 68, 9191, 9327, 358, 1104, 279, 1375, 64, 9242, 68, 17, 7126, 17, 3266, 310, 16, 1625, 1375, 64, 9242, 68, 353, 3959, 358, 326, 4207, 10782, 316, 326, 2667, 18, 971, 23343, 16, 9327, 358, 1104, 471, 1135, 279, 1375, 64, 9242, 397, 404, 68, 17, 7126, 17, 3266, 310, 18, 2 ]
[ 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, 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, 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, 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, 434, 279, 2667, 18, 2164, 326, 1976, 1062, 2207, 275, 18, 11999, 13744, 18, 3341, 19, 13044, 19, 6098, 67, 3266, 310, 364, 9271, 3189, 603, 3591, 2036, 310, 18, 225, 12943, 30, 225, 300, 12176, 75, 10335, 1493, 279, 2667, 18, 225, 300, 12176, 1132, 67, 3700, 10335, 1493, 261, 1886, 30, 12176, 8381, 10335, 4672, 225, 300, 5203, 444, 358, 12176, 5510, 68, 9191, 1338, 326, 8123, 2126, 770, 353, 2106, 18, 225, 300, 5203, 444, 358, 12176, 8381, 68, 2 ]
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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100 ]
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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100 ]