Prepare to stitch in tentative ZODB 3.3 final.

lib/python/BTrees/DEPENDENCIES.cfg

-persistent
-transaction

lib/python/BTrees/IIBTree.py

-##############################################################################
-#
-# Copyright (c) 2001, 2002 Zope Corporation and Contributors.
-# All Rights Reserved.
-#
-# This software is subject to the provisions of the Zope Public License,
-# Version 2.0 (ZPL).  A copy of the ZPL should accompany this distribution.
-# THIS SOFTWARE IS PROVIDED "AS IS" AND ANY AND ALL EXPRESS OR IMPLIED
-# WARRANTIES ARE DISCLAIMED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-# WARRANTIES OF TITLE, MERCHANTABILITY, AGAINST INFRINGEMENT, AND FITNESS
-# FOR A PARTICULAR PURPOSE
-#
-##############################################################################
-
-# hack to overcome dynamic-linking headache.
-from _IIBTree import *

lib/python/BTrees/IOBTree.py

-##############################################################################
-#
-# Copyright (c) 2001, 2002 Zope Corporation and Contributors.
-# All Rights Reserved.
-#
-# This software is subject to the provisions of the Zope Public License,
-# Version 2.0 (ZPL).  A copy of the ZPL should accompany this distribution.
-# THIS SOFTWARE IS PROVIDED "AS IS" AND ANY AND ALL EXPRESS OR IMPLIED
-# WARRANTIES ARE DISCLAIMED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-# WARRANTIES OF TITLE, MERCHANTABILITY, AGAINST INFRINGEMENT, AND FITNESS
-# FOR A PARTICULAR PURPOSE
-#
-##############################################################################
-
-# hack to overcome dynamic-linking headache.
-from _IOBTree import *

lib/python/BTrees/Length.py

-##############################################################################
-#
-# Copyright (c) 2001, 2002 Zope Corporation and Contributors.
-# All Rights Reserved.
-#
-# This software is subject to the provisions of the Zope Public License,
-# Version 2.0 (ZPL).  A copy of the ZPL should accompany this distribution.
-# THIS SOFTWARE IS PROVIDED "AS IS" AND ANY AND ALL EXPRESS OR IMPLIED
-# WARRANTIES ARE DISCLAIMED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-# WARRANTIES OF TITLE, MERCHANTABILITY, AGAINST INFRINGEMENT, AND FITNESS
-# FOR A PARTICULAR PURPOSE
-#
-##############################################################################
-
-import persistent
-
-class Length(persistent.Persistent):
-    """BTree lengths are too expensive to compute
-
-    Objects that use BTrees need to keep track of lengths themselves.
-    This class provides an object for doing this.
-
-    As a bonus, the object support application-level conflict
-    resolution.
-
-    It is tempting to to assign length objects to __len__ attributes
-    to provide instance-specific __len__ methods. However, this no
-    longer works as expected, because new-style classes cache
-    class-defined slot methods (like __len__) in C type slots.  Thus,
-    instance-define slot fillers are ignores.
-
-    """
-
-    def __init__(self, v=0):
-        self.value = v
-
-    def __getstate__(self):
-        return self.value
-
-    def __setstate__(self, v):
-        self.value = v
-
-    def set(self, v):
-        self.value = v
-
-    def _p_resolveConflict(self, old, s1, s2):
-        return s1 + s2 - old
-
-    def _p_independent(self):
-        # My state doesn't depend on or materially effect the state of
-        # other objects.
-        return 1
-
-    def change(self, delta):
-        self.value += delta
-
-    def __call__(self, *args):
-        return self.value

lib/python/BTrees/OIBTree.py

-##############################################################################
-#
-# Copyright (c) 2001, 2002 Zope Corporation and Contributors.
-# All Rights Reserved.
-#
-# This software is subject to the provisions of the Zope Public License,
-# Version 2.0 (ZPL).  A copy of the ZPL should accompany this distribution.
-# THIS SOFTWARE IS PROVIDED "AS IS" AND ANY AND ALL EXPRESS OR IMPLIED
-# WARRANTIES ARE DISCLAIMED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-# WARRANTIES OF TITLE, MERCHANTABILITY, AGAINST INFRINGEMENT, AND FITNESS
-# FOR A PARTICULAR PURPOSE
-#
-##############################################################################
-
-# hack to overcome dynamic-linking headache.
-from _OIBTree import *

lib/python/BTrees/OOBTree.py

-##############################################################################
-#
-# Copyright (c) 2001, 2002 Zope Corporation and Contributors.
-# All Rights Reserved.
-#
-# This software is subject to the provisions of the Zope Public License,
-# Version 2.0 (ZPL).  A copy of the ZPL should accompany this distribution.
-# THIS SOFTWARE IS PROVIDED "AS IS" AND ANY AND ALL EXPRESS OR IMPLIED
-# WARRANTIES ARE DISCLAIMED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-# WARRANTIES OF TITLE, MERCHANTABILITY, AGAINST INFRINGEMENT, AND FITNESS
-# FOR A PARTICULAR PURPOSE
-#
-##############################################################################
-
-# hack to overcome dynamic-linking headache.
-from _OOBTree import *

lib/python/BTrees/SETUP.cfg

-# Extension information for zpkg.
-
-# These extensions depend on a header provided by another component;
-# this header is named using depends-on in the sections for each
-# extension that requires it, but must also be identified as a public
-# header in the component that needs it.
-
-<extension _fsBTree>
-  source     _fsBTree.c
-
-  # Common btree includes:
-  depends-on BTreeItemsTemplate.c
-  depends-on BTreeModuleTemplate.c
-  depends-on BTreeTemplate.c
-  depends-on BucketTemplate.c
-  depends-on MergeTemplate.c
-  depends-on SetOpTemplate.c
-  depends-on SetTemplate.c
-  depends-on TreeSetTemplate.c
-  depends-on sorters.c
-</extension>
-
-
-<extension _IIBTree>
-  source     _IIBTree.c
-
-  # Specialization:
-  depends-on intkeymacros.h
-  depends-on intvaluemacros.h
-
-  # Common btree includes:
-  depends-on BTreeItemsTemplate.c
-  depends-on BTreeModuleTemplate.c
-  depends-on BTreeTemplate.c
-  depends-on BucketTemplate.c
-  depends-on MergeTemplate.c
-  depends-on SetOpTemplate.c
-  depends-on SetTemplate.c
-  depends-on TreeSetTemplate.c
-  depends-on sorters.c
-</extension>
-
-
-<extension _IOBTree>
-  source     _IOBTree.c
-
-  # Specialization:
-  depends-on intkeymacros.h
-  depends-on objectvaluemacros.h
-
-  # Common btree includes:
-  depends-on BTreeItemsTemplate.c
-  depends-on BTreeModuleTemplate.c
-  depends-on BTreeTemplate.c
-  depends-on BucketTemplate.c
-  depends-on MergeTemplate.c
-  depends-on SetOpTemplate.c
-  depends-on SetTemplate.c
-  depends-on TreeSetTemplate.c
-  depends-on sorters.c
-</extension>
-
-
-<extension _OIBTree>
-  source     _OIBTree.c
-
-  # Specialization:
-  depends-on objectkeymacros.h
-  depends-on intvaluemacros.h
-
-  # Common btree includes:
-  depends-on BTreeItemsTemplate.c
-  depends-on BTreeModuleTemplate.c
-  depends-on BTreeTemplate.c
-  depends-on BucketTemplate.c
-  depends-on MergeTemplate.c
-  depends-on SetOpTemplate.c
-  depends-on SetTemplate.c
-  depends-on TreeSetTemplate.c
-  depends-on sorters.c
-</extension>
-
-
-<extension _OOBTree>
-  source     _OOBTree.c
-
-  # Specialization:
-  depends-on objectkeymacros.h
-  depends-on objectvaluemacros.h
-
-  # Common btree includes:
-  depends-on BTreeItemsTemplate.c
-  depends-on BTreeModuleTemplate.c
-  depends-on BTreeTemplate.c
-  depends-on BucketTemplate.c
-  depends-on MergeTemplate.c
-  depends-on SetOpTemplate.c
-  depends-on SetTemplate.c
-  depends-on TreeSetTemplate.c
-  depends-on sorters.c
-</extension>

lib/python/BTrees/SetTemplate.c

-/*****************************************************************************
-
-  Copyright (c) 2001, 2002 Zope Corporation and Contributors.
-  All Rights Reserved.
-
-  This software is subject to the provisions of the Zope Public License,
-  Version 2.0 (ZPL).  A copy of the ZPL should accompany this distribution.
-  THIS SOFTWARE IS PROVIDED "AS IS" AND ANY AND ALL EXPRESS OR IMPLIED
-  WARRANTIES ARE DISCLAIMED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-  WARRANTIES OF TITLE, MERCHANTABILITY, AGAINST INFRINGEMENT, AND FITNESS
-  FOR A PARTICULAR PURPOSE
-
- ****************************************************************************/
-
-#define SETTEMPLATE_C "$Id: SetTemplate.c,v 1.17 2003/11/28 16:44:44 jim Exp $\n"
-
-static PyObject *
-Set_insert(Bucket *self, PyObject *args)
-{
-  PyObject *key;
-  int i;
-
-  UNLESS (PyArg_ParseTuple(args, "O", &key)) return NULL;
-  if ( (i=_bucket_set(self, key, Py_None, 1, 1, 0)) < 0) return NULL;
-  return PyInt_FromLong(i);
-}
-
-/* _Set_update and _TreeSet_update are identical except for the
-   function they call to add the element to the set.
-*/
-
-static int
-_Set_update(Bucket *self, PyObject *seq)
-{
-    int n = -1;
-    PyObject *iter, *v;
-    int ind;
-
-    iter = PyObject_GetIter(seq);
-    if (iter == NULL)
-	return -1;
-
-    while (1) {
-	v = PyIter_Next(iter);
-	if (v == NULL) {
-	    if (PyErr_Occurred())
-		goto err;
-	    else
-		break;
-	}
-	ind = _bucket_set(self, v, Py_None, 1, 1, 0);
-	Py_DECREF(v);
-	if (ind < 0)
-	    goto err;
-	else
-	    n += ind;
-    }
-    /* n starts out at -1, which is the error return value.  If
-       this point is reached, then there is no error.  n must be
-       incremented to account for the initial value of -1 instead of
-       0.
-    */
-    n++;
-
- err:
-    Py_DECREF(iter);
-    return n;
-}
-
-static PyObject *
-Set_update(Bucket *self, PyObject *args)
-{
-    PyObject *seq = NULL;
-    int n = 0;
-
-    if (!PyArg_ParseTuple(args, "|O:update", &seq))
-	return NULL;
-
-    if (seq) {
-	n = _Set_update(self, seq);
-	if (n < 0)
-	    return NULL;
-    }
-
-    return PyInt_FromLong(n);
-}
-
-static PyObject *
-Set_remove(Bucket *self, PyObject *args)
-{
-  PyObject *key;
-
-  UNLESS (PyArg_ParseTuple(args, "O", &key)) return NULL;
-  if (_bucket_set(self, key, NULL, 0, 1, 0) < 0) return NULL;
-
-  Py_INCREF(Py_None);
-  return Py_None;
-}
-
-static int
-_set_setstate(Bucket *self, PyObject *args)
-{
-  PyObject *k, *items;
-  Bucket *next=0;
-  int i, l, copied=1;
-  KEY_TYPE *keys;
-
-  UNLESS (PyArg_ParseTuple(args, "O|O", &items, &next))
-    return -1;
-
-  if ((l=PyTuple_Size(items)) < 0) return -1;
-
-  for (i=self->len; --i >= 0; )
-    {
-      DECREF_KEY(self->keys[i]);
-    }
-  self->len=0;
-
-  if (self->next)
-    {
-      Py_DECREF(self->next);
-      self->next=0;
-    }
-
-  if (l > self->size)
-    {
-      UNLESS (keys=BTree_Realloc(self->keys, sizeof(KEY_TYPE)*l)) return -1;
-      self->keys=keys;
-      self->size=l;
-    }
-
-  for (i=0; i<l; i++)
-    {
-      k=PyTuple_GET_ITEM(items, i);
-      COPY_KEY_FROM_ARG(self->keys[i], k, copied);
-      UNLESS (copied) return -1;
-      INCREF_KEY(self->keys[i]);
-    }
-
-  self->len=l;
-
-  if (next)
-    {
-      self->next=next;
-      Py_INCREF(next);
-    }
-
-  return 0;
-}
-
-static PyObject *
-set_setstate(Bucket *self, PyObject *args)
-{
-  int r;
-
-  UNLESS (PyArg_ParseTuple(args, "O", &args)) return NULL;
-
-  PER_PREVENT_DEACTIVATION(self);
-  r=_set_setstate(self, args);
-  PER_UNUSE(self);
-
-  if (r < 0) return NULL;
-  Py_INCREF(Py_None);
-  return Py_None;
-}
-
-static struct PyMethodDef Set_methods[] = {
-  {"__getstate__", (PyCFunction) bucket_getstate,	METH_VARARGS,
-   "__getstate__() -- Return the picklable state of the object"},
-
-  {"__setstate__", (PyCFunction) set_setstate,	METH_VARARGS,
-   "__setstate__() -- Set the state of the object"},
-
-  {"keys",	(PyCFunction) bucket_keys,	METH_KEYWORDS,
-     "keys() -- Return the keys"},
-
-  {"has_key",	(PyCFunction) bucket_has_key,	METH_O,
-     "has_key(key) -- Test whether the bucket contains the given key"},
-
-  {"clear",	(PyCFunction) bucket_clear,	METH_VARARGS,
-   "clear() -- Remove all of the items from the bucket"},
-
-  {"maxKey", (PyCFunction) Bucket_maxKey,	METH_VARARGS,
-   "maxKey([key]) -- Find the maximum key\n\n"
-   "If an argument is given, find the maximum <= the argument"},
-
-  {"minKey", (PyCFunction) Bucket_minKey,	METH_VARARGS,
-   "minKey([key]) -- Find the minimum key\n\n"
-   "If an argument is given, find the minimum >= the argument"},
-
-#ifdef PERSISTENT
-  {"_p_resolveConflict", (PyCFunction) bucket__p_resolveConflict, METH_VARARGS,
-   "_p_resolveConflict() -- Reinitialize from a newly created copy"},
-
-  {"_p_deactivate", (PyCFunction) bucket__p_deactivate, METH_KEYWORDS,
-   "_p_deactivate() -- Reinitialize from a newly created copy"},
-#endif
-
-  {"insert",	(PyCFunction)Set_insert,	METH_VARARGS,
-   "insert(id,[ignored]) -- Add a key to the set"},
-
-  {"update",	(PyCFunction)Set_update,	METH_VARARGS,
-   "update(seq) -- Add the items from the given sequence to the set"},
-
-  {"remove",	(PyCFunction)Set_remove,	METH_VARARGS,
-   "remove(id) -- Remove an id from the set"},
-
-  {NULL,		NULL}		/* sentinel */
-};
-
-static int
-Set_init(PyObject *self, PyObject *args, PyObject *kwds)
-{
-    PyObject *v = NULL;
-
-    if (!PyArg_ParseTuple(args, "|O:" MOD_NAME_PREFIX "Set", &v))
-	return -1;
-
-    if (v)
-	return _Set_update((Bucket *)self, v);
-    else
-	return 0;
-}
-
-
-
-static PyObject *
-set_repr(Bucket *self)
-{
-  static PyObject *format;
-  PyObject *r, *t;
-
-  if (!format)
-      format = PyString_FromString(MOD_NAME_PREFIX "Set(%s)");
-  UNLESS (t = PyTuple_New(1)) return NULL;
-  UNLESS (r = bucket_keys(self, NULL, NULL)) goto err;
-  PyTuple_SET_ITEM(t, 0, r);
-  r = t;
-  ASSIGN(r, PyString_Format(format, r));
-  return r;
-err:
-  Py_DECREF(t);
-  return NULL;
-}
-
-static int
-set_length(Bucket *self)
-{
-  int r;
-
-  PER_USE_OR_RETURN(self, -1);
-  r = self->len;
-  PER_UNUSE(self);
-
-  return r;
-}
-
-static PyObject *
-set_item(Bucket *self, int index)
-{
-  PyObject *r=0;
-
-  PER_USE_OR_RETURN(self, NULL);
-  if (index >= 0 && index < self->len)
-    {
-      COPY_KEY_TO_OBJECT(r, self->keys[index]);
-    }
-  else
-    IndexError(index);
-
-  PER_UNUSE(self);
-
-  return r;
-}
-
-static PySequenceMethods set_as_sequence = {
-	(inquiry)set_length,		/* sq_length */
-	(binaryfunc)0,                  /* sq_concat */
-	(intargfunc)0,                  /* sq_repeat */
-	(intargfunc)set_item,           /* sq_item */
-	(intintargfunc)0,               /* sq_slice */
-	(intobjargproc)0,               /* sq_ass_item */
-	(intintobjargproc)0,            /* sq_ass_slice */
-        (objobjproc)bucket_contains,    /* sq_contains */
-        0,                              /* sq_inplace_concat */
-        0,                              /* sq_inplace_repeat */
-};
-
-static PyTypeObject SetType = {
-    PyObject_HEAD_INIT(NULL) /* PyPersist_Type */
-    0,					/* ob_size */
-    MODULE_NAME MOD_NAME_PREFIX "Set",	/* tp_name */
-    sizeof(Bucket),			/* tp_basicsize */
-    0,					/* tp_itemsize */
-    (destructor)bucket_dealloc,		/* tp_dealloc */
-    0,					/* tp_print */
-    0,					/* tp_getattr */
-    0,					/* tp_setattr */
-    0,					/* tp_compare */
-    (reprfunc)set_repr,			/* tp_repr */
-    0,					/* tp_as_number */
-    &set_as_sequence,			/* tp_as_sequence */
-    0,					/* tp_as_mapping */
-    0,					/* tp_hash */
-    0,					/* tp_call */
-    0,					/* tp_str */
-    0,					/* tp_getattro */
-    0,					/* tp_setattro */
-    0,					/* tp_as_buffer */
-    Py_TPFLAGS_DEFAULT | Py_TPFLAGS_HAVE_GC |
-	    Py_TPFLAGS_BASETYPE, 	/* tp_flags */
-    0,					/* tp_doc */
-    (traverseproc)bucket_traverse,	/* tp_traverse */
-    (inquiry)bucket_tp_clear,		/* tp_clear */
-    0,					/* tp_richcompare */
-    0,					/* tp_weaklistoffset */
-    (getiterfunc)Bucket_getiter,	/* tp_iter */
-    0,					/* tp_iternext */
-    Set_methods,			/* tp_methods */
-    Bucket_members,			/* tp_members */
-    0,					/* tp_getset */
-    0,					/* tp_base */
-    0,					/* tp_dict */
-    0,					/* tp_descr_get */
-    0,					/* tp_descr_set */
-    0,					/* tp_dictoffset */
-    Set_init,				/* tp_init */
-    0,					/* tp_alloc */
-    0, /*PyType_GenericNew,*/		/* tp_new */
-};
-
-static int
-nextSet(SetIteration *i)
-{
-
-  if (i->position >= 0)
-    {
-      UNLESS(PER_USE(BUCKET(i->set))) return -1;
-
-      if (i->position)
-        {
-          DECREF_KEY(i->key);
-        }
-
-      if (i->position < BUCKET(i->set)->len)
-        {
-          COPY_KEY(i->key, BUCKET(i->set)->keys[i->position]);
-          INCREF_KEY(i->key);
-          i->position ++;
-        }
-      else
-        {
-          i->position = -1;
-          PER_ACCESSED(BUCKET(i->set));
-        }
-
-      PER_ALLOW_DEACTIVATION(BUCKET(i->set));
-    }
-
-
-  return 0;
-}

lib/python/BTrees/_IIBTree.c

-/*############################################################################
-#
-# Copyright (c) 2004 Zope Corporation and Contributors.
-# All Rights Reserved.
-#
-# This software is subject to the provisions of the Zope Public License,
-# Version 2.0 (ZPL).  A copy of the ZPL should accompany this distribution.
-# THIS SOFTWARE IS PROVIDED "AS IS" AND ANY AND ALL EXPRESS OR IMPLIED
-# WARRANTIES ARE DISCLAIMED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-# WARRANTIES OF TITLE, MERCHANTABILITY, AGAINST INFRINGEMENT, AND FITNESS
-# FOR A PARTICULAR PURPOSE.
-#
-############################################################################*/
-
-#define MASTER_ID "$Id: _IIBTree.c,v 1.9 2004/05/03 18:45:52 spascoe Exp $\n"
-
-/* IIBTree - int key, int value BTree
-
-   Implements a collection using int type keys
-   and int type values
-*/
-
-/* Setup template macros */
-
-#define PERSISTENT
-
-#define MOD_NAME_PREFIX "II"
-#define INITMODULE init_IIBTree
-#define DEFAULT_MAX_BUCKET_SIZE 120
-#define DEFAULT_MAX_BTREE_SIZE 500
-
-#include "intkeymacros.h"
-#include "intvaluemacros.h"
-#include "BTreeModuleTemplate.c"

lib/python/BTrees/tests/__init__.py

-# If tests is a package, debugging is a bit easier.

lib/python/Persistence/tests/__init__.py

-# package