Did I find the right examples for you? yes no      Crawl my project      Python Jobs

All Samples(20)  |  Call(9)  |  Derive(0)  |  Import(11)

src/p/l/plonesocial.microblog-0.5.3/plonesocial/microblog/statuscontainer.py   plonesocial.microblog(Download)
    def _idx_user(self, status):
        userid = unicode(status.userid)
        # If the key was already in the collection, there is no change
        # create user treeset if not already present
        self._user_mapping.insert(userid, LLBTree.LLTreeSet())
    def _idx_tag(self, status):
        for tag in [unicode(tag) for tag in status.tags]:
            # If the key was already in the collection, there is no change
            # create tag treeset if not already present
            self._tag_mapping.insert(tag, LLBTree.LLTreeSet())
            # If the key was already in the collection, there is no change
            # create tag treeset if not already present
            self._uuid_mapping.insert(uuid, LLBTree.LLTreeSet())
            self._uuid_mapping[uuid].insert(status.id)
 
    def _keys_tag(self, tag, keyset):
        if tag is None:
            return keyset
        return LLBTree.intersection(
            LLBTree.LLTreeSet(keyset),
    def _keys_uuid(self, uuid, keyset):
        if uuid is None:
            return keyset
        return LLBTree.intersection(
            LLBTree.LLTreeSet(keyset),

src/b/t/BTrees-4.0.8/BTrees/check.py   BTrees(Download)
from BTrees.LFBTree import LFBTree, LFBucket, LFSet, LFTreeSet
from BTrees.LFBTree import LFBTreePy, LFBucketPy, LFSetPy, LFTreeSetPy
from BTrees.LLBTree import LLBTree, LLBucket, LLSet, LLTreeSet
from BTrees.LLBTree import LLBTreePy, LLBucketPy, LLSetPy, LLTreeSetPy
from BTrees.LOBTree import LOBTree, LOBucket, LOSet, LOTreeSet

src/d/m/dm.incrementalsearch-2.0/dm/incrementalsearch/__init__.py   dm.incrementalsearch(Download)
from BTrees.LOBTree import LOBTree, LOBucket, LOSet, LOTreeSet
from BTrees.OLBTree import OLBTree, OLBucket, OLSet, OLTreeSet
from BTrees.LLBTree import LLBTree, LLBucket, LLSet, LLTreeSet
from BTrees.LFBTree import LFBTree, LFBucket, LFSet, LFTreeSet
 
  type(OOTreeSet()) : (30, 250, OBJECT,),
  type(IITreeSet()) : (30, 250, INT,),
  type(LLTreeSet()) : (30, 250, LONG,),
  type(OOSet()) : (0, 0, OBJECT,),
  type(IISet()) : (0, 0, INT,),

src/b/t/BTrees-4.0.8/BTrees/tests/test_LLBTree.py   BTrees(Download)
    def _getTargetClass(self):
        from BTrees.LLBTree import LLTreeSet
        return LLTreeSet
 
 
    def _getTargetClass(self):
        from BTrees.LLBTree import LLTreeSet
        return LLTreeSet
 
 
    def _makeOne(self):
        from BTrees.LLBTree import LLTreeSet
        return LLTreeSet()
 
 
    def builders(self):
        from BTrees.LLBTree import LLBTree
        from BTrees.LLBTree import LLBucket
        from BTrees.LLBTree import LLTreeSet
        from BTrees.LLBTree import LLSet

src/p/l/plonesocial.microblog-0.5.3/plonesocial/microblog/tests/test_utils.py   plonesocial.microblog(Download)
import time
import unittest2 as unittest
from BTrees.LLBTree import LLTreeSet
 
from plonesocial.microblog.utils import longkeysortreverse
    def setUp(self):
        self.treeset = LLTreeSet()
        self.k0 = long(1)
        self.treeset.insert(self.k0)
        self.k1 = long((time.time() - 3700) * 1e6)

src/d/m/dm.incrementalsearch-2.0/dm/incrementalsearch/tests/testIBTrees.py   dm.incrementalsearch(Download)
from BTrees.IOBTree import IOBucket, IOBTree
from BTrees.OOBTree import OOBucket, OOBTree, OOTreeSet, OOSet
from BTrees.LLBTree import LLSet, LLTreeSet
from BTrees.LOBTree import LOBucket, LOBTree