JuliaComplexF32Vector¶
jarray32.spad line 510 [edit on github]
This domain provides a fast JuliaComplexF32
vector type with no bound checking on elt's
. Minimum index is 1.
- #: % -> NonNegativeInteger
from Aggregate
- *: (%, JuliaComplexF32) -> %
- *: (Integer, %) -> %
- *: (JuliaComplexF32, %) -> %
- +: (%, %) -> %
- <=: (%, %) -> Boolean if JuliaComplexF32 has OrderedSet
from PartialOrder
- <: (%, %) -> Boolean if JuliaComplexF32 has OrderedSet
from PartialOrder
- >=: (%, %) -> Boolean if JuliaComplexF32 has OrderedSet
from PartialOrder
- >: (%, %) -> Boolean if JuliaComplexF32 has OrderedSet
from PartialOrder
- any?: (JuliaComplexF32 -> Boolean, %) -> Boolean
- coerce: % -> OutputForm
from CoercibleTo OutputForm
- concat: (%, %) -> %
- concat: (%, JuliaComplexF32) -> %
- concat: (JuliaComplexF32, %) -> %
- concat: List % -> %
- construct: List JuliaComplexF32 -> %
- convert: % -> InputForm
from ConvertibleTo InputForm
- copy!: (%, %) -> %
copy!(b,a)
copies efficiently a tob
. No check are done on arrays dimension.
- count: (JuliaComplexF32 -> Boolean, %) -> NonNegativeInteger
- count: (JuliaComplexF32, %) -> NonNegativeInteger
- cross: (%, %) -> %
- delete: (%, Integer) -> %
- delete: (%, UniversalSegment Integer) -> %
- dot: (%, %) -> JuliaComplexF32
- elt: (%, Integer) -> JuliaComplexF32
from Eltable(Integer, JuliaComplexF32)
- elt: (%, Integer, JuliaComplexF32) -> JuliaComplexF32
- elt: (%, UniversalSegment Integer) -> %
from Eltable(UniversalSegment Integer, %)
- entries: % -> List JuliaComplexF32
- entry?: (JuliaComplexF32, %) -> Boolean
- eval: (%, Equation JuliaComplexF32) -> % if JuliaComplexF32 has Evalable JuliaComplexF32
from Evalable JuliaComplexF32
- eval: (%, JuliaComplexF32, JuliaComplexF32) -> % if JuliaComplexF32 has Evalable JuliaComplexF32
- eval: (%, List Equation JuliaComplexF32) -> % if JuliaComplexF32 has Evalable JuliaComplexF32
from Evalable JuliaComplexF32
- eval: (%, List JuliaComplexF32, List JuliaComplexF32) -> % if JuliaComplexF32 has Evalable JuliaComplexF32
- every?: (JuliaComplexF32 -> Boolean, %) -> Boolean
- fill!: (%, JuliaComplexF32) -> %
- find: (JuliaComplexF32 -> Boolean, %) -> Union(JuliaComplexF32, failed)
- first: % -> JuliaComplexF32
- first: (%, NonNegativeInteger) -> %
- hash: % -> SingleInteger if JuliaComplexF32 has Hashable
from Hashable
- hashUpdate!: (HashState, %) -> HashState if JuliaComplexF32 has Hashable
from Hashable
- imag: % -> JuliaFloat32Vector
imag(v)
returns aJuliaFloat32
vector with the imaginary part of thev
elements.
- insert: (%, %, Integer) -> %
- insert: (JuliaComplexF32, %, Integer) -> %
- jlApply: (String, %) -> JuliaFloat32
jlApply(func, x)
applyfunc
to argumentx
.
- jlApply: (String, %, JuliaFloat32) -> JuliaFloat32
jlApply(func, x, val)
applyfunc
to argumentsx
and val.
- jlApprox?: (%, %) -> Boolean
jlApprox?(x,y)
computes inexact equality comparison with default parameters.Two numbers compare equal if their relative distance or their absolute distance is within tolerance bounds. Applied component-wise.
- jlDisplay: % -> Void
jldisplay(
v
) pretty printsv
(à
la Julia).
- juliaCVPrint: Boolean -> Boolean
juliaCVPrint(b)
defines whether or not FriCAS uses the printing version of Julia for matrices instead of its OutputForm version. Returns previous value. By default it is the Julia version.
- latex: % -> String
from SetCategory
- leftTrim: (%, JuliaComplexF32) -> %
- length: % -> JuliaComplexF32
- less?: (%, NonNegativeInteger) -> Boolean
from Aggregate
- map!: (JuliaComplexF32 -> JuliaComplexF32, %) -> %
- map: ((JuliaComplexF32, JuliaComplexF32) -> JuliaComplexF32, %, %) -> %
- map: (JuliaComplexF32 -> JuliaComplexF32, %) -> %
- max: % -> JuliaComplexF32 if JuliaComplexF32 has OrderedSet
- max: (%, %) -> % if JuliaComplexF32 has OrderedSet
from OrderedSet
- max: ((JuliaComplexF32, JuliaComplexF32) -> Boolean, %) -> JuliaComplexF32
- member?: (JuliaComplexF32, %) -> Boolean
- merge: (%, %) -> % if JuliaComplexF32 has OrderedSet
- merge: ((JuliaComplexF32, JuliaComplexF32) -> Boolean, %, %) -> %
- min: % -> JuliaComplexF32 if JuliaComplexF32 has OrderedSet
- min: (%, %) -> % if JuliaComplexF32 has OrderedSet
from OrderedSet
- more?: (%, NonNegativeInteger) -> Boolean
from Aggregate
- new: (NonNegativeInteger, JuliaComplexF32) -> %
- nrand: NonNegativeInteger -> %
nrand(n)
returns a normally distributed Julia vector of sizen
. See Julia documentation (randn) for this complex version used here.
- outerProduct: (%, %) -> Matrix JuliaComplexF32
- position: (JuliaComplexF32 -> Boolean, %) -> Integer
- position: (JuliaComplexF32, %) -> Integer
- position: (JuliaComplexF32, %, Integer) -> Integer
- qelt: (%, Integer) -> JuliaComplexF32
- qnew: NonNegativeInteger -> %
qnew(n)
creates a new uninitialized vector of lengthn
.
- qsetelt!: (%, Integer, JuliaComplexF32) -> JuliaComplexF32
- real: % -> JuliaFloat32Vector
real(v)
returns aJuliaFloat32
vector with the real part of thev
elements.
- reduce: ((JuliaComplexF32, JuliaComplexF32) -> JuliaComplexF32, %) -> JuliaComplexF32
- reduce: ((JuliaComplexF32, JuliaComplexF32) -> JuliaComplexF32, %, JuliaComplexF32) -> JuliaComplexF32
- reduce: ((JuliaComplexF32, JuliaComplexF32) -> JuliaComplexF32, %, JuliaComplexF32, JuliaComplexF32) -> JuliaComplexF32
- remove: (JuliaComplexF32 -> Boolean, %) -> %
- remove: (JuliaComplexF32, %) -> %
- removeDuplicates: % -> %
- reverse!: % -> %
- reverse: % -> %
- rightTrim: (%, JuliaComplexF32) -> %
- select: (JuliaComplexF32 -> Boolean, %) -> %
- setelt!: (%, Integer, JuliaComplexF32) -> JuliaComplexF32
- setelt!: (%, UniversalSegment Integer, JuliaComplexF32) -> JuliaComplexF32
- size?: (%, NonNegativeInteger) -> Boolean
from Aggregate
- smaller?: (%, %) -> Boolean
from Comparable
- sort!: % -> % if JuliaComplexF32 has OrderedSet
- sort!: ((JuliaComplexF32, JuliaComplexF32) -> Boolean, %) -> %
- sort: % -> % if JuliaComplexF32 has OrderedSet
- sort: ((JuliaComplexF32, JuliaComplexF32) -> Boolean, %) -> %
- sorted?: % -> Boolean if JuliaComplexF32 has OrderedSet
- sorted?: ((JuliaComplexF32, JuliaComplexF32) -> Boolean, %) -> Boolean
- trim: (%, JuliaComplexF32) -> %
- urand01: NonNegativeInteger -> %
urand01(n)
returns a uniformly (0$NNI..1) distributed Julia vector of sizen
.
- vector: List JuliaComplexF32 -> %
vector(l)
converts the listl
to a vector.
- zero: NonNegativeInteger -> %
Eltable(Integer, JuliaComplexF32)
Eltable(UniversalSegment Integer, %)
EltableAggregate(Integer, JuliaComplexF32)
Evalable JuliaComplexF32 if JuliaComplexF32 has Evalable JuliaComplexF32
FiniteLinearAggregate JuliaComplexF32
Hashable if JuliaComplexF32 has Hashable
HomogeneousAggregate JuliaComplexF32
IndexedAggregate(Integer, JuliaComplexF32)
InnerEvalable(JuliaComplexF32, JuliaComplexF32) if JuliaComplexF32 has Evalable JuliaComplexF32
JuliaVectorCategory JuliaComplexF32
LinearAggregate JuliaComplexF32
OneDimensionalArrayAggregate JuliaComplexF32
OrderedSet if JuliaComplexF32 has OrderedSet