cypy/graph/store.py
def nodes(self, *n_labels):
        """ Return an iterator over the node keys in this store,
        optionally filtered by label.
        """
        if n_labels:
            n_ids = ()
            n_id_sets = []
            for n_label in set(n_labels):
                try:
                    n_id_sets.append(self._nodes_by_label[n_label])
                except KeyError:
                    break
            else:
                n_ids = reduce(and_operator, n_id_sets)
        else:
            n_ids = self._nodes.keys()
        for n_id in n_ids:
            yield n_id
 Return an iterator over the node keys in this store,
        optionally filtered by label.
        
Return an iterator over the node keys in this store,
optionally filtered by label.
Return an iterator over the node keys in this store optionally filtered by label .
def nodes(self, *n_labels):
        if n_labels:
            n_ids = ()
            n_id_sets = []
            for n_label in set(n_labels):
                try:
                    n_id_sets.append(self._nodes_by_label[n_label])
                except KeyError:
                    break
            else:
                n_ids = reduce(and_operator, n_id_sets)
        else:
            n_ids = self._nodes.keys()
        for n_id in n_ids:
            yield n_id
def nodes ( self , * n_labels ) : if n_labels : n_ids = ( ) n_id_sets = [ ] for n_label in set ( n_labels ) : try : n_id_sets . append ( self . _nodes_by_label [ n_label ] ) except KeyError : break else : n_ids = reduce ( and_operator , n_id_sets ) else : n_ids = self . _nodes . keys ( ) for n_id in n_ids : yield n_id
Return an iterator over the node keys in this store,
optionally filtered by label.
Return an iterator over the node keys in this store optionally filtered by label .
""" Return an iterator over the node keys in this store,
        optionally filtered by label.
        """
self