-
-
Notifications
You must be signed in to change notification settings - Fork 69
/
Copy pathmachine.hpp
17819 lines (14168 loc) · 529 KB
/
machine.hpp
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
// HFSM2 (hierarchical state machine for games and interactive applications)
// 2.7.0 (2025-04-17)
//
// Created by Andrew Gresyk
//
// Licensed under the MIT License;
// you may not use this file except in compliance with the License.
//
//
// MIT License
//
// Copyright (c) 2025
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
#pragma once
#define HFSM2_VERSION_MAJOR 2
#define HFSM2_VERSION_MINOR 7
#define HFSM2_VERSION_PATCH 0
#define HFSM2_VERSION (10000 * HFSM2_VERSION_MAJOR + 100 * HFSM2_VERSION_MINOR + HFSM2_VERSION_PATCH)
#include <stdint.h> // uint32_t, uint64_t
#include <string.h> // memcpy_s()
#include <new>
#ifndef HFSM2_DISABLE_TYPEINDEX
#include <typeindex>
#endif
#if defined _DEBUG && _MSC_VER
#include <intrin.h> // __debugbreak()
#endif
#define HFSM2_UNUSED(x)
#define HFSM2_ATTRIBUTE(A) HFSM2_ATTRIBUTE_##A()
#ifndef __has_cpp_attribute
#define __has_cpp_attribute(x) 0
#endif
#if __has_cpp_attribute(fallthrough)
#define HFSM2_ATTRIBUTE_FALLTHROUGH() [[fallthrough]]
#elif __has_cpp_attribute(clang::fallthrough)
#define HFSM2_ATTRIBUTE_FALLTHROUGH() [[clang::fallthrough]]
#elif __has_cpp_attribute(gnu::fallthrough)
#define HFSM2_ATTRIBUTE_FALLTHROUGH() [[gnu::fallthrough]]
#else
#define HFSM2_ATTRIBUTE_FALLTHROUGH()
#endif
#if __has_cpp_attribute(no_unique_address)
#define HFSM2_ATTRIBUTE_NO_UNIQUE_ADDRESS() [[no_unique_address]]
#else
#define HFSM2_ATTRIBUTE_NO_UNIQUE_ADDRESS()
#endif
#define HFSM2_CONSTEXPR(A) HFSM2_CONSTEXPR_##A()
#define HFSM2_CONSTEXPR_NO()
#define HFSM2_CONSTEXPR_11() constexpr
#if __cplusplus >= 201402L
#define HFSM2_CONSTEXPR_14() constexpr
#else
#define HFSM2_CONSTEXPR_14() inline
#endif
#if __cplusplus >= 201703L
#define HFSM2_CONSTEXPR_17() constexpr
#else
#define HFSM2_CONSTEXPR_17() inline
#endif
#if __cplusplus >= 202002L
#define HFSM2_CONSTEXPR_20() constexpr
#else
#define HFSM2_CONSTEXPR_20() inline
#endif
#if defined _MSC_VER
#define HFSM2_EMPTY_BASES __declspec(empty_bases)
#else
#define HFSM2_EMPTY_BASES
#endif
#define HFSM2_ARCHITECTURE(A) HFSM2_ARCHITECTURE_##A()
#if INTPTR_MAX == INT64_MAX
#define HFSM2_ARCHITECTURE_64BIT() true
#define HFSM2_ARCHITECTURE_32BIT() false
#define HFSM2_64BIT_OR_32BIT(p64, p32) p64
#elif INTPTR_MAX == INT32_MAX
#define HFSM2_ARCHITECTURE_64BIT() false
#define HFSM2_ARCHITECTURE_32BIT() true
#define HFSM2_64BIT_OR_32BIT(p64, p32) p32
#else
#error
#endif
#if defined _DEBUG && defined _MSC_VER
#define HFSM2_BREAK() __debugbreak()
#define HFSM2_BREAK_AVAILABLE() true
#else
#define HFSM2_BREAK() ((void) 0)
#define HFSM2_BREAK_AVAILABLE() false
#endif
#ifdef _DEBUG
#define HFSM2_IF_DEBUG(...) __VA_ARGS__
#define HFSM2_UNLESS_DEBUG(...)
#define HFSM2_DEBUG_OR(y, n) y
#else
#define HFSM2_IF_DEBUG(...)
#define HFSM2_UNLESS_DEBUG(...) __VA_ARGS__
#define HFSM2_DEBUG_OR(y, n) n
#endif
#if HFSM2_BREAK_AVAILABLE() && defined HFSM2_ENABLE_ASSERT
#define HFSM2_ASSERT_AVAILABLE() true
#define HFSM2_IF_ASSERT(...) __VA_ARGS__
#define HFSM2_CHECKED(x) (!!(x) || (HFSM2_BREAK(), 0))
#define HFSM2_ASSERT(x) (!!(x) || (HFSM2_BREAK(), 0))
#define HFSM2_ASSERT_OR(y, n) y
#else
#define HFSM2_ASSERT_AVAILABLE() false
#define HFSM2_IF_ASSERT(...)
#define HFSM2_CHECKED(x) x
#define HFSM2_ASSERT(x) ((void) 0)
#define HFSM2_ASSERT_OR(y, n) n
#endif
#if defined _MSC_VER || defined __clang_major__ && __clang_major__ >= 7
#define HFSM2_EXPLICIT_MEMBER_SPECIALIZATION_AVAILABLE() true
#else
#define HFSM2_EXPLICIT_MEMBER_SPECIALIZATION_AVAILABLE() false
#endif
#ifdef HFSM2_ENABLE_ALL
#define HFSM2_ENABLE_DEBUG_STATE_TYPE
#define HFSM2_ENABLE_PLANS
#define HFSM2_ENABLE_SERIALIZATION
#define HFSM2_ENABLE_STRUCTURE_REPORT
#define HFSM2_ENABLE_TRANSITION_HISTORY
#define HFSM2_ENABLE_UTILITY_THEORY
#endif
#ifndef HFSM2_DISABLE_TYPEINDEX
#define HFSM2_TYPEINDEX_AVAILABLE() true
#define HFSM2_IF_TYPEINDEX(...) __VA_ARGS__
#define HFSM2_TYPEINDEX_MASK (1 << 0)
#else
#define HFSM2_TYPEINDEX_AVAILABLE() false
#define HFSM2_IF_TYPEINDEX(...)
#define HFSM2_TYPEINDEX_MASK (0 << 0)
#endif
#ifdef HFSM2_ENABLE_DEBUG_STATE_TYPE
#define HFSM2_DEBUG_STATE_TYPE_AVAILABLE() true
#define HFSM2_DEBUG_STATE_TYPE_MASK (1 << 1)
#else
#define HFSM2_DEBUG_STATE_TYPE_AVAILABLE() false
#define HFSM2_DEBUG_STATE_TYPE_MASK (0 << 1)
#endif
#ifdef HFSM2_ENABLE_PLANS
#define HFSM2_PLANS_AVAILABLE() true
#define HFSM2_IF_PLANS(...) __VA_ARGS__
#define HFSM2_PLANS_MASK (1 << 2)
#else
#define HFSM2_PLANS_AVAILABLE() false
#define HFSM2_IF_PLANS(...)
#define HFSM2_PLANS_MASK (0 << 2)
#endif
#ifdef HFSM2_ENABLE_SERIALIZATION
#define HFSM2_SERIALIZATION_AVAILABLE() true
#define HFSM2_IF_SERIALIZATION(...) __VA_ARGS__
#define HFSM2_SERIALIZATION_MASK (1 << 3)
#else
#define HFSM2_SERIALIZATION_AVAILABLE() false
#define HFSM2_IF_SERIALIZATION(...)
#define HFSM2_SERIALIZATION_MASK (0 << 3)
#endif
#ifdef HFSM2_ENABLE_STRUCTURE_REPORT
#define HFSM2_STRUCTURE_REPORT_AVAILABLE() true
#define HFSM2_IF_STRUCTURE_REPORT(...) __VA_ARGS__
#define HFSM2_STRUCTURE_REPORT_MASK (1 << 4)
#else
#define HFSM2_STRUCTURE_REPORT_AVAILABLE() false
#define HFSM2_IF_STRUCTURE_REPORT(...)
#define HFSM2_STRUCTURE_REPORT_MASK (0 << 4)
#endif
#ifdef HFSM2_ENABLE_TRANSITION_HISTORY
#define HFSM2_TRANSITION_HISTORY_AVAILABLE() true
#define HFSM2_IF_TRANSITION_HISTORY(...) __VA_ARGS__
#define HFSM2_TRANSITION_HISTORY_MASK (1 << 5)
#else
#define HFSM2_TRANSITION_HISTORY_AVAILABLE() false
#define HFSM2_IF_TRANSITION_HISTORY(...)
#define HFSM2_TRANSITION_HISTORY_MASK (0 << 5)
#endif
#ifdef HFSM2_ENABLE_UTILITY_THEORY
#define HFSM2_UTILITY_THEORY_AVAILABLE() true
#define HFSM2_IF_UTILITY_THEORY(...) __VA_ARGS__
#define HFSM2_UTILITY_THEORY_MASK (1 << 6)
#else
#define HFSM2_UTILITY_THEORY_AVAILABLE() false
#define HFSM2_IF_UTILITY_THEORY(...)
#define HFSM2_UTILITY_THEORY_MASK (0 << 6)
#endif
#ifdef HFSM2_ENABLE_VERBOSE_DEBUG_LOG
#define HFSM2_ENABLE_LOG_INTERFACE
#define HFSM2_VERBOSE_DEBUG_LOG_AVAILABLE() true
#define HFSM2_VERBOSE_DEBUG_LOG_MASK (1 << 7)
#else
#define HFSM2_VERBOSE_DEBUG_LOG_AVAILABLE() false
#define HFSM2_VERBOSE_DEBUG_LOG_MASK (0 << 7)
#endif
#ifdef HFSM2_ENABLE_LOG_INTERFACE
#define HFSM2_LOG_INTERFACE_AVAILABLE() true
#define HFSM2_IF_LOG_INTERFACE(...) __VA_ARGS__
#define HFSM2_LOG_INTERFACE_MASK (1 << 8)
#define HFSM2_LOG_TRANSITION(CONTEXT, ORIGIN, TYPE, DESTINATION) \
if (_core.logger) \
_core.logger->recordTransition(CONTEXT, ORIGIN, TYPE, DESTINATION)
#if HFSM2_PLANS_AVAILABLE()
#define HFSM2_LOG_TASK_STATUS(CONTEXT, REGION, ORIGIN, STATUS) \
if (_core.logger) \
_core.logger->recordTaskStatus(CONTEXT, REGION, ORIGIN, STATUS)
#define HFSM2_LOG_PLAN_STATUS(CONTEXT, REGION, STATUS) \
if (_core.logger) \
_core.logger->recordPlanStatus(CONTEXT, REGION, STATUS)
#endif
#define HFSM2_LOG_CANCELLED_PENDING(CONTEXT, ORIGIN) \
if (_core.logger) \
_core.logger->recordCancelledPending(CONTEXT, ORIGIN)
#define HFSM2_LOG_SELECT_RESOLUTION(CONTEXT, HEAD, PRONG) \
if (auto* const logger = control._core.logger) \
logger->recordSelectResolution(CONTEXT, HEAD, PRONG)
#if HFSM2_UTILITY_THEORY_AVAILABLE()
#define HFSM2_LOG_UTILITY_RESOLUTION(CONTEXT, HEAD, PRONG, UTILITY) \
if (auto* const logger = control._core.logger) \
logger->recordUtilityResolution(CONTEXT, HEAD, PRONG, UTILITY)
#define HFSM2_LOG_RANDOM_RESOLUTION(CONTEXT, HEAD, PRONG, UTILITY) \
if (auto* const logger = control._core.logger) \
logger->recordRandomResolution(CONTEXT, HEAD, PRONG, UTILITY)
#endif
#else
#define HFSM2_LOG_INTERFACE_AVAILABLE() false
#define HFSM2_IF_LOG_INTERFACE(...)
#define HFSM2_LOG_INTERFACE_MASK (0 << 8)
#define HFSM2_LOG_TRANSITION(CONTEXT, ORIGIN, TYPE, DESTINATION)
#if HFSM2_PLANS_AVAILABLE()
#define HFSM2_LOG_TASK_STATUS(CONTEXT, REGION, ORIGIN, STATUS)
#define HFSM2_LOG_PLAN_STATUS(CONTEXT, REGION, STATUS)
#endif
#define HFSM2_LOG_CANCELLED_PENDING(CONTEXT, ORIGIN)
#define HFSM2_LOG_SELECT_RESOLUTION(CONTEXT, HEAD, PRONG)
#if HFSM2_UTILITY_THEORY_AVAILABLE()
#define HFSM2_LOG_UTILITY_RESOLUTION(CONTEXT, HEAD, PRONG, UTILITY)
#define HFSM2_LOG_RANDOM_RESOLUTION(CONTEXT, HEAD, PRONG, UTILITY)
#endif
#endif
#if HFSM2_VERBOSE_DEBUG_LOG_AVAILABLE()
#define HFSM2_LOG_STATE_METHOD(METHOD, METHOD_ID) \
if (auto* const logger = control._core.logger) \
logger->recordMethod(control.context(), STATE_ID, METHOD_ID)
#define HFSM2_IF_LOG_STATE_METHOD(...) __VA_ARGS__
#define HFSM2_IF_PLANS_OR_LOG_STATE_METHOD(...) __VA_ARGS__
#elif HFSM2_LOG_INTERFACE_AVAILABLE()
#define HFSM2_LOG_STATE_METHOD(METHOD, METHOD_ID) \
if (auto* const logger = control._core.logger) \
log(METHOD, *logger, control.context(), METHOD_ID)
#define HFSM2_IF_LOG_STATE_METHOD(...) __VA_ARGS__
#define HFSM2_IF_PLANS_OR_LOG_STATE_METHOD(...) __VA_ARGS__
#else
#define HFSM2_LOG_STATE_METHOD(METHOD, METHOD_ID)
#define HFSM2_IF_LOG_STATE_METHOD(...)
#if HFSM2_PLANS_AVAILABLE()
#define HFSM2_IF_PLANS_OR_LOG_STATE_METHOD(...) __VA_ARGS__
#else
#define HFSM2_IF_PLANS_OR_LOG_STATE_METHOD(...)
#endif
#endif
namespace hfsm2 {
using FeatureTag = uint16_t;
constexpr FeatureTag HFSM2_FEATURE_TAG = HFSM2_TYPEINDEX_MASK
| HFSM2_DEBUG_STATE_TYPE_MASK
| HFSM2_PLANS_MASK
| HFSM2_SERIALIZATION_MASK
| HFSM2_STRUCTURE_REPORT_MASK
| HFSM2_TRANSITION_HISTORY_MASK
| HFSM2_UTILITY_THEORY_MASK
| HFSM2_VERBOSE_DEBUG_LOG_MASK
| HFSM2_LOG_INTERFACE_MASK;
}
#undef HFSM2_TYPEINDEX_MASK
#undef HFSM2_DEBUG_STATE_TYPE_MASK
#undef HFSM2_PLANS_MASK
#undef HFSM2_SERIALIZATION_MASK
#undef HFSM2_STRUCTURE_REPORT_MASK
#undef HFSM2_TRANSITION_HISTORY_MASK
#undef HFSM2_UTILITY_THEORY_MASK
#undef HFSM2_VERBOSE_DEBUG_LOG_MASK
#undef HFSM2_LOG_INTERFACE_MASK
#if _MSC_VER == 1900
#pragma warning(push)
#pragma warning(disable: 4814) // in C++14 'constexpr' will not imply 'const'; consider explicitly specifying 'const'
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Wextra-semi" // error : extra ';' inside a class
#pragma clang diagnostic ignored "-Wconstexpr-not-const" // error: 'constexpr' non-static member function will not be implicitly 'const' in C++14; add 'const' to avoid a change in behavior
#endif
#if defined(__GNUC__) || defined(__GNUG__)
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wpedantic" // error : extra ';'
#endif
namespace hfsm2 {
struct EmptyPayload final {};
struct Automatic;
struct Manual;
struct TopDown;
struct BottomUp;
using Short = uint8_t;
static constexpr Short INVALID_SHORT = UINT8_MAX;
using Prong = Short;
static constexpr Prong INVALID_PRONG = INVALID_SHORT;
using RegionID = Short;
static constexpr RegionID INVALID_REGION_ID = INVALID_SHORT;
using ForkID = int8_t;
static constexpr ForkID INVALID_FORK_ID = INT8_MIN;
using Long = uint16_t;
static constexpr Long INVALID_LONG = UINT16_MAX;
using StateID = Long;
static constexpr StateID INVALID_STATE_ID = INVALID_LONG;
template <
bool B
, typename TT
, typename TF
>
struct ConditionalT final {
using Type = TT;
};
template <
typename TT
, typename TF
>
struct ConditionalT<false, TT, TF> final {
using Type = TF;
};
template <
bool B
, typename TT
, typename TF
>
using Conditional = typename ConditionalT<B, TT, TF>::Type;
template <typename T>
struct RemoveConstT final {
using Type = T;
};
template <typename T>
struct RemoveConstT<const T> final {
using Type = T;
};
template <typename T>
using RemoveConst = typename RemoveConstT<T>::Type;
template <typename T>
struct RemoveReferenceT final {
using Type = T;
};
template <typename T>
struct RemoveReferenceT<T&> final {
using Type = T;
};
template <typename T>
struct RemoveReferenceT<T&&> final {
using Type = T;
};
template <typename T>
using RemoveReference = typename RemoveReferenceT<T>::Type;
template <typename T>
using Undecorate = RemoveConst<RemoveReference<T>>;
template <typename T>
struct IsValueReferenceT final {
static const bool VALUE = false;
};
template <typename T>
struct IsValueReferenceT<T&> final {
static const bool VALUE = true;
};
template <uint64_t N>
using UIndex = Conditional<N <= (1ull << 8), uint8_t,
Conditional<N <= (1ull << 16), uint16_t,
Conditional<N <= (1ull << 32), uint32_t,
void>>>;
template <uint64_t N>
using UCapacity = Conditional<N < (1ull << 8), uint8_t,
Conditional<N < (1ull << 16), uint16_t,
Conditional<N < (1ull << 32), uint32_t,
void>>>;
HFSM2_CONSTEXPR(11)
Short
bitContain(const Short v) noexcept {
return v <= 1 << 0 ? 0 :
v <= 1 << 1 ? 1 :
v <= 1 << 2 ? 2 :
v <= 1 << 3 ? 3 :
v <= 1 << 4 ? 4 :
v <= 1 << 5 ? 5 :
v <= 1 << 6 ? 6 :
v <= 1 << 7 ? 7 :
8 ;
}
template <uint64_t N>
using UBitWidth = Conditional<N <= 8, uint8_t,
Conditional<N <= 16, uint16_t,
Conditional<N <= 32, uint32_t,
void>>>;
template <typename T>
HFSM2_CONSTEXPR(11)
T&&
forward(RemoveReference<T>& t) noexcept {
return static_cast<T&&>(t);
}
template <typename T>
HFSM2_CONSTEXPR(11)
T&&
forward(RemoveReference<T>&& t) noexcept {
static_assert(!IsValueReferenceT<T>::VALUE, "");
return static_cast<T&&>(t);
}
template <typename T>
HFSM2_CONSTEXPR(11)
RemoveReference<T>&&
move(T&& t) noexcept {
return static_cast<RemoveReference<T>&&>(t);
}
template <
typename T0
, typename T1
>
HFSM2_CONSTEXPR(11)
T0
min(const T0 t0,
const T1 t1) noexcept
{
return t0 < static_cast<T0>(t1) ?
t0 : static_cast<T0>(t1);
}
template <
typename T0
, typename T1
>
HFSM2_CONSTEXPR(11)
T0
max(const T0 t0,
const T1 t1) noexcept
{
return t0 > static_cast<T0>(t1) ?
t0 : static_cast<T0>(t1);
}
template <
typename TIndex
, typename TElement
, TIndex NCount
>
HFSM2_CONSTEXPR(11)
TIndex
count(const TElement (&)[NCount]) noexcept {
return NCount;
}
template <
typename T
, typename TT
>
HFSM2_CONSTEXPR(11)
T
contain(const T x,
const TT to) noexcept
{
return (x + static_cast<T>(to) - 1) / static_cast<T>(to);
}
HFSM2_CONSTEXPR(11)
uint64_t
widen(const uint32_t x, const uint32_t y) noexcept {
return static_cast<uint64_t>(x) << 32 | y;
}
template <typename T>
HFSM2_CONSTEXPR(14)
void
fill(T& a, const char value) noexcept {
memset(&a, static_cast<int>(value), sizeof(a));
}
template <typename T>
HFSM2_CONSTEXPR(14)
void
swap(T& l, T& r) noexcept {
T t = move(l);
l = move(r);
r = move(t);
}
template <
typename TTo
, typename TFrom
>
HFSM2_CONSTEXPR(14)
void
overwrite(TTo& to, const TFrom& from) noexcept {
static_assert(sizeof(TTo) == sizeof(TFrom), "");
#if defined(__GNUC__) || defined(__GNUG__)
memcpy (&to, &from, sizeof(from));
#else
memcpy_s(&to, sizeof(to), &from, sizeof(from));
#endif
}
template <
typename TO
, typename TI
>
HFSM2_CONSTEXPR(14)
TO
reinterpret(const TI& in) noexcept {
TO out{};
overwrite(out, in);
return out;
}
template<class T>
HFSM2_CONSTEXPR(14)
void destroy(T& t) noexcept {
t.~T();
}
template <int>
struct StaticPrintConstT;
template <typename>
struct StaticPrintTypeT;
}
namespace hfsm2 {
namespace detail {
template <typename TContainer>
class IteratorT {
public:
using Container = TContainer;
using Item = typename Container::Item;
using Index = typename Container::Index;
template <typename, Long>
friend class DynamicArrayT;
private:
HFSM2_CONSTEXPR(11) IteratorT(Container& container,
const Index cursor) noexcept
: _container{container}
, _cursor{cursor}
{}
public:
HFSM2_CONSTEXPR(14) bool operator != (const IteratorT& HFSM2_IF_ASSERT(other)) const noexcept {
HFSM2_ASSERT(&_container == &other._container);
return _cursor != _container.limit();
}
HFSM2_CONSTEXPR(14) IteratorT& operator ++() noexcept {
_cursor = _container.next(_cursor);
return *this;
}
HFSM2_CONSTEXPR(14) Item& operator *() noexcept { return _container[_cursor]; }
HFSM2_CONSTEXPR(11) const Item& operator *() const noexcept { return _container[_cursor]; }
HFSM2_CONSTEXPR(14) Item* operator->() noexcept { return &_container[_cursor]; }
HFSM2_CONSTEXPR(11) const Item* operator->() const noexcept { return &_container[_cursor]; }
private:
Container& _container;
Index _cursor;
};
template <typename TContainer>
class IteratorT<const TContainer> {
public:
using Container = TContainer;
using Item = typename Container::Item;
using Index = typename Container::Index;
template <typename, Long>
friend class DynamicArrayT;
private:
HFSM2_CONSTEXPR(11) IteratorT(const Container& container,
const Index cursor) noexcept
: _container{container}
, _cursor{cursor}
{}
public:
HFSM2_CONSTEXPR(14) bool operator != (const IteratorT& HFSM2_IF_ASSERT(other)) const noexcept {
HFSM2_ASSERT(&_container == &other._container);
return _cursor != _container.limit();
}
HFSM2_CONSTEXPR(14) IteratorT& operator ++() noexcept {
_cursor = _container.next(_cursor);
return *this;
}
HFSM2_CONSTEXPR(11) const Item& operator *() const noexcept { return _container[_cursor]; }
HFSM2_CONSTEXPR(11) const Item* operator->() const noexcept { return &operator *(); }
private:
const Container& _container;
Index _cursor;
};
}
}
#if HFSM2_SERIALIZATION_AVAILABLE()
namespace hfsm2 {
namespace detail {
template <Long>
class BitWriteStreamT;
template <Long>
class BitReadStreamT;
template <Long NBitCapacity>
class StreamBufferT {
template <Long>
friend class BitWriteStreamT;
template <Long>
friend class BitReadStreamT;
public:
static constexpr Long BIT_CAPACITY = NBitCapacity;
static constexpr Long BYTE_COUNT = contain(BIT_CAPACITY, 8u);
using StreamBuffer = StreamBufferT<BIT_CAPACITY>;
using Data = uint8_t [BYTE_COUNT ];
HFSM2_CONSTEXPR(14) void clear() noexcept { fill(_data, 0); }
HFSM2_CONSTEXPR(14) Data& data() noexcept { return _data; }
HFSM2_CONSTEXPR(11) const Data& data() const noexcept { return _data; }
HFSM2_CONSTEXPR(14) bool operator == (const StreamBuffer& s) const noexcept;
HFSM2_CONSTEXPR(14) bool operator != (const StreamBuffer& s) const noexcept;
private:
Data _data {};
};
template <Long NBitCapacity>
class BitWriteStreamT final {
public:
static constexpr Long BIT_CAPACITY = NBitCapacity;
using Buffer = StreamBufferT<BIT_CAPACITY>;
public:
HFSM2_CONSTEXPR(14) explicit BitWriteStreamT(Buffer& buffer,
const Long cursor = 0) noexcept
: _buffer{buffer}
, _cursor{cursor}
{
_buffer.clear();
}
template <Short NBitWidth>
HFSM2_CONSTEXPR(14) void write(const UBitWidth<NBitWidth> item) noexcept;
HFSM2_CONSTEXPR(11) Long cursor() const noexcept { return _cursor; }
private:
Buffer& _buffer;
Long _cursor = 0;
};
template <Long NBitCapacity>
class BitReadStreamT final {
public:
static constexpr Long BIT_CAPACITY = NBitCapacity;
using Buffer = StreamBufferT<BIT_CAPACITY>;
public:
HFSM2_CONSTEXPR(11) explicit BitReadStreamT(const Buffer& buffer,
const Long cursor = 0) noexcept
: _buffer{buffer}
, _cursor{cursor}
{}
template <Short NBitWidth>
HFSM2_CONSTEXPR(14) UBitWidth<NBitWidth> read() noexcept;
HFSM2_CONSTEXPR(11) Long cursor() const noexcept { return _cursor; }
private:
const Buffer& _buffer;
Long _cursor;
};
}
}
#if HFSM2_SERIALIZATION_AVAILABLE()
namespace hfsm2 {
namespace detail {
template <Long NBitCapacity>
HFSM2_CONSTEXPR(14)
bool
StreamBufferT<NBitCapacity>::operator == (const StreamBuffer& buffer) const noexcept {
for (Long i = 0; i < BYTE_COUNT; ++i)
if (_data[i] != buffer._data[i])
return false;
return true;
}
template <Long NBitCapacity>
HFSM2_CONSTEXPR(14)
bool
StreamBufferT<NBitCapacity>::operator != (const StreamBuffer& buffer) const noexcept {
for (Long i = 0; i < BYTE_COUNT; ++i)
if (_data[i] != buffer._data[i])
return true;
return false;
}
template <Long NBitCapacity>
template <Short NBitWidth>
HFSM2_CONSTEXPR(14)
void
BitWriteStreamT<NBitCapacity>::write(const UBitWidth<NBitWidth> item) noexcept {
constexpr Short BIT_WIDTH = NBitWidth;
static_assert(BIT_WIDTH > 0, "STATIC ASSERT");
HFSM2_ASSERT(_cursor + BIT_WIDTH <= BIT_CAPACITY);
using Item = UBitWidth<BIT_WIDTH>;
Item itemBits = item;
for (Short itemWidth = BIT_WIDTH; itemWidth; ) {
const Long byteIndex = _cursor >> 3;
uint8_t& byte = _buffer._data[byteIndex];
const Short byteChunkStart = _cursor & 0x7;
const Short byteDataWidth = 8 - byteChunkStart;
const Short byteChunkWidth = min(byteDataWidth, itemWidth);
const Item byteChunk = itemBits << byteChunkStart;
byte |= byteChunk;
itemBits >>= byteChunkWidth;
itemWidth -= byteChunkWidth;
_cursor += byteChunkWidth;
}
}
template <Long NBitCapacity>
template <Short NBitWidth>
HFSM2_CONSTEXPR(14)
UBitWidth<NBitWidth>
BitReadStreamT<NBitCapacity>::read() noexcept {
constexpr Short BIT_WIDTH = NBitWidth;
static_assert(BIT_WIDTH > 0, "STATIC ASSERT");
HFSM2_ASSERT(_cursor + BIT_WIDTH <= BIT_CAPACITY);
using Item = UBitWidth<BIT_WIDTH>;
Item item = 0;
for (Short itemCursor = 0, itemWidth = BIT_WIDTH; itemWidth; ) {
const Long byteIndex = _cursor >> 3;
const uint8_t& byte = _buffer._data[byteIndex];
const Short byteChunkStart = _cursor & 0x7;
const Short byteDataWidth = 8 - byteChunkStart;
const Short byteChunkWidth = min(byteDataWidth, itemWidth);
const Short byteChunkMask = (1 << byteChunkWidth) - 1;
const Item byteChunk = (byte >> byteChunkStart) & byteChunkMask;
const Item itemChunk = byteChunk << itemCursor;
item |= itemChunk;
itemCursor += byteChunkWidth;
itemWidth -= byteChunkWidth;
_cursor += byteChunkWidth;
}
return item;
}
}
}
#endif
#endif
#if HFSM2_UTILITY_THEORY_AVAILABLE()
namespace hfsm2 {
namespace detail {
HFSM2_CONSTEXPR(14) float uniform(const uint32_t uint) noexcept;
HFSM2_CONSTEXPR(14) double uniform(const uint64_t uint) noexcept;
template <unsigned>
struct SimpleRandomT;
// SplitMix64 (http://xoshiro.di.unimi.it/splitmix64.c)
template <>
struct SimpleRandomT<8> {
HFSM2_CONSTEXPR(11) SimpleRandomT() noexcept {}
HFSM2_CONSTEXPR(14) SimpleRandomT(const uint64_t seed) noexcept;
HFSM2_CONSTEXPR(14) uint64_t uint64() noexcept;
HFSM2_CONSTEXPR(14) uint64_t raw64() noexcept;
uint64_t _state = 0;
};
// SplitMix32 (https://groups.google.com/forum/#!topic/prng/VFjdFmbMgZI)
template <>
struct SimpleRandomT<4> {
HFSM2_CONSTEXPR(11) SimpleRandomT() noexcept {}
HFSM2_CONSTEXPR(14) SimpleRandomT(const uint32_t seed) noexcept;
HFSM2_CONSTEXPR(14) uint32_t uint32() noexcept;
HFSM2_CONSTEXPR(14) uint32_t raw32() noexcept;
uint32_t _state = 0;
};
template <unsigned>
class BaseRandomT;
template <>
class BaseRandomT<8> {
protected:
using SimpleRandom = SimpleRandomT<8>;
HFSM2_CONSTEXPR(14) BaseRandomT(SimpleRandom&& simple) noexcept;
HFSM2_CONSTEXPR(14) void seed(SimpleRandom&& simple) noexcept;
public:
HFSM2_CONSTEXPR(14) BaseRandomT() noexcept;
HFSM2_CONSTEXPR(14) BaseRandomT(const uint64_t s) noexcept;
HFSM2_CONSTEXPR(14) BaseRandomT(const uint64_t(& s)[4]) noexcept;
HFSM2_CONSTEXPR(14) void seed(const uint64_t s) noexcept;
HFSM2_CONSTEXPR(14) void seed(const uint64_t(& s)[4]) noexcept;
protected:
uint64_t _state[4] {};
};
template <>
class BaseRandomT<4> {
protected:
using SimpleRandom = SimpleRandomT<4>;
HFSM2_CONSTEXPR(14) BaseRandomT(SimpleRandom&& simple) noexcept;
HFSM2_CONSTEXPR(14) void seed(SimpleRandom&& simple) noexcept;
public:
HFSM2_CONSTEXPR(14) BaseRandomT() noexcept;