starlark 0.13.0

An implementation of the Starlark language in Rust.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67

# @generated
# Copied from https://github.com/google/starlark-go/blob/e81fc95f7bd5bb1495fe69f27c1a99fcc77caa48/starlark/testdata/

# Tests of Starlark control flow

load("asserts.star", "asserts")

def controlflow():
  # elif
  x = 0
  if True:
    x=1
  elif False:
    asserts.fail("else of true")
  else:
    asserts.fail("else of else of true")
  asserts.true(x)

  x = 0
  if False:
    asserts.fail("then of false")
  elif True:
    x = 1
  else:
    asserts.fail("else of true")
  asserts.true(x)

  x = 0
  if False:
    asserts.fail("then of false")
  elif False:
    asserts.fail("then of false")
  else:
    x = 1
  asserts.true(x)
controlflow()

def loops():
  y = ""
  for x in [1, 2, 3, 4, 5]:
    if x == 2:
      continue
    if x == 4:
      break
    y = y + str(x)
  return y
asserts.eq(loops(), "13")

# return
g = 123
def f(x):
  for g in (1, 2, 3):
    if g == x:
      return g
asserts.eq(f(2), 2)
asserts.eq(f(4), None) # falling off end => return None
asserts.eq(g, 123) # unchanged by local use of g in function

# infinite sequences
def fib(n):
  seq = []
  for x in fibonacci: # fibonacci is an infinite iterable defined in eval_test.go
    if len(seq) == n:
      break
    seq.append(x)
  return seq
asserts.eq(fib(10),  [0, 1, 1, 2, 3, 5, 8, 13, 21, 34])