-
Notifications
You must be signed in to change notification settings - Fork 26
/
plan.cpp
1637 lines (1471 loc) · 48.9 KB
/
plan.cpp
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
#include "ai.h"
#include "plan.h"
#include "debug.h"
#include "plan_setup.h"
#include <VTableInterpose.h>
#include "modules/Buildings.h"
#include "modules/Maps.h"
#include "modules/World.h"
#include "df/block_square_event_mineralst.h"
#include "df/building_civzonest.h"
#include "df/feature_init_outdoor_riverst.h"
#include "df/feature_outdoor_riverst.h"
#include "df/map_block.h"
#include "df/tile_designation.h"
#include "df/world.h"
#include "df/world_underground_region.h"
REQUIRE_GLOBAL(cur_year);
REQUIRE_GLOBAL(cur_year_tick);
REQUIRE_GLOBAL(world);
farm_allowed_materials_t::farm_allowed_materials_t()
{
set.insert(tiletype_material::GRASS_DARK);
set.insert(tiletype_material::GRASS_LIGHT);
set.insert(tiletype_material::GRASS_DRY);
set.insert(tiletype_material::GRASS_DEAD);
set.insert(tiletype_material::SOIL);
set.insert(tiletype_material::PLANT);
set.insert(tiletype_material::TREE);
}
farm_allowed_materials_t farm_allowed_materials;
Plan::Plan(AI & ai) :
ai(ai),
onupdate_handle(nullptr),
nrdig(),
tasks_generic(),
tasks_furniture(),
bg_idx_generic(tasks_generic.end()),
bg_idx_furniture(tasks_furniture.end()),
rooms_and_corridors(),
priorities(),
room_category(),
room_by_z(),
cache_nofurnish(),
fort_entrance(nullptr),
map_veins(),
important_workshops(),
important_workshops2(),
important_workshops3(),
m_c_lever_in(nullptr),
m_c_lever_out(nullptr),
m_c_cistern(nullptr),
m_c_reserve(nullptr),
m_c_testgate_delay(-1),
checkroom_idx(0),
trycistern_count(0),
map_vein_queue(),
dug_veins(),
noblesuite(-1),
cavern_max_level(-1),
last_idle_year(-1),
allow_ice(false),
should_search_for_metal(false),
past_initial_phase(false),
cistern_channel_requested(false),
deconstructed_wagons(false),
last_update_year(-1),
last_update_tick(-1)
{
add_task(task_type::check_rooms);
important_workshops.push_back(workshop_type::Butchers);
important_workshops.push_back(workshop_type::Quern);
important_workshops.push_back(workshop_type::Farmers);
important_workshops.push_back(workshop_type::Mechanics);
important_workshops.push_back(workshop_type::Still);
important_workshops2.push_back(furnace_type::Smelter);
important_workshops2.push_back(furnace_type::WoodFurnace);
important_workshops3.push_back(workshop_type::Loom);
important_workshops3.push_back(workshop_type::Craftsdwarfs);
important_workshops3.push_back(workshop_type::Tanners);
important_workshops3.push_back(workshop_type::Kitchen);
categorize_all();
}
Plan::~Plan()
{
for (auto it = tasks_generic.begin(); it != tasks_generic.end(); it++)
{
delete *it;
}
for (auto it = tasks_furniture.begin(); it != tasks_furniture.end(); it++)
{
delete *it;
}
for (auto it = rooms_and_corridors.begin(); it != rooms_and_corridors.end(); it++)
{
delete *it;
}
}
command_result Plan::startup(color_ostream & out)
{
if (Core::getInstance().isMapLoaded())
{
std::ifstream active_persist("data/save/current/df-ai-plan.dat");
if (active_persist.good())
{
load(active_persist);
return CR_OK;
}
}
std::ifstream persist(("data/save/" + World::ReadWorldFolder() + "/df-ai-plan.dat").c_str());
if (persist.good())
{
load(persist);
return CR_OK;
}
return setup_blueprint(out);
}
struct gathering_zone_hide_hook : df::building_civzonest {
typedef df::building_civzonest interpose_base;
DEFINE_VMETHOD_INTERPOSE(bool, isVisibleInViewport, (df::map_viewport *viewport))
{
if (this->zone_flags.whole == (T_zone_flags::mask_gather | T_zone_flags::mask_water_source | T_zone_flags::mask_active))
{
return false;
}
return INTERPOSE_NEXT(isVisibleInViewport)(viewport);
}
};
IMPLEMENT_VMETHOD_INTERPOSE(gathering_zone_hide_hook, isVisibleInViewport);
command_result Plan::onupdate_register(color_ostream &)
{
onupdate_handle = events.onupdate_register("df-ai plan", 240, 20, [this](color_ostream & out) { update(out); });
INTERPOSE_HOOK(gathering_zone_hide_hook, isVisibleInViewport).apply();
return CR_OK;
}
command_result Plan::onupdate_unregister(color_ostream &)
{
INTERPOSE_HOOK(gathering_zone_hide_hook, isVisibleInViewport).remove();
events.onupdate_unregister(onupdate_handle);
return CR_OK;
}
uint16_t Maps::getTileWalkable(df::coord t)
{
DFAI_ASSERT_VALID_TILE(t, "");
df::map_block *b = getTileBlock(t);
if (BOOST_LIKELY(b != nullptr))
return b->walkable[t.x & 0xf][t.y & 0xf];
return 0;
}
void AI::dig_tile(df::coord t, df::tile_dig_designation dig)
{
DFAI_ASSERT_VALID_TILE(t, " (designation: " << enum_item_key(dig) << ")");
if (BOOST_UNLIKELY(ENUM_ATTR(tiletype, material, *Maps::getTileType(t)) == tiletype_material::TREE && dig != tile_dig_designation::No))
{
dig = tile_dig_designation::Default;
t = Plan::find_tree_base(t);
}
df::tile_designation *des = Maps::getTileDesignation(t);
if (dig != tile_dig_designation::No && des->bits.dig == tile_dig_designation::No)
{
for (auto job : world->jobs.list)
{
if ((ENUM_ATTR(job_type, type, job->job_type) == job_type_class::Digging || ENUM_ATTR(job_type, type, job->job_type) == job_type_class::Gathering) && job->pos == t)
{
// someone already enroute to dig here, avoid 'Inappropriate
// dig square' spam
return;
}
}
}
des->bits.dig = dig;
Maps::getTileOccupancy(t)->bits.dig_marked = 0;
if (dig != tile_dig_designation::No)
{
auto block = Maps::getTileBlock(t);
block->flags.bits.designated = true;
block->dsgn_check_cooldown = 0;
}
}
// marks all items in room and its access for dumping
// return true if any item is found
bool Plan::dump_items_access(color_ostream & out, room *r)
{
bool found = false;
room_items(out, r, [&found](df::item *i)
{
found = true;
i->flags.bits.dump = 1;
});
for (auto it : r->accesspath)
{
found = dump_items_access(out, it) || found;
}
return found;
}
// yield every on_ground items in the room
void Plan::room_items(color_ostream &, room *r, std::function<void(df::item *)> f)
{
for (int16_t z = r->min.z; z <= r->max.z; z++)
{
for (int16_t x = r->min.x & -16; x <= r->max.x; x += 16)
{
for (int16_t y = r->min.y & -16; y <= r->max.y; y += 16)
{
auto & items = Maps::getTileBlock(x, y, z)->items;
for (auto id : items)
{
auto i = df::item::find(id);
if (BOOST_LIKELY(i && i->flags.bits.on_ground &&
r->min.x <= i->pos.x && i->pos.x <= r->max.x &&
r->min.y <= i->pos.y && i->pos.y <= r->max.y &&
z == i->pos.z))
{
f(i);
}
}
}
}
}
}
command_result Plan::make_map_walkable(color_ostream &)
{
events.onupdate_register_once("df-ai plan make_map_walkable", [this](color_ostream & out) -> bool
{
if (!Core::getInstance().isMapLoaded())
{
return true;
}
if (ai.find_room(room_type::corridor, [](room *r) -> bool { return r->corridor_type == corridor_type::walkable && r->status == room_status::dig; }))
{
return false;
}
// if we don't have a river, we're fine
df::coord river = scan_river(out);
if (!river.isValid())
return true;
df::coord surface = surface_tile_at(river.x, river.y);
if (surface.isValid() && ENUM_ATTR(tiletype, material, *Maps::getTileType(surface)) == tiletype_material::BROOK)
return true;
Plan *plan = this;
int16_t fort_miny = 0x7fff;
int16_t fort_maxy = -1;
for (room *r : rooms_and_corridors)
{
if (!r->outdoor && (r->type != room_type::corridor || r->corridor_type == corridor_type::corridor))
{
fort_miny = std::min(fort_miny, r->min.y);
fort_maxy = std::max(fort_maxy, r->max.y);
}
}
river = AI::spiral_search(river, [plan, fort_miny, fort_maxy](df::coord t) -> bool
{
// TODO rooms outline
if (t.y >= fort_miny && t.y <= fort_maxy)
return false;
df::tile_designation *td = Maps::getTileDesignation(t);
return td && td->bits.feature_local;
});
if (!river.isValid())
return true;
// find a safe place for the first tile
df::coord t1 = AI::spiral_search(river, [plan](df::coord t) -> bool
{
if (!plan->map_tile_in_rock(t))
return false;
df::coord st = plan->surface_tile_at(t.x, t.y);
return st.isValid() && plan->map_tile_in_rock(st + df::coord(0, 0, -1));
});
if (!t1.isValid())
return true;
t1 = surface_tile_at(t1.x, t1.y);
// if the game hasn't done any pathfinding yet, wait until the next frame and try again
uint16_t t1w = Maps::getTileWalkable(t1);
if (t1w == 0)
return false;
// find the second tile
df::coord t2 = AI::spiral_search(t1, [t1w](df::coord t) -> bool
{
uint16_t tw = Maps::getTileWalkable(t);
return tw != 0 && tw != t1w;
});
if (!t2.isValid())
return true;
uint16_t t2w = Maps::getTileWalkable(t2);
// make sure the second tile is in a safe place
t2 = AI::spiral_search(t2, [plan, t2w](df::coord t) -> bool
{
return Maps::getTileWalkable(t) == t2w && plan->map_tile_in_rock(t - df::coord(0, 0, 1));
});
if (!t2.isValid())
return true;
// find the bottom of the staircases
int16_t z = -1;
for (auto f = world->features.map_features.begin(); f != world->features.map_features.end(); f++)
{
df::feature_init_outdoor_riverst *r = virtual_cast<df::feature_init_outdoor_riverst>(*f);
if (r)
{
for (auto zz : r->feature->min_map_z)
{
if (zz > 0 && (z == -1 || z > zz))
{
z = zz;
}
}
break;
}
}
// make the corridors
std::vector<room *> cor;
cor.push_back(new room(corridor_type::walkable, t1, df::coord(t1, z)));
cor.push_back(new room(corridor_type::walkable, t2, df::coord(t2, z)));
int16_t dx = t1.x - t2.x;
if (-1 > dx)
cor.push_back(new room(corridor_type::walkable, df::coord(t1.x + 1, t1.y, z), df::coord(t2.x - 1, t1.y, z)));
else if (dx > 1)
cor.push_back(new room(corridor_type::walkable, df::coord(t1.x - 1, t1.y, z), df::coord(t2.x + 1, t1.y, z)));
int16_t dy = t1.y - t2.y;
if (-1 > dy)
cor.push_back(new room(corridor_type::walkable, df::coord(t2.x, t1.y + 1, z), df::coord(t2.x, t2.y - 1, z)));
else if (dy > 1)
cor.push_back(new room(corridor_type::walkable, df::coord(t2.x, t1.y - 1, z), df::coord(t2.x, t2.y + 1, z)));
if ((-1 > dx || dx > 1) && (-1 > dy || dy > 1))
cor.push_back(new room(corridor_type::walkable, df::coord(t2.x, t1.y, z), df::coord(t2.x, t1.y, z)));
for (auto c = cor.begin(); c != cor.end(); c++)
{
rooms_and_corridors.push_back(*c);
digroom(out, *c); // skip the queue
}
categorize_all();
return true;
});
return CR_OK;
}
static int32_t count_tile_bitmask(const df::tile_bitmask & mask)
{
static int8_t bits_set[] = {0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4};
int32_t count = 0;
for (int i = 0; i < df::tile_bitmask::SIZE; i++)
{
count += bits_set[(mask.bits[i] >> 0) & 0xf];
count += bits_set[(mask.bits[i] >> 4) & 0xf];
count += bits_set[(mask.bits[i] >> 8) & 0xf];
count += bits_set[(mask.bits[i] >> 12) & 0xf];
}
return count;
}
// scan the map, list all map veins in @map_veins (mat_index => [block coords],
// sorted by z)
command_result Plan::list_map_veins(color_ostream &)
{
map_veins.clear();
for (int16_t z = 0; z < world->map.z_count; z++)
{
for (int16_t xb = 0; xb < world->map.x_count_block; xb++)
{
for (int16_t yb = 0; yb < world->map.y_count_block; yb++)
{
df::map_block *block = world->map.block_index[xb][yb][z];
if (!block)
{
continue;
}
for (auto event : block->block_events)
{
if (auto vein = virtual_cast<df::block_square_event_mineralst>(event))
{
map_veins[vein->inorganic_mat].push_back(std::make_pair(block->map_pos, count_tile_bitmask(vein->tile_bitmask)));
}
}
}
}
}
return CR_OK;
}
static int32_t mat_index_vein(const df::map_block *block, df::coord t)
{
for (auto event : block->block_events)
{
if (auto mineral = virtual_cast<df::block_square_event_mineralst>(event))
{
if (mineral->getassignment(t.x & 0xf, t.y & 0xf))
{
return mineral->inorganic_mat;
}
}
}
return -1;
}
int32_t Plan::can_dig_vein(int32_t mat)
{
int32_t count = 0;
if (map_vein_queue.count(mat))
{
for (auto queued : map_vein_queue.at(mat))
{
df::map_block *block = Maps::getTileBlock(queued.first);
if (!block)
{
continue;
}
df::tiletype tt = block->tiletype[queued.first.x & 0xf][queued.first.y & 0xf];
if (ENUM_ATTR(tiletype_shape, basic_shape, ENUM_ATTR(tiletype, shape, tt)) == tiletype_shape_basic::Wall &&
ENUM_ATTR(tiletype, material, tt) == tiletype_material::MINERAL &&
mat_index_vein(block, queued.first) == mat)
{
count++;
}
}
}
if (map_veins.count(mat))
{
for (auto vein : map_veins.at(mat))
{
count += vein.second;
}
}
return count / 4;
}
// mark a vein of a mat for digging, return expected boulder count
int32_t Plan::dig_vein(color_ostream & out, int32_t mat, int32_t want_boulders)
{
// mat => [x, y, z, dig_mode] marked for to dig
int32_t count = 0;
// check previously queued veins
if (map_vein_queue.count(mat))
{
auto & q = map_vein_queue.at(mat);
q.erase(std::remove_if(q.begin(), q.end(), [this, mat, &count, &out](std::pair<df::coord, df::tile_dig_designation> d) -> bool
{
df::map_block *block = Maps::getTileBlock(d.first);
if (!block)
{
return true;
}
df::tiletype tt = block->tiletype[d.first.x & 0xf][d.first.y & 0xf];
df::tiletype_shape_basic sb = ENUM_ATTR(tiletype_shape, basic_shape, ENUM_ATTR(tiletype, shape, tt));
if (sb == tiletype_shape_basic::Open)
{
df::construction_type ctype = construction_type::Floor;
if (d.second == tile_dig_designation::Default)
{
ctype = construction_type::Floor;
}
else if (!find_enum_item(&ctype, ENUM_KEY_STR(tile_dig_designation, d.second)))
{
ai.debug(out, "[ERROR] could not find construction_type::" + ENUM_KEY_STR(tile_dig_designation, d.second));
return false;
}
std::ofstream discard;
return try_furnish_construction(out, ctype, d.first, discard);
}
if (sb != tiletype_shape_basic::Wall)
{
return true;
}
if (block->designation[d.first.x & 0xf][d.first.y & 0xf].bits.dig == tile_dig_designation::No) // warm/wet tile
{
AI::dig_tile(d.first, d.second);
}
if (ENUM_ATTR(tiletype, material, tt) == tiletype_material::MINERAL && mat_index_vein(block, d.first) == mat)
{
count++;
}
return false;
}), q.end());
if (q.empty())
{
map_vein_queue.erase(mat);
}
}
if (!map_veins.count(mat))
{
return count / 4;
}
// queue new vein
// delete it from map_veins
// discard tiles that would dig into a plan room/corridor, or into a cavern
// (hidden + !wall)
// try to find a vein close to one we already dug
for (size_t i = 0; i < 16; i++)
{
if (count / 4 >= want_boulders && (want_boulders || i))
{
break;
}
auto & veins = map_veins.at(mat);
auto it = std::find_if(veins.begin(), veins.end(), [this](std::pair<df::coord, int32_t> c) -> bool
{
for (int16_t vx = -1; vx <= 1; vx++)
{
for (int16_t vy = -1; vy <= 1; vy++)
{
if (dug_veins.count(c.first + df::coord(16 * vx, 16 * vy, 0)))
{
return true;
}
}
}
return false;
});
if (it == veins.end())
{
it--;
}
auto v = *it;
if (want_boulders)
{
map_veins.at(mat).erase(it);
}
int32_t cnt = do_dig_vein(out, mat, v.first, !want_boulders);
if (cnt > 0 && want_boulders)
{
dug_veins.insert(v.first);
}
count += cnt;
if (map_veins.at(mat).empty())
{
map_veins.erase(mat);
break;
}
}
return count / 4;
}
int32_t Plan::do_dig_vein(color_ostream & out, int32_t mat, df::coord b, bool plan_only)
{
if (!plan_only)
{
ai.debug(out, "dig_vein " + world->raws.inorganics[mat]->id);
}
int32_t count = 0;
int16_t fort_miny = 0x7fff;
int16_t fort_maxy = -1;
int16_t fort_minz = 0x7fff;
for (room *r : rooms_and_corridors)
{
if (!r->outdoor && (r->type != room_type::corridor || r->corridor_type == corridor_type::corridor))
{
fort_miny = std::min(fort_miny, r->min.y);
fort_maxy = std::max(fort_maxy, r->max.y);
fort_minz = std::min(fort_minz, r->min.z);
}
}
std::set<df::coord> disallow_tile;
if (b.z >= fort_minz && b.y > fort_miny && b.y < fort_maxy)
{
for (uint16_t dx = 0; dx < 16; dx++)
{
for (uint16_t dy = 0; dy < 16; dy++)
{
df::coord c = b + df::coord(dx, dy, 0);
auto r = ai.find_room_at(c);
if (r && (r->type != room_type::corridor || r->corridor_type != corridor_type::veinshaft || r->include(c)))
{
disallow_tile.insert(c);
}
}
}
}
auto & q = map_vein_queue[mat];
// dig whole block
// TODO have the dwarves search for the vein
// TODO mine in (visible?) chunks
DFAI_ASSERT_VALID_TILE(b, " (base position for dig_vein(" << world->raws.inorganics[mat]->id << ")");
df::map_block *block = Maps::getTileBlock(b);
int16_t minx = 16, maxx = -1, miny = 16, maxy = -1;
for (int16_t dx = 0; dx < 16; dx++)
{
if (b.x + dx == 0 || b.x + dx >= world->map.x_count - 1)
continue;
for (int16_t dy = 0; dy < 16; dy++)
{
if (b.y + dy == 0 || b.y + dy >= world->map.y_count - 1)
continue;
df::coord t = b + df::coord(dx, dy, 0);
if (ENUM_ATTR(tiletype, material, block->tiletype[dx][dy]) == tiletype_material::MINERAL && mat_index_vein(block, t) == mat)
{
minx = std::min(minx, dx);
maxx = std::max(maxx, dx);
miny = std::min(miny, dy);
maxy = std::max(maxy, dy);
}
}
}
if (minx > maxx)
return count;
bool need_shaft = true;
std::vector<std::pair<df::coord, df::tile_dig_designation>> todo;
for (int16_t dx = minx; dx <= maxx; dx++)
{
for (int16_t dy = miny; dy <= maxy; dy++)
{
df::coord t = b + df::coord(dx, dy, 0);
if (!Maps::isValidTilePos(t) || disallow_tile.count(t))
{
continue;
}
if (Maps::getTileDesignation(t)->bits.dig == tile_dig_designation::No)
{
bool ok = true;
bool ns = need_shaft;
for (int16_t ddx = -1; ddx <= 1; ddx++)
{
for (int16_t ddy = -1; ddy <= 1; ddy++)
{
df::coord tt = t + df::coord(ddx, ddy, 0);
if (ENUM_ATTR(tiletype_shape, basic_shape, ENUM_ATTR(tiletype, shape, *Maps::getTileType(tt))) != tiletype_shape_basic::Wall)
{
if (Maps::getTileDesignation(tt)->bits.hidden)
{
ok = false;
}
else
{
ns = false;
}
}
else if (Maps::getTileDesignation(tt)->bits.dig != tile_dig_designation::No)
{
ns = false;
}
}
}
if (ok)
{
todo.push_back(std::make_pair(t, tile_dig_designation::Default));
if (ENUM_ATTR(tiletype, material, *Maps::getTileType(t)) == tiletype_material::MINERAL && mat_index_vein(block, t) == mat)
{
count++;
}
need_shaft = ns;
}
}
}
}
if (!plan_only)
{
for (auto d : todo)
{
q.push_back(d);
AI::dig_tile(d.first, d.second);
}
}
if (need_shaft)
{
df::coord t0{ uint16_t(b.x + (minx + maxx) / 2), uint16_t(b.y + (miny + maxy) / 2), uint16_t(b.z) };
room *r = find_typed_corridor(out, corridor_type::veinshaft, t0);
if (r)
{
categorize_all();
if (!plan_only)
{
digroom(out, r);
}
}
}
return count;
}
// check that tile is surrounded by solid rock/soil walls
bool Plan::map_tile_in_rock(df::coord tile)
{
for (int16_t dx = -1; dx <= 1; dx++)
{
for (int16_t dy = -1; dy <= 1; dy++)
{
df::tiletype *tt = Maps::getTileType(tile + df::coord(dx, dy, 0));
if (!tt)
{
return false;
}
if (ENUM_ATTR(tiletype_shape, basic_shape, ENUM_ATTR(tiletype, shape, *tt)) != tiletype_shape_basic::Wall)
{
return false;
}
df::tiletype_material tm = ENUM_ATTR(tiletype, material, *tt);
if (tm != tiletype_material::STONE && tm != tiletype_material::MINERAL && tm != tiletype_material::SOIL && tm != tiletype_material::ROOT && (!allow_ice || tm != tiletype_material::FROZEN_LIQUID))
{
return false;
}
}
}
return true;
}
// check tile is surrounded by solid walls or visible tile
bool Plan::map_tile_nocavern(df::coord tile)
{
for (int16_t dx = -1; dx <= 1; dx++)
{
for (int16_t dy = -1; dy <= 1; dy++)
{
df::coord t = tile + df::coord(dx, dy, 0);
df::tile_designation *td = Maps::getTileDesignation(t);
if (!td)
{
continue;
}
if (!td->bits.hidden)
{
if (td->bits.flow_size >= 4)
return false;
if (!allow_ice && ENUM_ATTR(tiletype, material, *Maps::getTileType(t)) == tiletype_material::FROZEN_LIQUID)
return false;
continue;
}
df::tiletype tt = *Maps::getTileType(t);
if (ENUM_ATTR(tiletype_shape, basic_shape, ENUM_ATTR(tiletype, shape, tt)) != tiletype_shape_basic::Wall)
{
return false;
}
df::tiletype_material tm = ENUM_ATTR(tiletype, material, tt);
if (tm != tiletype_material::STONE && tm != tiletype_material::MINERAL && tm != tiletype_material::SOIL && tm != tiletype_material::ROOT && (!allow_ice || tm != tiletype_material::FROZEN_LIQUID))
{
return false;
}
}
}
return true;
}
// check tile is a hidden floor
bool Plan::map_tile_cavernfloor(df::coord t)
{
df::tile_designation *td = Maps::getTileDesignation(t);
if (!td)
return false;
if (!td->bits.hidden)
return false;
if (td->bits.flow_size != 0)
return false;
df::tiletype tt = *Maps::getTileType(t);
df::tiletype_material tm = ENUM_ATTR(tiletype, material, tt);
if (tm != tiletype_material::STONE && tm != tiletype_material::MINERAL && tm != tiletype_material::SOIL && tm != tiletype_material::ROOT && tm != tiletype_material::GRASS_LIGHT && tm != tiletype_material::GRASS_DARK && tm != tiletype_material::PLANT && tm != tiletype_material::SOIL)
return false;
return ENUM_ATTR(tiletype_shape, basic_shape, ENUM_ATTR(tiletype, shape, tt)) == tiletype_shape_basic::Floor;
}
bool Plan::map_tile_undiscovered_cavern(df::coord t)
{
df::tile_designation *td = Maps::getTileDesignation(t);
if (!td->bits.feature_global)
{
return false;
}
auto region = df::world_underground_region::find(Maps::getTileBlock(t)->global_feature);
if (!region || !region->feature_init)
{
return false;
}
return !region->feature_init->flags.is_set(feature_init_flags::Discovered);
}
std::string Plan::status()
{
std::map<task_type::type, size_t> task_count;
std::map<layout_type::type, std::set<df::coord>> furnishing;
for (auto t : tasks_generic)
{
task_count[t->type]++;
}
for (auto t : tasks_furniture)
{
task_count[t->type]++;
if (!t->f->type == layout_type::none)
{
furnishing[t->f->type].insert(t->r->min + t->f->pos);
}
}
std::ostringstream s;
bool first = true;
for (auto tc = task_count.begin(); tc != task_count.end(); tc++)
{
if (first)
{
first = false;
}
else
{
s << ", ";
}
s << tc->first << ": " << tc->second;
}
if (task *t = is_digging())
{
if (t->type == task_type::dig_room || t->type == task_type::dig_room_immediate)
{
s << ", digging: " << AI::describe_room(t->r);
}
else if (t->type == task_type::want_dig)
{
s << ", waiting to dig: " << AI::describe_room(t->r);
}
}
first = true;
for (auto f = furnishing.begin(); f != furnishing.end(); f++)
{
if (first)
{
first = false;
s << "\nfurnishing: ";
}
else
{
s << ", ";
}
s << f->first << ": " << f->second.size();
}
return s.str();
}
static void report_task(std::ostream & out, bool html, task *t)
{
if (html)
{
out << "<b>" << t->type << "</b>";
}
else
{
out << "- " << t->type;
}
if (t->r != nullptr)
{
if (t->type == task_type::want_dig || t->type == task_type::dig_room || t->type == task_type::dig_room_immediate)
{
out << " (queue " << t->r->queue << ")";
}
if (html)
{
out << "<br/>";
}
else
{
out << "\n ";
}
out << AI::describe_room(t->r, html);
}
if (t->f != nullptr)
{
if (html)
{
out << "<br/>";
}
else
{
out << "\n ";
}
out << AI::describe_furniture(t->f, html);
}
if (!t->last_status.empty())
{
if (html)
{
out << "<br/><i>" << html_escape(t->last_status) << "</i>";
}
else
{
out << "\n " << t->last_status;
}
}
}
void Plan::report_helper(std::ostream & out, bool html, const std::string & title, const std::list<task *> & tasks, const std::list<task *>::iterator & bg_idx, const std::set<task *> & seen_tasks)
{
if (html)
{
out << "<h2 id=\"Plan_Tasks_" << title << "\">" << title << "</h2><ul>";
}
else
{
out << "## Tasks\n### " << title << "\n";
}
for (auto it = tasks.begin(); it != tasks.end(); it++)
{
if (seen_tasks.count(*it) && bg_idx != it)
{
continue;
}
if (html)
{
out << "<li>";
}
if (bg_idx == it)
{
if (html)
{
out << "<i>--- current position ---</i><br/>";
}
else
{
out << "--- current position ---\n";
}
}
if (!seen_tasks.count(*it))
{
report_task(out, html, *it);
}
out << (html ? "</li>" : "\n");
}
if (html)
{
out << "</ul>";
}
if (bg_idx == tasks.end())
{