sequence
stringlengths
492
15.9k
code
stringlengths
75
8.58k
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 12; 2, function_name:intersect_range_array; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 9; 4, identifier:bed1; 5, identifier:beds2; 6, default_parameter; 6, 7; 6, 8; 7, identifier:payload; 8, None; 9, default_parameter; 9, 10; 9, 11; 10, identifier:is_sorted; 11, False; 1...
def intersect_range_array(bed1,beds2,payload=None,is_sorted=False): if not is_sorted: beds2 = sort_ranges(beds2) output = [] for bed2 in beds2: cval = bed2.cmp(bed1) if cval == -1: continue elif cval == 0: output.append(bed1.intersect(bed2)) if payload==1: output[-1].set_payload(be...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:sort_genomic_ranges; 3, parameters; 3, 4; 4, identifier:rngs; 5, block; 5, 6; 6, return_statement; 6, 7; 7, call; 7, 8; 7, 9; 8, identifier:sorted; 9, argument_list; 9, 10; 9, 11; 10, identifier:rngs; 11, keyword_argument; 11, 12; 11, 13; 12, i...
def sort_genomic_ranges(rngs): return sorted(rngs, key=lambda x: (x.chr, x.start, x.end))
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:topological_sort; 3, parameters; 3, 4; 3, 5; 4, identifier:dependencies; 5, identifier:start_nodes; 6, block; 6, 7; 6, 11; 6, 22; 6, 33; 6, 51; 6, 95; 6, 117; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 10; 9, identifier:retval; 10, ...
def topological_sort(dependencies, start_nodes): retval = [] def edges(node): return dependencies[node][1] def in_degree(node): return dependencies[node][0] def remove_incoming(node): dependencies[node][0] = in_degree(node) - 1 while start_nodes: node = start_nodes.pop() retval.appen...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 8; 2, function_name:_do_parse; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 4, identifier:inp; 5, identifier:fmt; 6, identifier:encoding; 7, identifier:force_types; 8, block; 8, 9; 8, 13; 8, 19; 8, 189; 9, expression_statement; 9, 10; 10, assignment; 10, 11; 10, 12; 11,...
def _do_parse(inp, fmt, encoding, force_types): res = {} _check_lib_installed(fmt, 'parse') if fmt == 'ini': cfg = configobj.ConfigObj(inp, encoding=encoding) res = cfg.dict() elif fmt == 'json': if six.PY3: inp = io.TextIOWrapper(inp, encoding=encoding) res =...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:_do_serialize; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:struct; 5, identifier:fmt; 6, identifier:encoding; 7, block; 7, 8; 7, 12; 7, 18; 7, 180; 8, expression_statement; 8, 9; 9, assignment; 9, 10; 9, 11; 10, identifier:res; 11, None; 12,...
def _do_serialize(struct, fmt, encoding): res = None _check_lib_installed(fmt, 'serialize') if fmt == 'ini': config = configobj.ConfigObj(encoding=encoding) for k, v in struct.items(): config[k] = v res = b'\n'.join(config.write()) elif fmt in ['json', 'json5']: ...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:sort_header; 3, parameters; 3, 4; 4, identifier:header_text; 5, block; 5, 6; 5, 19; 5, 23; 5, 56; 5, 60; 5, 64; 5, 126; 6, expression_statement; 6, 7; 7, assignment; 7, 8; 7, 9; 8, identifier:lines; 9, call; 9, 10; 9, 17; 10, attribute; 10, 11;...
def sort_header(header_text): lines = header_text.rstrip().split("\n") rlens = {} for ln in lines: m = re.match('@SQ\tSN:(\S+)\tLN:(\S+)',ln) if m: rlens[m.group(1)] = m.group(2) output = '' done_lens = False for ln in lines: if re.match('@SQ\tSN:',ln): if not done_lens: done...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 9; 2, function_name:sort; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:self; 5, identifier:field; 6, default_parameter; 6, 7; 6, 8; 7, identifier:direction; 8, string:"asc"; 9, block; 9, 10; 9, 23; 9, 35; 10, if_statement; 10, 11; 10, 17; 11, not_operator; 11, 1...
def sort(self, field, direction="asc"): if not isinstance(field, basestring): raise ValueError("Field should be a string") if direction not in ["asc", "desc"]: raise ValueError("Sort direction should be `asc` or `desc`") self.sorts.append({field: direction})
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:remove_sort; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, identifier:field_name; 6, block; 6, 7; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 12; 9, attribute; 9, 10; 9, 11; 10, identifier:self; 11, identifier:sorts; 12, list_com...
def remove_sort(self, field_name): self.sorts = [dict(field=value) for field, value in self.sorts if field is not field_name]
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 4; 2, function_name:aggregate_registry_timers; 3, parameters; 4, block; 4, 5; 4, 8; 4, 27; 4, 31; 4, 100; 4, 106; 5, import_statement; 5, 6; 6, dotted_name; 6, 7; 7, identifier:itertools; 8, expression_statement; 8, 9; 9, assignment; 9, 10; 9, 11; 10, identifier:t...
def aggregate_registry_timers(): import itertools timers = sorted(shared_registry.values(), key=lambda t: t.desc) aggregate_timers = [] for k, g in itertools.groupby(timers, key=lambda t: t.desc): group = list(g) num_calls = len(group) total_elapsed_ms = sum(t.elapsed_time_ms for...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:spread; 3, parameters; 3, 4; 4, identifier:iterable; 5, block; 5, 6; 5, 16; 5, 24; 5, 30; 5, 60; 6, if_statement; 6, 7; 6, 13; 7, comparison_operator:==; 7, 8; 7, 12; 8, call; 8, 9; 8, 10; 9, identifier:len; 10, argument_list; 10, 11; 11, ident...
def spread(iterable): if len(iterable) == 1: return 0 iterable = iterable.copy() iterable.sort() max_diff = max(abs(i - j) for (i, j) in zip(iterable[1:], iterable[:-1])) return max_diff
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:sort_transcripts; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 36; 6, expression_statement; 6, 7; 7, assignment; 7, 8; 7, 9; 8, identifier:txs; 9, call; 9, 10; 9, 11; 10, identifier:sorted; 11, argument_list; 11, 12; 11, 15; 12, ...
def sort_transcripts(self): txs = sorted(self.transcripts,key=lambda x: (x.range.chr, x.range.start, x.range.end)) self._transcripts = txs
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:in1d_events; 3, parameters; 3, 4; 3, 5; 4, identifier:ar1; 5, identifier:ar2; 6, block; 6, 7; 6, 16; 6, 25; 6, 39; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 10; 9, identifier:ar1; 10, call; 10, 11; 10, 14; 11, attribute; 11, 12; 11...
def in1d_events(ar1, ar2): ar1 = np.ascontiguousarray(ar1) ar2 = np.ascontiguousarray(ar2) tmp = np.empty_like(ar1, dtype=np.uint8) return analysis_functions.get_in1d_sorted(ar1, ar2, tmp)
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 11; 2, function_name:sort_by_priority; 3, parameters; 3, 4; 3, 5; 3, 8; 4, identifier:iterable; 5, default_parameter; 5, 6; 5, 7; 6, identifier:reverse; 7, False; 8, default_parameter; 8, 9; 8, 10; 9, identifier:default_priority; 10, integer:10; 11, block; 11, 12;...
def sort_by_priority(iterable, reverse=False, default_priority=10): return sorted(iterable, reverse=reverse, key=lambda o: getattr(o, 'priority', default_priority))
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 14; 2, function_name:apply; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 9; 3, 12; 4, identifier:self; 5, identifier:func; 6, default_parameter; 6, 7; 6, 8; 7, identifier:mapping; 8, None; 9, default_parameter; 9, 10; 9, 11; 10, identifier:new_dtype; 11, None; 12, dictiona...
def apply(self, func, mapping=None, new_dtype=None, **kwargs): if callable(func): return Series(func(self.values, weld_type=self.weld_type, **kwargs), self.index, self.dtype, ...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 10; 2, function_name:weld_sort; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 4, identifier:arrays; 5, identifier:weld_types; 6, identifier:readable_text; 7, default_parameter; 7, 8; 7, 9; 8, identifier:ascending; 9, True; 10, block; 10, 11; 10, 20; 10, 28; 10, 36; 10, 4...
def weld_sort(arrays, weld_types, readable_text, ascending=True): weld_obj_sort = _weld_sort(arrays, weld_types, ascending) weld_obj_struct = weld_vec_of_struct_to_struct_of_vec(weld_obj_sort, weld_types) weld_obj_indices = weld_select_from_struct(weld_obj_struct, 0) intermediate_result = LazyArrayResul...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 10; 2, function_name:chooseBestDuplicates; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 3, 8; 3, 9; 4, identifier:tped; 5, identifier:samples; 6, identifier:oldSamples; 7, identifier:completion; 8, identifier:concordance_all; 9, identifier:prefix; 10, block; 10, 11; 10,...
def chooseBestDuplicates(tped, samples, oldSamples, completion, concordance_all, prefix): chosenFile = None try: chosenFile = open(prefix + ".chosen_samples.info", "w") except IOError: msg = "%(prefix)s.chosen_samples.info: can't write file" % locals() raise ...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:order_qc_dir; 3, parameters; 3, 4; 4, identifier:dirnames; 5, block; 5, 6; 6, return_statement; 6, 7; 7, call; 7, 8; 7, 9; 8, identifier:sorted; 9, argument_list; 9, 10; 9, 11; 10, identifier:dirnames; 11, keyword_argument; 11, 12; 11, 13; 12, ...
def order_qc_dir(dirnames): return sorted( dirnames, key=lambda dn: time.strptime( os.path.basename(dn.rstrip("/"))[14:], "%Y-%m-%d_%H.%M.%S", ) )
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:fetch; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, identifier:webfonts; 6, block; 6, 7; 6, 18; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 10; 9, identifier:sorted_keys; 10, call; 10, 11; 10, 12; 11, identifier:sorted; 12, argu...
def fetch(self, webfonts): sorted_keys = sorted(webfonts.keys()) for webfont_name in sorted_keys: self.get(webfont_name, webfonts[webfont_name])
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 8; 2, function_name:sort_index; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, default_parameter; 5, 6; 5, 7; 6, identifier:ascending; 7, True; 8, block; 8, 9; 8, 23; 9, if_statement; 9, 10; 9, 17; 10, call; 10, 11; 10, 12; 11, identifier:isinstance; 12, argume...
def sort_index(self, ascending=True): if isinstance(self.index, MultiIndex): raise NotImplementedError('Weld does not yet support sorting on multiple columns') return self.sort_values(self.index._gather_names(), ascending)
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 9; 2, function_name:sort_values; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:self; 5, identifier:by; 6, default_parameter; 6, 7; 6, 8; 7, identifier:ascending; 8, True; 9, block; 9, 10; 9, 16; 9, 21; 9, 28; 9, 41; 9, 49; 9, 55; 9, 75; 9, 86; 9, 97; 9, 107; 9, 1...
def sort_values(self, by, ascending=True): check_type(ascending, bool) check_str_or_list_str(by) by = as_list(by) if len(by) > 1: raise NotImplementedError('Weld does not yet support sorting on multiple columns') all_data = self.reset_index() by_data = all_dat...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 23; 2, function_name:optimize_with_repeates; 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:fast; 7, None; 8, default_parameter; 8, 9; 8, 10; 9, identifier:verbose; 10, None; 11, def...
def optimize_with_repeates(self,fast=None,verbose=None,n_times=10,lambd=None,lambd_g=None,lambd_n=None): verbose = dlimix.getVerbose(verbose) if not self.init: self._initGP(fast) opt_list = [] fixed0 = sp.zeros_like(self.gp.getParams()['dataTerm']) for i in range(n_times): ...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 8; 2, function_name:sort_prefixes; 3, parameters; 3, 4; 3, 5; 4, identifier:orig; 5, default_parameter; 5, 6; 5, 7; 6, identifier:prefixes; 7, string:'@+'; 8, block; 8, 9; 8, 13; 8, 26; 9, expression_statement; 9, 10; 10, assignment; 10, 11; 10, 12; 11, identifier...
def sort_prefixes(orig, prefixes='@+'): new = '' for prefix in prefixes: if prefix in orig: new += prefix return new
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 11; 2, function_name:sort_children; 3, parameters; 3, 4; 3, 5; 3, 8; 4, identifier:self; 5, default_parameter; 5, 6; 5, 7; 6, identifier:attribute; 7, None; 8, default_parameter; 8, 9; 8, 10; 9, identifier:reverse_order; 10, False; 11, block; 11, 12; 11, 16; 11, 1...
def sort_children(self, attribute=None, reverse_order=False): sorted_children = [] if attribute: sortable_children = [] unsortable_children = [] for child in self.__children: if child.attribute_exists(attribute): sortable_children.a...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 8; 2, function_name:_sort_kw_matches; 3, parameters; 3, 4; 3, 5; 4, identifier:skw_matches; 5, default_parameter; 5, 6; 5, 7; 6, identifier:limit; 7, integer:0; 8, block; 8, 9; 8, 20; 8, 31; 9, expression_statement; 9, 10; 10, assignment; 10, 11; 10, 12; 11, ident...
def _sort_kw_matches(skw_matches, limit=0): sorted_keywords = list(skw_matches.items()) sorted(sorted_keywords, key=cmp_to_key(_skw_matches_comparator)) return limit and sorted_keywords[:limit] or sorted_keywords
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:trim; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, identifier:n_peaks; 6, block; 6, 7; 6, 13; 7, expression_statement; 7, 8; 8, call; 8, 9; 8, 12; 9, attribute; 9, 10; 9, 11; 10, identifier:self; 11, identifier:sortByIntensity; 12, argumen...
def trim(self, n_peaks): self.sortByIntensity() ims.spectrum_trim(self.ptr, n_peaks)
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 8; 2, function_name:centroids; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, default_parameter; 5, 6; 5, 7; 6, identifier:window_size; 7, integer:5; 8, block; 8, 9; 8, 15; 8, 25; 8, 35; 8, 41; 8, 60; 9, expression_statement; 9, 10; 10, call; 10, 11; 10, 14; 11...
def centroids(self, window_size=5): self.sortByMass() mzs = _cffi_buffer(self.masses, 'd') intensities = _cffi_buffer(self.intensities, 'f') n = self.size p = ims.spectrum_new_from_raw(n, mzs.ptr, intensities.ptr, int(window_size)) return _new_spectrum(CentroidedSpectrum,...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:list_engines_by_priority; 3, parameters; 3, 4; 4, default_parameter; 4, 5; 4, 6; 5, identifier:engines; 6, None; 7, block; 7, 8; 7, 17; 8, if_statement; 8, 9; 8, 12; 9, comparison_operator:is; 9, 10; 9, 11; 10, identifier:engines; 11, None; 12,...
def list_engines_by_priority(engines=None): if engines is None: engines = ENGINES return sorted(engines, key=operator.methodcaller("priority"))
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:union; 3, parameters; 3, 4; 3, 5; 4, identifier:dict1; 5, identifier:dict2; 6, block; 6, 7; 6, 48; 7, for_statement; 7, 8; 7, 11; 7, 16; 8, pattern_list; 8, 9; 8, 10; 9, identifier:key; 10, identifier:value; 11, call; 11, 12; 11, 15; 12, attrib...
def union(dict1, dict2): for key, value in dict2.items(): if key in dict1 and isinstance(value, dict): dict1[key] = union(dict1[key], value) else: dict1[key] = value return dict1
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:_format_data; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, identifier:data; 6, block; 6, 7; 7, return_statement; 7, 8; 8, list_comprehension; 8, 9; 8, 10; 8, 37; 9, identifier:spectrum; 10, for_in_clause; 10, 11; 10, 12; 10, 13; 11, identi...
def _format_data(self, data): return [spectrum for spectrum in \ sorted(data if isinstance(data, (list, tuple)) else [data], key=lambda x: x.disp[0]) if np.any(np.isfinite(spectrum.flux))]
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 8; 2, function_name:get_sorting; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:self; 5, identifier:request; 6, dictionary_splat_pattern; 6, 7; 7, identifier:resources; 8, block; 8, 9; 8, 13; 8, 21; 8, 31; 9, expression_statement; 9, 10; 10, assignment; 10, 11; 10...
def get_sorting(self, request, **resources): sorting = [] if not request.GET: return sorting prefix = self._meta.dyn_prefix + 'sort' return request.GET.getlist(prefix)
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:sort; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, list_splat_pattern; 5, 6; 6, identifier:sort_tuples; 7, block; 7, 8; 7, 10; 7, 14; 7, 72; 8, expression_statement; 8, 9; 9, string:''' pymongo-style sorting. Accepts a list of tuples. ...
def sort(self, *sort_tuples): ''' pymongo-style sorting. Accepts a list of tuples. :param sort_tuples: varargs of sort tuples. ''' query = self for name, direction in sort_tuples: field = resolve_name(self.type, name) if direction in (ASCENDING, 1): ...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:_has_bad_coords; 3, parameters; 3, 4; 3, 5; 4, identifier:root; 5, identifier:stream; 6, block; 6, 7; 6, 14; 6, 29; 6, 38; 6, 55; 7, if_statement; 7, 8; 7, 11; 8, comparison_operator:==; 8, 9; 8, 10; 9, identifier:stream; 10, string:"com.dc3/dc...
def _has_bad_coords(root, stream): if stream == "com.dc3/dc3.broker": return True if not stream.split('/')[0] == 'nasa.gsfc.gcn': return False toplevel_params = vp.get_toplevel_params(root) if "Coords_String" in toplevel_params: if (toplevel_params["Coords_String"]['value'] == ...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 19; 1, 31; 2, function_name:sorted_chain; 3, parameters; 3, 4; 4, typed_parameter; 4, 5; 4, 7; 5, list_splat_pattern; 5, 6; 6, identifier:ranges; 7, type; 7, 8; 8, generic_type; 8, 9; 8, 10; 9, identifier:Iterable; 10, type_parameter; 10, 11; 11, type; 11, 12; 12,...
def sorted_chain(*ranges: Iterable[Tuple[int, int]]) -> List[Tuple[int, int]]: return sorted(itertools.chain(*ranges))
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 8; 2, function_name:partition_range; 3, parameters; 3, 4; 3, 5; 4, identifier:stop; 5, default_parameter; 5, 6; 5, 7; 6, identifier:annotations; 7, None; 8, block; 8, 9; 8, 15; 8, 19; 8, 27; 8, 127; 9, expression_statement; 9, 10; 10, assignment; 10, 11; 10, 12; 1...
def partition_range(stop, annotations=None): annotations = annotations or [] partitioning = [] part_start, part_levels = 0, None for p in sorted(set(itertools.chain([0, stop], *itertools.chain(*annotations)))): if p == stop: partitioning.append...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 17; 2, function_name:pprint_sequence; 3, parameters; 3, 4; 3, 5; 3, 8; 3, 11; 3, 14; 4, identifier:sequence; 5, default_parameter; 5, 6; 5, 7; 6, identifier:annotations; 7, None; 8, default_parameter; 8, 9; 8, 10; 9, identifier:block_length; 10, integer:10; 11, de...
def pprint_sequence(sequence, annotations=None, block_length=10, blocks_per_line=6, format=PlaintextFormat): annotations = annotations or [] partitioning = partition_range(len(sequence), annotations) margin = int(math.floor(math.log(max(len(sequence), 1), 10)) + 1) + len...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 32; 2, function_name:tabulate; 3, parameters; 3, 4; 3, 5; 3, 8; 3, 11; 3, 14; 3, 17; 3, 20; 3, 23; 3, 26; 3, 29; 4, identifier:obj; 5, default_parameter; 5, 6; 5, 7; 6, identifier:v_level_indexes; 7, None; 8, default_parameter; 8, 9; 8, 10; 9, identifier:h_level_i...
def tabulate( obj, v_level_indexes=None, h_level_indexes=None, v_level_visibility=None, h_level_visibility=None, v_level_sort_keys=None, h_level_sort_keys=None, v_level_titles=None, h_level_titles=None, empty="", ): level_keys = breadth_first(obj) v_level_indexes, h_level...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 8; 2, function_name:get_ordered_entries; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, default_parameter; 5, 6; 5, 7; 6, identifier:queryset; 7, False; 8, block; 8, 9; 8, 32; 8, 155; 9, if_statement; 9, 10; 9, 11; 9, 18; 10, identifier:queryset; 11, block; 11,...
def get_ordered_entries(self, queryset=False): if queryset: self.queryset = queryset else: self.queryset = EntryCategory.objects.all() if self.queryset: for category in self.queryset: entries = category.get_entries() if entries:...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 26; 2, function_name:parallel_progbar; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 9; 3, 12; 3, 15; 3, 18; 3, 21; 3, 24; 4, identifier:mapper; 5, identifier:iterable; 6, default_parameter; 6, 7; 6, 8; 7, identifier:nprocs; 8, None; 9, default_parameter; 9, 10; 9, 11; 10, ...
def parallel_progbar(mapper, iterable, nprocs=None, starmap=False, flatmap=False, shuffle=False, verbose=True, verbose_flatmap=None, **kwargs): results = _parallel_progbar_launch(mapper, iterable, nprocs, starmap, flatmap, shuffle, verbose, verbose_flatmap, **kwargs) return [x for i, x in s...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 30; 2, function_name:iparallel_progbar; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 9; 3, 12; 3, 15; 3, 18; 3, 21; 3, 24; 3, 28; 4, identifier:mapper; 5, identifier:iterable; 6, default_parameter; 6, 7; 6, 8; 7, identifier:nprocs; 8, None; 9, default_parameter; 9, 10; 9, ...
def iparallel_progbar(mapper, iterable, nprocs=None, starmap=False, flatmap=False, shuffle=False, verbose=True, verbose_flatmap=None, max_cache=-1, **kwargs): results = _parallel_progbar_launch(mapper, iterable, nprocs, starmap, flatmap, shuffle, verbose, ...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 9; 2, function_name:get_creation_date_tags; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:url; 5, identifier:domain; 6, default_parameter; 6, 7; 6, 8; 7, identifier:as_dicts; 8, False; 9, block; 9, 10; 9, 22; 9, 41; 9, 47; 10, expression_statement; 10, 11; 11, as...
def get_creation_date_tags(url, domain, as_dicts=False): creation_date_tags = [ mementoweb_api_tags(url), get_whois_tags(domain), ] creation_date_tags = sorted( sum(creation_date_tags, []), key=lambda x: x.date ) if not as_dicts: return creation_date_tags ...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:image_from_name; 3, parameters; 3, 4; 3, 5; 4, identifier:name; 5, identifier:images; 6, block; 6, 7; 6, 24; 6, 50; 6, 79; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 10; 9, identifier:prefixed_images; 10, list_comprehension; 10, 11;...
def image_from_name(name, images): prefixed_images = [i for i in images if i.name.startswith(name)] if name in [i.name for i in prefixed_images]: return [i for i in prefixed_images if i.name == name][-1] decorated = sorted( [(int(re.search('\d+', i.name).group(0)), i) for i in prefixed_image...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:func_on_enter; 3, parameters; 3, 4; 4, identifier:func; 5, block; 5, 6; 5, 29; 6, function_definition; 6, 7; 6, 8; 6, 10; 7, function_name:function_after_enter_pressed; 8, parameters; 8, 9; 9, identifier:ev; 10, block; 10, 11; 10, 17; 11, expre...
def func_on_enter(func): def function_after_enter_pressed(ev): ev.stopPropagation() if ev.keyCode == 13: func(ev) return function_after_enter_pressed
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:prev_next_group; 3, parameters; 3, 4; 3, 5; 4, identifier:project; 5, identifier:group; 6, block; 6, 7; 6, 23; 6, 41; 6, 54; 6, 72; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 10; 9, identifier:groups; 10, call; 10, 11; 10, 12; 11, i...
def prev_next_group(project, group): groups = sorted(x for x in project.groups if x.submissions) try: index = groups.index(group) except ValueError: return None, None prev_group = groups[index - 1] if index > 0 else None next_group = groups[index + 1] if index + 1 < len(groups) else ...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:do_minus; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:self; 5, identifier:parser; 6, identifier:group; 7, block; 7, 8; 7, 10; 7, 18; 7, 22; 7, 110; 7, 121; 8, expression_statement; 8, 9; 9, string:'''This filter sorts nodes in a flat group i...
def do_minus(self, parser, group): '''This filter sorts nodes in a flat group into "required", "default", and "banned" subgroups based on the presence of plus and minus nodes. ''' grouper = group.__class__() next_not = None for node in group: if isinstance(nod...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:topological_sort; 3, parameters; 3, 4; 4, identifier:dependency_pairs; 5, block; 5, 6; 5, 8; 5, 15; 5, 22; 5, 26; 5, 68; 5, 80; 5, 109; 5, 125; 6, expression_statement; 6, 7; 7, string:"Sort values subject to dependency constraints"; 8, express...
def topological_sort(dependency_pairs): "Sort values subject to dependency constraints" num_heads = defaultdict(int) tails = defaultdict(list) heads = [] for h, t in dependency_pairs: num_heads[t] += 1 if h in tails: tails[h].append(t) else: tails[h] =...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:multisorted; 3, parameters; 3, 4; 3, 5; 4, identifier:items; 5, list_splat_pattern; 5, 6; 6, identifier:keys; 7, block; 7, 8; 7, 23; 7, 47; 8, if_statement; 8, 9; 8, 15; 9, comparison_operator:==; 9, 10; 9, 14; 10, call; 10, 11; 10, 12; 11, ide...
def multisorted(items, *keys): if len(keys) == 0: keys = [asc()] for key in reversed(keys): items = sorted(items, key=key.func, reverse=key.reverse) return items
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:tuplesorted; 3, parameters; 3, 4; 3, 5; 4, identifier:items; 5, list_splat_pattern; 5, 6; 6, identifier:keys; 7, block; 7, 8; 7, 47; 8, expression_statement; 8, 9; 9, assignment; 9, 10; 9, 11; 10, identifier:tuple_keys; 11, list_comprehension; ...
def tuplesorted(items, *keys): tuple_keys = [ Key(func=lambda t, i=index, k=key: k.func(t[i]), reverse=key.reverse) for index, key in enumerate(keys) ] return multisorted(items, *tuple_keys)
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 12; 2, function_name:list_formats; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 9; 4, identifier:self; 5, identifier:node; 6, default_parameter; 6, 7; 6, 8; 7, identifier:path; 8, tuple; 9, default_parameter; 9, 10; 9, 11; 10, identifier:formats; 11, None; 12, block; 12, 1...
def list_formats(self, node, path=(), formats=None): if formats == None: formats = [] for child in node.children: self.list_formats(child, path + (child.name,), formats) path and formats.append(".".join(path)) return sorted(formats)
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 13; 2, function_name:ls; 3, parameters; 3, 4; 3, 7; 3, 10; 4, default_parameter; 4, 5; 4, 6; 5, identifier:root; 6, string:"."; 7, default_parameter; 7, 8; 7, 9; 8, identifier:abspaths; 9, False; 10, default_parameter; 10, 11; 10, 12; 11, identifier:recursive; 12,...
def ls(root=".", abspaths=False, recursive=False): def _expand_subdirs(file): if isdir(path(root, file)): return [file] + [path(file, x) for x in ls(path(root, file), recursive=True)] else: return [file] if isfile(root): return [abspat...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 19; 2, function_name:list; 3, parameters; 3, 4; 3, 5; 3, 8; 3, 11; 3, 14; 3, 17; 4, identifier:self; 5, default_parameter; 5, 6; 5, 7; 6, identifier:offset; 7, integer:0; 8, default_parameter; 8, 9; 8, 10; 9, identifier:limit; 10, integer:0; 11, default_parameter;...
def list(self, offset=0, limit=0, fields=None, sort=None, **kwargs): try: cursor = self._cursor(offset=offset, limit=limit, fields=fields, sort=sort, **kwargs) return list(cursor), cursor.count() except pymongo.errors.OperationFailure as exc: ...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 19; 2, function_name:_cursor; 3, parameters; 3, 4; 3, 5; 3, 8; 3, 11; 3, 14; 3, 17; 4, identifier:self; 5, default_parameter; 5, 6; 5, 7; 6, identifier:offset; 7, integer:0; 8, default_parameter; 8, 9; 8, 10; 9, identifier:limit; 10, integer:0; 11, default_paramet...
def _cursor(self, offset=0, limit=0, fields=None, sort=None, **kwargs): projection = {'_id': False} if fields: projection.update({field: True for field in fields}) results = self._collection.find(kwargs, projection) if sort: sort_pairs = sort[:] for in...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:insert; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:self; 5, identifier:item; 6, identifier:low_value; 7, block; 7, 8; 8, return_statement; 8, 9; 9, call; 9, 10; 9, 11; 10, identifier:c_void_p; 11, argument_list; 11, 12; 12, call; 12, 13; 12...
def insert(self, item, low_value): return c_void_p(lib.zlistx_insert(self._as_parameter_, item, low_value))
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:reorder; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:self; 5, identifier:handle; 6, identifier:low_value; 7, block; 7, 8; 8, return_statement; 8, 9; 9, call; 9, 10; 9, 13; 10, attribute; 10, 11; 10, 12; 11, identifier:lib; 12, identifier:zli...
def reorder(self, handle, low_value): return lib.zlistx_reorder(self._as_parameter_, handle, low_value)
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 14; 2, function_name:process_params; 3, parameters; 3, 4; 3, 5; 3, 8; 3, 11; 4, identifier:request; 5, default_parameter; 5, 6; 5, 7; 6, identifier:standard_params; 7, identifier:STANDARD_QUERY_PARAMS; 8, default_parameter; 8, 9; 8, 10; 9, identifier:filter_fields...
def process_params(request, standard_params=STANDARD_QUERY_PARAMS, filter_fields=None, defaults=None): if not filter_fields: filter_fields = [] unfilterable = (set(request.query.keys()) - set(filter_fields) - set(standard_params)) if unfilterable: bottl...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 15; 2, function_name:_weave_dohist; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 3, 8; 3, 9; 3, 12; 4, identifier:data; 5, identifier:s; 6, identifier:binsize; 7, identifier:hist; 8, identifier:rev; 9, default_parameter; 9, 10; 9, 11; 10, identifier:dorev; 11, False; 12...
def _weave_dohist(data, s, binsize, hist, rev, dorev=False, verbose=0): if dorev: dorev=1 else: dorev=0 code = scipy.weave.inline(code, ['data','s','binsize','hist','rev','dorev'], type_converters = scipy.weave.converters.blitz, verbose=verbose) return
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 11; 2, function_name:loose_search; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 9; 4, identifier:self; 5, identifier:asset_manager_id; 6, default_parameter; 6, 7; 6, 8; 7, identifier:query; 8, string:''; 9, dictionary_splat_pattern; 9, 10; 10, identifier:kwargs; 11, block;...
def loose_search(self, asset_manager_id, query='', **kwargs): self.logger.info('Asset Search - Asset Manager: %s', asset_manager_id) url = '{endpoint}/assets/search/{asset_manager_id}'.format( asset_manager_id=asset_manager_id, endpoint=self.endpoint, ) params = {...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:natural_sort; 3, parameters; 3, 4; 4, identifier:item; 5, block; 5, 6; 5, 13; 5, 30; 6, if_statement; 6, 7; 6, 10; 7, comparison_operator:is; 7, 8; 7, 9; 8, identifier:item; 9, None; 10, block; 10, 11; 11, return_statement; 11, 12; 12, integer:...
def natural_sort(item): if item is None: return 0 def try_int(s): try: return int(s) except ValueError: return s return tuple(map(try_int, re.findall(r'(\d+|\D+)', item)))
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:get_html_attrs; 3, parameters; 3, 4; 4, default_parameter; 4, 5; 4, 6; 5, identifier:kwargs; 6, None; 7, block; 7, 8; 7, 14; 7, 18; 7, 22; 7, 36; 7, 73; 7, 83; 7, 151; 7, 157; 7, 163; 7, 170; 8, expression_statement; 8, 9; 9, assignment; 9, 10;...
def get_html_attrs(kwargs=None): kwargs = kwargs or {} attrs = [] props = [] classes = kwargs.get('classes', '').strip() if classes: classes = ' '.join(re.split(r'\s+', classes)) classes = to_unicode(quoteattr(classes)) attrs.append('class=%s' % classes) try: del ...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:sort_dependencies; 3, parameters; 3, 4; 4, identifier:objects; 5, block; 5, 6; 5, 13; 5, 17; 5, 23; 5, 29; 5, 36; 5, 62; 5, 172; 5, 178; 5, 182; 5, 308; 5, 312; 5, 325; 6, import_from_statement; 6, 7; 6, 11; 7, dotted_name; 7, 8; 7, 9; 7, 10; 8...
def sort_dependencies(objects): from django.db.models import get_model model_dependencies = [] models = set() model_list = set() objs_by_model = defaultdict(list) for o in objects: model = o.__class__ objs_by_model[model].append(o) model_list.add(model) for model in m...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 10; 2, function_name:sort_languages; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, default_parameter; 5, 6; 5, 7; 6, identifier:order; 7, attribute; 7, 8; 7, 9; 8, identifier:Qt; 9, identifier:AscendingOrder; 10, block; 10, 11; 10, 17; 10, 40; 11, expression_s...
def sort_languages(self, order=Qt.AscendingOrder): self.beginResetModel() self.__languages = sorted(self.__languages, key=lambda x: (x.name), reverse=order) self.endResetModel()
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 11; 2, function_name:fmt_pairs; 3, parameters; 3, 4; 3, 5; 3, 8; 4, identifier:obj; 5, default_parameter; 5, 6; 5, 7; 6, identifier:indent; 7, integer:4; 8, default_parameter; 8, 9; 8, 10; 9, identifier:sort_key; 10, None; 11, block; 11, 12; 11, 25; 11, 31; 11, 38...
def fmt_pairs(obj, indent=4, sort_key=None): lengths = [len(x[0]) for x in obj] if not lengths: return '' longest = max(lengths) obj = sorted(obj, key=sort_key) formatter = '%s{: <%d} {}' % (' ' * indent, longest) string = '\n'.join([formatter.format(k, v) for k, v in obj]) return st...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 11; 2, function_name:serialize; 3, parameters; 3, 4; 3, 5; 3, 8; 4, identifier:self; 5, default_parameter; 5, 6; 5, 7; 6, identifier:as_dict; 7, False; 8, default_parameter; 8, 9; 8, 10; 9, identifier:sort; 10, None; 11, block; 11, 12; 11, 25; 11, 48; 11, 64; 11, ...
def serialize(self, as_dict=False, sort=None): files = getattr(self, 'files', self.run()) if as_dict: return dict((fn, p.to_dict()) for fn, p in files.items()) data = (p.to_dict() for p in files.values()) if callable(sort): return sorted(data, key=sort) el...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:iteritems; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 28; 6, expression_statement; 6, 7; 7, assignment; 7, 8; 7, 9; 8, identifier:sorted_data; 9, call; 9, 10; 9, 11; 10, identifier:sorted; 11, argument_list; 11, 12; 11, 19; 11,...
def iteritems(self): sorted_data = sorted(self.data.iteritems(), self.cmp, self.key, self.reverse) for k,v in sorted_data: yield k,v
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 14; 2, function_name:get_posts; 3, parameters; 3, 4; 3, 5; 3, 8; 3, 11; 4, identifier:self; 5, default_parameter; 5, 6; 5, 7; 6, identifier:num; 7, None; 8, default_parameter; 8, 9; 8, 10; 9, identifier:tag; 10, None; 11, default_parameter; 11, 12; 11, 13; 12, ide...
def get_posts(self, num=None, tag=None, private=False): posts = self.posts if not private: posts = [post for post in posts if post.public] if tag: posts = [post for post in posts if tag in post.tags] if num: return posts[:num] return posts
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:get_sort_function; 3, parameters; 3, 4; 4, identifier:order; 5, block; 5, 6; 5, 26; 5, 71; 6, expression_statement; 6, 7; 7, assignment; 7, 8; 7, 9; 8, identifier:stable; 9, call; 9, 10; 9, 11; 10, identifier:tuple; 11, generator_expression; 11...
def get_sort_function(order): stable = tuple((d['key'], -1 if d['reverse'] else 1) for d in order) def sort_function(a, b): for name, direction in stable: v = cmp(getattr(a, name) if a else a, getattr(b, name) if b else b) if v != 0: return v * direction r...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:create_proxy_model; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, identifier:model; 6, block; 6, 7; 6, 14; 6, 21; 6, 32; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 10; 9, identifier:proxy; 10, call; 10, 11; 10, 12; 11, identifie...
def create_proxy_model(self, model): proxy = ReftrackSortFilterModel(self) proxy.setSourceModel(model) model.rowsInserted.connect(self.sort_model) return proxy
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 9; 2, function_name:sort_model; 3, parameters; 3, 4; 3, 5; 3, 7; 4, identifier:self; 5, list_splat_pattern; 5, 6; 6, identifier:args; 7, dictionary_splat_pattern; 7, 8; 8, identifier:kwargs; 9, block; 9, 10; 9, 19; 9, 28; 9, 37; 10, expression_statement; 10, 11; 1...
def sort_model(self, *args, **kwargs): self.proxy.sort(17) self.proxy.sort(2) self.proxy.sort(1) self.proxy.sort(0)
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:prepare_value; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, identifier:value; 6, block; 6, 7; 6, 41; 7, if_statement; 7, 8; 7, 15; 8, boolean_operator:and; 8, 9; 8, 12; 9, comparison_operator:is; 9, 10; 9, 11; 10, identifier:value; 11, Non...
def prepare_value(self, value): if value is None and self.required: choices =list(self.choices) if len(choices) == 1: value = choices[0][0] return super(TemplateChoiceField, self).prepare_value(value)
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:_sort; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 15; 5, 39; 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, identifier:_log; 12, identifier:d...
def _sort(self): self._log.debug('Sorting responses by priority') self._responses = OrderedDict(sorted(list(self._responses.items()), reverse=True)) self.sorted = True
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 18; 2, function_name:csv_row_to_transaction; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 9; 3, 12; 3, 15; 4, identifier:index; 5, identifier:row; 6, default_parameter; 6, 7; 6, 8; 7, identifier:source_encoding; 8, string:"latin1"; 9, default_parameter; 9, 10; 9, 11; 10, i...
def csv_row_to_transaction(index, row, source_encoding="latin1", date_format="%d-%m-%Y", thousand_sep=".", decimal_sep=","): xfer, posted, message, amount, total = row xfer = Parse.date(xfer) posted = Parse.date(posted) message = Parse.to_utf8(message, source_encoding) ...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 17; 2, function_name:csv_to_transactions; 3, parameters; 3, 4; 3, 5; 3, 8; 3, 11; 3, 14; 4, identifier:handle; 5, default_parameter; 5, 6; 5, 7; 6, identifier:source_encoding; 7, string:"latin1"; 8, default_parameter; 8, 9; 8, 10; 9, identifier:date_format; 10, st...
def csv_to_transactions(handle, source_encoding="latin1", date_format="%d-%m-%Y", thousand_sep=".", decimal_sep=","): trans = Transactions() rows = csv.reader(handle, delimiter=";", quotechar="\"") for index, row in enumerate(rows): trans.append(Parse.csv_row_to_transacti...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:filterAcceptsRow; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:self; 5, identifier:row; 6, identifier:parentindex; 7, block; 7, 8; 7, 24; 7, 49; 7, 60; 7, 69; 8, if_statement; 8, 9; 8, 21; 9, not_operator; 9, 10; 10, call; 10, 11; 10, 18; 11,...
def filterAcceptsRow(self, row, parentindex): if not super(ReftrackSortFilterModel, self).filterAcceptsRow(row, parentindex): return False if parentindex.isValid(): m = parentindex.model() else: m = self.sourceModel() i = m.index(row, 18, parentindex) ...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 14; 2, function_name:load_grid_data; 3, parameters; 3, 4; 3, 5; 3, 8; 3, 11; 4, identifier:file_list; 5, default_parameter; 5, 6; 5, 7; 6, identifier:data_type; 7, string:"binary"; 8, default_parameter; 8, 9; 8, 10; 9, identifier:sort; 10, True; 11, default_parame...
def load_grid_data(file_list, data_type="binary", sort=True, delim=" "): if not type(file_list) is list: file_list = [file_list] elif sort: file_list.sort(key=lambda f: int(re.sub("[^0-9]", "", f))) world_size = get_world_dimensions(file_list[0], delim) data = initialize_grid(world_size,...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:sort; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 113; 5, 119; 5, 156; 6, for_statement; 6, 7; 6, 10; 6, 17; 7, pattern_list; 7, 8; 7, 9; 8, identifier:priority; 9, identifier:triggers; 10, call; 10, 11; 10, 16; 11, attribute; 1...
def sort(self): for priority, triggers in self._triggers.items(): self._log.debug('Sorting priority {priority} triggers'.format(priority=priority)) atomics = [trigger for trigger in triggers if trigger.pattern_is_atomic] wildcards = [trigger for trigger in triggers if not tri...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:log_message; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:self; 5, identifier:user; 6, identifier:message; 7, block; 7, 8; 7, 36; 7, 44; 7, 56; 8, if_statement; 8, 9; 8, 14; 8, 21; 9, call; 9, 10; 9, 11; 10, identifier:isinstance; 11, argumen...
def log_message(self, user, message): if isinstance(user, SeshetUser): user = user.nick elif not isinstance(user, IRCstr): user = IRCstr(user) time = datetime.utcnow() self.message_log.append((time, user, message)) while len(self.message_log) > self._log_s...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 22; 2, function_name:add_item; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 3, 10; 3, 13; 3, 16; 3, 19; 4, identifier:self; 5, identifier:path; 6, identifier:name; 7, default_parameter; 7, 8; 7, 9; 8, identifier:icon; 9, None; 10, default_parameter; 10, 11; 10, 12; 11, ...
def add_item(self, path, name, icon=None, url=None, order=None, permission=None, active_regex=None): if self.root_item is None: self.root_item = MenuItem('ROOT', 'ROOT') root_item = self.root_item current_path = '' for node in path.split('/')[:-1]: if not node: ...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 9; 2, function_name:assist; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 7; 3, 8; 4, identifier:self; 5, identifier:project_path; 6, identifier:source; 7, identifier:position; 8, identifier:filename; 9, block; 9, 10; 10, return_statement; 10, 11; 11, call; 11, 12; 11, 15; ...
def assist(self, project_path, source, position, filename): return self._call('assist', project_path, source, position, filename)
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:sorted_key_list; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 18; 5, 41; 5, 51; 6, if_statement; 6, 7; 6, 11; 7, not_operator; 7, 8; 8, attribute; 8, 9; 8, 10; 9, identifier:self; 10, identifier:is_baked; 11, block; 11, 12; 12, e...
def sorted_key_list(self): if not self.is_baked: self.bake() key_value_tuple = sorted(self.dct.items(), key=lambda x: x[1]['__abs_time__']) skl = [k[0] for k in key_value_tuple] return skl
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:get_used_key_frames; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 16; 5, 20; 5, 48; 6, expression_statement; 6, 7; 7, assignment; 7, 8; 7, 9; 8, identifier:skl; 9, call; 9, 10; 9, 15; 10, attribute; 10, 11; 10, 14; 11, attribute;...
def get_used_key_frames(self): skl = self.key_frame_list.sorted_key_list() used_key_frames = [] for kf in skl: if kf in self.dct['keys']: used_key_frames.append((kf, self.dct['keys'][kf])) return used_key_frames
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:flds_firstsort; 3, parameters; 3, 4; 4, identifier:d; 5, block; 5, 6; 5, 8; 5, 29; 5, 47; 6, expression_statement; 6, 7; 7, string:''' Perform a lexsort and return the sort indices and shape as a tuple. '''; 8, expression_statement; 8, ...
def flds_firstsort(d): ''' Perform a lexsort and return the sort indices and shape as a tuple. ''' shape = [ len( np.unique(d[l]) ) for l in ['xs', 'ys', 'zs'] ]; si = np.lexsort((d['z'],d['y'],d['x'])); return si,shape;
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:flds_sort; 3, parameters; 3, 4; 3, 5; 4, identifier:d; 5, identifier:s; 6, block; 6, 7; 6, 9; 6, 31; 6, 37; 6, 69; 7, expression_statement; 7, 8; 8, string:''' Sort based on position. Sort with s as a tuple of the sort indices and shape...
def flds_sort(d,s): ''' Sort based on position. Sort with s as a tuple of the sort indices and shape from first sort. Parameters: ----------- d -- the flds/sclr data s -- (si, shape) sorting and shaping data from firstsort. ''' labels = [ key for key in d.keys() if...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 7; 2, function_name:read; 3, parameters; 3, 4; 3, 5; 4, identifier:fname; 5, dictionary_splat_pattern; 5, 6; 6, identifier:kw; 7, block; 7, 8; 7, 10; 7, 37; 7, 50; 7, 324; 8, expression_statement; 8, 9; 9, string:''' Reads an lsp output file and returns a raw ...
def read(fname,**kw): ''' Reads an lsp output file and returns a raw dump of data, sectioned into quantities either as an dictionary or a typed numpy array. Parameters: ----------- fname -- filename of thing to read Keyword Arguments: ------------------ vprint -- Verbose printer. ...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 9; 2, function_name:get_region_nt_counts; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:region; 5, identifier:bam; 6, default_parameter; 6, 7; 6, 8; 7, identifier:stranded; 8, False; 9, block; 9, 10; 9, 28; 9, 182; 9, 191; 9, 218; 9, 233; 9, 468; 10, if_statement...
def get_region_nt_counts(region, bam, stranded=False): if type(bam) == str: bam = pysam.AlignmentFile(bam, 'rb') if type(region) is str: r = parse_region(region) if len(r) == 3: chrom, start, end = r elif len(r) == 4: chrom, start, end, strand = r ...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 15; 2, function_name:nt_counts; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 9; 3, 12; 4, identifier:bam; 5, identifier:positions; 6, default_parameter; 6, 7; 6, 8; 7, identifier:stranded; 8, False; 9, default_parameter; 9, 10; 9, 11; 10, identifier:vcf; 11, False; 12, def...
def nt_counts(bam, positions, stranded=False, vcf=False, bed=False): if not bed and not vcf: if type(positions) == pbt.bedtool.BedTool: df = positions.to_dataframe() elif positions[-4:] == '.bed': bed = True elif positions[-4:] == '.vcf': vcf = True ...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 12; 2, function_name:add_host; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 9; 4, identifier:self; 5, identifier:host; 6, default_parameter; 6, 7; 6, 8; 7, identifier:group_names; 8, None; 9, default_parameter; 9, 10; 9, 11; 10, identifier:host_vars; 11, None; 12, block; 1...
def add_host(self, host, group_names=None, host_vars=None): gnames = group_names if group_names else [] hvars = host_vars if host_vars else {} gnames.sort() hvars[A.server.GROUP_NAMES] = gnames hvars[A.server.INV_NAME] = host hvars[A.server.INV_NAME_SHORT] = host.split('....
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 16; 2, function_name:beds_to_boolean; 3, parameters; 3, 4; 3, 5; 3, 8; 3, 11; 3, 14; 4, identifier:beds; 5, default_parameter; 5, 6; 5, 7; 6, identifier:ref; 7, None; 8, default_parameter; 8, 9; 8, 10; 9, identifier:beds_sorted; 10, False; 11, default_parameter; 1...
def beds_to_boolean(beds, ref=None, beds_sorted=False, ref_sorted=False, **kwargs): beds = copy.deepcopy(beds) fns = [] for i,v in enumerate(beds): if type(v) == str: fns.append(v) beds[i] = pbt.BedTool(v) else: fns.append(v.fn) ...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 11; 2, function_name:combine; 3, parameters; 3, 4; 3, 5; 3, 8; 4, identifier:beds; 5, default_parameter; 5, 6; 5, 7; 6, identifier:beds_sorted; 7, False; 8, default_parameter; 8, 9; 8, 10; 9, identifier:postmerge; 10, True; 11, block; 11, 12; 11, 21; 11, 65; 11, 8...
def combine(beds, beds_sorted=False, postmerge=True): beds = copy.deepcopy(beds) for i,v in enumerate(beds): if type(v) == str: beds[i] = pbt.BedTool(v) if not beds_sorted: beds[i] = beds[i].sort() out = reduce(lambda x,y : x.cat(y, postmerge=False), beds) out = o...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:sanitize_config_loglevel; 3, parameters; 3, 4; 4, identifier:level; 5, block; 5, 6; 5, 8; 5, 31; 5, 35; 5, 53; 5, 64; 6, expression_statement; 6, 7; 7, string:''' Kinda sorta backport of loglevel sanitization for Python 2.6. '''; 8, if_...
def sanitize_config_loglevel(level): ''' Kinda sorta backport of loglevel sanitization for Python 2.6. ''' if sys.version_info[:2] != (2, 6) or isinstance(level, (int, long)): return level lvl = None if isinstance(level, basestring): lvl = logging._levelNames.get(level) if no...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 11; 2, function_name:prt_js; 3, parameters; 3, 4; 3, 5; 3, 8; 4, identifier:js; 5, default_parameter; 5, 6; 5, 7; 6, identifier:sort_keys; 7, True; 8, default_parameter; 8, 9; 8, 10; 9, identifier:indent; 10, integer:4; 11, block; 11, 12; 12, expression_statement;...
def prt_js(js, sort_keys=True, indent=4): print(js2str(js, sort_keys, indent))
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 17; 2, function_name:find_field_names; 3, parameters; 3, 4; 3, 5; 3, 8; 3, 11; 3, 14; 4, identifier:fields; 5, default_parameter; 5, 6; 5, 7; 6, identifier:model; 7, identifier:DEFAULT_MODEL; 8, default_parameter; 8, 9; 8, 10; 9, identifier:app; 10, identifier:DEF...
def find_field_names(fields, model=DEFAULT_MODEL, app=DEFAULT_APP, score_cutoff=50, pad_with_none=False): fields = util.listify(fields) model = get_model(model, app) available_field_names = model._meta.get_all_field_names() matched_fields = [] for field_name in fields: match = fuzzy.extractO...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 34; 2, function_name:lagged_in_date; 3, parameters; 3, 4; 3, 7; 3, 10; 3, 13; 3, 16; 3, 19; 3, 22; 3, 25; 3, 28; 3, 31; 4, default_parameter; 4, 5; 4, 6; 5, identifier:x; 6, None; 7, default_parameter; 7, 8; 7, 9; 8, identifier:y; 9, None; 10, default_parameter; 1...
def lagged_in_date(x=None, y=None, filter_dict=None, model='WikiItem', app=DEFAULT_APP, sort=True, limit=30000, lag=1, pad=0, truncate=True): lag = int(lag or 0) if isinstance(x, basestring) and isinstance(y, basestring): x, y = sequence_from_filter_spec([find_synonymous_field(x), find_synonymous_field(...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 12; 2, function_name:percentile; 3, parameters; 3, 4; 3, 5; 3, 6; 4, identifier:sorted_list; 5, identifier:percent; 6, default_parameter; 6, 7; 6, 8; 7, identifier:key; 8, lambda; 8, 9; 8, 11; 9, lambda_parameters; 9, 10; 10, identifier:x; 11, identifier:x; 12, bl...
def percentile(sorted_list, percent, key=lambda x: x): if not sorted_list: return None if percent == 1: return float(sorted_list[-1]) if percent == 0: return float(sorted_list[0]) n = len(sorted_list) i = percent * n if ceil(i) == i: i = int(i) return (sor...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 5; 2, function_name:tags; 3, parameters; 3, 4; 4, identifier:self; 5, block; 5, 6; 5, 8; 5, 21; 5, 30; 5, 43; 5, 56; 5, 64; 6, expression_statement; 6, 7; 7, string:'''Return a list of all tags that have this semantic tag, sorted by name. :rtype: list of ckan.mo...
def tags(self): '''Return a list of all tags that have this semantic tag, sorted by name. :rtype: list of ckan.model.tag.Tag objects ''' q = meta.Session.query(_tag.Tag) q = q.join(TagSemanticTag) q = q.filter_by(tag_id=self.id) q = q.order_by(_tag.Tag.name) tags = q.all() return tags
0, module; 0, 1; 1, ERROR; 1, 2; 1, 178; 1, 195; 1, 203; 1, 213; 2, function_definition; 2, 3; 2, 4; 2, 10; 3, function_name:make_feature_bed; 4, parameters; 4, 5; 4, 6; 4, 7; 5, identifier:gtf; 6, identifier:feature; 7, default_parameter; 7, 8; 7, 9; 8, identifier:out; 9, None; 10, block; 10, 11; 10, 15; 11, expressio...
def make_feature_bed(gtf, feature, out=None): bed_lines = [] with open(gtf) as f: line = f.readline().strip() while line != '': if line[0] != ' line = line.split('\t') if line[2] == feature: chrom = line[0] start...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 13; 2, function_name:filter; 3, parameters; 3, 4; 3, 5; 3, 8; 3, 11; 4, identifier:self; 5, default_parameter; 5, 6; 5, 7; 6, identifier:order_by; 7, None; 8, default_parameter; 8, 9; 8, 10; 9, identifier:limit; 10, integer:0; 11, dictionary_splat_pattern; 11, 12;...
def filter(self, order_by=None, limit=0, **kwargs): with rconnect() as conn: if len(kwargs) == 0: raise ValueError try: query = self._base() query = query.filter(kwargs) if order_by is not None: query = s...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 11; 2, function_name:all; 3, parameters; 3, 4; 3, 5; 3, 8; 4, identifier:self; 5, default_parameter; 5, 6; 5, 7; 6, identifier:order_by; 7, None; 8, default_parameter; 8, 9; 8, 10; 9, identifier:limit; 10, integer:0; 11, block; 11, 12; 12, with_statement; 12, 13; ...
def all(self, order_by=None, limit=0): with rconnect() as conn: try: query = self._base() if order_by is not None: query = self._order_by(query, order_by) if limit > 0: query = self._limit(query, limit) ...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 15; 2, function_name:safe_dump_js; 3, parameters; 3, 4; 3, 5; 3, 6; 3, 9; 3, 12; 4, identifier:js; 5, identifier:abspath; 6, default_parameter; 6, 7; 6, 8; 7, identifier:fastmode; 8, False; 9, default_parameter; 9, 10; 9, 11; 10, identifier:compress; 11, False; 12...
def safe_dump_js(js, abspath, fastmode=False, compress=False, enable_verbose=True): abspath = str(abspath) temp_abspath = "%s.tmp" % abspath dump_js(js, temp_abspath, fastmode=fastmode, replace=True, compress=compress, enable_verbose=enable_verbose) shutil.move(temp_abspat...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:all_selectors; 3, parameters; 3, 4; 3, 5; 4, identifier:Class; 5, identifier:fn; 6, block; 6, 7; 6, 11; 6, 22; 6, 31; 6, 64; 6, 77; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 10; 9, identifier:selectors; 10, list:[]; 11, expression_...
def all_selectors(Class, fn): selectors = [] cssparser = cssutils.CSSParser(validate=False) css = cssparser.parseFile(fn) for rule in [r for r in css.cssRules if type(r)==cssutils.css.CSSStyleRule]: selectors += [sel.selectorText for sel in rule.selectorList] se...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 8; 2, function_name:create_logger; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, default_parameter; 5, 6; 5, 7; 6, identifier:args; 7, dictionary; 8, block; 8, 9; 8, 18; 8, 26; 8, 46; 8, 56; 8, 65; 8, 78; 8, 85; 8, 92; 8, 138; 8, 156; 9, expression_statement; ...
def create_logger(self, args={}): logger = logging.getLogger("SmartFileSorter") logger.level = logging.INFO if '--debug' in args and args['--debug'] is True: logger.setLevel(logging.DEBUG) file_log_formatter = logging.Formatter('%(asctime)s %(name)s %(levelname)s %(message)s'...
0, module; 0, 1; 1, function_definition; 1, 2; 1, 3; 1, 6; 2, function_name:get; 3, parameters; 3, 4; 3, 5; 4, identifier:self; 5, identifier:slug; 6, block; 6, 7; 6, 16; 6, 21; 6, 29; 6, 42; 6, 55; 6, 68; 6, 81; 6, 94; 6, 107; 6, 115; 6, 123; 6, 167; 7, expression_statement; 7, 8; 8, assignment; 8, 9; 8, 10; 9, identi...
def get(self, slug): kb = api.get_kb_by_slug(slug) check_knowledge_access(kb) parser = reqparse.RequestParser() parser.add_argument( 'from', type=str, help="Return only entries where key matches this.") parser.add_argument( 'to', type=str, ...