4.3. kink/BIN

Companion mod for bin vals.

4.3.1. type bin

A bin is a finite immutable byte array.

Elements of the bin are int nums in the range [0x00, 0xff].

Example:

:BIN.require_from('kink/')
:Magic <- BIN.of(0xca 0xfe 0xba 0xbe)
:Slice <- Magic.take_front(2)
stdout.print_line(Slice.repr) # => BIN.of(0xca 0xfe)

4.3.1.1. Bin.empty?

Bin.empty? returns whether the size of the Bin is zero.

4.3.1.2. Bin.size

Bin.size returns the number of elements of the Bin.

4.3.1.3. Bin.get(Ind)

Bin.get returns the specified element of the Bin.

Ind must be an int num in the range [0, Bin.size).

The result element is an int num in the range [0, 0xff].

4.3.1.4. Bin.slice(From_pos To_pos)

Bin.slice returns the specified slice of the Bin.

From_pos and To_pos must be int nums in the range [0, Bin.size]. From_pos must be less than or equal to To_pos.

The result is a bin the elements of which are copied from the slice of the Bin.

Example:

:BIN.require_from('kink/')
:Magic <- BIN.of(0xca 0xfe 0xba 0xbe)
:Slice <- Magic.slice(1 3)
stdout.print_line(Slice.repr) # => BIN.of(0xfe 0xba)

4.3.1.5. Bin.take_front(N)

Bin.take_front makes a bin containing the first N elements of the Bin.

N must be an int num in the range [0, Bin.size].

Example:

:BIN.require_from('kink/')
:Pdf_signature <- BIN.of(0x25 0x50 0x44 0x46 0x2d)
:Slice <- Pdf_signature.take_front(2)
stdout.print_line(Slice.repr) # => BIN.of(0x25 0x50)

4.3.1.6. Bin.take_back(N)

Bin.take_back makes a bin containing the last N elements of the Bin.

N must be an int num in the range [0, Bin.size].

Example:

:BIN.require_from('kink/')
:Pdf_signature <- BIN.of(0x25 0x50 0x44 0x46 0x2d)
:Slice <- Pdf_signature.take_back(2)
stdout.print_line(Slice.repr) # => BIN.of(0x46 0x2d)

4.3.1.7. Bin.drop_front(N)

Bin.drop_front makes a bin dropping the first N elements from the Bin.

N must be an int num in the range [0, Bin.size].

Example:

:BIN.require_from('kink/')
:Pdf_signature <- BIN.of(0x25 0x50 0x44 0x46 0x2d)
:Slice <- Pdf_signature.drop_front(2)
stdout.print_line(Slice.repr) # => BIN.of(0x44 0x46 0x2d)

4.3.1.8. Bin.drop_back(N)

Bin.drop_back makes a bin dropping the last N elements from the Bin.

N must be an int num in the range [0, Bin.size].

Example:

:BIN.require_from('kink/')
:Pdf_signature <- BIN.of(0x25 0x50 0x44 0x46 0x2d)
:Slice <- Pdf_signature.drop_back(2)
stdout.print_line(Slice.repr) # => BIN.of(0x25 0x50 0x44)

4.3.1.9. Bin.op_add(Arg_bin)

Bin.op_add makes a bin containing the elements of the Bin on the front, and the elements of the Arg_bin on the back.

Arg_bin must be a bin.

Example:

:BIN.require_from('kink/')
:Cafe <- BIN.of(0xca 0xfe)
:Babe <- BIN.of(0xba 0xbe)
:Cafe_babe <- Cafe + Babe
stdout.print_line(Cafe_babe.repr) # => BIN.of(0xca 0xfe 0xba 0xbe)

4.3.1.10. Bin.op_mul(N)

Bin.op_mul makes a bin repeating the elements of the Bin N times.

N must be an int num.

Example:

:BIN.require_from('kink/')
:Babe <- BIN.of(0xba 0xbe)
:Babe_babe_babe <- Babe * 3
stdout.print_line(Babe_babe_babe.repr) # => BIN.of(0xba 0xbe 0xba 0xbe 0xba 0xbe)

4.3.1.11. Bin1.op_eq(Bin2)

`op_eq` returns whether `Bin1` and `Bin2` contain the same sequence of elements.

Precondition:

• `Bin1` and `Bin2` must be bins.

Example:

:BIN.require_from('kink/')
:Bin <- BIN.of(1 2 3)

stdout.print_line((Bin == BIN.of(1 2 3)).repr)  # => true
stdout.print_line((Bin != BIN.of(1 2 3)).repr)  # => false

stdout.print_line((Bin == BIN.of(3 2 1)).repr)  # => false
stdout.print_line((Bin != BIN.of(3 2 1)).repr)  # => true

4.3.1.12. Bin1.op_lt(Bin2)

`op_lt` returns whether `Bin1` is less than `Bin2` lexicographically.

Precondition:

• `Bin1` and `Bin2` must be bins.

Example:

:BIN.require_from('kink/')

:compare <- {(:Bin :Arg_bin)
  [:Lt? :Le? :Gt? :Ge?] = [
    Bin < Arg_bin
    Bin <= Arg_bin
    Bin > Arg_bin
    Bin >= Arg_bin
  ]
  stdout.print_line(
    'Lt?={} Le?={} Gt?={} Ge?={}'.format(Lt?.repr Le?.repr Gt?.repr Ge?.repr))
}

compare(BIN.of(1 2 3) BIN.of(1 2 3))    # => Lt?=false Le?=true Gt?=false Ge?=true
compare(BIN.of(1 2 3) BIN.of(1 2 3 4))  # => Lt?=true Le?=true Gt?=false Ge?=false
compare(BIN.of(1 2 3) BIN.of(1 2))      # => Lt?=false Le?=false Gt?=true Ge?=true

4.3.1.13. Bin.repr

`repr` returns a str like "(bin 0xca 0xfe 0xba 0xbe)".

4.3.2. BIN.is?(Val)

Returns whether the Val is a bin.

Example:

:BIN.require_from('kink/')
:Bin <- BIN.of(1 2 3)
stdout.print_line(BIN.is?(Bin).repr) # => true
stdout.print_line(BIN.is?(42).repr)  # => false

4.3.3. BIN.of(... Elems)

BIN.of makes a bin containing Elems as the elements.

Elems must be int nums in the range [0, 0xff].

Example:

:BIN.require_from('kink/')
:Bin <- BIN.of(0 1 254 255)
stdout.print_line(Bin.repr) # => BIN.of(0x00 0x01 0xfe 0xff)