Liking cljdoc? Tell your friends :D

sicmutils.calculus.form-field


components->oneform-fieldclj/s

(components->oneform-field components coordinate-system & [name])

coordinate-basis-oneform-fieldclj/s

(coordinate-basis-oneform-field coordinate-system name & i)

coordinate-basis-oneform-field-procedureclj/s

(coordinate-basis-oneform-field-procedure coordinate-system & i)

coordinate-basis-oneform-fieldsclj/s

(coordinate-basis-oneform-fields coordinate-system)

coordinate-name->ff-nameclj/s

(coordinate-name->ff-name n)

From the name of a coordinate, produce the name of the coordinate basis one-form field (as a symbol)

From the name of a coordinate, produce the name of the coordinate basis
one-form field (as a symbol)
raw docstring

dclj/s


exterior-derivative-procedureclj/s

(exterior-derivative-procedure kform)

form-field?clj/s

(form-field? f)

function->oneform-fieldclj/s

(function->oneform-field f)

get-rankclj/s

(get-rank f)

literal-oneform-fieldclj/s

(literal-oneform-field name coordinate-system)

oneform-field->componentsclj/s

(oneform-field->components form coordinate-system)

oneform-field-procedureclj/s

(oneform-field-procedure components coordinate-system)

oneform-field?clj/s

(oneform-field? f)

permutation-sequenceclj/s

(permutation-sequence as)

This is an unusual way to go about this in a functional language, but it's fun. Produces an iterable sequence developing the permutations of the input sequence of objects (which are considered distinct) in church-bell-changes order, that is, each permutation differs from the previous by a transposition of adjacent elements (Algorithm P from §7.2.1.2 of Knuth). This has the side-effect of arranging for the parity of the generated permutations to alternate; the first permutation yielded is the identity permutation (which of course is even). Inside, there is a great deal of mutable state, but this cannot be observed by the user.

This is an unusual way to go about this in a functional language,
but it's fun. Produces an iterable sequence developing the
permutations of the input sequence of objects (which are considered
distinct) in church-bell-changes order, that is, each permutation
differs from the previous by a transposition of adjacent
elements (Algorithm P from §7.2.1.2 of Knuth). This has the
side-effect of arranging for the parity of the generated
permutations to alternate; the first permutation yielded is the
identity permutation (which of course is even). Inside, there is a
great deal of mutable state, but this cannot be observed by the
user.
raw docstring

procedure->nform-fieldclj/s

(procedure->nform-field proc n name)

procedure->oneform-fieldclj/s

(procedure->oneform-field fp name)

wedgeclj/s

(wedge & fs)

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

× close