bps 2.4

The B-tree with a twist pointer set approaches the speed of the fastest, hash
table based sets, while using a lot less memory and still maintaining
an order.

The set introduces a new B-tree variety with superior search and
edit qualities.

C Usage Example:

    /* the pointer set */
    void *pset;

    /* initialize - extra argument may indicate a memory allocator */
    /* should check return value for operation success */
    x1f4_init_bpfset(&pset, 0, NULL);

    /* register some pointer with the pointer set */
    if (x1f4_post_bppset(pset, pointer)) {
    /* operation failed */
    /*
     * if return value was X1f4_BPFSET_EVER_MATCH pointer is already
     * recorded with the pointer set (this set does not allow for
     * duplicates)
     *
     */
    }

    /* check that pointer is registered with the pointer set */
    if (x1f4_find_bppset(pset, pointer)) {
    /* yes, she is */
    } else {
    /* she is not */
    }

    /* remove pointer from the set */
    if (x1f4_cast_bppset(pset, pointer)) {
    /* operation failed */
    /*
     * if return value was X1f4_BPFSET_MISS_CLASS pointer is missing from
     * set
     *
     */
    }

    /* finalize */
    x1f4_fini_bpfset(&pset);


Product's homepage

What's New in This Release: [ read full changelog ]

· This version adds two delete methods, one deleting the first element and the other the last element.