(self, delimiter, prefix=u"")
Returns an Iterator over all prefixes currently in the store, in any order. The
        prefixes are listed up to the given delimiter.

        If the prefix contains the delimiter, the first delimiter after the prefix is used
        as a cut-off point.

        The uniqueness of the prefixes is ensured.

        The default uses an naive key iteration. Some backends may implement more efficient
        variants.

        :raises exceptions.IOError: If there was an error accessing the store.
Returns an Iterator over all prefixes currently in the store, in any order. The
        prefixes are listed up to the given delimiter.
Returns an Iterator over all prefixes currently in the store in any order . The prefixes are listed up to the given delimiter .
def iter_prefixes(self, delimiter, prefix=u""):
        """Returns an Iterator over all prefixes currently in the store, in any order. The
        prefixes are listed up to the given delimiter.

        If the prefix contains the delimiter, the first delimiter after the prefix is used
        as a cut-off point.

        The uniqueness of the prefixes is ensured.

        The default uses an naive key iteration. Some backends may implement more efficient
        variants.

        :raises exceptions.IOError: If there was an error accessing the store.
        """
        dlen = len(delimiter)
        plen = len(prefix)
        memory = set()

        for k in self.iter_keys(prefix):
            pos = k.find(delimiter, plen)
            if pos >= 0:
                k = k[: pos + dlen]

            if k not in memory:
                yield k
                memory.add(k)
def iter_prefixes ( self , delimiter , prefix = u"" ) : dlen = len ( delimiter ) plen = len ( prefix ) memory = set ( ) for k in self . iter_keys ( prefix ) : pos = k . find ( delimiter , plen ) if pos >= 0 : k = k [ : pos + dlen ] if k not in memory : yield k memory . add ( k )