Liking cljdoc? Tell your friends :D

tick.interval


amclj/s

(am date)

basic-relationclj/s

A function to determine the (basic) relation between two intervals.

A function to determine the (basic) relation between two intervals.
raw docstring

basic-relationsclj/s


boundsclj/s

(bounds & args)

complementclj/s

(complement coll)

complement-rclj/s

(complement-r r)

Return the complement of the general relation. The complement ~r of a relation r is the relation consisting of all basic relations not in r.

Return the complement of the general relation. The complement ~r of
a relation r is the relation consisting of all basic relations not
in r.
raw docstring

compose-rclj/s

(compose-r r s)

Return the composition of r and s

Return the composition of r and s
raw docstring

concurclj/s

(concur x y)

Return the interval representing the interval, if there is one, representing the interval of time the given intervals are concurrent.

Return the interval representing the interval, if there is one,
representing the interval of time the given intervals are
concurrent.
raw docstring

concur?clj/s


concurrenciesclj/s

(concurrencies & intervals)

Return a sequence of occurances where intervals coincide (having non-nil concur intervals).

Return a sequence of occurances where intervals coincide (having
non-nil concur intervals).
raw docstring

conjclj/s

(conj coll interval)

contains?clj/s

(contains? x y)

convclj/s

(conv f)

The converse of a basic relation.

The converse of a basic relation.
raw docstring

converse-rclj/s

(converse-r r)

Return the converse of the given general relation. The converse !r of a relation r is the relation consisting of the converses of all basic relations in r.

Return the converse of the given general relation. The converse !r
of a relation r is the relation consisting of the converses of all
basic relations in r.
raw docstring

differenceclj/s

(difference s1)
(difference s1 s2)
(difference s1 s2 & sets)

Return an interval set that is the first set without elements of the remaining sets.

Return an interval set that is the first set without elements of
the remaining sets.
raw docstring

disjoinclj/s

(disjoin s1)
(disjoin s1 s2)
(disjoin s1 s2 & sets)

Split s1 across the grating defined by s2

Split s1 across the grating defined by s2
raw docstring

disjoint?clj/s


divide-by-divisorclj/s

(divide-by-divisor ival divisor)

divide-by-durationclj/s

(divide-by-duration ival dur)

Divide an interval by a duration, returning a sequence of intervals. If the interval cannot be wholly sub-divided by the duration divisor, the last interval will represent the 'remainder' of the division and not be as long as the other preceeding intervals.

Divide an interval by a duration, returning a sequence of
intervals. If the interval cannot be wholly sub-divided by the
duration divisor, the last interval will represent the 'remainder'
of the division and not be as long as the other preceeding
intervals.
raw docstring

divide-by-periodclj/s

(divide-by-period ival period)

during?clj/s

(during? x y)

equals?clj/s

(equals? x y)

extendclj/s

(extend ival dur)

finished-by?clj/s

(finished-by? x y)

finishes?clj/s

(finishes? x y)

flattenclj/s

(flatten s)

GeneralRelationcljs


group-by-intervalsclj/s

(group-by-intervals intervals-to-group-by ivals)

Divide intervals in s1 by (disjoint ordered) intervals in s2, splitting if necessary, grouping by s2. Complexity is O(n) rather than O(n^2)

Divide intervals in s1 by (disjoint ordered) intervals in s2,
splitting if necessary, grouping by s2. Complexity is O(n) rather
than O(n^2)
raw docstring

IDivisibleIntervalclj/s≠protocol

divide-intervalclj/s

(divide-interval divisor ival)

Divide an interval by a given divisor

Divide an interval by a given divisor

IGroupableclj/s≠protocol

group-byclj/s

(group-by grouping ivals)

IIntervalOpsclj/s≠protocol

spliceclj/s

(splice this ival)

Splice another interval on to this one

Splice another interval on to this one

splitclj/s

(split this t)

Split ival into 2 intervals at t, returned as a 2-element vector

Split ival into 2 intervals at t, returned as a 2-element vector

sliceclj/s

(slice this beginning end)

Fit the interval between beginning and end, slicing off one or both ends as necessary

Fit the interval between beginning and end, slicing off one or both ends as necessary

intersectionclj/s

(intersection s1)
(intersection s1 s2)
(intersection s1 s2 & sets)

Return a time-ordered sequence of disjoint intervals where two or more intervals of the given sequences are concurrent. Arguments must be time-ordered sequences of disjoint intervals.

Return a time-ordered sequence of disjoint intervals where two or
more intervals of the given sequences are concurrent. Arguments must
be time-ordered sequences of disjoint intervals.
raw docstring

intersection-rclj/s

(intersection-r r s)

Return the intersection of the r with s

Return the intersection of the r with s
raw docstring

intersects?clj/s

(intersects? ivals interval)

intervalclj/s

(interval t)

ITimeSpanableclj/s≠protocol

temporal-valueclj/s

(temporal-value _)

Return a value of a type that satisfies t/ITimeSpan

Return a value of a type that satisfies t/ITimeSpan

meets?clj/s

(meets? x y)

met-by?clj/s

(met-by? x y)

new-intervalclj/s

(new-interval v1 v2)

new-interval-groupclj/s

(new-interval-group x)

Return an interval group. Interval groups are maps with a :tick/intervals entry that contain a time-ordered sequence of disjoint intervals.

Return an interval group. Interval groups are maps with
a :tick/intervals entry that contain a time-ordered sequence of
disjoint intervals.
raw docstring

new-relationclj/s

(new-relation & basic-relations)

normalizeclj/s

(normalize intervals)

Within a time-ordered sequence of disjoint intervals, return a sequence of interval groups, splicing together meeting intervals.

Within a time-ordered sequence of disjoint intervals, return a
sequence of interval groups, splicing together meeting intervals.
raw docstring

not-yet-implementedclj/s

(not-yet-implemented)

ordered-disjoint-intervals?clj/s

(ordered-disjoint-intervals? s)

Are all the intervals in the given set time-ordered and disjoint? This is a useful property of a collection of intervals. The given collection must contain proper intervals (that is, intervals that have finite greater-than-zero durations).

Are all the intervals in the given set time-ordered and
disjoint? This is a useful property of a collection of
intervals. The given collection must contain proper intervals (that
is, intervals that have finite greater-than-zero durations).
raw docstring

overlapped-by?clj/s

(overlapped-by? x y)

overlaps?clj/s

(overlaps? x y)

pmclj/s

(pm date)

preceded-by?clj/s

(preceded-by? x y)

precedes-or-meets?clj/s


precedes?clj/s

(precedes? x y)

relationclj/s

(relation x y)

relation->kwclj/s


scaleclj/s

(scale ival factor)

slice-intervalclj/s

(slice-interval ival beginning end)

split-intervalclj/s

(split-interval ival t)

split-with-assertclj/s

(split-with-assert ival t)

started-by?clj/s

(started-by? x y)

starts?clj/s

(starts? x y)

temporal-amount?clj/s

(temporal-amount? o)

temporal?clj/s

(temporal? o)

unionclj/s

(union & colls)

Merge multiple time-ordered sequences of disjoint intervals into a single sequence of time-ordered disjoint intervals.

Merge multiple time-ordered sequences of disjoint intervals into a
single sequence of time-ordered disjoint intervals.
raw docstring

uniteclj/s

(unite intervals)

Unite concurrent intervals. Intervals must be ordered by beginning but not necessarily disjoint (the purpose of this function is to splice together intervals that are concurrent resulting in a time-ordered sequence of disjoint intervals that is returned.

Unite concurrent intervals. Intervals must be ordered by beginning
but not necessarily disjoint (the purpose of this function is to
splice together intervals that are concurrent resulting in a
time-ordered sequence of disjoint intervals that is returned.
raw docstring

cljdoc is a website building & hosting documentation for Clojure/Script libraries

× close