-
Notifications
You must be signed in to change notification settings - Fork 6
/
worlds.lisp
1172 lines (1051 loc) · 41.7 KB
/
worlds.lisp
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
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
;;; worlds.lisp --- turn-based cell/sprite worlds
;; Copyright (C) 2008 David O'Toole
;; Author: David O'Toole <dto@gnu.org>
;; Keywords:
;; 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 this program. If not, see <http://www.gnu.org/licenses/>
(in-package :xe2)
(define-prototype world
(:documentation "An XE2 game world filled with cells and sprites.
Worlds are the focus of the action in XE2. A world is a 3-D grid of
interacting cells. The world object performs the following tasks:
- Keeps track of a single player in a world of cells
- Receives command messages from the user
- Handles some messages, forwards the rest on to the player cell.
- Runs the CPU phase so that all non-player :actor cells get their turns
- Keeps track of lit squares
- Performs collision detection for sprites and cells
")
(name :initform "Unknown" :documentation "Name of the world.")
(overworld :initform nil)
(paused :initform nil :documentation "Non-nil when the game is paused.")
(description :initform "Unknown area." :documentation "Brief description of area.")
(tile-size :initform 16 :documentation "Size in pixels of a grid tile.")
(required-modes :initform nil :documentation
"A list of keywords specifying which modes of transportation are
required for travel here." )
(categories :initform "The set of categories this world is in.")
;; turtle graphics
(grammar :initform '() :documentation "Context-free grammar for level generation.")
(stack :initform '() :documentation "Stack for logo system.")
(row :initform 0)
(column :initform 0)
(direction :initform :east)
(paint :initform nil)
;;
(scale :initform '(1 m)
:documentation "Scale per square side in the form (N UNIT) where UNIT is m, km, ly etc.")
(player :documentation "The player cell (or sprite).")
(width :documentation "The width of the world map, measured in tiles.")
(height :documentation "The height of the world map, measured in tiles.")
;; cells
(grid :documentation "A two-dimensional array of adjustable vectors of cells.")
(serialized-grid :documentation "A serialized sexp version.")
;; sprite cells
(sprites :initform nil :documentation "A list of sprites.")
(serialized-sprites :initform nil)
(sprite-grid :initform nil :documentation "Grid for collecting sprite collision information.")
(sprite-table :initform nil :documentation "Hash table to prevent redundant collisions.")
;; forms processing
(variables :initform nil :documentation "Hash table mapping values to values, local to the form.")
;; environment
(environment-grid :documentation "A two-dimensional array of environment data cells.")
;; lighting
(automapped :initform nil :documentation "Show all previously lit squares.")
(light-grid
:documentation
"A 2d array of integers giving the light level at that point in <grid>.
At the moment, only 0=off and 1=on are supported.")
(ambient-light :initform :total :documentation
"Radius of ambient visibility. :total means that lighting is turned off.")
;; action-points
(phase-number :initform 1 :documentation "Integer number of current phase.")
(turn-number :initform 1 :documentation "Integer number of elapsed user turns (actions).")
;; queueing
(message-queue :initform (make-queue))
;; narration
(narrator :documentation "The narration widget object.")
;; browsing
(browser :documentation "The browser object.")
;; viewing
(viewport :initform nil :documentation "The viewport object.")
;; space
(edge-condition :initform :exit
:documentation "Either :block the player, :exit the world, or :wrap around.")
(exited :initform nil
:documentation "Non-nil when the player has exited. See also `forward'.")
(player-exit-row :initform 0)
(player-exit-column :initform 0))
(defparameter *default-world-axis-size* 10)
(defparameter *default-world-z-size* 4)
(define-method initialize world ()
(setf <variables> (make-hash-table :test 'equal)))
(define-method set-variable world (var value)
(setf (gethash var <variables>) value))
(define-method get-variable world (var)
(gethash var <variables>))
(define-method in-category world (category)
"Returns non-nil when the cell SELF is in the category CATEGORY."
(member category <categories>))
(define-method pause world (&optional always)
"Toggle the pause state of the world."
(clon:with-fields (paused) self
(setf paused (if (null paused)
t (when always t)))
(if (null paused)
[narrateln <narrator> "Resuming game."]
[narrateln <narrator> "The game is now paused. Press Control-P or PAUSE to un-pause."])))
(define-prototype environment
(:documentation "A cell giving general environmental conditions at a world location.")
(temperature :initform nil :documentation "Temperature at this location, in degrees Celsius.")
(radiation-level :initform nil :documentation "Radiation level at this location, in clicks.")
(oxygen :initform nil :documentation "Oxygen level, in percent.")
(pressure :initform nil :documentation "Atmospheric pressure, in multiples of Earth's.")
(overlay :initform nil
:documentation "Possibly transparent image overlay to be drawn at this location."))
(define-method create-grid world (&key width height)
"Initialize all the arrays for a world of WIDTH by HEIGHT cells."
(let ((dims (list height width)))
(let ((grid (make-array dims
:element-type 'vector :adjustable nil)))
;; now put a vector in each square to represent the z-axis
(dotimes (i height)
(dotimes (j width)
(setf (aref grid i j)
(make-array *default-world-z-size*
:adjustable t
:fill-pointer 0))))
(setf <grid> grid
<height> height
<width> width)
;; we need a grid of integers for the lighting map.
(setf <light-grid> (make-array dims
:element-type 'integer
:initial-element 0))
;;and a grid of special objects for the environment map.
(let ((environment (make-array dims)))
(setf <environment-grid> environment)
(dotimes (i height)
(dotimes (j width)
(setf (aref environment i j) (clone =environment=)))))
;; sprite intersection data grid
(let ((sprite-grid (make-array dims :element-type 'vector :adjustable t)))
;; now put a vector in each square to collect intersecting sprites
(dotimes (i height)
(dotimes (j width)
(setf (aref sprite-grid i j)
(make-array *default-world-z-size*
:adjustable t
:fill-pointer 0))))
(setf <sprite-grid> sprite-grid)
(setf <sprite-table> (make-hash-table :test 'equal))))))
(define-method serialize world ()
(clon:with-field-values (width height) self
(let ((grid <grid>)
(sprites nil)
(sgrid (make-array (list height width) :initial-element nil :adjustable nil)))
(dotimes (i height)
(dotimes (j width)
(map nil #'(lambda (cell)
(when cell
(push (clon:serialize cell)
(aref sgrid i j))))
(aref grid i j))))
(setf <serialized-grid> sgrid)
(dolist (s <sprites>)
(push (serialize s) sprites))
(setf <serialized-sprites> sprites)
(prog1 (clon:serialize self :excluding
'(:grid :sprite-grid
:sprites :light-grid
:narrator :browser :viewport :player))
(setf <serialized-grid> nil)
(setf <serialized-sprites> nil)))))
(define-method create-default-grid world ()
"If height and width have been set in a world's definition,
initialize the arrays for a world of the size specified there."
(if (and (numberp <width>)
(numberp <height>))
[create-grid self :width <width> :height <height>]
(error "Cannot create default grid without height and width set.")))
(define-method location-name world ()
"Return the location name."
<name>)
(define-method environment-at world (row column)
(aref <environment-grid> row column))
(define-method environment-condition-at world (row column condition)
(field-value condition (aref <environment-grid> row column)))
(define-method set-environment-condition-at world (row column condition value)
(setf (field-value condition
(aref <environment-grid> row column))
value))
;;; LOGO-like level generation capabilities
;; Use turtle graphics to generate levels! One may write turtle
;; programs by hand, or use context-free grammars to generate the
;; turtle commands, or generate them programmatically in other ways.
;; See also grammars.lisp.
(define-method generate world (&rest parameters)
"Generate a world, reading generation parameters from the plist
PARAMETERS."
(declare (ignore parameters))
(with-fields (grammar stack) self
(assert grammar)
(setf xe2:*grammar* grammar)
(let ((program (generate 'world)))
(or program (error "ERROR: Nothing was generated from this grammar."))
(message (prin1-to-string program))
(unless <grid>
[create-default-grid self])
(dolist (op program)
(typecase op
(keyword (if (clon:has-method op self)
(send nil op self)
(message "WARNING: Found keyword without corresponding method in turtle program.")))
(symbol (when (null (keywordp op))
(when (boundp op)
(push (symbol-value op) stack))))
(string (push op stack))
(number (push op stack)))))))
(define-method generate-with world (parameters)
(apply #'send self :generate self parameters))
(define-method origin world ()
(setf <row> 0 <column> 0 <direction> :east))
(define-method color world ()
"Set the color to =FOO= where FOO is the prototype symbol on top of
the stack."
(let ((prototype (pop <stack>)))
(if (clon:object-p prototype)
(setf <paint> prototype)
(error "Must pass a =FOO= prototype symbol as a COLOR."))))
(define-method push-color world ()
"Push the symbol name of the current <paint> object onto the stack."
(clon:with-fields (paint stack) self
(if (clon:object-p paint)
(prog1 (message "PUSHING PAINT ~S" (clon:object-name paint))
(push paint stack))
(error "No paint to save on stack during PUSH-COLOR."))))
(define-method drop world ()
"Clone the current <paint> object and drop it at the current turtle
location."
(clon:with-field-values (paint row column) self
(if (clon:object-p paint)
[drop-cell self (clone paint) row column]
(error "Nothing to drop. Use =FOO= :COLOR to set the paint color."))))
(define-method jump world ()
"Jump N squares forward where N is the integer on the top of the stack."
(let ((distance (pop <stack>)))
(if (integerp distance)
(multiple-value-bind (row column)
(step-in-direction <row> <column> <direction> distance)
(setf <row> row <column> column)
(when (not (array-in-bounds-p <grid> row column))
(message "Turtle left drawing area during MOVE.")))
(error "Must pass an integer as distance for MOVE."))))
(define-method draw world ()
"Move N squares forward while painting cells. Clones N cells where N
is the integer on the top of the stack."
(clon:with-fields (paint stack) self
(if (not (clon:object-p paint))
(error "No paint set.")
(let ((distance (pop stack)))
(if (integerp distance)
(dotimes (n distance)
[drop-cell self (clone paint) <row> <column>]
(multiple-value-bind (row column)
(step-in-direction <row> <column> <direction>)
(setf <row> row <column> column)
(when (array-in-bounds-p <grid> row column)
(message "Turtle left drawing area during DRAW."))))
(error "Must pass an integer as distance for DRAW."))))))
(define-method pushloc world ()
"Push the current row,col location (and direction) onto the stack."
(push (list <row> <column> <direction>) <stack>))
(define-method poploc world ()
"Jump to the location on the top of the stack, and pop the stack."
(let ((loc (pop <stack>)))
(message "LOC: ~S" loc)
(if (and (listp loc) (= 3 (length loc)))
(destructuring-bind (r c dir) loc
(setf <row> r <column> c <direction> dir))
(error "Invalid location argument for POPLOC. Must be a list of two integers plus a keyword."))))
(define-method right world ()
"Turn N degrees clockwise, where N is 0, 45, or 90."
(with-fields (direction stack) self
(labels ((turn45 () (setf direction (getf *right-turn* direction))))
(ecase (pop stack)
(0 nil)
(45 (turn45))
(90 (turn45) (turn45))))))
(define-method left world ()
"Turn N degrees counter-clockwise, where N is 0, 45, or 90."
(with-fields (direction stack) self
(labels ((turn45 () (setf direction (getf *left-turn* direction))))
(ecase (pop stack)
(0 nil)
(45 (turn45))
(90 (turn45) (turn45))))))
(define-method noop world ()
nil)
;;; Narration
(define-method set-narrator world (narrator)
(setf <narrator> narrator))
(define-method set-browser world (browser)
(setf <browser> browser))
(define-method cells-at world (row column)
"Return the vector of cells at ROW, COLUMN in the world SELF."
(when (array-in-bounds-p <grid> row column)
(aref <grid> row column)))
(define-method top-cell-at world (row column)
(let ((cells [cells-at self row column]))
(when (and cells (not (zerop (fill-pointer cells))))
(aref cells (- (fill-pointer cells) 1)))))
(define-method random-place world (&optional &key avoiding distance)
(clon:with-field-values (width height) self
(let ((limit 10000)
(n 0)
found r c)
(loop do (progn (setf r (random height))
(setf c (random width))
(incf n)
(unless
(or (and (numberp distance)
(> distance (distance r c 0 0)))
[category-at-p self r c :exclusive])
(setf found t)))
while (and (not found)
(< n limit)))
(values r c found))))
(define-method replace-cells-at world (row column data)
"Destroy the cells at ROW, COLUMN, invoking CANCEL on each,
replacing them with the single cell (or vector of cells) DATA."
(when (array-in-bounds-p <grid> row column)
(do-cells (cell (aref <grid> row column))
[cancel cell])
(setf (aref <grid> row column)
(etypecase data
(vector data)
(clon:object (let ((cells (make-array *default-world-z-size*
:adjustable t
:fill-pointer 0)))
(prog1 cells
(vector-push-extend data cells))))))
(do-cells (cell (aref <grid> row column))
[set-location cell row column])))
(define-method drop-sprite world (sprite x y &key no-collisions loadout)
"Add a sprite to the world. When NO-COLLISIONS is non-nil, then the
object will not be dropped when there is an obstacle. When LOADOUT is
non-nil, the :loadout method is invoked on the sprite after
placement."
(assert (eq :sprite (field-value :type sprite)))
[add-sprite self sprite]
[update-position sprite x y]
(when loadout
[loadout sprite])
(unless no-collisions
;; TODO do collision test
nil))
(define-method drop-cell world (cell row column
&optional &key
loadout no-stepping no-collisions (exclusive t) (probe t))
"Put the cell CELL on top of the stack of cells at ROW,
COLUMN. If LOADOUT is non-nil, then the `loadout' method of the
dropped cell is invoked after dropping. If the field <auto-loadout> is
non-nil in the CELL, then the `loadout' method is invoked regardless
of the value of LOADOUT.
If NO-COLLISIONS is non-nil, then an object is not dropped on top of
an obstacle. If EXCLUSIVE is non-nil, then two objects with
category :exclusive will not be placed together. If PROBE is non-nil,
try to place the cell in the immediate neighborhood. Return T if a
cell is placed; nil otherwise."
(let ((grid <grid>)
(tile-size <tile-size>)
(auto-loadout (field-value :auto-loadout cell)))
(declare (optimize (speed 3))
(type (simple-array vector (* *)) grid)
(fixnum tile-size row column))
(when (array-in-bounds-p grid row column)
(ecase (field-value :type cell)
(:cell
(labels ((drop-it (row column)
(prog1 t
(vector-push-extend cell (aref grid row column))
(setf (field-value :row cell) row)
(setf (field-value :column cell) column)
(when (or loadout auto-loadout)
[loadout cell])
(unless no-stepping
[step-on-current-square cell]))))
(if (or no-collisions exclusive)
(progn
(when no-collisions
(when (not [obstacle-at-p self row column])
(drop-it row column)))
(when exclusive
(if [category-at-p self row column :exclusive]
(when probe
(block probing
(dolist (dir *compass-directions*)
(multiple-value-bind (r c)
(step-in-direction row column dir)
(when (not [category-at-p self row column :exclusive])
(return-from probing (drop-it r c)))))))
(drop-it row column))))
(drop-it row column))))
;; handle sprites
(:sprite
[add-sprite self cell]
[update-position cell
(* column tile-size)
(* row tile-size)])))))
(define-method replace-cell world (cell new-cell row column
&optional &key loadout no-collisions)
"Replace the CELL with NEW-CELL at ROW, COLUMN in this world."
(let* ((cells [cells-at self row column])
(pos (position cell cells)))
(if (numberp pos)
(setf (aref cells pos) new-cell)
(error "Could not find cell to replace."))))
(define-method drop-player-at-entry world (player)
"Drop the PLAYER at the first entry point."
(with-field-values (width height grid tile-size) self
(multiple-value-bind (dest-row dest-column)
(block seeking
(dotimes (i height)
(dotimes (j width)
(when [category-at-p self i j :player-entry-point]
(return-from seeking (values i j)))))
(return-from seeking (values 0 0)))
(setf <player> player)
(ecase (field-value :type player)
(:cell [drop-cell self player dest-row dest-column :no-stepping t])
(:sprite [drop-sprite self player
(* dest-column tile-size)
(* dest-row tile-size)])))))
(define-method drop-player-at-last-location world (player)
(setf <player> player)
(message "DROPPING PLAYER ~S" (list <player-exit-row> <player-exit-column>))
[drop-cell self player <player-exit-row> <player-exit-column>])
(define-method nth-cell world (n row column)
(aref (aref <grid> row column) n))
(define-method get-player world ()
<player>)
(define-method player-row world ()
"Return the grid row the player is on."
(clon:with-field-values (player tile-size) self
(ecase (field-value :type player)
(:sprite (truncate (/ (field-value :y player) tile-size)))
(:cell (field-value :row player)))))
(define-method player-column world ()
"Return the grid column the player is on."
(clon:with-field-values (player tile-size) self
(ecase (field-value :type player)
(:sprite (truncate (/ (field-value :x player) tile-size)))
(:cell (field-value :column player)))))
(define-method exit world ()
"Leave the current world."
(setf <exited> t) ;; see also `forward' method
;; record current location so we can exit back to it
(setf <player-exit-row> (field-value :row <player>))
(setf <player-exit-column> (field-value :column <player>))
(message "EXITING AT ~S" (list <player-exit-row> <player-exit-column>))
[exit <player>]
[delete-cell self <player> <player-exit-row> <player-exit-column>])
(define-method obstacle-at-p world (row column)
"Returns non-nil if there is any obstacle in the grid at ROW, COLUMN."
(or (not (array-in-bounds-p <grid> row column))
(some #'(lambda (cell)
(when [in-category cell :obstacle]
cell))
(aref <grid> row column))))
(define-method category-at-p world (row column category)
"Returns non-nil if there is any cell in CATEGORY at ROW, COLUMN.
CATEGORY may be a list of keyword symbols or one keyword symbol."
(declare (optimize (speed 3)))
(let ((catlist (etypecase category
(keyword (list category))
(list category)))
(grid <grid>))
(declare (type (simple-array vector (* *)) grid))
(and (array-in-bounds-p grid row column)
(some #'(lambda (cell)
(when (intersection catlist
(field-value :categories cell))
cell))
(aref grid row column)))))
;; (define-method category-at-xy-p world (x y category)
;; (let ((
(define-method in-bounds-p world (row column)
"Return non-nil if ROW and COLUMN are valid coordinates."
(array-in-bounds-p <grid> row column))
(define-method direction-to-player world (row column)
"Return the general compass direction of the player from ROW, COLUMN."
(direction-to row column
[player-row self]
[player-column self]))
(define-method distance-to-player world (row column)
"Return the straight-line distance to the player from ROW, COLUMN."
(distance row column
[player-row self]
[player-column self]))
(define-method adjacent-to-player world (row column)
"Return non-nil when ROW, COLUMN is adjacent to the player."
(<= [distance-to-player self row column] 1.5))
(define-method obstacle-in-direction-p world (row column direction)
"Return non-nil when there is an obstacle one step in DIRECTION from ROW, COLUMN."
(multiple-value-bind (nrow ncol)
(step-in-direction row column direction)
[obstacle-at-p self nrow ncol]))
(define-method category-in-direction-p world (row column direction category)
"Return non-nil when there is a cell in CATEGORY one step in
DIRECTION from ROW, COLUMN. CATEGORY may be a list as well."
(multiple-value-bind (nrow ncol)
(step-in-direction row column direction)
[category-at-p self nrow ncol category]))
(define-method target-in-direction-p world (row column direction)
"Return non-nil when there is a target one step in DIRECTION from ROW, COLUMN."
(multiple-value-bind (nrow ncol)
(step-in-direction row column direction)
[category-at-p self nrow ncol :target]))
(define-method set-player world (player)
"Set PLAYER as the player object to which the World will forward
most user command messages. (See also the method `forward'.)"
(setf <player> player))
(define-method resolve-receiver world (receiver)
(case receiver
(:world self)
(:browser <browser>)
(:narrator <narrator>)
(:viewport <viewport>)
(:player <player>)))
(define-method process-messages world ()
"Process, narrate, and send all the messages in the queue.
The processing step allows the sender to specify the receiver
indirectly as a keyword symbol (like `:world', `:player', or
`:output'.) Any resulting queued messages are processed and sent, and
so on, until no more messages are generated."
(let ((player <player>))
(with-message-queue <message-queue>
(loop while (queued-messages-p) do
(destructuring-bind (sender method-key receiver args)
(unqueue-message)
(let ((rec (or [resolve-receiver self receiver]
receiver)))
;; (when (and <narrator>
;; ;; only narrate player-related messages
;; (or (eq player sender)
;; (eq player rec)))
;; ;; now print message
;; (when (not (zerop (field-value :verbosity <narrator>)))
;; [narrate-message <narrator> sender method-key rec args]))
;; stop everything if player dies
;(when (not [in-category player :dead])
(apply #'send sender method-key rec args)))))))
(define-method get-phase-number world ()
<phase-number>)
(define-method forward world (method-key &rest args)
"Send unhandled messages to the player object."
(assert <player>)
(when (or (eq :quit method-key)
(not <paused>))
(prog1 nil
(let ((player <player>)
(phase-number <phase-number>))
(with-message-queue <message-queue>
(when <narrator>
[narrate-message <narrator> nil method-key player args])
;; run the player
[run player]
;; send the message to the player, possibly generating queued messages
(apply #'send self method-key player args)
;; process any messages that were generated
[process-messages self])))))
(define-method run-cpu-phase-maybe world ()
"If this is the player's last turn, run the cpu phase. otherwise,
stay in player phase and exit. Always runs cpu when the engine is in
realtime mode."
(when (or *timer-p* (not [can-act player <phase-number>]))
[end-phase player]
(unless <exited>
(incf <phase-number>)
(when (not [in-category <player> :dead])
[run-cpu-phase self])
[begin-phase player])))
(define-method run-cpu-phase world (&optional timer-p)
"Run all non-player actor cells."
(declare (optimize (speed 3)))
(when (not <paused>)
(when timer-p
(incf <phase-number>))
(with-message-queue <message-queue>
(let ((cell nil)
(phase-number <phase-number>)
(player <player>)
(grid <grid>)
(categories nil))
(declare (type (simple-array vector (* *)) grid))
[run player]
[clear-light-grid self]
[clear-sprite-grid self]
(dotimes (i <height>)
(dotimes (j <width>)
(let ((cells (aref grid i j)))
(declare (vector cells))
(dotimes (z (fill-pointer cells))
(setf cell (aref cells z))
(setf categories (field-value :categories cell))
;; perform lighting
(when (or (member :player categories)
(member :light-source categories))
[render-lighting self cell])
(when (and (not (eq player cell))
(member :actor categories)
(not (member :dead categories)))
[begin-phase cell]
;; do cells
(loop while [can-act cell phase-number] do
[run cell]
[process-messages self]
[end-phase cell]))))))
;; run sprites
(dolist (sprite <sprites>)
[begin-phase sprite]
(loop while [can-act sprite phase-number] do
[run sprite]
[process-messages self]
[end-phase sprite]))
;; do sprite collisions
(when <sprite-table>
[collide-sprites self])))))
(defvar *lighting-hack-function* nil)
(define-method render-lighting world (cell)
"When lighting is activated, calculate lit squares using light
sources and ray casting."
(let* ((light-radius (field-value :light-radius cell))
(ambient <ambient-light>)
(light-grid <light-grid>)
(grid <grid>)
(source-row (field-value :row cell))
(source-column (field-value :column cell))
(total (+ light-radius
(if (numberp ambient) ambient 0)))
(octagon (make-array 100 :initial-element nil :adjustable t :fill-pointer 0))
(line (make-array 100 :initial-element nil :adjustable t :fill-pointer 0)))
(declare (type (simple-array vector (* *)) grid) (optimize (speed 3)))
;; don't bother lighting if everything is lit.
(when (not (eq :total ambient))
;; draw only odd-radius octagons that have a center pixel
(when (evenp total)
(incf total))
(labels ((light-square (row column)
(when (array-in-bounds-p light-grid row column)
(setf (aref light-grid row column) 1) nil))
(collect-line-point (x y)
(prog1 nil (vector-push-extend (list x y) line)))
;; (if (array-in-bounds-p light-grid x y)
;; (prog1 nil (vector-push-extend (list x y) line))
;; t))
(make-line (row column)
(setf (fill-pointer line) 0)
(let ((flipped (trace-line #'collect-line-point
source-column source-row
column row)))
;; Bresenham's swaps the input points around when x0 is to the
;; right of x1. We need to reverse the list of points if this
;; happens, otherwise shadows will be cast the wrong way.
(if flipped
(setf line (nreverse line))
;; Furthermore, when a non-flipped line is drawn, the endpoint
;; isn't actually visited, so we append it to the list. (Maybe this
;; is a bug in my implementation?)
;;
;; Make sure endpoint of ray is traced.
(when (array-in-bounds-p grid row column)
(vector-push-extend (list row column) line)))))
(light-line (row column)
(make-line row column)
(block lighting
(dotimes (i (fill-pointer line))
do (destructuring-bind (r c) (aref line i)
(when (array-in-bounds-p grid r c)
(light-square r c)
;; HACK
(when *lighting-hack-function*
(funcall *lighting-hack-function*
source-row source-column
r c))
;; should we stop lighting?
(when [category-at-p self r c :opaque] ;;'(:opaque :obstacle)]
(return-from lighting t)))))))
(collect-octagon-point (r c)
(vector-push-extend (list r c) octagon) nil)
(light-rectangle (row column radius)
(trace-rectangle #'light-square
(- row radius)
(- column radius)
(* 2 radius)
(* 2 radius)
:fill))
(light-octagon (row column radius)
(setf (fill-pointer octagon) 0)
(trace-octagon #'collect-octagon-point
row column radius :thicken)
(dotimes (i (fill-pointer octagon))
(destructuring-bind (row column) (aref octagon i)
;; HACK
;; (when *lighting-hack-funtcion*
;; (funcall *lighting-hack-function*
;; source-row source-column
;; row column ".red"))
(light-line row column)))))
(light-octagon source-row source-column total)
(light-octagon source-row source-column (- total 2))))))
(define-method clear-light-grid world ()
(unless <automapped>
(let ((light-grid <light-grid>))
(dotimes (i <height>)
(dotimes (j <width>)
(setf (aref light-grid i j) 0))))))
(define-method deserialize world (sexp)
"Load a saved world from Lisp data."
(declare (ignore sexp))
nil)
(define-method begin-ambient-loop world ()
"Begin looping your music for this world here."
nil)
(define-method describe world (&optional description)
(setf description (or description <description>))
(if (stringp description)
(dolist (line (split-string-on-lines description))
[>>narrateln :narrator line])
;; it's a formatted string
(dolist (line description)
(dolist (string line)
(apply #'send-queue nil :print :narrator string))
(send-queue nil :newline :narrator)
(send-queue nil :newline :narrator))))
(define-method start world ()
"Prepare the world for play."
(assert <player>)
;; start player at same phase (avoid free catch-up turns)
(message "STARTWORLD: ~S ~S" <phase-number> (field-value :phase-number <player>))
;; get everyone on the same turn.
(setf <phase-number> (+ 1 (field-value :phase-number <player>)))
(let ((grid <grid>)
(phase-number <phase-number>))
(dotimes (i <height>)
(dotimes (j <width>)
(do-cells (cell (aref grid i j))
(setf (field-value :phase-number cell) phase-number)))))
;; mark the world as entered
(setf <exited> nil)
;; light up the world
[render-lighting self <player>]
;; clear out any pending messages
(setf <message-queue> (make-queue))
(with-message-queue <message-queue>
[run-cpu-phase self]
(incf <phase-number>)
[start <player>]
[begin-phase <player>]
;; (when (has-method :show-location <player>)
;; [show-location <player>])
[after-start-method self]
[process-messages self])
[begin-ambient-loop self])
(define-method after-start-method world ()
nil)
(define-method set-viewport world (viewport)
"Set the viewport widget."
(setf <viewport> viewport))
(define-method delete-cell world (cell row column)
"Delete CELL from the grid at ROW, COLUMN."
(ecase (field-value :type cell)
(:cell
(let* ((grid <grid>)
(square (aref grid row column))
(start (position cell square :test #'eq)))
(declare (type (simple-array vector (* *)) grid)
(optimize (speed 3)))
(when start
(replace square square :start1 start :start2 (1+ start))
(decf (fill-pointer square)))))
(:sprite
[remove-sprite self cell])))
(define-method delete-category-at world (row column category)
"Delete all cells in CATEGORY at ROW, COLUMN in the grid.
The cells' :cancel method is invoked."
(let* ((grid <grid>))
(declare (type (simple-array vector (* *)) grid)
(optimize (speed 3)))
(when (array-in-bounds-p grid row column)
(setf (aref grid row column)
(delete-if #'(lambda (c) (when [in-category c category]
(prog1 t [cancel c])))
(aref grid row column))))))
(define-method line-of-sight world (r1 c1 r2 c2 &optional (category :obstacle))
"Return non-nil when there is a direct Bresenham's line of sight
along grid squares between R1,C1 and R2,C2."
(let ((grid <grid>))
(when (and (array-in-bounds-p grid r1 c1)
(array-in-bounds-p grid r2 c2))
(let ((line (make-array 100 :initial-element nil :adjustable t :fill-pointer 0))
(num-points 0)
(r0 r1)
(c0 c1))
(labels ((collect-point (&rest args)
(prog1 nil
(vector-push-extend args line)
(incf num-points))))
(let ((flipped (trace-line #'collect-point c1 r1 c2 r2)))
(if flipped
(setf line (nreverse line))
(when (array-in-bounds-p grid r2 c2)
(incf num-points)
(vector-push-extend (list c2 r2) line)))
(message "~S" line)
(let ((retval (block tracing
(let ((i 0))
(loop while (< i num-points) do
(destructuring-bind (x y) (aref line i)
(setf r0 x c0 y)
(when *lighting-hack-function*
(funcall *lighting-hack-function* r0 c0 r1 c1))
(if (and (= r0 r2)
(= c0 c2))
(return-from tracing t)
(when [category-at-p self r0 c0 category]
(return-from tracing nil))))
(incf i)))
(return-from tracing t))))
(prog1 retval nil))))))))
;; (message "tracing ~S" retval)))))))))
(define-method move-cell world (cell row column)
"Move CELL to ROW, COLUMN."
(let* ((old-row (field-value :row cell))
(old-column (field-value :column cell)))
[delete-cell self cell old-row old-column]
[drop-cell self cell row column]))
;;; The sprite layer. See also viewport.lisp
(define-method add-sprite world (sprite)
(pushnew sprite <sprites> :test 'equal))
(define-method remove-sprite world (sprite)
(setf <sprites> (delete sprite <sprites>)))
(define-method clear-sprite-grid world ()
(let ((grid <sprite-grid>))
(dotimes (i <height>)
(dotimes (j <width>)
(setf (fill-pointer (aref grid i j)) 0)))))
(define-method collide-sprites world (&optional sprites)
"Perform collision detection between sprites and the grid.
Sends a :do-collision message for every detected collision."
(with-field-values (width height tile-size sprite-grid sprite-table grid) self
(dolist (sprite (or sprites <sprites>))
;; figure out which grid squares we really need to scan
(let* ((x (field-value :x sprite))
(y (field-value :y sprite))
(left (1- (floor (/ x tile-size))))
(right (1+ (floor (/ (+ x (field-value :width sprite)) tile-size))))
(top (1- (floor (/ y tile-size))))
(bottom (1+ (floor (/ (+ y (field-value :height sprite)) tile-size)))))
;; find out which scanned squares actually intersect the sprite
;; (message "COLLIDE-SPRITES DEBUG: ~S" (list x y left right top bottom))
(block colliding
(dotimes (i (max 0 (- bottom top)))
(dotimes (j (max 0 (- right left)))
(let ((i0 (+ i top))
(j0 (+ j left)))
(when (array-in-bounds-p grid i0 j0)
(when [collide-* sprite
(* i0 tile-size)
(* j0 tile-size)
tile-size tile-size]
;; save this intersection information
(vector-push-extend sprite (aref sprite-grid i0 j0))
;; collide the sprite with the cells on this square
(do-cells (cell (aref grid i0 j0))
(when (and (or [in-category cell :target]
[in-category cell :obstacle])
[is-located cell])
[do-collision sprite cell]))))))))))
;; now find collisions with other sprites
;; we can re-use the sprite-grid data from earlier.
(let (collision num-sprites ix)
;; prepare to detect redundant collisions
(clrhash sprite-table)
(labels ((collide-first (&rest args)
(unless (gethash args sprite-table)
(setf (gethash args sprite-table) t)
(destructuring-bind (a b) args
[do-collision a b]))))
;; iterate over grid, reporting collisions
(dotimes (i height)
(dotimes (j width)
(setf collision (aref sprite-grid i j))
(setf num-sprites (length collision))
(when (< 1 num-sprites)
(dotimes (i (- num-sprites 1))
(setf ix (1+ i))
(loop do (let ((a (aref collision i))
(b (aref collision ix)))
(incf ix)
(assert (and (clon:object-p a) (clon:object-p b)))
(when (and (not (eq a b)) [collide a b])
(collide-first a b)))
while (< ix num-sprites))))))))))
;;; Universes are composed of connected worlds.
(defvar *universe* nil)
(defun normalize-address (address)
"Sort the plist ADDRESS so that its keys come in alphabetical order