Quickdocs

Search Results

for data structure

33 projects are found.

• fare-utils 2017-01-24

  Basic functions and macros, interfaces, pure and stateful datastructures

  download 3000
• access 2015-12-18

  A library providing functions that unify data-structure access for Common Lisp: access and (setf access)

  download 2162
• array-operations 2019-07-10

  Provides commonly used operations on arrays.Operations provided include elementwise +, -, * and /, the same operations involving an array and a scalar, minimum, maximum and range (the last one is faster then the two of them called separately), and also general functions to implement other, similar functions, including array-reduce, array-map, etc.It also has a macro for `vectorizing' operations:(let ((a #(1d0 2d0 3d0)) (b #(4d0 5d0 6d0)) (c 0.25d0)) (vectorize (a b) (+ a b c 0.25))) ; => #(5.5d0 7.5d0 9.5d0) Formerly, many functions in this package were part of FFA, but were split to eliminate the dependency on CFFI. With the fix in SBCL, we no longer need to make a special effort to make arrays "foreign friendly".Homepage: GitHub (original), GitHub (an actively maintained fork)License: MIT (as stated in asdf:defsystem; the license text in LICENSE file is boilerplate from another project)As of 2018-03-10, Quicklisp offers original version, not the fork. This might change in the coming months. See article Multidimensional arrays in The Common Lisp Cookbook for some differences between the fork and the original. data structure

• binomial-heap 2013-04-20

  A compact binomial heap implementation.

• bk-tree 2013-04-20

  This page is moved to https://github.com/vy/bk-tree.Keywords: data structure

• cacle 2019-05-21

  Extensible cache services for Common Lisp

• cl-cache-tables 2017-10-19

  A wrapper around native hash-tables to facilitate in-process caching of common lisp data structures.

• cl-custom-hash-table 2017-11-30

  cl-custom-hash-table extends the hash table data structure by allowing the use of arbitrary TEST/HASH functions, in addition to the TEST functions allowed by the standard (EQ, EQL, EQUAL and EQUALP).It is different from genhash in that genhash is a complete hash table implementation with its own api. CL-CUSTOM-HASH-TABLE is primarily a compatibility layer that uses the standard hash table API, and has a simple fall-back solution built on top of standard hash tables.Homepage: https://github.com/metawilm/cl-custom-hash-tableLicense: BSD-style

• cl-heap 2013-03-12

  An implementation of heap and priority queue data structures.

• cl-string-match 2019-03-07

  Substring search and string matching, exact and inexact and other algorithms on strings and sequences. This is a mirror of the repository on SourceForge.

• colliflower 2015-12-18

  Generic interfaces for collections and iterators.

• data-table 2016-02-08

  A library providing a data-table class, and useful functionality around this

• dlist 2012-11-25

  An implementation of the doubly-linked list in Common Lisp.

• flexichain 2010-10-06

  Flexichain is an API for editable sequences. Its primary use is in end-user applications that edit sequences of objects such as text editors (characters), word processors (characters, paragraphs, sections, etc), score editors (notes, clusters, measures, etc), though it can also be used as a stack and a double-ended queue. Project page Topics: data structure

• fset 2017-10-19

  A functional set-theoretic collections library. See: http://www.ergy.com/FSet.html

• genhash 2018-12-10

  Generic hashtable code

• hh-redblack 2015-10-31

  hh-redblack provides in-memory and disk-based red-black trees.Homepage: http://haphazardhouse.net/projects/hh-redblackSource: https://github.com/hargettp/hh-redblackLicense: MIT Topics: data structure StructuredStorage

• jpl-queues 2010-10-06

  A few different kinds of queues, with optional multithreading synchronization.

• lisp-interface-library 2018-04-30

  Long name alias for lil

• minheap 2016-06-28

  Various heap/priority queue data structures

• pipes 2015-09-23

  pipes implements the input stream (lazy list) data structure. It is based on ideas from Peter Norvig's Paradigms of Artificial Intelligence Programming.``Pipes'' is an implementation of a concept that goes by many names: streams or functional streams SICP, generated lists or glists, and lazy lists.

• series 2013-11-11

  See <http://series.sourceforge.net/>.

• spatial-trees 2014-08-26

  spatial-trees is a set of dynamic index data structures for spatially-extended data. The flavors provided are, as of the 0.1 release (on 2004-12-03): R-trees, as in R-TREES: A DYNAMIC INDEX STRUCTURE FOR SPATIAL SEARCHING, Antonin Guttman, Proc. ACM SIGMOD Int. Conf. on Management of Data, 1984. Greene-trees, as in An Implementation and Performance Analysis of Spatial Data Access Methods, Diane Greene, Proc. 5th IEEE Int. Conf. on Data Engineering, 1989. R*-trees, as in The R*-tree: An Efficient and Robust Access Method for Points and Rectangles, Beckmann, Kriegel, Schneider and Seeger, Proc. ACM Int. Conf. on Management of Data, 1990 X-trees, as in The X-tree: An Index Structure for High-Dimensional Data, Berchtold, Keim and Kriegel, Proc. 22th Int. Conf. on Very Large Databases, 1996 Future work planned includes performance enhancements, incorporation of more index structures, and some work on supporting more optimal indexing when the entire set of data is known at index creation time; for more details, see the TODO file in the binary distribution.The code is licensed BSD-style, and is intended to be similar in spirit to Nathan Froyd's TREES Library. You can get this via Quicklisp.As per #lisp discussion, the new official source for this is the github repository, which is a conversion of the darcs repository.

• symbol-namespaces 2013-01-28

  Defines a new kind of package that's named by a symbol rather than a string and that maps from existing symbols to their respective "implicitly managed" counterparts. The motivating use-case is to conceptually allow multiple definitions of the same kind on a single symbol, without conflicts.

• trees 2018-01-31

  A library for binary trees in normal and balanced flavors

• x.fdatatypes 2015-07-09

  functional data collections

• cxml-stp 2019-05-21

  An alternative to DOM inspired by XOM Info Project name: cxml-stpAuthor: David LichteblauLicense: X11-styleHomepage: lichteblau.com/cxml-stpDownload (tarball): Yes, see belowDownload (git clone): http://www.lichteblau.com/git/cxml-stp.git (gitweb)This project is asdf-installable (release tarball) and available in clbuild (git version). Project An alternative to DOM. Feature overviewcxml-stp is an add-on package for cxml. Implements STP, an alternative to W3C DOM. STP is a data structure for well-formed XML documents Inspired heavily by Java's XOM, but designed for Common Lisp. Documentation STP tutorial API documentation

  download 3136
• check-it 2015-07-09

  A randomized property-based testing tool for Common Lisp.

• cl-marshal 2018-03-28

  marshal: Simple (de)serialization of Lisp datastructures.

• cl-proj 2019-03-07

  CL-PROJ Common Lisp bindings for the Proj4 geographic projections library.

• map-set 2019-03-07

  Set-like data structure.

• stmx 2018-10-18

  STMX is an actively maintained, high-performance concurrency library providing Transactional Memory for Common Lisp.Home page and downloads: http://github.com/cosmos72/stmx Main features Extremely intuitive to use and to write correct, thread-safe concurrent code Brings database-style transactions to Common Lisp by introducing transactional memory High performance implementation, benchmarked to exceed 7 millions transactions per CPU core per second on commodity PC hardware Support for hardware memory transactions (requires 64-bit SBCL and CPUs with Intel TSX instructions - currently Core i5 4570, Core i7 4670, Core i7 4770 and some others). They increase STMX performance up to almost 40 millions transactions per CPU core per second Removes the need for traditional locks, mutexes and conditions - writing correct concurrent code with them is well known to be hard Transactional code is intrinsically deadlock-free: if two transactions conflict one of them will be re-executed Automatic commit and rollback: if a transaction completes normally it will be committed, if it signals an error it will be rolled back Transactions are composable: they can be executed in a larger transaction, either in sequence (all-or-nothing) or as alternatives (try them until one succeeds) Offers freedom of choice between blocking and non-blocking transactional functions: given either behaviour, it is trivial to transform it into the other. Features transactional versions of popular data structures: hash tables, red-black trees, stack, fifo Includes transactional data structure for multicast publish/subscribe Creating new transactional data structures is easy Extensive test suite Tested on SBCL, ABCL, CCL, CMUCL and ECL. Very simple to install with Quicklisp A quick-start guide and installation instructions are provided in README.md fileLicense: LLGPL What STMX is NOT In order not to confuse programmers - less experienced ones in particular - and to avoid rising unrealistic hopes, the author himself stated the following about STMX: it is NOT a quick hack to automagically transform existing, slow, single-threaded programs into fast, concurrent ones. No matter how much transactions can help, writing concurrent code still requires careful design and implementation - and testing. And refactoring takes time too. it is NOT for optimization-focused programmers trying to squeeze the last cycle from their Common Lisp programs. STMX records an in-memory transaction log containing all reads and writes from/to transactional memory, then later (during commit) validates the transaction log against the latest data present in transactional memory and finally copies the transaction log onto the transactional memory while holding locks. STMX is quite optimized, but this machinery comes at an obvious performance cost with respect to hand-made, highly optimized locking code (but a good reality check is to ask yourself how many people have the skill and patience to write such code without bugs). it is NOT supposed to be used for all data structures in a Common Lisp program. STMX is intended only for the data accessed concurrently by multiple threads while being modified by at least one thread. And even in that case, transactional memory is not always needed: it depends on the kinds of modifications. it is NOT a serialization or persistence framework. Rather, messing with metaclasses and playing (allowed) tricks with slots contents as STMX does, quite likely does not mix well with serialization or persistence libraries such as CL-STORE, because they typically need full control on the slots of the objects to be serialized and de-serialized. it is NOT a million dollar library from some deep-pocket company. At the moment, it is the work of a single person.

• xml-emitter 2019-11-30

  xml-emitter simply emits XML, with some complexity for handling indentation. It can be used to produce all sorts of useful XML output; it has an RSS 2.0 emitter built in.