Datasets:
thisisanshgupta
/
Pycode

Dataset card Data Studio Files
xet
Community
text
stringlengths
0
828
previous_procent_done_str = current_percent_done_str
i += 1.0
logs.print_info(""Analizowanie playlist..."")
for f in playlists:
with open(f, 'r') as fo:
playlist_dict = loads(fo.read())
playlist = Playlist(lib, f, playlist_dict['title'], playlist_dict['tracks'])
lib.add_playlist(playlist)
writer.commit()
logs.print_info(""Optymalizacja index-u..."")
lib.ix.optimize()
return lib"
1103,"def full_subgraph(self, objects):
""""""
Return the subgraph of this graph whose vertices
are the given ones and whose edges are the edges
of the original graph between those vertices.
""""""
vertices = ElementTransformSet(transform=id)
out_edges = KeyTransformDict(transform=id)
in_edges = KeyTransformDict(transform=id)
for obj in objects:
vertices.add(obj)
out_edges[obj] = []
in_edges[obj] = []
edges = set()
head = {}
tail = {}
for referrer in vertices:
for edge in self._out_edges[referrer]:
referent = self._head[edge]
if referent not in vertices:
continue
edges.add(edge)
tail[edge] = referrer
head[edge] = referent
out_edges[referrer].append(edge)
in_edges[referent].append(edge)
return ObjectGraph._raw(
vertices=vertices,
edges=edges,
out_edges=out_edges,
in_edges=in_edges,
head=head,
tail=tail,
)"
1104,"def _raw(cls, vertices, edges, out_edges, in_edges, head, tail):
""""""
Private constructor for direct construction
of an ObjectGraph from its attributes.
vertices is the collection of vertices
out_edges and in_edges map vertices to lists of edges
head and tail map edges to objects.
""""""
self = object.__new__(cls)
self._out_edges = out_edges
self._in_edges = in_edges
self._head = head
self._tail = tail
self._vertices = vertices
self._edges = edges
return self"
1105,"def _from_objects(cls, objects):
""""""
Private constructor: create graph from the given Python objects.
The constructor examines the referents of each given object to build up
a graph showing the objects and their links.
""""""
vertices = ElementTransformSet(transform=id)
out_edges = KeyTransformDict(transform=id)
in_edges = KeyTransformDict(transform=id)
for obj in objects:
vertices.add(obj)
out_edges[obj] = []
in_edges[obj] = []
# Edges are identified by simple integers, so
# we can use plain dictionaries for mapping
# edges to their heads and tails.
edge_label = itertools.count()
edges = set()
head = {}
tail = {}
for referrer in vertices:
for referent in gc.get_referents(referrer):
if referent not in vertices:
continue
edge = next(edge_label)
edges.add(edge)
tail[edge] = referrer
head[edge] = referent