Type Members

1.  abstract class AbstractImmArraySeq[+A] extends AbstractSeq[A] with IndexedSeq[A] with IndexedSeqOps[A, ImmArraySeq, ImmArraySeq[A]] with StrictOptimizedSeqOps[A, ImmArraySeq, ImmArraySeq[A]] with IterableFactoryDefaults[A, ImmArraySeq]
2.  final class ArrayFactory[T] extends AnyRef
3.  final class BackStack[+A] extends AnyRef

   A stack which allows to snoc, append, and pop in constant time, and generate an ImmArray in linear time.

4.  final class Bytes extends AnyVal
5.  sealed trait ConcatenableStringModule[T <: String, HS <: String] extends StringModule[T]

   ConcatenableMatchingString are non empty US-ASCII strings built with letters, digits, and some other (parameterizable) extra characters.

   ConcatenableMatchingString are non empty US-ASCII strings built with letters, digits, and some other (parameterizable) extra characters. We use them to represent identifiers. In this way, we avoid empty identifiers, escaping problems, and other similar pitfalls.

   ConcatenableMatchingString has the advantage over MatchingStringModule of being concatenable and can be generated from numbers without extra checks. Those properties are heavily use to generate some ids by combining other existing ids.

6.  final class FrontStack[+A] extends AnyRef

   A stack which allows to cons, prepend, and pop in constant time, and generate an ImmArray in linear time.

   A stack which allows to cons, prepend, and pop in constant time, and generate an ImmArray in linear time. Very useful when needing to traverse stuff in topological order or similar situations.

7.  sealed trait HexStringModule[T <: String] extends StringModule[T]
8.  sealed abstract class IdString extends AnyRef
9.  final class ImmArray[+A] extends AnyRef

   Simple immutable array.

   Simple immutable array. The intention is that all the operations have the "obvious" operational behavior (like Vector in haskell).

   Functions that slice the ImmArray (including head, tail, etc) are all constant time -- they keep referring to the same underlying array.

   Note that we _very intentionally_ do _not_ make this an instance of any sorts of Seq, since using Seq encourages patterns where the performance of what you're doing is totally unclear. Use toSeq if you want a Seq, and think about what that means.

10.  abstract class ImmArraySeqCompanion extends StrictOptimizedSeqFactory[ImmArraySeq]
11.  final class InsertOrdSet[T] extends AbstractSet[T] with IterableFactoryDefaults[T, InsertOrdSet] with StrictOptimizedSetOps[T, InsertOrdSet, InsertOrdSet[T]] with Serializable

    Insert-ordered Set.

    Insert-ordered Set.

    Implemented as (Queue[T], HashSet[T]). Asymptotics: get: O(1) insert: O(1) remove: O(n)

12.  trait NoCopy extends AnyRef
13.  type Numeric = data.NumericModule.Numeric
14.  abstract class NumericModule extends AnyRef

    The model of our floating point decimal numbers.

    The model of our floating point decimal numbers.

    These are numbers of precision 38 (38 decimal digits), and variable scale (from 0 to 37 bounds included).

15.  final class SortedLookupList[+X] extends Equals

    We use this container to pass around Daml-LF text maps as flat lists in various parts of the codebase.

16.  sealed abstract class SortedLookupListInstances extends AnyRef
17.  sealed trait StringModule[T] extends AnyRef
18.  final class Struct[+X] extends AnyVal