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

All Samples(14)  |  Call(2)  |  Derive(0)  |  Import(12)

src/b/t/BTrees-4.0.8/BTrees/check.py   BTrees(Download)
from BTrees.LOBTree import LOBTree, LOBucket, LOSet, LOTreeSet
from BTrees.LOBTree import LOBTreePy, LOBucketPy, LOSetPy, LOTreeSetPy
from BTrees.OIBTree import OIBTree, OIBucket, OISet, OITreeSet
from BTrees.OIBTree import OIBTreePy, OIBucketPy, OISetPy, OITreeSetPy
from BTrees.OLBTree import OLBTree, OLBucket, OLSet, OLTreeSet

src/d/m/dm.incrementalsearch-2.0/dm/incrementalsearch/__init__.py   dm.incrementalsearch(Download)
from BTrees.OOBTree import OOBTree, OOBucket, OOSet, OOTreeSet
from BTrees.IOBTree import IOBTree, IOBucket, IOSet, IOTreeSet
from BTrees.OIBTree import OIBTree, OIBucket, OISet, OITreeSet
from BTrees.IIBTree import IIBTree, IIBucket, IISet, IITreeSet
from BTrees.IFBTree import IFBTree, IFBucket, IFSet, IFTreeSet

src/i/n/indico-HEAD/indico/MaKaC/conference.py   indico(Download)
from persistent import Persistent
from BTrees.OOBTree import OOBTree, OOTreeSet, OOSet
from BTrees.OIBTree import OIBTree,OISet,union
import MaKaC
import MaKaC.common.indexes as indexes
    def match(self,query):
        query=query.lower().strip()
        res=OISet()
        for k in self._idx.keys():
            if k.find(query)!=-1:

src/a/c/AccessControl-3.0.8/src/AccessControl/SimpleObjectPolicies.py   AccessControl(Download)
#
from BTrees.OOBTree import OOBTree, OOBucket, OOSet
from BTrees.OIBTree import OIBTree, OIBucket, OISet
from BTrees.IOBTree import IOBTree, IOBucket, IOSet
from BTrees.IIBTree import IIBTree, IIBucket, IISet

src/e/x/experimental.catalogqueryplan-3.2.8/experimental/catalogqueryplan/setpatches.py   experimental.catalogqueryplan(Download)
    patch_difference(IOBTree, IOSet)
 
    from BTrees.OIBTree import OISet, OITreeSet
    from BTrees import OIBTree
    patch_intersection(OIBTree, OISet)

src/e/x/experimental.btree-1.1/experimental/btree/setpatches.py   experimental.btree(Download)
    patch_difference(IOBTree, IOSet)
 
    from BTrees.OIBTree import OISet, OITreeSet
    from BTrees import OIBTree
    patch_intersection(OIBTree, OISet)

src/i/n/indico-HEAD/indico/MaKaC/review.py   indico(Download)
    def match(self, query):
        query = query.lower().strip()
        res = OIBTree.OISet()
        for k in self._idx.keys():
            if k.find(query) != -1:

src/b/t/BTrees-4.0.8/BTrees/tests/test_OIBTree.py   BTrees(Download)
    def _getTargetClass(self):
        from BTrees.OIBTree import OISet
        return OISet
 
 
    def builders(self):
        from BTrees.OIBTree import OIBTree
        from BTrees.OIBTree import OIBucket
        from BTrees.OIBTree import OITreeSet
        from BTrees.OIBTree import OISet
    def builders(self):
        from BTrees.OIBTree import OIBTree
        from BTrees.OIBTree import OIBucket
        from BTrees.OIBTree import OITreeSet
        from BTrees.OIBTree import OISet
    def _getTargetClass(self):
        from BTrees.OIBTree import OISet
        return OISet
 
 

src/e/x/experimental.catalogqueryplan-3.2.8/experimental/catalogqueryplan/tests/test_plan.py   experimental.catalogqueryplan(Download)
from BTrees.OIBTree import weightedIntersection as oiweightedIntersection
from BTrees.OIBTree import difference as oidifference
from BTrees.OIBTree import OISet, OITreeSet, OIBTree, OIBucket
 
from BTrees.OOBTree import intersection as oointersection

src/e/x/experimental.btree-1.1/experimental/btree/tests/test_sets.py   experimental.btree(Download)
from BTrees.OIBTree import weightedIntersection as oiweightedIntersection
from BTrees.OIBTree import difference as oidifference
from BTrees.OIBTree import OISet, OITreeSet, OIBTree, OIBucket
 
from BTrees.OOBTree import intersection as oointersection