helins.htm.sdr — io.helins/htm 0.0.0-alpha0

Create and act on Sparse Distributed Representations.

Cf. helins.htm.sdr.props

active-bits clj

(active-bits sdr)

Lazily computes a sorted list containing indices of active bits from this SDR.

cardinality clj

(cardinality sdr)

What is the number of active bits in this SDR ?

deserialize-immutable-SDR clj

(deserialize-immutable-SDR ba)

Deserialize an immutable SDR.

immutable-SDR clj

(immutable-SDR)

(immutable-SDR options)

Creates a new immutable SDR.

A map of options may be given :

::capacity The length of the binary vector.

immutable-SDR-from clj

(immutable-SDR-from sq)

Creates a new immutable SDR from a sequence.

ISDR clj protocol

Basic functions for implementing a SDR.

active-bit? clj

(active-bit? sdr i)

Is the iiest bit active in this SDR ?

capacity clj

(capacity sdr)

How many bits is this SDR composed of ?

clear clj

(clear sdr)

Turns off all bits in this SDR.

serialize clj

(serialize sdr)

Transforms this SDR into a byte array.

set-bit clj

(set-bit sdr i active?)

Sets the ith bit in this SDR.

set-bit-range clj

(set-bit-range sdr i j active?)

Sets bits from i to j (both inclusive) in this SDR.

set-bits clj

(set-bits sdr i->active?)

Efficiently sets the required bits in this SDR following a map of index -> boolean.

match-exactly? clj

(match-exactly? sdr-1 sdr-2)

Do those two SDRs match exactly ?

match-inexactly? clj

(match-inexactly? overlap-score sdr-1 sdr-2)

Do those two SDRs have at least overlap-score active bits in common ?

overlap-score clj

(overlap-score sdr-1 sdr-2)

Computes the number of bits active in both SDRs.

overlapping-bits clj

(overlapping-bits sdr-1 sdr-2)

Lazy computes a sorted list of bits active in both SDRs.

sparsity clj

(sparsity sdr)

What is the percentage of active bits in this SDR ?

union clj

(union & sdrs)

Lazily computes a sequence representing the union of all the given SDRs.

Cf. [1] Section G