plone

zope.app.zptpage-3.5.1-2.lbn25.noarch
zope.app.zptpage
Located in LBN / … / Plone and Zope / BastionLinux 25
zope.app.zptpage-3.5.1-2.lbn25.noarch
zope.app.zptpage
Located in LBN / … / Plone and Zope / BastionLinux 19
zope.applicationcontrol-3.5.5-2.lbn13.noarch
Zope applicationcontrol
Located in LBN / … / Plone and Zope / BastionLinux 13
zope.applicationcontrol-3.5.5-2.lbn25.noarch
Zope applicationcontrol
Located in LBN / … / Plone and Zope / BastionLinux 25
zope.applicationcontrol-3.5.5-2.lbn25.noarch
Zope applicationcontrol
Located in LBN / … / Plone and Zope / BastionLinux 19
zope.authentication-3.7.1-2.lbn13.noarch
Definition of authentication basics for the Zope Framework
Located in LBN / … / Plone and Zope / BastionLinux 13
zope.authentication-3.7.1-2.lbn25.noarch
Definition of authentication basics for the Zope Framework
Located in LBN / … / Plone and Zope / BastionLinux 25
zope.authentication-3.7.1-2.lbn25.noarch
Definition of authentication basics for the Zope Framework
Located in LBN / … / Plone and Zope / BastionLinux 19
zope.bforest-1.2-2.lbn13.noarch
BForests are dictionary-like objects that use multiple BTrees for a backend and support rotation of the composite trees. This supports various implementations of timed member expirations, enabling caches and semi-persistent storage. A useful and simple subclass would be to promote a key-value pair to the first (newest) bucket whenever the key is accessed, for instance. It also is useful with disabling the rotation capability. Like btrees, bforests come in four flavors: Integer-Integer (IIBForest), Integer-Object (IOBForest), Object-Integer (OIBForest), and Object-Object (OOBForest). The examples here will deal with them in the abstract: we will create classes from the imaginary and representative BForest class, and generate keys from KeyGenerator and values from ValueGenerator. From the examples you should be able to extrapolate usage of all four types.
Located in LBN / … / Plone and Zope / BastionLinux 13
zope.bforest-1.2-2.lbn19.noarch
BForests are dictionary-like objects that use multiple BTrees for a backend and support rotation of the composite trees. This supports various implementations of timed member expirations, enabling caches and semi-persistent storage. A useful and simple subclass would be to promote a key-value pair to the first (newest) bucket whenever the key is accessed, for instance. It also is useful with disabling the rotation capability. Like btrees, bforests come in four flavors: Integer-Integer (IIBForest), Integer-Object (IOBForest), Object-Integer (OIBForest), and Object-Object (OOBForest). The examples here will deal with them in the abstract: we will create classes from the imaginary and representative BForest class, and generate keys from KeyGenerator and values from ValueGenerator. From the examples you should be able to extrapolate usage of all four types.
Located in LBN / … / Plone and Zope / BastionLinux 19

« Previous 10 items Next 10 items » 1 ... 4810 4811 4812 4813 4814 4815 4816 ... 4845

Sections

Search results


	Copyright © 2000-2025 Corporation of Balclutha Inc. All rights reserved.