package acgtk
Abstract Categorial Grammar development toolkit
Install
Dune Dependency
Authors
Maintainers
Sources
acg-2.1.0-20240219.tar.gz
sha512=5d380a947658fb1201895cb4cb449b1f60f54914c563e85181d628a89f045c1dd7b5b2226bb7865dd090f87caa9187e0ea6c7a4ee3dc3dda340d404c4e76c7c2
doc/acgtk.datalogLib/DatalogLib/PersistentArray/index.html
Module DatalogLib.PersistentArray
Source
This module implements a persistent array data structure as described in "A Persistent Union-Find Data Structure" (Sylvain Concohn and Jean-Chrisophe Filliâtre.
It is meant for managing quick access while keeping peristency in backtracking algorithms such as in unification algorithms using union find algorithms.
In particular, when a persistent array a_0
has been modified several times, yielding arrays a_1
, a_2
, ... , a_N
, when a_i
is accessed using the get
or set
functions (with 0 <= i < N
) than all a_j
with i < j <= N
become unaccessible, hence a Unacessible
exception is raised.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>