package acgtk
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
Abstract Categorial Grammar development toolkit
Install
dune-project
Dependency
Authors
Maintainers
Sources
acgtk-1.5.3.tar.gz
sha256=2743321ae4cc97400856eb503a876cbcbd08435ebc750276399a97481d001d41
md5=04c1e14f98e2c8fd966ef7ef30b38323
doc/acgtkLib.datalogLib/DatalogLib/PersistentArray/index.html
Module DatalogLib.PersistentArraySource
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)"
>