Liking cljdoc? Tell your friends :D

tick.interval


amclj/s

(am date)
source

basic-relationclj/s

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

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

basic-relationsclj/s

source

boundsclj/s

(bounds & args)
source

complementclj/s

(complement coll)
source

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.
sourceraw docstring

compose-rclj/s

(compose-r r s)

Return the composition of r and s

Return the composition of r and s
sourceraw 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.
sourceraw docstring

concur?clj/s

source

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).
sourceraw docstring

conjclj/s

(conj coll interval)
source

contains?clj/s

(contains? x y)
source

convclj/s

(conv f)

The converse of a basic relation.

The converse of a basic relation.
sourceraw 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.
sourceraw 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.
sourceraw 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
sourceraw docstring

disjoint?clj/s

source

divide-by-divisorclj/s

(divide-by-divisor ival divisor)
source

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.
sourceraw docstring

divide-by-periodclj/s

(divide-by-period ival period)
source

during?clj/s

(during? x y)
source

equals?clj/s

(equals? x y)
source

extendclj/s

(extend ival dur)
source

finished-by?clj/s

(finished-by? x y)
source

finishes?clj/s

(finishes? x y)
source

flattenclj/s

(flatten s)
source

GeneralRelationcljs

source

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)
sourceraw 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
source

IGroupableclj/s≠protocol

group-byclj/s

(group-by grouping ivals)
source

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
source

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.
sourceraw docstring

intersection-rclj/s

(intersection-r r s)

Return the intersection of the r with s

Return the intersection of the r with s
sourceraw docstring

intersects?clj/s

(intersects? ivals interval)
source

intervalclj/s

(interval t)
source

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
source

meets?clj/s

(meets? x y)
source

met-by?clj/s

(met-by? x y)
source

new-intervalclj/s

(new-interval v1 v2)
source

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.
sourceraw docstring

new-relationclj/s

(new-relation & basic-relations)
source

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.
sourceraw docstring

not-yet-implementedclj/s

(not-yet-implemented)
source

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).
sourceraw docstring

overlapped-by?clj/s

(overlapped-by? x y)
source

overlaps?clj/s

(overlaps? x y)
source

pmclj/s

(pm date)
source

preceded-by?clj/s

(preceded-by? x y)
source

precedes-or-meets?clj/s

source

precedes?clj/s

(precedes? x y)
source

relationclj/s

(relation x y)
source

relation->kwclj/s

source

scaleclj/s

(scale ival factor)
source

slice-intervalclj/s

(slice-interval ival beginning end)
source

split-intervalclj/s

(split-interval ival t)
source

split-with-assertclj/s

(split-with-assert ival t)
source

started-by?clj/s

(started-by? x y)
source

starts?clj/s

(starts? x y)
source

temporal-amount?clj/s

(temporal-amount? o)
source

temporal?clj/s

(temporal? o)
source

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.
sourceraw 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.
sourceraw docstring

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

× close