summaryrefslogtreecommitdiff
path: root/starling/node.scm
blob: 8247b310303c1a4c7c6b21ce0c9be7a6eeecfdc2 (plain)
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
;;; Starling Game Engine
;;; Copyright © 2018, 2019, 2020 David Thompson <davet@gnu.org>
;;;
;;; This program is free software: you can redistribute it and/or
;;; modify it under the terms of the GNU General Public License as
;;; published by the Free Software Foundation, either version 3 of the
;;; License, or (at your option) any later version.
;;;
;;; This program is distributed in the hope that it will be useful,
;;; but WITHOUT ANY WARRANTY; without even the implied warranty of
;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
;;; General Public License for more details.
;;;
;;; You should have received a copy of the GNU General Public License
;;; along with Starling.  If not, see <http://www.gnu.org/licenses/>.

;;; Commentary:
;;
;; Base class for all game objects.
;;
;;; Code:

(define-module (starling node)
  #:use-module (chickadee scripting)
  #:use-module (oop goops)
  #:use-module (starling asset)
  #:use-module (starling config)
  #:export (<node>
            name
            rank
            parent
            children
            agenda
            booted?
            active?
            visible?
            paused?
            for-each-child
            on-boot
            on-enter
            on-exit
            reboot
            activate
            deactivate
            show
            hide
            pause
            resume
            update
            update-tree
            render
            render-tree
            child-ref
            &
            on-attach
            on-detach
            attach-to
            detach
            run-script
            stop-scripts
            blink)
  #:replace (pause))

(define-class <meta-node> (<class>))

(define-method (asset-slot? (slot <slot>))
  (get-keyword #:asset? (slot-definition-options slot)))

(define-method (compute-getter-method (class <meta-node>) slot)
  (if (asset-slot? slot)
      (make <method>
        #:specializers (list class)
        #:procedure (let ((slot-name (slot-definition-name slot)))
                      (lambda (obj)
                        (let ((value (slot-ref obj slot-name)))
                          (if (is-a? value <asset>)
                              (asset-ref value)
                              value)))))
      (next-method)))


(define-class <developer-meta-node> (<meta-node> <redefinable-class>))

(define-method (compute-setter-method (class <developer-meta-node>) slot)
  (if (asset-slot? slot)
      (make <method>
        #:specializers (list class <top>)
        #:procedure (let ((slot-name (slot-definition-name slot)))
                      (lambda (obj new)
                        (let ((old (and (slot-bound? obj slot-name)
                                        (slot-ref obj slot-name))))
                          (when (is-a? old <asset>)
                            (remove-subscriber old obj slot-name))
                          (when (is-a? new <asset>)
                            (add-subscriber new obj slot-name))
                          (slot-set! obj slot-name new)))))
      (next-method)))

(define-method (make (class <developer-meta-node>) . initargs)
  (let ((instance (next-method)))
    ;; Subscribe for updates to all asset slots.
    (for-each (lambda (slot)
                (when (asset-slot? slot)
                  (let* ((slot-name (slot-definition-name slot))
                         (value (and (slot-bound? instance slot-name)
                                     (slot-ref instance slot-name))))
                    (when (is-a? value <asset>)
                      (add-subscriber value instance slot-name)))))
              (class-slots class))
    instance))

(define-class <node> ()
  ;; Auto-generated process-unique identifier.  As of now I don't see
  ;; a need for globally unique identifiers and this is much faster.
  (id #:getter id #:init-form (gensym "node"))
  ;; Global index of all nodes by their unique id.
  (nodes-by-id #:getter nodes-by-id #:allocation #:class
               #:init-thunk make-weak-value-hash-table)
  ;; Symbolic name.  Used for easy lookup of children within a parent.
  (name #:getter name #:init-form #f #:init-keyword #:name)
  ;; An integer value that determines priority order for
  ;; updating/rendering.
  (rank #:getter rank #:init-value 0 #:init-keyword #:rank)
  ;; The node that this node is attached to.  A node may only have one
  ;; parent.
  (parent #:accessor parent #:init-form #f)
  ;; List of children, sorted by rank.
  (children #:accessor children #:init-form '())
  ;; Children indexed by name for fast lookup.
  (children-by-name #:getter children-by-name #:init-thunk make-hash-table)
  ;; Script scheduler.
  (agenda #:getter agenda #:init-thunk make-agenda)
  ;; Flips to #t upon first entering a scene.
  (booted? #:accessor booted? #:init-form #f)
  ;; Flips to #t when node is part of current scene.
  (active? #:accessor active? #:init-form #f)
  ;; Determines whether or not the node and all of its children are
  ;; rendered.
  (visible? #:accessor visible? #:init-form #t #:init-keyword #:visible?)
  ;; Determines whether or not updates happen.
  (paused? #:accessor paused? #:init-form #f #:init-keyword #:paused?)
  ;; Use redefinable classes when in dev mode.
  #:metaclass (if developer-mode?
                  <developer-meta-node>
                  <meta-node>))

(define-method (initialize (node <node>) initargs)
  (next-method)
  ;; Add node to global index.
  (hashq-set! (nodes-by-id node) (id node) node))

(define (for-each-child proc node)
  (for-each proc (children node)))


;;;
;;; Life cycle event handlers
;;;

(define-method (update (node <node>) dt)
  #t)

(define-method (update-tree (node <node>) dt)
  (unless (or (paused? node) (not (booted? node)))
    ;; Update children first, recursively.
    (for-each-child (lambda (child) (update-tree child dt)) node)
    ;; Scripts take precedence over the update method.
    (with-agenda (agenda node)
                 (update-agenda 1)
                 (update node dt))))

(define-method (render (node <node>) alpha)
  #t)

(define-method (render-tree (node <node>) alpha)
  (when (visible? node)
    (render node alpha)
    (for-each-child (lambda (child) (render-tree child alpha)) node)))

(define-method (on-boot (node <node>))
  #t)

(define-method (on-enter (node <node>))
  #t)

(define-method (on-exit (node <node>))
  #t)

(define-method (on-asset-reload (node <node>) slot-name asset)
  #t)


;;;
;;; Life cycle state management
;;;

(define-method (boot (node <node>))
  (unless (booted? node)
    (set! (booted? node) #t)
    (on-boot node)))

(define-method (reboot (node <node>))
  (define (do-reboot)
    (for-each-child detach node)
    (with-agenda (agenda node) (reset-agenda))
    (on-boot node))
  (cond
   ;; Never booted before, so do nothing.
   ((not (booted? node))
    #t)
   ;; Currently active, so reactivate after reboot.
   ((active? node)
    (do-reboot)
    (activate node))
   ;; Not active.
   (else
    (do-reboot))))

(define-method (activate (node <node>))
  ;; First time activating?  We must boot!
  (unless (booted? node) (boot node))
  (set! (active? node) #t)
  (for-each-child activate node)
  ;; Activate all children, recursively, before calling on-enter hook.
  (on-enter node))

(define-method (deactivate (node <node>))
  (set! (active? node) #f)
  (on-exit node)
  (for-each-child deactivate node))

(define-method (show (node <node>))
  (set! (visible? node) #t))

(define-method (hide (node <node>))
  (set! (visible? node) #f))

(define-method (pause (node <node>))
  (set! (paused? node) #t))

(define-method (resume (node <node>))
  (set! (paused? node) #f))


;;;
;;; Child management
;;;

(define-method (child-ref (parent <node>) name)
  (hashq-ref (children-by-name parent) name))

(define-syntax &
  (syntax-rules ()
    ((_ parent child-name)
     (child-ref parent 'child-name))
    ((_ parent child-name . rest)
     (& (child-ref parent 'child-name) . rest))))

(define-method (on-attach (parent <node>) (child <node>))
  #t)

(define-method (on-detach (parent <node>) (child <node>))
  #t)

(define-method (attach-to (new-parent <node>) . new-children)
  ;; Validate all children first.  The whole operation will fail if
  ;; any of them cannot be attached.
  (for-each (lambda (child)
              (when (parent child)
                (error "node already has a parent:" child))
              (when (child-ref new-parent (name child))
                (error "node name taken:" (name child))))
            new-children)
  ;; Add the new children and sort them by their rank so that
  ;; updating/rendering happens in the desired order.
  (set! (children new-parent)
    (sort (append new-children (children new-parent))
          (lambda (a b)
            (< (rank a) (rank b)))))
  ;; Mark the children as having parents and add them to the rank and
  ;; name indexes for quick lookup later.
  (for-each (lambda (child)
              (set! (parent child) new-parent)
              ;; Add to name index.
              (when (name child)
                (hashq-set! (children-by-name new-parent) (name child) child))
              ;; If the parent is booted or active, that means the new
              ;; children must also be booted or activated.
              (when (booted? new-parent)
                (boot child))
              (when (active? new-parent)
                (activate child)))
            new-children)
  ;; Notify parent of attach event.
  (for-each (lambda (child)
              (on-attach new-parent child))
            new-children))

(define-method (detach (node <node>))
  (let ((p (parent node)))
    (when p
      ;; Remove child from parent.
      (set! (children p) (delq node (children p)))
      ;; Remove from name index.
      (when (name node)
        (hashq-remove! (children-by-name p) (name node)))
      ;; Detaching deactives the node and all of its children.
      (when (active? node)
        (deactivate node))
      (set! (parent node) #f)
      (on-detach p node))))

(define-method (detach . nodes)
  (for-each detach nodes))


;;;
;;; Scripting
;;;

(define-syntax-rule (run-script node body ...)
  (with-agenda (agenda node) (script body ...)))

(define-method (stop-scripts node)
  (with-agenda (agenda node) (clear-agenda)))

(define-method (blink (node <node>) times interval)
  (let loop ((i 0))
    (when (< i times)
      (set! (visible? node) #f)
      (sleep interval)
      (set! (visible? node) #t)
      (sleep interval)
      (loop (+ i 1)))))