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

All Samples(325)  |  Call(204)  |  Derive(2)  |  Import(119)

src/h/a/haufe.ztop-0.2.2/haufe/ztop/Sampler.py   haufe.ztop(Download)
from __future__ import division
from time import time as pyTime, mktime
from BTrees.IOBTree import IOBTree
 
 
        self._retain = int(retain * 86400) # now in seconds
        # internal data
        self._events = IOBTree()
        self._restarts = []
        self._pending = {}

src/b/t/BTrees-4.0.8/BTrees/check.py   BTrees(Download)
from BTrees.IIBTree import IIBTree, IIBucket, IISet, IITreeSet
from BTrees.IIBTree import IIBTreePy, IIBucketPy, IISetPy, IITreeSetPy
from BTrees.IOBTree import IOBTree, IOBucket, IOSet, IOTreeSet
from BTrees.IOBTree import IOBTreePy, IOBucketPy, IOSetPy, IOTreeSetPy
from BTrees.LFBTree import LFBTree, LFBucket, LFSet, LFTreeSet

src/h/o/horae.planning-1.0a1/horae/planning/execution.py   horae.planning(Download)
from persistent.list import PersistentList
from persistent.wref import WeakRef
from BTrees.IOBTree import IOBTree
from BTrees.OOBTree import OOBTree
 
    def _initialize_storage(self):
        storage = IAnnotations(self.context)
        storage[self._key] = PersistentDict()
        storage[self._key]['by_ticket'] = IOBTree()
        storage[self._key]['by_milestone'] = IOBTree()
        storage[self._key]['by_project'] = IOBTree()
        storage[self._key]['by_client'] = IOBTree()

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
_btree_classifier = {
  type(OOBTree()) : (30, 250, OBJECT,),
  type(IOBTree()) : (60, 500, INT,),
  type(OIBTree()) : (60, 250, OBJECT,),
  type(IIBTree()) : (120, 500, INT,),

src/h/o/horae.planning-1.0a1/horae/planning/calculation.py   horae.planning(Download)
from threading import Lock, RLock
 
from BTrees.IOBTree import IOBTree
from BTrees.OOBTree import OOBTree
from persistent.dict import PersistentDict
        global_storage = annotations[self._global_key]
        if not 'invalidated' in storage:
            storage['invalidated'] = IOBTree()
        self._invalidated = storage['invalidated']
        if not 'cache' in storage:
            storage['cache'] = OOBTree()
        self._cache = storage['cache']
        if not 'cache_map' in storage:
            storage['cache_map'] = IOBTree()
        for key in ('order', 'above', 'ticket', 'ordered', 'complete',):
            if not key in global_storage:
                global_storage[key] = IOBTree()
            setattr(self, '_' + key, global_storage[key])
        for key in ('start', 'end', 'entries',):
            if not key in storage:
                storage[key] = IOBTree()

src/t/i/TikiDB-0.1.4/tikidb/TikiContainer.py   TikiDB(Download)
from persistent.mapping import PersistentMapping
from persistent.list import PersistentList
from persistent  import Persistent
from BTrees.IOBTree import IOBTree,IOTreeSet,IOSet
from BTrees.OOBTree import OOBTree,OOTreeSet,OOSet
    def __init__(self):
        self.data = IOBTree()
        self.uniqueFields = OOTreeSet()#tuple of key name or names that must
                                        #be unique for each record stored or
                                        #it will be considered the same record
                                      #that can be associated to data values
 
        self.recordDefinition = IOBTree()#has all record definition versions
                                          #highest key is current.  keeps old
                                          #versions to fix issues

src/t/i/TikiDB-0.1.4/tikidb/TikiDB.py   TikiDB(Download)
from persistent.mapping import PersistentMapping
from persistent.list import PersistentList
from persistent  import Persistent
from BTrees.IOBTree import IOBTree,IOTreeSet,IOSet
from BTrees.OOBTree import OOBTree,OOTreeSet,OOSet
            self.root[index_name] = OOBTree()
        elif index_type == 'IOBtree':
            self.root[index_name] = IOBTree()
        #check passed data to ensure the operation can be done
        for k,v in self.root['object_definitions'].iteritems():
    #dict types
    oobtree = OOBTree()
    iobtree = IOBTree()
    pm = PersistentMapping
    d = {}

src/p/r/Products.ZCatalog-3.0.2/src/Products/PluginIndexes/DateRangeIndex/DateRangeIndex.py   Products.ZCatalog(Download)
from BTrees.IIBTree import intersection
from BTrees.IIBTree import multiunion
from BTrees.IOBTree import IOBTree
from BTrees.Length import Length
from DateTime.DateTime import DateTime
    def clear(self):
        """Start over fresh."""
        self._always = IITreeSet()
        self._since_only = IOBTree()
        self._until_only = IOBTree()
        self._since = IOBTree()
        self._until = IOBTree()

src/i/n/indico-HEAD/indico/MaKaC/plugins/RoomBooking/default/initialize.py   indico(Download)
from ZODB.PersistentMapping import PersistentMapping
from persistent import Persistent
from BTrees.IOBTree import IOBTree
from BTrees.OOBTree import OOBTree
 
    # Create rooms branch
    if force or not root.has_key( 'Rooms' ):
        root['Rooms'] = IOBTree()
 
    # Create reservations branch
    if force or not root.has_key( 'Reservations' ):
        root['Reservations'] = IOBTree()
    if force or not root.has_key( 'RoomBlocking' ):
        root['RoomBlocking'] = OOBTree()
        root['RoomBlocking']['Blockings'] = IOBTree()
        root['RoomBlocking']['Indexes'] = OOBTree()
        root['RoomBlocking']['Indexes']['OwnerBlockings'] = OOBTree()

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
 

  1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9  Next