sequence stringlengths 492 15.9k | code stringlengths 75 8.58k |
|---|---|
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:previous; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 17; 5, 28; 6, if_statement; 6, 7; 6, 12; 7, comparison_operator:==; 7, 8; 7, 11; 8, attribute; 8, 9; 8, 10; 9, identifier:self; 10, identifier:_order_by; 11, string:'oldest';... | def previous(self):
if self._order_by == 'oldest':
return self.older
if self._order_by == 'newest':
return self.newer
return None |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:next; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 17; 5, 28; 6, if_statement; 6, 7; 6, 12; 7, comparison_operator:==; 7, 8; 7, 11; 8, attribute; 8, 9; 8, 10; 9, identifier:self; 10, identifier:_order_by; 11, string:'oldest'; 12,... | def next(self):
if self._order_by == 'oldest':
return self.newer
if self._order_by == 'newest':
return self.older
return None |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:newest; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 17; 5, 28; 6, if_statement; 6, 7; 6, 12; 7, comparison_operator:==; 7, 8; 7, 11; 8, attribute; 8, 9; 8, 10; 9, identifier:self; 10, identifier:_order_by; 11, string:'newest'; 1... | def newest(self):
if self._order_by == 'newest':
return self.first
if self._order_by == 'oldest':
return self.last
return max(self.entries, key=lambda x: (x.date, x.id)) |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:oldest; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 17; 5, 28; 6, if_statement; 6, 7; 6, 12; 7, comparison_operator:==; 7, 8; 7, 11; 8, attribute; 8, 9; 8, 10; 9, identifier:self; 10, identifier:_order_by; 11, string:'newest'; 1... | def oldest(self):
if self._order_by == 'newest':
return self.last
if self._order_by == 'oldest':
return self.first
return min(self.entries, key=lambda x: (x.date, -x.id)) |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:sort_dataframe_cols; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 14; 5, 38; 5, 47; 5, 51; 5, 69; 5, 79; 5, 83; 5, 97; 5, 116; 5, 123; 5, 156; 5, 166; 6, expression_statement; 6, 7; 7, assignment; 7, 8; 7, 9; 8, identifier:cols; ... | def sort_dataframe_cols(self):
cols = self.df.columns
groups = list(map(lambda x: self.data_model.get_group_for_col(self.dtype, x), cols))
sorted_cols = cols.groupby(groups)
ordered_cols = []
try:
names = sorted_cols.pop('Names')
except KeyError:
n... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:sort_diclist; 3, parameters; 3, 4; 3, 5; 4, identifier:undecorated; 5, identifier:sort_on; 6, block; 6, 7; 6, 38; 6, 44; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 10; 9, identifier:decorated; 10, list_comprehension; 10, 11; 10, 30;... | def sort_diclist(undecorated, sort_on):
decorated = [(len(dict_[sort_on]) if hasattr(dict_[sort_on], '__len__') else dict_[
sort_on], index) for (index, dict_) in enumerate(undecorated)]
decorated.sort()
return[undecorated[index] for (key, index) in decorated] |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:process_data_for_mean; 3, parameters; 3, 4; 3, 5; 4, identifier:data; 5, identifier:direction_type_key; 6, block; 6, 7; 6, 17; 6, 38; 6, 46; 6, 54; 6, 61; 6, 358; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 13; 9, pattern_list; 9, 10... | def process_data_for_mean(data, direction_type_key):
dec_key, inc_key, meth_key = 'dec', 'inc', 'magic_method_codes'
if 'dir_dec' in data[0].keys():
dec_key, inc_key, meth_key = 'dir_dec', 'dir_inc', 'method_codes'
n_lines, n_planes = 0, 0
L, fdata = [], []
E = [0, 0, 0]
for rec in data:... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 4; 2, function_name:main; 3, parameters; 4, block; 4, 5; 4, 9; 4, 13; 4, 41; 4, 61; 4, 89; 4, 103; 4, 111; 4, 121; 4, 132; 4, 149; 4, 159; 4, 247; 5, expression_statement; 5, 6; 6, assignment; 6, 7; 6, 8; 7, identifier:dir_path; 8, string:'.'; 9, expression_statem... | def main():
dir_path='.'
inspec="pmag_specimens.txt"
if '-WD' in sys.argv:
ind=sys.argv.index('-WD')
dir_path=sys.argv[ind+1]
if '-h' in sys.argv:
print(main.__doc__)
sys.exit()
if '-f' in sys.argv:
ind=sys.argv.index('-f')
inspec=sys.argv[ind+1]
b... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:read_magic_file; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:self; 5, identifier:path; 6, identifier:sort_by_this_name; 7, block; 7, 8; 7, 12; 7, 46; 7, 52; 7, 66; 7, 70; 7, 166; 7, 172; 8, expression_statement; 8, 9; 9, assignment; 9, 10; 9... | def read_magic_file(self, path, sort_by_this_name):
DATA = {}
try:
with open(path, 'r') as finput:
lines = list(finput.readlines()[1:])
except FileNotFoundError:
return []
line = lines[0]
header = line.strip('\n').split('\t')
error_... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 8; 2, function_name:plot_teq; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 4, identifier:fignum; 5, identifier:araiblock; 6, identifier:s; 7, identifier:pars; 8, block; 8, 9; 8, 21; 8, 30; 8, 36; 8, 46; 8, 85; 8, 90; 8, 132; 8, 174; 8, 197; 8, 210; 8, 224; 8, 239; 8, 25... | def plot_teq(fignum, araiblock, s, pars):
first_Z, first_I = araiblock[0], araiblock[1]
plt.figure(num=fignum)
plt.clf()
ZIblock, IZblock, pTblock = [], [], []
for zrec in first_Z:
if zrec[4] == 1:
ZIblock.append([zrec[1], zrec[2]])
else:
IZblock.append([zrec[... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:_sort_records_map; 3, parameters; 3, 4; 4, identifier:records; 5, block; 5, 6; 5, 14; 5, 21; 5, 28; 5, 35; 5, 73; 5, 80; 5, 89; 5, 96; 5, 104; 5, 113; 5, 122; 5, 157; 5, 165; 5, 177; 5, 206; 5, 213; 5, 219; 5, 238; 6, expression_statement; 6, 7... | def _sort_records_map(records):
ctx = context.get()
l = len(records)
key_records = [None] * l
logging.debug("Parsing")
for i in range(l):
proto = kv_pb.KeyValue()
proto.ParseFromString(records[i])
key_records[i] = (proto.key(), records[i])
logging.debug("Sorting")
key_records.sort(cmp=_compare... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:find_all_by_mapreduce_state; 3, parameters; 3, 4; 3, 5; 4, identifier:cls; 5, identifier:mapreduce_state; 6, block; 6, 7; 6, 16; 6, 20; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 10; 9, identifier:keys; 10, call; 10, 11; 10, 14; 11,... | def find_all_by_mapreduce_state(cls, mapreduce_state):
keys = cls.calculate_keys_by_mapreduce_state(mapreduce_state)
i = 0
while i < len(keys):
@db.non_transactional
def no_tx_get(i):
return db.get(keys[i:i+cls._MAX_STATES_IN_MEMORY])
states = no_tx_get(i)
for s in states:
... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:calculate_keys_by_mapreduce_state; 3, parameters; 3, 4; 3, 5; 4, identifier:cls; 5, identifier:mapreduce_state; 6, block; 6, 7; 6, 14; 6, 18; 6, 61; 7, if_statement; 7, 8; 7, 11; 8, comparison_operator:is; 8, 9; 8, 10; 9, identifier:mapreduce_s... | def calculate_keys_by_mapreduce_state(cls, mapreduce_state):
if mapreduce_state is None:
return []
keys = []
for i in range(mapreduce_state.mapreduce_spec.mapper.shard_count):
shard_id = cls.shard_id_from_number(mapreduce_state.key().name(), i)
keys.append(cls.get_key_by_shard_id(shard_id)... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 32; 2, function_name:split; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 3, 29; 4, identifier:cls; 5, identifier:n; 6, identifier:contiguous; 7, default_parameter; 7, 8; 7, 9; 8, identifier:can_query; 9, attribute; 9, 10; 9, 28; 10, call; 10, 11; 10, 14; 11, attribute; ... | def split(cls,
n,
contiguous,
can_query=itertools.chain(itertools.repeat(True, 50),
itertools.repeat(False)).next,
_app=None):
if n < 1:
raise ValueError('n must be >= 1')
ranges = None
if can_query():
if not c... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 12; 2, function_name:_parse_raw_members; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 3, 10; 4, identifier:self; 5, identifier:leaderboard_name; 6, identifier:members; 7, default_parameter; 7, 8; 7, 9; 8, identifier:members_only; 9, False; 10, dictionary_splat_pattern; ... | def _parse_raw_members(
self, leaderboard_name, members, members_only=False, **options):
'''
Parse the raw leaders data as returned from a given leader board query. Do associative
lookups with the member to rank, score and potentially sort the results.
@param leaderboard_name... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 163; 2, function_name:search; 3, parameters; 3, 4; 3, 7; 3, 10; 3, 13; 3, 16; 3, 19; 3, 22; 3, 25; 3, 28; 3, 31; 3, 34; 3, 37; 3, 40; 3, 43; 3, 46; 3, 49; 3, 52; 3, 55; 3, 58; 3, 61; 3, 64; 3, 67; 3, 70; 3, 73; 3, 76; 3, 79; 3, 82; 3, 85; 3, 88; 3, 91; 3, 94; 3, 9... | def search(title=None, artist=None, artist_id=None, combined=None, description=None, style=None, mood=None,
results=None, start=None, max_tempo=None, min_tempo=None,
max_duration=None, min_duration=None, max_loudness=None, min_loudness=None,
artist_max_familiarity=None, artist_min_famil... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:list_campaigns; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, dictionary_splat_pattern; 5, 6; 6, identifier:kwargs; 7, block; 7, 8; 7, 17; 7, 28; 7, 39; 8, expression_statement; 8, 9; 9, assignment; 9, 10; 9, 11; 10, identifier:kwargs; 11, ... | def list_campaigns(self, **kwargs):
kwargs = self._verify_sort_options(kwargs)
kwargs = self._verify_filters(kwargs, Campaign, True)
api = self._get_api(update_service.DefaultApi)
return PaginatedResponse(api.update_campaign_list, lwrap_type=Campaign, **kwargs) |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 8; 2, function_name:list_campaign_device_states; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:self; 5, identifier:campaign_id; 6, dictionary_splat_pattern; 6, 7; 7, identifier:kwargs; 8, block; 8, 9; 8, 18; 8, 29; 8, 35; 8, 46; 9, expression_statement; 9, 10; 10... | def list_campaign_device_states(self, campaign_id, **kwargs):
kwargs = self._verify_sort_options(kwargs)
kwargs = self._verify_filters(kwargs, CampaignDeviceState, True)
kwargs["campaign_id"] = campaign_id
api = self._get_api(update_service.DefaultApi)
return PaginatedResponse(ap... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:list_firmware_manifests; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, dictionary_splat_pattern; 5, 6; 6, identifier:kwargs; 7, block; 7, 8; 7, 17; 7, 28; 7, 39; 8, expression_statement; 8, 9; 9, assignment; 9, 10; 9, 11; 10, identifier:kwa... | def list_firmware_manifests(self, **kwargs):
kwargs = self._verify_sort_options(kwargs)
kwargs = self._verify_filters(kwargs, FirmwareManifest, True)
api = self._get_api(update_service.DefaultApi)
return PaginatedResponse(api.firmware_manifest_list, lwrap_type=FirmwareManifest, **kwargs) |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 13; 2, function_name:merge_bams; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 3, 10; 4, identifier:self; 5, identifier:input_bams; 6, identifier:merged_bam; 7, default_parameter; 7, 8; 7, 9; 8, identifier:in_sorted; 9, string:"TRUE"; 10, default_parameter; 10, 11; 10, 1... | def merge_bams(self, input_bams, merged_bam, in_sorted="TRUE", tmp_dir=None):
if not len(input_bams) > 1:
print("No merge required")
return 0
outdir, _ = os.path.split(merged_bam)
if outdir and not os.path.exists(outdir):
print("Creating path to merge file's f... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 10; 2, function_name:samtools_view; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 4, identifier:self; 5, identifier:file_name; 6, identifier:param; 7, default_parameter; 7, 8; 7, 9; 8, identifier:postpend; 9, string:""; 10, block; 10, 11; 10, 27; 11, expression_statement... | def samtools_view(self, file_name, param, postpend=""):
cmd = "{} view {} {} {}".format(
self.tools.samtools, param, file_name, postpend)
return subprocess.check_output(cmd, shell=True) |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 9; 2, function_name:sam_conversions; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:self; 5, identifier:sam_file; 6, default_parameter; 6, 7; 6, 8; 7, identifier:depth; 8, True; 9, block; 9, 10; 9, 34; 9, 64; 9, 84; 9, 117; 10, expression_statement; 10, 11; 11, as... | def sam_conversions(self, sam_file, depth=True):
cmd = self.tools.samtools + " view -bS " + sam_file + " > " + sam_file.replace(".sam", ".bam") + "\n"
cmd += self.tools.samtools + " sort " + sam_file.replace(".sam", ".bam") + " -o " + sam_file.replace(".sam", "_sorted.bam") + "\n"
cmd += self.to... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 9; 2, function_name:bam_conversions; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:self; 5, identifier:bam_file; 6, default_parameter; 6, 7; 6, 8; 7, identifier:depth; 8, True; 9, block; 9, 10; 9, 34; 9, 58; 9, 78; 9, 111; 10, expression_statement; 10, 11; 11, as... | def bam_conversions(self, bam_file, depth=True):
cmd = self.tools.samtools + " view -h " + bam_file + " > " + bam_file.replace(".bam", ".sam") + "\n"
cmd += self.tools.samtools + " sort " + bam_file + " -o " + bam_file.replace(".bam", "_sorted.bam") + "\n"
cmd += self.tools.samtools + " index " ... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:_checkpoint; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, identifier:stage; 6, block; 6, 7; 6, 14; 6, 96; 6, 106; 6, 132; 7, if_statement; 7, 8; 7, 11; 8, comparison_operator:is; 8, 9; 8, 10; 9, identifier:stage; 10, None; 11, block; 11, 1... | def _checkpoint(self, stage):
if stage is None:
return False
try:
is_checkpoint = stage.checkpoint
except AttributeError:
if hasattr(stage, "__call__"):
stage = stage.__name__
else:
base, ext = os.path.splitext(stage... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 13; 2, function_name:geolocation_sort; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 3, 10; 4, identifier:field_name; 5, identifier:argument; 6, identifier:unit; 7, default_parameter; 7, 8; 7, 9; 8, identifier:mode; 9, None; 10, default_parameter; 10, 11; 10, 12; 11, ide... | def geolocation_sort(field_name, argument, unit, mode=None,
distance_type=None):
def inner(asc):
locations = request.values.getlist(argument, type=str)
field = {
'_geo_distance': {
field_name: locations,
'order': 'asc' if asc else 'des... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:eval_field; 3, parameters; 3, 4; 3, 5; 4, identifier:field; 5, identifier:asc; 6, block; 6, 7; 7, if_statement; 7, 8; 7, 13; 7, 60; 7, 71; 8, call; 8, 9; 8, 10; 9, identifier:isinstance; 10, argument_list; 10, 11; 10, 12; 11, identifier:field; ... | def eval_field(field, asc):
if isinstance(field, dict):
if asc:
return field
else:
field = copy.deepcopy(field)
key = list(field.keys())[0]
field[key]['order'] = reverse_order(field[key]['order'])
return field
elif callable(field):
... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:default_sorter_factory; 3, parameters; 3, 4; 3, 5; 4, identifier:search; 5, identifier:index; 6, block; 6, 7; 6, 11; 6, 26; 6, 69; 6, 78; 6, 97; 6, 106; 6, 126; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 10; 9, identifier:sort_arg_n... | def default_sorter_factory(search, index):
sort_arg_name = 'sort'
urlfield = request.values.get(sort_arg_name, '', type=str)
if not urlfield:
has_query = request.values.get('q', type=six.text_type)
urlfield = current_app.config['RECORDS_REST_DEFAULT_SORT'].get(
index, {}).get('qu... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 8; 2, function_name:MakeHistFromList; 3, parameters; 3, 4; 3, 5; 4, identifier:t; 5, default_parameter; 5, 6; 5, 7; 6, identifier:name; 7, string:''; 8, block; 8, 9; 8, 18; 8, 29; 9, expression_statement; 9, 10; 10, assignment; 10, 11; 10, 12; 11, identifier:hist;... | def MakeHistFromList(t, name=''):
hist = Hist(name=name)
[hist.Incr(x) for x in t]
return hist |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 8; 2, function_name:MakePmfFromList; 3, parameters; 3, 4; 3, 5; 4, identifier:t; 5, default_parameter; 5, 6; 5, 7; 6, identifier:name; 7, string:''; 8, block; 8, 9; 8, 16; 8, 24; 8, 32; 8, 38; 9, expression_statement; 9, 10; 10, assignment; 10, 11; 10, 12; 11, ide... | def MakePmfFromList(t, name=''):
hist = MakeHistFromList(t)
d = hist.GetDict()
pmf = Pmf(d, name)
pmf.Normalize()
return pmf |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 8; 2, function_name:MakeSuiteFromList; 3, parameters; 3, 4; 3, 5; 4, identifier:t; 5, default_parameter; 5, 6; 5, 7; 6, identifier:name; 7, string:''; 8, block; 8, 9; 8, 16; 8, 24; 9, expression_statement; 9, 10; 10, assignment; 10, 11; 10, 12; 11, identifier:hist... | def MakeSuiteFromList(t, name=''):
hist = MakeHistFromList(t)
d = hist.GetDict()
return MakeSuiteFromDict(d) |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:sort_precursor; 3, parameters; 3, 4; 3, 5; 4, identifier:c; 5, identifier:loci; 6, block; 6, 7; 6, 59; 6, 75; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 10; 9, identifier:data_loci; 10, list_comprehension; 10, 11; 10, 47; 11, list:[... | def sort_precursor(c, loci):
data_loci = [[x, loci[x].chr, int(loci[x].start), int(loci[x].end), loci[x].strand, len(c.loci2seq[x])] for x in list(c.loci2seq.keys())]
data_loci = sorted(data_loci, key=itemgetter(5), reverse=True)
return data_loci |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:_merge_similar; 3, parameters; 3, 4; 3, 5; 4, identifier:loci; 5, identifier:loci_similarity; 6, block; 6, 7; 6, 11; 6, 15; 6, 19; 6, 41; 6, 306; 6, 318; 6, 334; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 10; 9, identifier:n_cluster... | def _merge_similar(loci, loci_similarity):
n_cluster = 0
internal_cluster = {}
clus_seen = {}
loci_sorted = sorted(loci_similarity.iteritems(), key=operator.itemgetter(1), reverse=True)
for pairs, sim in loci_sorted:
common = sim > parameters.similar
n_cluster += 1
logger.deb... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 10; 2, function_name:_solve_loci_deprecated; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 3, 8; 3, 9; 4, identifier:c; 5, identifier:locilen_sorted; 6, identifier:seen_seqs; 7, identifier:filtered; 8, identifier:maxseq; 9, identifier:n_cluster; 10, block; 10, 11; 10, 15... | def _solve_loci_deprecated(c, locilen_sorted, seen_seqs, filtered, maxseq, n_cluster):
first_run = 0
seen_seqs = list()
n_cluster += 1
logger.debug("_solve_loci:new cluster %s" % n_cluster)
new_c = cluster(n_cluster)
for idl, lenl in locilen_sorted:
locus_seqs = c.loci2seq[idl]
i... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:hash_prefix_list_checksum; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, identifier:threat_list; 6, block; 6, 7; 6, 11; 6, 24; 6, 78; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 10; 9, identifier:q; 10, string:'''SELECT value FRO... | def hash_prefix_list_checksum(self, threat_list):
q = '''SELECT value FROM hash_prefix
WHERE threat_type=? AND platform_type=? AND threat_entry_type=?
ORDER BY value
'''
params = [threat_list.threat_type, threat_list.platform_type, threat_list.threat_entry_type]
... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:remove_hash_prefix_indices; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:self; 5, identifier:threat_list; 6, identifier:indices; 7, block; 7, 8; 7, 12; 7, 16; 7, 26; 8, expression_statement; 8, 9; 9, assignment; 9, 10; 9, 11; 10, identifier:b... | def remove_hash_prefix_indices(self, threat_list, indices):
batch_size = 40
q = '''DELETE FROM hash_prefix
WHERE threat_type=? AND platform_type=? AND threat_entry_type=? AND value IN ({})
'''
prefixes_to_remove = self.get_hash_prefix_values_to_remove(threat_list, indices... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 14; 2, function_name:has_equal_value; 3, parameters; 3, 4; 3, 5; 3, 8; 3, 11; 4, identifier:state; 5, default_parameter; 5, 6; 5, 7; 6, identifier:ordered; 7, False; 8, default_parameter; 8, 9; 8, 10; 9, identifier:ndigits; 10, None; 11, default_parameter; 11, 12;... | def has_equal_value(state, ordered=False, ndigits=None, incorrect_msg=None):
if not hasattr(state, "parent"):
raise ValueError(
"You can only use has_equal_value() on the state resulting from check_column, check_row or check_result."
)
if incorrect_msg is None:
incorrect_msg ... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:sorted_releases; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 23; 5, 32; 6, expression_statement; 6, 7; 7, assignment; 7, 8; 7, 9; 8, identifier:releases; 9, list_comprehension; 9, 10; 9, 18; 10, tuple; 10, 11; 10, 17; 11, call; ... | def sorted_releases(self):
releases = [(parse_version(release.version), release)
for release in self.releases]
releases.sort(reverse=True)
return [release[1] for release in releases] |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 33; 2, function_name:image_position_stochastic; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 3, 8; 3, 11; 3, 18; 3, 21; 3, 24; 3, 27; 3, 30; 4, identifier:self; 5, identifier:source_x; 6, identifier:source_y; 7, identifier:kwargs_lens; 8, default_parameter; 8, 9; 8, 10;... | def image_position_stochastic(self, source_x, source_y, kwargs_lens, search_window=10,
precision_limit=10**(-10), arrival_time_sort=True, x_center=0,
y_center=0, num_random=1000, verbose=False):
x_solve, y_solve = [], []
for i in range(... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 42; 2, function_name:image_position_from_source; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 3, 8; 3, 11; 3, 14; 3, 21; 3, 24; 3, 27; 3, 30; 3, 33; 3, 36; 3, 39; 4, identifier:self; 5, identifier:sourcePos_x; 6, identifier:sourcePos_y; 7, identifier:kwargs_lens; 8, def... | def image_position_from_source(self, sourcePos_x, sourcePos_y, kwargs_lens, min_distance=0.1, search_window=10,
precision_limit=10**(-10), num_iter_max=100, arrival_time_sort=True,
initial_guess_cut=True, verbose=False, x_center=0, y_center=0, num_ra... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 29; 2, function_name:count; 3, parameters; 3, 4; 3, 5; 3, 8; 3, 11; 3, 14; 3, 17; 3, 20; 3, 23; 3, 26; 4, identifier:event_collection; 5, default_parameter; 5, 6; 5, 7; 6, identifier:timeframe; 7, None; 8, default_parameter; 8, 9; 8, 10; 9, identifier:timezone; 10... | def count(event_collection, timeframe=None, timezone=None, interval=None, filters=None, group_by=None, order_by=None,
max_age=None, limit=None):
_initialize_client_from_environment()
return _client.count(event_collection=event_collection, timeframe=timeframe, timezone=timezone,
... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 30; 2, function_name:sum; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 9; 3, 12; 3, 15; 3, 18; 3, 21; 3, 24; 3, 27; 4, identifier:event_collection; 5, identifier:target_property; 6, default_parameter; 6, 7; 6, 8; 7, identifier:timeframe; 8, None; 9, default_parameter; 9, 1... | def sum(event_collection, target_property, timeframe=None, timezone=None, interval=None, filters=None,
group_by=None, order_by=None, max_age=None, limit=None):
_initialize_client_from_environment()
return _client.sum(event_collection=event_collection, timeframe=timeframe, timezone=timezone,
... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 30; 2, function_name:multi_analysis; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 9; 3, 12; 3, 15; 3, 18; 3, 21; 3, 24; 3, 27; 4, identifier:event_collection; 5, identifier:analyses; 6, default_parameter; 6, 7; 6, 8; 7, identifier:timeframe; 8, None; 9, default_parameter; ... | def multi_analysis(event_collection, analyses, timeframe=None, interval=None, timezone=None,
filters=None, group_by=None, order_by=None, max_age=None, limit=None):
_initialize_client_from_environment()
return _client.multi_analysis(event_collection=event_collection, timeframe=timeframe,
... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 31; 2, function_name:select_unique; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 3, 10; 3, 13; 3, 16; 3, 19; 3, 22; 3, 25; 3, 28; 4, identifier:self; 5, identifier:event_collection; 6, identifier:target_property; 7, default_parameter; 7, 8; 7, 9; 8, identifier:timeframe... | def select_unique(self, event_collection, target_property, timeframe=None, timezone=None, interval=None,
filters=None, group_by=None, order_by=None, max_age=None, limit=None):
params = self.get_params(event_collection=event_collection, timeframe=timeframe, timezone=timezone,
... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:check_voltage; 3, parameters; 3, 4; 3, 5; 4, identifier:grid; 5, identifier:mode; 6, block; 6, 7; 6, 11; 6, 136; 6, 154; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 10; 9, identifier:crit_nodes; 10, dictionary; 11, if_statement; 11, ... | def check_voltage(grid, mode):
crit_nodes = {}
if mode == 'MV':
mv_max_v_level_lc_diff_normal = float(cfg_ding0.get('mv_routing_tech_constraints',
'mv_max_v_level_lc_diff_normal'))
mv_max_v_level_fc_diff_normal = float(cfg_ding0.get('mv... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:compute_savings_list; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, identifier:graph; 6, block; 6, 7; 6, 11; 6, 100; 6, 125; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 10; 9, identifier:savings_list; 10, dictionary; 11, for_stat... | def compute_savings_list(self, graph):
savings_list = {}
for i, j in graph.edges():
if repr(i) < repr(j):
t = (i, j)
else:
t = (j, i)
if i == graph.depot() or j == graph.depot():
continue
savings_list[t] = gr... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 26; 1, 28; 2, function_name:ask_choice; 3, parameters; 3, 4; 3, 9; 3, 17; 4, typed_parameter; 4, 5; 4, 7; 5, list_splat_pattern; 5, 6; 6, identifier:prompt; 7, type; 7, 8; 8, identifier:Token; 9, typed_parameter; 9, 10; 9, 11; 10, identifier:choices; 11, type; 11,... | def ask_choice(
*prompt: Token, choices: List[Any], func_desc: Optional[FuncDesc] = None
) -> Any:
if func_desc is None:
func_desc = lambda x: str(x)
tokens = get_ask_tokens(prompt)
info(*tokens)
choices.sort(key=func_desc)
for i, choice in enumerate(choices, start=1):
choice_des... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:list; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 10; 5, 35; 5, 52; 6, expression_statement; 6, 7; 7, assignment; 7, 8; 7, 9; 8, identifier:backups; 9, list:[]; 10, for_statement; 10, 11; 10, 12; 10, 22; 11, identifier:d; 12, ca... | def list(self):
backups = []
for d in glob(join(self.backup_directory, '*')):
backups.append(WorkspaceBackup.from_path(d))
backups.sort(key=lambda b: b.lastmod, reverse=True)
return backups |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 9; 2, function_name:retrieve; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:self; 5, identifier:operation; 6, default_parameter; 6, 7; 6, 8; 7, identifier:field; 8, None; 9, block; 9, 10; 9, 20; 9, 40; 10, expression_statement; 10, 11; 11, assignment; 11, 12; 11,... | def retrieve(self, operation, field=None):
obj = self._get(operation, field)
if obj is None:
return Mark(collection=self.collection, operation=operation, field=field)
return Mark.from_dict(self.collection, obj) |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 16; 2, function_name:query; 3, parameters; 3, 4; 3, 5; 3, 8; 3, 11; 3, 14; 4, identifier:self; 5, default_parameter; 5, 6; 5, 7; 6, identifier:properties; 7, None; 8, default_parameter; 8, 9; 8, 10; 9, identifier:criteria; 10, None; 11, default_parameter; 11, 12; ... | def query(self, properties=None, criteria=None, distinct_key=None,
**kwargs):
if properties is not None:
props, prop_dict = self._parse_properties(properties)
else:
props, prop_dict = None, None
crit = self._parse_criteria(criteria)
if self.query_pos... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:sort_rows; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:self; 5, identifier:rows; 6, identifier:section; 7, block; 7, 8; 7, 35; 8, if_statement; 8, 9; 8, 22; 8, 29; 9, comparison_operator:==; 9, 10; 9, 15; 10, call; 10, 11; 10, 14; 11, attrib... | def sort_rows(self, rows, section):
if section.lower() == Differ.CHANGED.lower():
sort_key = Differ.CHANGED_DELTA
else:
sort_key = None
if sort_key is not None:
rows.sort(key=itemgetter(sort_key)) |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 8; 2, function_name:get_free_crypto_domains; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, default_parameter; 5, 6; 5, 7; 6, identifier:crypto_adapters; 7, None; 8, block; 8, 9; 8, 27; 8, 33; 8, 37; 8, 64; 8, 70; 8, 83; 8, 155; 8, 166; 8, 172; 9, if_statement;... | def get_free_crypto_domains(self, crypto_adapters=None):
if crypto_adapters is None:
crypto_adapters = self.adapters.findall(type='crypto')
if not crypto_adapters:
return None
max_domains = None
for ca in crypto_adapters:
if max_domains is None:
... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:topological; 3, parameters; 3, 4; 4, identifier:nodes; 5, block; 5, 6; 5, 21; 5, 93; 5, 105; 6, expression_statement; 6, 7; 7, assignment; 7, 8; 7, 12; 8, pattern_list; 8, 9; 8, 10; 8, 11; 9, identifier:order; 10, identifier:enter; 11, identifi... | def topological(nodes):
order, enter, state = deque(), set(nodes), {}
def dfs(node):
state[node] = GRAY
for parent in nodes.get(node, ()):
color = state.get(parent, None)
if color == GRAY:
raise ValueError('cycle')
if color == BLACK:
... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:get_teachers_sorted; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 14; 5, 31; 5, 65; 5, 92; 5, 110; 5, 120; 5, 142; 5, 148; 5, 175; 6, expression_statement; 6, 7; 7, assignment; 7, 8; 7, 9; 8, identifier:teachers; 9, call; 9, 10; ... | def get_teachers_sorted(self):
teachers = self.get_teachers()
teachers = [(u.last_name, u.first_name, u.id) for u in teachers]
for t in teachers:
if t is None or t[0] is None or t[1] is None or t[2] is None:
teachers.remove(t)
for t in teachers:
if... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 1, 17; 2, function_name:sorted_bits; 3, parameters; 3, 4; 4, identifier:self; 5, type; 5, 6; 6, generic_type; 6, 7; 6, 8; 7, identifier:List; 8, type_parameter; 8, 9; 9, type; 9, 10; 10, generic_type; 10, 11; 10, 12; 11, identifier:Tuple; 12, type_parameter; 12... | def sorted_bits(self) -> List[Tuple[str, int]]:
return sorted(self.bit.items(), key=lambda x: x[1]) |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 1, 17; 2, function_name:sorted_enums; 3, parameters; 3, 4; 4, identifier:self; 5, type; 5, 6; 6, generic_type; 6, 7; 6, 8; 7, identifier:List; 8, type_parameter; 8, 9; 9, type; 9, 10; 10, generic_type; 10, 11; 10, 12; 11, identifier:Tuple; 12, type_parameter; 1... | def sorted_enums(self) -> List[Tuple[str, int]]:
return sorted(self.enum.items(), key=lambda x: x[1]) |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 8; 2, function_name:collate; 3, parameters; 3, 4; 3, 6; 4, list_splat_pattern; 4, 5; 5, identifier:iterables; 6, dictionary_splat_pattern; 6, 7; 7, identifier:kwargs; 8, block; 8, 9; 8, 22; 8, 32; 8, 39; 8, 52; 8, 56; 8, 60; 8, 99; 8, 114; 9, expression_statement;... | def collate(*iterables, **kwargs):
key = kwargs.pop('key', lambda a: a)
reverse = kwargs.pop('reverse', False)
min_or_max = max if reverse else min
rows = [iter(iterable) for iterable in iterables if iterable]
next_values = {}
by_key = []
def gather_next_value(row, index):
try:
... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:order_key_defs; 3, parameters; 3, 4; 4, identifier:key_def; 5, block; 5, 6; 5, 10; 5, 60; 5, 72; 6, expression_statement; 6, 7; 7, assignment; 7, 8; 7, 9; 8, identifier:_int; 9, list:[]; 10, for_statement; 10, 11; 10, 12; 10, 13; 11, identifier... | def order_key_defs(key_def):
_int = []
for kd in key_def:
if len(kd['use']) > 1:
for _use in kd['use']:
_kd = kd.copy()
_kd['use'] = _use
_int.append(_kd)
else:
_int.append(kd)
_int.sort(key=cmp_to_key(sort_func))
re... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 9; 2, function_name:wait; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:self; 5, identifier:condition_or_value; 6, default_parameter; 6, 7; 6, 8; 7, identifier:timeout; 8, None; 9, block; 9, 10; 9, 32; 9, 50; 9, 62; 9, 68; 9, 81; 9, 145; 9, 155; 9, 166; 10, if_st... | def wait(self, condition_or_value, timeout=None):
if (isinstance(condition_or_value, collections.Sequence) and not
isinstance(condition_or_value, basestring)):
raise NotImplementedError(
'Currently only single conditions are supported')
condition_test = (condi... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:_find_nearest_conn_objects; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:network; 5, identifier:node; 6, identifier:branches; 7, block; 7, 8; 7, 18; 7, 22; 7, 35; 7, 243; 7, 262; 8, expression_statement; 8, 9; 9, assignment; 9, 10; 9, 11; 10,... | def _find_nearest_conn_objects(network, node, branches):
conn_diff_tolerance = network.config['grid_connection'][
'conn_diff_tolerance']
conn_objects_min_stack = []
node_shp = transform(proj2equidistant(network), node.geom)
for branch in branches:
stations = branch['adj_nodes']
s... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 8; 2, function_name:mv_voltage_deviation; 3, parameters; 3, 4; 3, 5; 4, identifier:network; 5, default_parameter; 5, 6; 5, 7; 6, identifier:voltage_levels; 7, string:'mv_lv'; 8, block; 8, 9; 8, 13; 8, 17; 8, 23; 8, 29; 8, 39; 8, 49; 8, 147; 8, 173; 8, 199; 8, 211;... | def mv_voltage_deviation(network, voltage_levels='mv_lv'):
crit_nodes = {}
v_dev_allowed_per_case = {}
v_dev_allowed_per_case['feedin_case_lower'] = 0.9
v_dev_allowed_per_case['load_case_upper'] = 1.1
offset = network.config[
'grid_expansion_allowed_voltage_deviations']['hv_mv_trafo_offset']... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 9; 2, function_name:calc_geo_lines_in_buffer; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 3, 8; 4, identifier:network; 5, identifier:node; 6, identifier:grid; 7, identifier:radius; 8, identifier:radius_inc; 9, block; 9, 10; 9, 14; 9, 99; 10, expression_statement; 10, 1... | def calc_geo_lines_in_buffer(network, node, grid, radius, radius_inc):
lines = []
while not lines:
node_shp = transform(proj2equidistant(network), node.geom)
buffer_zone_shp = node_shp.buffer(radius)
for line in grid.graph.lines():
nodes = line['adj_nodes']
branch... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:_group_by_size_greedy; 3, parameters; 3, 4; 3, 5; 4, identifier:obj_list; 5, identifier:tot_groups; 6, block; 6, 7; 6, 25; 6, 36; 6, 63; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 10; 9, identifier:sorted_list; 10, call; 10, 11; 10,... | def _group_by_size_greedy(obj_list, tot_groups):
sorted_list = sorted(obj_list, key=lambda x: x['size'], reverse=True)
groups = [[] for _ in range(tot_groups)]
for index, obj in enumerate(sorted_list):
current_group = groups[index % len(groups)]
current_group.append(obj)
return groups |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:dimensions_from_subgroups; 3, parameters; 3, 4; 4, identifier:s; 5, block; 5, 6; 5, 10; 6, expression_statement; 6, 7; 7, assignment; 7, 8; 7, 9; 8, identifier:letters; 9, string:'XYABCDEFGHIJKLMNOPQRSTUVWZ'; 10, return_statement; 10, 11; 11, c... | def dimensions_from_subgroups(s):
letters = 'XYABCDEFGHIJKLMNOPQRSTUVWZ'
return ' '.join(['dim{0}={1}'.format(dim, sg.name) for dim, sg in zip(letters, s)]) |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:filter_composite_from_subgroups; 3, parameters; 3, 4; 4, identifier:s; 5, block; 5, 6; 5, 10; 5, 36; 6, expression_statement; 6, 7; 7, assignment; 7, 8; 7, 9; 8, identifier:dims; 9, list:[]; 10, for_statement; 10, 11; 10, 14; 10, 23; 11, patter... | def filter_composite_from_subgroups(s):
dims = []
for letter, sg in zip('ABCDEFGHIJKLMNOPQRSTUVWZ', s[2:]):
dims.append('dim{0}'.format(letter))
if dims:
return ' '.join(dims) |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 16; 2, function_name:_get_videos_for_filter; 3, parameters; 3, 4; 3, 5; 3, 8; 3, 13; 4, identifier:video_filter; 5, default_parameter; 5, 6; 5, 7; 6, identifier:sort_field; 7, None; 8, default_parameter; 8, 9; 8, 10; 9, identifier:sort_dir; 10, attribute; 10, 11; ... | def _get_videos_for_filter(video_filter, sort_field=None, sort_dir=SortDirection.asc, pagination_conf=None):
videos = Video.objects.filter(**video_filter)
paginator_context = {}
if sort_field:
videos = videos.order_by(sort_field.value, "edx_video_id")
if sort_dir == SortDirection.desc:
... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 16; 2, function_name:get_videos_for_course; 3, parameters; 3, 4; 3, 5; 3, 8; 3, 13; 4, identifier:course_id; 5, default_parameter; 5, 6; 5, 7; 6, identifier:sort_field; 7, None; 8, default_parameter; 8, 9; 8, 10; 9, identifier:sort_dir; 10, attribute; 10, 11; 10, ... | def get_videos_for_course(course_id, sort_field=None, sort_dir=SortDirection.asc, pagination_conf=None):
return _get_videos_for_filter(
{'courses__course_id': six.text_type(course_id), 'courses__is_hidden': False},
sort_field,
sort_dir,
pagination_conf,
) |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 13; 2, function_name:get_videos_for_ids; 3, parameters; 3, 4; 3, 5; 3, 8; 4, identifier:edx_video_ids; 5, default_parameter; 5, 6; 5, 7; 6, identifier:sort_field; 7, None; 8, default_parameter; 8, 9; 8, 10; 9, identifier:sort_dir; 10, attribute; 10, 11; 10, 12; 11... | def get_videos_for_ids(
edx_video_ids,
sort_field=None,
sort_dir=SortDirection.asc
):
videos, __ = _get_videos_for_filter(
{"edx_video_id__in":edx_video_ids},
sort_field,
sort_dir,
)
return videos |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 10; 2, function_name:put; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 4, identifier:self; 5, identifier:block_id; 6, identifier:priority; 7, default_parameter; 7, 8; 7, 9; 8, identifier:pb_type; 9, string:'offline'; 10, block; 10, 11; 10, 23; 11, if_statement; 11, 12; ... | def put(self, block_id, priority, pb_type='offline'):
if pb_type not in ('offline', 'realtime'):
raise ValueError('Invalid PB type.')
with self._mutex:
added_time = datetime.datetime.utcnow().isoformat()
entry = (priority, sys.maxsize-self._index, block_id, pb_type,
... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:sort_device; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 14; 5, 18; 5, 22; 5, 107; 5, 114; 6, expression_statement; 6, 7; 7, call; 7, 8; 7, 13; 8, attribute; 8, 9; 8, 12; 9, attribute; 9, 10; 9, 11; 10, identifier:self; 11, iden... | def sort_device(self):
self.devices.sort()
idx = []
names = []
for dev in order:
if dev in all_models:
all_dev = list(sorted(all_models[dev].keys()))
for item in all_dev:
if item in self.devices:
idx.... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 21; 2, function_name:export_csv; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 9; 3, 12; 3, 15; 3, 18; 4, identifier:self; 5, identifier:path; 6, default_parameter; 6, 7; 6, 8; 7, identifier:idx; 8, None; 9, default_parameter; 9, 10; 9, 11; 10, identifier:header; 11, None; ... | def export_csv(self, path, idx=None, header=None, formatted=False,
sort_idx=True, fmt='%.18e'):
if not idx:
idx = self._idx
if not header:
header = self.get_header(idx, formatted=formatted)
assert len(idx) == len(header), \
"Idx length does ... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:get_event_times; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 10; 5, 23; 5, 48; 5, 64; 6, expression_statement; 6, 7; 7, assignment; 7, 8; 7, 9; 8, identifier:times; 9, list:[]; 10, expression_statement; 10, 11; 11, call; 11, 12;... | def get_event_times(self):
times = []
times.extend(self.Breaker.get_times())
for model in self.__dict__['Event'].all_models:
times.extend(self.__dict__[model].get_times())
if times:
times = sorted(list(set(times)))
return times |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:get_sort_field; 3, parameters; 3, 4; 4, identifier:request; 5, block; 5, 6; 5, 17; 5, 34; 5, 43; 5, 57; 6, expression_statement; 6, 7; 7, assignment; 7, 8; 7, 9; 8, identifier:sort_direction; 9, call; 9, 10; 9, 15; 10, attribute; 10, 11; 10, 14... | def get_sort_field(request):
sort_direction = request.GET.get("dir")
field_name = (request.GET.get("sort") or "") if sort_direction else ""
sort_sign = "-" if sort_direction == "desc" else ""
result_field = "{sign}{field}".format(sign=sort_sign, field=field_name)
return result_field |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:linkage_group_ordering; 3, parameters; 3, 4; 4, identifier:linkage_records; 5, block; 5, 6; 5, 12; 5, 77; 6, expression_statement; 6, 7; 7, assignment; 7, 8; 7, 9; 8, identifier:new_records; 9, call; 9, 10; 9, 11; 10, identifier:dict; 11, argum... | def linkage_group_ordering(linkage_records):
new_records = dict()
for lg_name, linkage_group in itertools.groupby(
linkage_records, operator.itemgetter(0)
):
new_records[lg_name] = []
for record in linkage_group:
init_contig = record[-1]
start = record[1]
... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 43; 2, function_name:get_issues; 3, parameters; 3, 4; 3, 7; 3, 10; 3, 13; 3, 16; 3, 19; 3, 22; 3, 25; 3, 28; 3, 31; 3, 34; 3, 37; 3, 40; 4, default_parameter; 4, 5; 4, 6; 5, identifier:repo_name; 6, None; 7, default_parameter; 7, 8; 7, 9; 8, identifier:profile; 9,... | def get_issues(repo_name=None,
profile='github',
milestone=None,
state='open',
assignee=None,
creator=None,
mentioned=None,
labels=None,
sort='created',
direction='desc',
... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 25; 2, function_name:get_milestones; 3, parameters; 3, 4; 3, 7; 3, 10; 3, 13; 3, 16; 3, 19; 3, 22; 4, default_parameter; 4, 5; 4, 6; 5, identifier:repo_name; 6, None; 7, default_parameter; 7, 8; 7, 9; 8, identifier:profile; 9, string:'github'; 10, default_paramete... | def get_milestones(repo_name=None,
profile='github',
state='open',
sort='due_on',
direction='asc',
output='min',
per_page=None):
'''
Return information about milestones for a given repository.
.... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 31; 2, function_name:get_prs; 3, parameters; 3, 4; 3, 7; 3, 10; 3, 13; 3, 16; 3, 19; 3, 22; 3, 25; 3, 28; 4, default_parameter; 4, 5; 4, 6; 5, identifier:repo_name; 6, None; 7, default_parameter; 7, 8; 7, 9; 8, identifier:profile; 9, string:'github'; 10, default_p... | def get_prs(repo_name=None,
profile='github',
state='open',
head=None,
base=None,
sort='created',
direction='desc',
output='min',
per_page=None):
'''
Returns information for all pull requests in a given repository, b... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:_diff_lists; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:old; 5, identifier:new; 6, identifier:comparator; 7, block; 7, 8; 7, 10; 7, 48; 7, 64; 7, 73; 7, 151; 7, 157; 8, expression_statement; 8, 9; 9, string:'''
Compare lists to extract ... | def _diff_lists(old, new, comparator):
'''
Compare lists to extract the changes
:param old: old list
:param new: new list
:return: a dictionary with ``unchanged``, ``new``, ``deleted`` and ``sorted`` keys
The sorted list is the union of unchanged and new lists, but keeping the original
order... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:_job_sorting_key; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, identifier:job; 6, block; 6, 7; 6, 16; 6, 20; 6, 31; 7, if_statement; 7, 8; 7, 13; 8, comparison_operator:is; 8, 9; 8, 12; 9, attribute; 9, 10; 9, 11; 10, identifier:self; 11, ... | def _job_sorting_key(self, job):
if self._base_graph is None:
return 0
MAX_JOBS = 1000000
if job.addr not in self._node_addr_visiting_order:
return MAX_JOBS
return self._node_addr_visiting_order.index(job.addr) |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:instruction_addresses; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 10; 5, 38; 6, expression_statement; 6, 7; 7, assignment; 7, 8; 7, 9; 8, identifier:addrs; 9, list:[ ]; 10, for_statement; 10, 11; 10, 12; 10, 26; 11, identifier:... | def instruction_addresses(self):
addrs = [ ]
for b in sorted(self.blocks, key=lambda x: x.addr):
addrs.extend(b.instruction_addresses())
return sorted(set(addrs), key=lambda x: x[0]) |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:desymbolize; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 12; 5, 29; 6, expression_statement; 6, 7; 7, assignment; 7, 8; 7, 11; 8, attribute; 8, 9; 8, 10; 9, identifier:self; 10, identifier:sort; 11, string:'unknown'; 12, express... | def desymbolize(self):
self.sort = 'unknown'
content = self.binary.fast_memory_load(self.addr, self.size, bytes)
self.content = [ content ] |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 14; 2, function_name:append_data; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 3, 8; 3, 11; 4, identifier:self; 5, identifier:name; 6, identifier:initial_content; 7, identifier:size; 8, default_parameter; 8, 9; 8, 10; 9, identifier:readonly; 10, False; 11, default_param... | def append_data(self, name, initial_content, size, readonly=False, sort="unknown"):
if readonly:
section_name = ".rodata"
else:
section_name = '.data'
if initial_content is None:
initial_content = b""
initial_content = initial_content.ljust(size, b"\x0... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 8; 2, function_name:pop_job; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, default_parameter; 5, 6; 5, 7; 6, identifier:returning; 7, True; 8, block; 8, 9; 8, 15; 8, 38; 8, 66; 9, if_statement; 9, 10; 9, 12; 10, not_operator; 10, 11; 11, identifier:self; 12, b... | def pop_job(self, returning=True):
if not self:
return None
if not returning:
return self._pop_job(next(reversed(self._jobs.keys())))
for func_addr in reversed(self._jobs.keys()):
if func_addr not in self._returning_functions:
continue
... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:_get_min_addr; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 32; 6, if_statement; 6, 7; 6, 11; 7, not_operator; 7, 8; 8, attribute; 8, 9; 8, 10; 9, identifier:self; 10, identifier:_regions; 11, block; 11, 12; 11, 30; 12, if_statem... | def _get_min_addr(self):
if not self._regions:
if self.project.arch.name != "Soot":
l.error("self._regions is empty or not properly set.")
return None
return next(self._regions.irange()) |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:_job_sorting_key; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, identifier:job; 6, block; 6, 7; 6, 11; 6, 37; 6, 63; 6, 102; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 10; 9, identifier:MAX_BLOCKS_PER_FUNCTION; 10, integer:10000... | def _job_sorting_key(self, job):
MAX_BLOCKS_PER_FUNCTION = 1000000
task_functions = list(reversed(
list(task.function_address for task in self._task_stack if isinstance(task, FunctionAnalysis))
))
try:
function_pos = task_functions.index(job.func_addr)
... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:_merge_points; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, identifier:function_address; 6, block; 6, 7; 6, 24; 6, 54; 7, try_statement; 7, 8; 7, 19; 8, block; 8, 9; 9, expression_statement; 9, 10; 10, assignment; 10, 11; 10, 12; 11, ident... | def _merge_points(self, function_address):
try:
new_function = self.kb.functions[function_address]
except KeyError:
return [ ]
if function_address not in self._function_merge_points:
ordered_merge_points = CFGUtils.find_merge_points(function_address, new_funct... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:_widening_points; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, identifier:function_address; 6, block; 6, 7; 6, 24; 6, 66; 7, try_statement; 7, 8; 7, 19; 8, block; 8, 9; 9, expression_statement; 9, 10; 10, assignment; 10, 11; 10, 12; 11, id... | def _widening_points(self, function_address):
try:
new_function = self.kb.functions[function_address]
except KeyError:
return [ ]
if function_address not in self._function_widening_points:
if not new_function.normalized:
new_function.normalize(... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 11; 2, function_name:get_variables; 3, parameters; 3, 4; 3, 5; 3, 8; 4, identifier:self; 5, default_parameter; 5, 6; 5, 7; 6, identifier:sort; 7, None; 8, default_parameter; 8, 9; 8, 10; 9, identifier:collapse_same_ident; 10, False; 11, block; 11, 12; 11, 16; 11, ... | def get_variables(self, sort=None, collapse_same_ident=False):
variables = [ ]
if collapse_same_ident:
raise NotImplementedError()
for var in self._variables:
if sort == 'stack' and not isinstance(var, SimStackVariable):
continue
if sort == 're... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:find_merge_points; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:function_addr; 5, identifier:function_endpoints; 6, identifier:graph; 7, block; 7, 8; 7, 14; 7, 39; 7, 49; 7, 59; 8, expression_statement; 8, 9; 9, assignment; 9, 10; 9, 11; 10, ... | def find_merge_points(function_addr, function_endpoints, graph):
merge_points = set()
for node in graph.nodes():
if graph.in_degree(node) > 1:
merge_points.add(node)
ordered_merge_points = CFGUtils.quasi_topological_sort_nodes(graph, merge_points)
addrs = [n.a... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 8; 2, function_name:reverse_post_order_sort_nodes; 3, parameters; 3, 4; 3, 5; 4, identifier:graph; 5, default_parameter; 5, 6; 5, 7; 6, identifier:nodes; 7, None; 8, block; 8, 9; 8, 18; 8, 31; 8, 35; 8, 52; 9, expression_statement; 9, 10; 10, assignment; 10, 11; 1... | def reverse_post_order_sort_nodes(graph, nodes=None):
post_order = networkx.dfs_postorder_nodes(graph)
if nodes is None:
return reversed(list(post_order))
addrs_to_index = {}
for i, n in enumerate(post_order):
addrs_to_index[n.addr] = i
return sorted(nodes... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 23; 2, function_name:split; 3, parameters; 3, 4; 3, 5; 3, 8; 3, 11; 3, 14; 3, 17; 3, 20; 4, identifier:self; 5, default_parameter; 5, 6; 5, 7; 6, identifier:stash_splitter; 7, None; 8, default_parameter; 8, 9; 8, 10; 9, identifier:stash_ranker; 10, None; 11, defau... | def split(self, stash_splitter=None, stash_ranker=None, state_ranker=None,
limit=8, from_stash='active', to_stash='stashed'):
states = self._fetch_states(stash=from_stash)
if stash_splitter is not None:
keep, split = stash_splitter(states)
elif stash_ranker is not None:... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 11; 2, function_name:_executable_memory_regions; 3, parameters; 3, 4; 3, 5; 3, 8; 4, identifier:self; 5, default_parameter; 5, 6; 5, 7; 6, identifier:objects; 7, None; 8, default_parameter; 8, 9; 8, 10; 9, identifier:force_segment; 10, False; 11, block; 11, 12; 11... | def _executable_memory_regions(self, objects=None, force_segment=False):
if objects is None:
binaries = self.project.loader.all_objects
else:
binaries = objects
memory_regions = [ ]
for b in binaries:
if isinstance(b, ELF):
if not force... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:_debug_check; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 10; 5, 14; 6, expression_statement; 6, 7; 7, assignment; 7, 8; 7, 9; 8, identifier:old_end; 9, integer:0; 10, expression_statement; 10, 11; 11, assignment; 11, 12; 11, 13... | def _debug_check(self):
old_end = 0
old_sort = ""
for segment in self._list:
if segment.start <= old_end and segment.sort == old_sort:
raise AngrCFGError("Error in SegmentList: blocks are not merged")
old_end = segment.end
old_sort = segment.so... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 10; 2, function_name:next_pos_with_sort_not_in; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 4, identifier:self; 5, identifier:address; 6, identifier:sorts; 7, default_parameter; 7, 8; 7, 9; 8, identifier:max_distance; 9, None; 10, block; 10, 11; 10, 20; 10, 29; 10, 131... | def next_pos_with_sort_not_in(self, address, sorts, max_distance=None):
list_length = len(self._list)
idx = self._search(address)
if idx < list_length:
block = self._list[idx]
if max_distance is not None and address + max_distance < block.start:
return Non... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:occupied_by_sort; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, identifier:address; 6, block; 6, 7; 6, 16; 6, 28; 6, 54; 6, 81; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 10; 9, identifier:idx; 10, call; 10, 11; 10, 14; 11, attr... | def occupied_by_sort(self, address):
idx = self._search(address)
if len(self._list) <= idx:
return None
if self._list[idx].start <= address < self._list[idx].end:
return self._list[idx].sort
if idx > 0 and address < self._list[idx - 1].end:
return self... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 13; 2, function_name:_binary_insert; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 3, 10; 4, identifier:lst; 5, identifier:elem; 6, identifier:key; 7, default_parameter; 7, 8; 7, 9; 8, identifier:lo; 9, integer:0; 10, default_parameter; 10, 11; 10, 12; 11, identifier:hi;... | def _binary_insert(lst, elem, key, lo=0, hi=None):
if lo < 0:
raise ValueError("lo must be a non-negative number")
if hi is None:
hi = len(lst)
while lo < hi:
mid = (lo + hi) // 2
if key(lst[mid]) < key(elem):
lo = mid + 1
... |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 11; 2, function_name:_sort_io_counters; 3, parameters; 3, 4; 3, 5; 3, 8; 4, identifier:process; 5, default_parameter; 5, 6; 5, 7; 6, identifier:sortedby; 7, string:'io_counters'; 8, default_parameter; 8, 9; 8, 10; 9, identifier:sortedby_secondary; 10, string:'memo... | def _sort_io_counters(process,
sortedby='io_counters',
sortedby_secondary='memory_percent'):
return process[sortedby][0] - process[sortedby][2] + process[sortedby][1] - process[sortedby][3] |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 10; 2, function_name:_sort_lambda; 3, parameters; 3, 4; 3, 7; 4, default_parameter; 4, 5; 4, 6; 5, identifier:sortedby; 6, string:'cpu_percent'; 7, default_parameter; 7, 8; 7, 9; 8, identifier:sortedby_secondary; 9, string:'memory_percent'; 10, block; 10, 11; 10, ... | def _sort_lambda(sortedby='cpu_percent',
sortedby_secondary='memory_percent'):
ret = None
if sortedby == 'io_counters':
ret = _sort_io_counters
elif sortedby == 'cpu_times':
ret = _sort_cpu_times
return ret |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:loop_position; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 26; 6, for_statement; 6, 7; 6, 10; 6, 16; 7, pattern_list; 7, 8; 7, 9; 8, identifier:i; 9, identifier:v; 10, call; 10, 11; 10, 12; 11, identifier:enumerate; 12, argument... | def loop_position(self):
for i, v in enumerate(self._sort_loop):
if v == glances_processes.sort_key:
return i
return 0 |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:get_event_sort_key; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, identifier:event_type; 6, block; 6, 7; 6, 37; 7, if_statement; 7, 8; 7, 14; 7, 19; 7, 31; 8, call; 8, 9; 8, 12; 9, attribute; 9, 10; 9, 11; 10, identifier:event_type; 11, ide... | def get_event_sort_key(self, event_type):
if event_type.startswith("MEM"):
ret = 'memory_percent'
elif event_type.startswith("CPU_IOWAIT"):
ret = 'io_counters'
else:
ret = 'cpu_percent'
return ret |
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:set_process_sort; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, identifier:event_type; 6, block; 6, 7; 7, if_statement; 7, 8; 7, 11; 8, attribute; 8, 9; 8, 10; 9, identifier:glances_processes; 10, identifier:auto_sort; 11, block; 11, 12; 12... | def set_process_sort(self, event_type):
if glances_processes.auto_sort:
glances_processes.sort_key = self.get_event_sort_key(event_type) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.