Mercurial > repos > tabletprog

comparison modules/array.tp @ 84:9811040704ac

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Add support for llMessage:withVars:andCode and llProperty:withType for specifying low level code without having to stick C inside the compiler. Redo array built-in type to use this feature.
author Mike Pavone <pavone@retrodev.com>
date Sat, 21 Jul 2012 22:30:21 -0700
parents
children 547153211389
comparison
equal deleted inserted replaced
83:fdb9785d2c93 84:9811040704ac
1 #{
2 llProperty: size withType: uint32_t
3 llProperty: storage withType: uint32_t
4 llProperty: data withType: ((object ptr) ptr)
5 llMessage: get withVars: {
6 index <- obj_int32 ptr
7 } andCode: :index {
8 if: (index num) >= 0 && (index num) < size {
9 (self data) get: (index num)
10 } else: {
11 false
12 }
13 }
14
15 llMessage: set withVars: {
16 index <- obj_int32 ptr
17 value <- object ptr
18 } andCode: :index value {
19 if: (index num) >= 0 && (index num) < size {
20 data set: (index num) value
21 }
22 self
23 }
24
25 llMessage: foreach withVars: {
26 clos <- lambda ptr
27 i <- uint32_t
28 index <- obj_int32 ptr
29 } andCode: :clos {
30 i <- 0
31 while: { i < size } do: {
32 index <- make_object: (addr_of: obj_int32_meta) NULL 0
33 index num!: i
34 ccall: clos 2 index (data get: i)
35 i <- i + 1
36 }
37 self
38 }
39
40 llMessage: append withVars: {
41 value <- object ptr
42 tmp <- (object ptr) ptr
43 } andCode: :value {
44 if: storage = size {
45 storage <- storage * 2
46 tmp <- GC_REALLOC: data storage * (sizeof: (object ptr))
47 if: (not: tmp) {
48 fputs: "Failed to increase array size\n" stderr
49 exit: 1
50 }
51 data <- tmp
52 }
53 data set: size value
54 size <- size + 1
55 self
56 }
57
58 llMessage: length withVars: {
59 intret <- obj_int32 ptr
60 } andCode: {
61 intret <- make_object: (addr_of: obj_int32_meta) NULL 0
62 intret num!: size
63 intret
64 }
65
66 fold:with <- :acc :fun {
67 foreach: self :idx el {
68 fun: acc el
69 }
70 }
71
72 foldr:with <- :acc :fun {
73 idx <- length - 1
74 while: {idx >= 0} do: {
75 fun: acc (get: idx)
76 }
77 }
78
79 map <- :fun {
80 new <- #[]
81 foreach: self :idx el {
82 new append: (fun: el)
83 }
84 }
85
86 find:withDefault <- :pred :default{
87 idx <- 0
88 l <- length
89 ret <- default
90 while: {idx < l} do: {
91 v <- get: idx
92 if: (pred: v) {
93 ret <- #{
94 key <- idx
95 value <- v
96 }
97 idx <- l
98 }
99 }
100 ret
101 }
102 }