LList1

libretto.CoreLib.LList1$
object LList1

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Self type
LList1.type

Members list

Concise view

Value members

Concrete methods

def apply[T](x: $[T], xs: $[T]*): $[LList1[T]]
def cons[T]: T |*| LList[T] -⚬ LList1[T]
def cons1[T]: T |*| LList1[T] -⚬ LList1[T]
def fold[T](using T: Semigroup[T]): LList1[T] -⚬ T
def foldMap[T, U](f: T -⚬ U)(using U: Semigroup[U]): LList1[T] -⚬ U
def from[S, T](head: S -⚬ T, tail: List[S -⚬ T])(using S: Cosemigroup[S]): S -⚬ LList1[T]
def from[S, T](fs: ::[S -⚬ T])(using S: Cosemigroup[S]): S -⚬ LList1[T]
def fromExprList[T](h: $[T], t: List[$[T]]): $[LList1[T]]
def halfRotateL[A, B]: LList1[A |*| B] -⚬ LList1[B |*| A]

Shifts all the elements of a list by "half" to the left, moving the first half of the first element to the end of the list.

Shifts all the elements of a list by "half" to the left, moving the first half of the first element to the end of the list.

Example:

Before:

(a1, b1), (a2, b2), (a3, b3)

After:

(b1, a2), (b2, a3), (b3, a1)

Attributes

Inserts an element to a list as soon as the element signals. If m elements of the input list become available before the new element signals, the new element will appear as the (m+1)-th element in the output list. Note: The m elements from the input list are not awaited to signal; their timely appearence in the input list is sufficient for them to come before the inserted element.

Inserts an element to a list as soon as the element signals. If m elements of the input list become available before the new element signals, the new element will appear as the (m+1)-th element in the output list. Note: The m elements from the input list are not awaited to signal; their timely appearence in the input list is sufficient for them to come before the inserted element.

Attributes

def map[T, U](f: T -⚬ U): LList1[T] -⚬ LList1[U]
def mapS[S, T, U](f: S |*| T -⚬ S |*| U): S |*| LList1[T] -⚬ S |*| LList1[U]
def mapSAppend[S, T, U](f: S |*| T -⚬ S |*| U, tail: S -⚬ LList[U]): S |*| LList1[T] -⚬ LList1[U]
def of[S, T](head: S -⚬ T, tail: S -⚬ T*)(using S: Cosemigroup[S]): S -⚬ LList1[T]
def singleton[T]: T -⚬ LList1[T]
def switch[T, R](case1: T -⚬ R, caseN: T |*| LList1[T] -⚬ R): LList1[T] -⚬ R
def toLList[T]: LList1[T] -⚬ LList[T]
def uncons[T]: LList1[T] -⚬ T |*| LList[T]