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
|
////////////////////////////////////////////////////////////////////////////////
//
// SimplicialComplexTemplate_Declarations.hh
//
// produced: 12/06/98/98 jr
//
////////////////////////////////////////////////////////////////////////////////
#ifndef SIMPLICIALCOMPLEXTEMPLATE_DECLARATIONS_HH
#define SIMPLICIALCOMPLEXTEMPLATE_DECLARATIONS_HH
#include <stdlib.h>
#include <iostream>
#include <ctype.h>
#include <memory>
#include <vector>
#include "Message.hh"
#include "Permutation.hh"
#include "LabelSet.hh"
#include "IndexTableArray.hh"
#include "Chirotope.hh"
#include "Volumes.hh"
namespace topcom {
template<class T>
class SimplicialComplexTemplate;
template<class T>
inline std::istream& operator>>(std::istream& ist, SimplicialComplexTemplate<T>& st);
template<class T>
inline std::ostream& operator<<(std::ostream& ost, const SimplicialComplexTemplate<T>& st);
template<class T>
class __sc_const_iterator;
template<class T>
class SimplicialComplexTemplate {
public:
// save the empty index set:
static const T empty_indexset;
static const SimplicialComplexTemplate empty_complex;
// reset thte index table (invalidates all current simplicial complexes!):
static void reset_index_table ();
// preprocess the index table (good for multi-threading)
static void preprocess_index_table(const parameter_type,
const parameter_type,
const parameter_type);
static void preprocess_index_table(const parameter_type,
const parameter_type,
const parameter_type,
const Volumes&,
bool = false);
static void preprocess_index_table(const parameter_type,
const parameter_type,
const parameter_type,
const Chirotope&,
bool = false);
static const bool preprocessed(const parameter_type);
static const bool preprocessed();
static void set_preprocessed(const bool);
static void start_multithreading();
static void stop_multithreading();
typedef typename T::iterator IndexSet_iterator;
typedef typename T::const_iterator IndexSet_const_iterator;
public:
typedef T IndexSet;
public:
friend class VertexFacetTable;
friend class FaceFacetTableArray;
friend class FreeFaceTableArray;
public:
static const size_type init_capacity;
static const size_type init_size;
protected:
#ifdef TOPCOM_CONTAINERS
typedef Array<T> IndexSetArray;
#else
typedef std::vector<T> IndexSetArray;
#endif
public:
friend class __sc_const_iterator<T>;
public:
typedef __sc_const_iterator<T> const_iterator;
typedef const_iterator iterator; // no non-const iterators
private:
// for a pure complex, we only need a single index set
// together with the information about the rank
// (-1 for empty complex, ignored but mostly set to -2 for non-pure complex):
bool _is_pure;
parameter_type _pure_rank;
// for a non-pure complex, we need to have multiple index sets:
parameter_type _mincard; // minimum cardinality of a simplex
parameter_type _maxcard; // maximum cardinality of a simplex plus one
IndexSetArray _index_set; // index set for each card
static IndexTableArray _index_table; // common index table for each card
private:
void minmaxcard_update();
inline parameter_type resize(const parameter_type);
inline void make_non_pure();
inline void make_pure();
public:
// constructors:
inline SimplicialComplexTemplate();
inline SimplicialComplexTemplate(const SimplicialComplexTemplate&);
inline SimplicialComplexTemplate(SimplicialComplexTemplate&&);
inline explicit SimplicialComplexTemplate(const Simplex&,
const parameter_type);
inline explicit SimplicialComplexTemplate(const Simplex&);
public:
// destructor:
inline ~SimplicialComplexTemplate();
// iterator functions:
inline const_iterator begin() const;
inline const_iterator end() const;
// keys for a container:
const size_type keysize() const;
const size_type key(const size_type n) const;
// accessors:
inline const bool pure() const { return _is_pure; }
inline const parameter_type pure_rank() const { return _pure_rank; }
inline const parameter_type mincard() const { return _mincard; }
inline const parameter_type maxcard() const { return _maxcard; }
inline const IndexSetArray& index_set() const { return _index_set; }
inline static IndexTableArray& index_table() { return _index_table; }
inline const IndexSet& index_set_pure() const {
if (empty()) {
return empty_indexset;
} else {
return _index_set[0];
}
}
inline const IndexSet& index_set(const parameter_type n) const {
if (_is_pure) {
if (n != _pure_rank) {
MessageStreams::forced() << message::lock
<< *this << ":" << '\n'
<< "n = " << n << " != "
<< _pure_rank << " = _pure_rank - exiting" << std::endl
<< message::unlock;
exit(1);
}
else {
return _index_set[0];
}
}
else {
if ((n < _mincard) || (n >= _maxcard)) {
MessageStreams::forced() << message::lock
<< *this << ":" << '\n'
<< "n = " << n << " not in "
<< "[" << _mincard << "," << _maxcard
<< ") = [_mincard, _maxcard) - exiting" << std::endl
<< message::unlock;
exit(1);
}
else {
return _index_set[n];
}
}
}
static IndexTable& index_table(const parameter_type n) { return _index_table[n]; }
// make the internal indices usable from outside (only in mode "preprocessed"):
inline static size_type no_of_simplices(const parameter_type card) { return _index_table[card].size(); }
static size_type index_of_simplex(const Simplex& simp, const parameter_type card) {
if (!preprocessed(card)) {
MessageStreams::forced() << message::lock
<< "SimplicalComplex::index_of_simplex(const Simplex&, const parameter_type): "
<< "Error - index retrieval not allowed if not preprocessed - exiting."
<< std:: endl
<< message::unlock;
exit(1);
}
return _index_table[card].get_index(simp);
}
static size_type index_of_simplex(const Simplex& simp) { return index_of_simplex(simp, static_cast<parameter_type>(simp.card())); }
static Simplex simplex_of_index(const size_type index, const parameter_type card) {
return _index_table[card].get_obj(index);
}
inline void replace_indexset(const T& index_set, const parameter_type card) {
_is_pure = true;
_maxcard = 1;
_pure_rank = card;
resize(_maxcard);
_index_set[0] = index_set;
}
inline void replace_indexset(T&& index_set, const parameter_type card) {
_is_pure = true;
_maxcard = 1;
_pure_rank = card;
resize(_maxcard);
_index_set[0] = std::move(index_set);
}
// status information:
const bool empty() const { return (_maxcard == 0); }
const parameter_type rank() const {
if (_is_pure) {
return _pure_rank;
}
else {
return _maxcard - 1;
}
}
const int dim() const { return rank() - 1; }
inline const size_type card(const parameter_type n) const;
const size_type card() const;
const bool contains(const Simplex& simp, const parameter_type card) const;
inline const bool contains(const Simplex& simp) const;
const bool superset(const SimplicialComplexTemplate& sc) const;
inline const bool subset(const SimplicialComplexTemplate& sc) const;
const bool disjoint(const SimplicialComplexTemplate& sc) const;
const bool contains_face(const Simplex& simp, const parameter_type card) const;
inline const bool contains_face(const Simplex& simp) const;
const bool contains_face(const Simplex& simp,
const parameter_type card,
Simplex& facet) const;
inline const bool contains_face(const Simplex& simp, Simplex& facet) const;
const bool contains_free_face(const Simplex& simp,
const parameter_type card,
Simplex& facet) const;
inline const bool contains_free_face(const Simplex& simp,
Simplex& facet) const;
// standard operations on simplicial complexes:
const Simplex support() const;
SimplicialComplexTemplate star(const Simplex& simp, const parameter_type card) const;
inline SimplicialComplexTemplate star(const Simplex& simp) const;
SimplicialComplexTemplate link(const Simplex& simp, const parameter_type card) const;
inline SimplicialComplexTemplate link(const Simplex& simp) const;
SimplicialComplexTemplate& deletion(const Simplex& simp, const parameter_type card);
inline SimplicialComplexTemplate& deletion(const Simplex& simp);
// extract all simplices with given cardinality:
const SimplicialComplexTemplate operator[](const parameter_type) const;
// skeleton:
inline SimplicialComplexTemplate skeleton(const parameter_type);
// boolean operators:
const bool operator== (const SimplicialComplexTemplate&) const;
inline const bool operator!= (const SimplicialComplexTemplate&) const;
const bool operator< (const SimplicialComplexTemplate&) const;
inline const bool operator> (const SimplicialComplexTemplate&) const;
// the following lex-orders are w.r.t. the index sets, not the point labels:
const bool lexsmaller (const SimplicialComplexTemplate&, const parameter_type) const;
const bool lexsmaller (const SimplicialComplexTemplate&) const;
const bool colexgreater(const SimplicialComplexTemplate&, const parameter_type) const;
const bool colexgreater(const SimplicialComplexTemplate&) const;
// modifiers:
inline SimplicialComplexTemplate& clear(); // erase all
SimplicialComplexTemplate& insert_boundary(const Simplex&, const parameter_type);
inline SimplicialComplexTemplate& insert_boundary(const Simplex&);
SimplicialComplexTemplate& insert_faces(const SimplicialComplexTemplate&, const parameter_type);
SimplicialComplexTemplate& include_all_faces(const parameter_type = 1);
inline SimplicialComplexTemplate faces(const parameter_type = 1);
SimplicialComplexTemplate& reduce_to_facets(); // only keep facets
// assignment:
SimplicialComplexTemplate& operator=(const SimplicialComplexTemplate&);
SimplicialComplexTemplate& operator=(SimplicialComplexTemplate&&);
// adding and deleting a simplex:
inline SimplicialComplexTemplate& operator+=(const Simplex&);
inline SimplicialComplexTemplate& insert(const Simplex&);
SimplicialComplexTemplate& insert(const Simplex&, const parameter_type);
inline SimplicialComplexTemplate& operator-=(const Simplex&);
inline SimplicialComplexTemplate& erase(const Simplex&);
SimplicialComplexTemplate& erase(const Simplex&, const parameter_type);
inline SimplicialComplexTemplate& operator^=(const Simplex&);
inline SimplicialComplexTemplate& exclusiveor(const Simplex&);
SimplicialComplexTemplate& exclusiveor(const Simplex&, const parameter_type);
// union, difference, and intersection with simplicial complexes:
SimplicialComplexTemplate& operator+=(const SimplicialComplexTemplate&);
SimplicialComplexTemplate& operator-=(const SimplicialComplexTemplate&);
SimplicialComplexTemplate& operator*=(const SimplicialComplexTemplate&);
SimplicialComplexTemplate& operator^=(const SimplicialComplexTemplate&);
// the same but a new set is returned:
inline SimplicialComplexTemplate operator+(const Simplex&) const;
inline SimplicialComplexTemplate insert(const Simplex&) const;
inline SimplicialComplexTemplate insert(const Simplex&,
const parameter_type) const;
inline SimplicialComplexTemplate operator-(const Simplex&) const;
inline SimplicialComplexTemplate erase(const Simplex&) const;
inline SimplicialComplexTemplate erase(const Simplex&,
const parameter_type) const;
inline SimplicialComplexTemplate operator^(const Simplex&) const;
inline SimplicialComplexTemplate exclusiveor(const Simplex&) const;
inline SimplicialComplexTemplate exclusiveor(const Simplex&,
const parameter_type) const;
SimplicialComplexTemplate operator+(const SimplicialComplexTemplate&) const;
SimplicialComplexTemplate operator-(const SimplicialComplexTemplate&) const;
SimplicialComplexTemplate operator*(const SimplicialComplexTemplate&) const;
SimplicialComplexTemplate operator^(const SimplicialComplexTemplate&) const;
// join:
SimplicialComplexTemplate join(const Simplex&, const parameter_type) const;
inline SimplicialComplexTemplate join(const Simplex&) const;
SimplicialComplexTemplate join(const SimplicialComplexTemplate&) const;
// iostream:
std::istream& read(std::istream&);
std::ostream& write(std::ostream&) const;
friend std::istream& operator>><>(std::istream& ist, SimplicialComplexTemplate& st);
friend std::ostream& operator<<<>(std::ostream& ost, const SimplicialComplexTemplate& st);
};
template<class T>
class __sc_const_iterator {
typedef typename T::iterator IndexSet_iterator;
typedef typename T::const_iterator IndexSet_const_iterator;
public:
std::allocator<IndexSet_const_iterator> iter_allocator;
private:
const SimplicialComplexTemplate<T>* _container;
parameter_type _current_card;
IndexSet_const_iterator* _current_indexset_iter;
private:
__sc_const_iterator();
public:
__sc_const_iterator(const SimplicialComplexTemplate<T>& s);
inline __sc_const_iterator(const SimplicialComplexTemplate<T>& s, int);
__sc_const_iterator(const __sc_const_iterator& iter);
inline ~__sc_const_iterator();
inline __sc_const_iterator operator=(const __sc_const_iterator& iter);
const bool operator==(const __sc_const_iterator& iter) const;
inline const bool operator!=(const __sc_const_iterator& iter) const;
inline const Simplex& operator*() const;
inline const Simplex* operator->() const;
__sc_const_iterator& operator++();
inline __sc_const_iterator operator++(int);
};
// ==============================================================
// inlines for class SimplicialComplexTemplate<T>::const_iterator
// ==============================================================
template<class T>
inline __sc_const_iterator<T>::__sc_const_iterator(const SimplicialComplexTemplate<T>& s, int) :
_container(&s),
_current_card(_container->_maxcard),
_current_indexset_iter(nullptr) {}
template<class T>
inline __sc_const_iterator<T>::~__sc_const_iterator() {
if (_current_indexset_iter) {
// iter_allocator.destroy(_current_indexset_iter);
std::allocator_traits<std::allocator<IndexSet_const_iterator> >::destroy(iter_allocator,
_current_indexset_iter);
iter_allocator.deallocate(_current_indexset_iter, 1);
}
}
template<class T>
inline const bool __sc_const_iterator<T>::operator!=(const __sc_const_iterator& iter) const {
return !((*this) == iter);
}
template<class T>
inline const Simplex& __sc_const_iterator<T>::operator*() const {
#ifdef SCITER_DEBUG
MessageStreams::debug() << message::lock
<< "inline const Simplex& __sc_const_iterator<T>::operator*() const: dereferencing _current_indexset_iter at "
<< _current_indexset_iter << " ..."
<< std::endl;
#endif
#ifdef INDEXTABLE_DEBUG
const parameter_type card = _container->_is_pure ? _container->_pure_rank : _current_card;
MessageStreams::debug() << message::lock
<< "dereferencing iterator pointing to container "
<< _container << " with _index_table address "
<< &_container->_index_table << " and _index_table of current_card "
<< _container->_index_table[card] << " ..." << '\n'
<< "pointing to objects in "
<< _container->_index_table[card]._index_data << '\n'
<< "using _current_indexset_iter with address "
<< _current_indexset_iter << " and value "
<< **_current_indexset_iter << " ..." << '\n'
<< "picking "
<< _container->_index_table[card]._index_data[**_current_indexset_iter] << std::endl
<< message::unlock;
#endif
if (_container->_is_pure) {
const Simplex& result(_container->_index_table.get_obj(_container->_pure_rank, **_current_indexset_iter));
#ifdef SCITER_DEBUG
MessageStreams::debug() << message::lock
<< "... done." << std::endl
<< message::unlock;
#endif
return result;
}
else {
const Simplex& result(_container->_index_table.get_obj(_current_card, **_current_indexset_iter));
#ifdef INDEXTABLE_DEBUG
MessageStreams::debug() << message::lock
<< "... done" << '\n'
<< "returning reference with address " << &result
<< " and value " << result << std::endl
<< message::unlock;
#endif
#ifdef SCITER_DEBUG
MessageStreams::debug() << message::lock
<< "... done." << std::endl
<< message::unlock;
#endif
return result;
}
}
template<class T>
inline const Simplex* __sc_const_iterator<T>::operator->() const {
#ifdef SCITER_DEBUG
MessageStreams::debug() << message::lock
<< "inline const Simplex* __sc_const_iterator<T>::operator->() const: dereferencing _current_indexset_iter at "
<< _current_indexset_iter << " ..."
<< std::endl
<< message::unlock;
#endif
if (_container->_is_pure) {
const Simplex* result(&_container->_index_table.get_obj(_container->_pure_rank, **_current_indexset_iter));
#ifdef SCITER_DEBUG
MessageStreams::debug() << message::lock
<< "... done." << std::endl
<< message::unlock;;
#endif
return result;
}
else {
const Simplex* result(&_container->_index_table.get_obj(_current_card, **_current_indexset_iter));
#ifdef SCITER_DEBUG
MessageStreams::debug() << message::lock
<< "... done." << std::endl
<< message::unlock;;
#endif
return result;
}
}
template<class T>
inline __sc_const_iterator<T> __sc_const_iterator<T>::operator++(int) {
__sc_const_iterator tmp(*this);
++(*this);
return tmp;
}
// ===============================================
// inlines for class SimplicialComplexTemplate<T>:
// ===============================================
// resize:
template<class T>
inline parameter_type SimplicialComplexTemplate<T>::resize(const parameter_type new_size) {
#ifdef RESIZE_DEBUG
MessageStreams::debug() << message::lock
<< "parameter_type SimplicialComplexTemplate<T>::resize(const parameter_type)" << std::endl
<< message::unlock;
#endif
_index_table.resize(new_size);
_index_set.resize(std::max<parameter_type>(init_size, std::max<parameter_type>(_maxcard, new_size)));
return _index_set.size();
}
// change from pure to non-pure:
template<class T>
inline void SimplicialComplexTemplate<T>::make_non_pure() {
#ifdef RESIZE_DEBUG
MessageStreams::debug() << message::lock
<< "void SimplicialComplexTemplate<T>::make_non_pure()" << std::endl
<< message::unlock;
#endif
if (!_is_pure) {
return;
}
if (_pure_rank > 0) {
_maxcard = _pure_rank + 1;
resize(_maxcard);
_index_set[_pure_rank] = std::move(_index_set[0]);
_index_set[0].clear();
}
_pure_rank = -2;
_is_pure = false;
}
// change from non-pure to pure:
template<class T>
inline void SimplicialComplexTemplate<T>::make_pure() {
#ifdef RESIZE_DEBUG
MessageStreams::debug() << message::lock
<< "void SimplicialComplexTemplate<T>::make_pure()" << std::endl
<< message::unlock;
#endif
if (_is_pure) {
return;
}
if (_mincard >= _maxcard - 1) {
_is_pure = true;
_pure_rank = _maxcard - 1;
if (_mincard == _maxcard - 1) {
_pure_rank = _mincard;
if (_mincard > 0) {
_index_set[0] = std::move(_index_set[_mincard]);
}
_maxcard = 1;
_mincard = 0;
resize(_maxcard);
}
}
}
// constructors:
template<class T>
inline SimplicialComplexTemplate<T>::SimplicialComplexTemplate() :
_is_pure(true),
_pure_rank(-1),
_mincard(0),
_maxcard(0),
_index_set() {
_index_set.reserve(init_capacity);
_index_set.resize(init_size);
#ifdef CONSTRUCTOR_DEBUG
MessageStreams::debug() << message::lock
<< "SimplicialComplexTemplate<T>::SimplicialComplexTemplate()"
<< std::endl
<< message::unlock;
#endif
}
template<class T>
inline SimplicialComplexTemplate<T>::SimplicialComplexTemplate(const SimplicialComplexTemplate<T>& s) :
_is_pure(s._is_pure),
_pure_rank(s._pure_rank),
_mincard(s._mincard),
_maxcard(s._maxcard),
_index_set(s._index_set) {
#ifdef CONSTRUCTOR_DEBUG
MessageStreams::debug() << message::lock
<< "SimplicialComplexTemplate<T>::SimplicialComplexTemplate(const SimplicialComplexTemplate<T>&)"
<< std::endl
<< message::unlock;
#endif
}
template<class T>
inline SimplicialComplexTemplate<T>::SimplicialComplexTemplate(SimplicialComplexTemplate<T>&& s) :
_is_pure(s._is_pure),
_pure_rank(s._pure_rank),
_mincard(s._mincard),
_maxcard(s._maxcard),
_index_set(std::move(s._index_set)) {
#ifdef CONSTRUCTOR_DEBUG
MessageStreams::debug() << message::lock
<< "SimplicialComplexTemplate<T>::SimplicialComplexTemplate(SimplicialComplexTemplate<T>&&)"
<< std::endl
<< message::unlock;
#endif
}
template<class T>
inline SimplicialComplexTemplate<T>::SimplicialComplexTemplate(const Simplex& simp,
const parameter_type card) :
_is_pure(true),
_pure_rank(card),
_index_set() {
_index_set.reserve(init_capacity);
_index_set.resize(init_size);
#ifdef CONSTRUCTOR_DEBUG
MessageStreams::debug() << message::lock
<< "SimplicialComplexTemplate<T>::SimplicialComplexTemplate"
<< "(const Simplex&, const parameter_type)"
<< std::endl
<< message::unlock;
#endif
// _maxcard = card + 1;
// resize(_maxcard);
// _mincard = card;
// // std::shared_lock<std::shared_mutex> index_table_guard(_index_table_mutex);
// _index_set[card] += _index_table.get_index(card, simp);
_maxcard = 1;
resize(_maxcard);
_mincard = 0;
_index_set[0] += _index_table.get_index(card, simp);
}
template<class T>
inline SimplicialComplexTemplate<T>::SimplicialComplexTemplate(const Simplex& simp) :
_is_pure(true),
_pure_rank(static_cast<int>(simp.card())),
_index_set() {
_index_set.reserve(init_capacity);
_index_set.resize(init_size);
#ifdef CONSTRUCTOR_DEBUG
MessageStreams::debug() << message::lock
<< "SimplicialComplexTemplate<T>::SimplicialComplexTemplate(const Simplex&)" << std::endl
<< message::unlock;
#endif
const parameter_type card = static_cast<parameter_type>(simp.card());
// _maxcard = card + 1;
// resize(_maxcard);
// _mincard = card;
// // std::shared_lock<std::shared_mutex> index_table_guard(_index_table_mutex);
// _index_set[card] += _index_table.get_index(card, simp);
_maxcard = 1;
resize(_maxcard);
_mincard = 0;
_index_set[0] += _index_table.get_index(card, simp);
}
// destructor:
template<class T>
inline SimplicialComplexTemplate<T>::~SimplicialComplexTemplate() {
#ifdef CONSTRUCTOR_DEBUG
MessageStreams::debug() << message::lock
<< "SimplicialComplexTemplate<T>::~SimplicialComplexTemplate()"
<< std::endl
<< message::unlock;
#endif
}
template<class T>
inline const bool SimplicialComplexTemplate<T>::preprocessed() {
return _index_table.preprocessed();
}
template<class T>
inline void SimplicialComplexTemplate<T>::set_preprocessed(const bool preprocessed) {
return _index_table.set_preprocessed(preprocessed);
}
template<class T>
inline const bool SimplicialComplexTemplate<T>::preprocessed(const parameter_type rank) {
return _index_table.preprocessed(rank);
}
template<class T>
void SimplicialComplexTemplate<T>::start_multithreading() {
_index_table.start_multithreading();
for (parameter_type i = 0; i < _index_table.size(); ++i) {
_index_table[i].start_multithreading();
}
}
template<class T>
void SimplicialComplexTemplate<T>::stop_multithreading() {
_index_table.stop_multithreading();
for (parameter_type i = 0; i < _index_table.size(); ++i) {
_index_table[i].stop_multithreading();
}
}
// iterator functions:
template<class T>
inline typename SimplicialComplexTemplate<T>::const_iterator SimplicialComplexTemplate<T>::begin() const {
return __sc_const_iterator<T>(*this);
}
template<class T>
inline typename SimplicialComplexTemplate<T>::const_iterator SimplicialComplexTemplate<T>::end() const {
return __sc_const_iterator<T>(*this,0);
}
// status information:
template<class T>
inline const size_type SimplicialComplexTemplate<T>::card(const parameter_type n) const {
if (_is_pure) {
return _index_set[0].card();
}
else {
return _index_set[n].card();
}
}
template<class T>
inline const bool SimplicialComplexTemplate<T>::contains(const Simplex& simp) const {
parameter_type card = static_cast<parameter_type>(simp.card());
return contains(simp, card);
}
template<class T>
inline const bool SimplicialComplexTemplate<T>::subset(const SimplicialComplexTemplate<T>& sc) const {
return sc.superset(*this);
}
template<class T>
inline const bool SimplicialComplexTemplate<T>::contains_face(const Simplex& simp) const {
const parameter_type card = static_cast<parameter_type>(simp.card());
return contains_face(simp, card);
}
template<class T>
inline const bool SimplicialComplexTemplate<T>::contains_face(const Simplex& simp,
Simplex& facet) const {
const parameter_type card = static_cast<parameter_type>(simp.card());
return contains_face(simp, card, facet);
}
template<class T>
inline const bool SimplicialComplexTemplate<T>::contains_free_face(const Simplex& simp,
Simplex& facet) const {
const parameter_type card = static_cast<parameter_type>(simp.card());
return contains_free_face(simp, card, facet);
}
// standard operations on simplicial complexes:
template<class T>
inline SimplicialComplexTemplate<T> SimplicialComplexTemplate<T>::star(const Simplex& simp) const {
parameter_type card = static_cast<parameter_type>(simp.card());
return star(simp, card);
}
template<class T>
inline SimplicialComplexTemplate<T> SimplicialComplexTemplate<T>::link(const Simplex& simp) const {
parameter_type card = static_cast<parameter_type>(simp.card());
return link(simp, card);
}
template<class T>
inline SimplicialComplexTemplate<T>& SimplicialComplexTemplate<T>::deletion(const Simplex& simp) {
parameter_type card = static_cast<parameter_type>(simp.card());
return deletion(simp, card);
}
// skeleton:
template<class T>
inline SimplicialComplexTemplate<T> SimplicialComplexTemplate<T>::skeleton(const parameter_type card) {
SimplicialComplexTemplate<T> result(*this);
return result.include_all_faces(card)[card];
}
// boolean operators:
template<class T>
inline const bool SimplicialComplexTemplate<T>::operator!=(const SimplicialComplexTemplate<T>& s) const {
return !((*this) == s);
}
template<class T>
inline const bool SimplicialComplexTemplate<T>::operator>(const SimplicialComplexTemplate<T>& s) const {
return (s < (*this));
}
template<class T>
inline SimplicialComplexTemplate<T>& SimplicialComplexTemplate<T>::insert_boundary(const Simplex& simp) {
return insert_boundary(simp, static_cast<parameter_type>(simp.card()));
}
template<class T>
inline SimplicialComplexTemplate<T> SimplicialComplexTemplate<T>::faces(const parameter_type depth) {
SimplicialComplexTemplate<T> result(*this);
return result.include_all_faces(depth);
}
// modifiers:
template<class T>
inline SimplicialComplexTemplate<T>& SimplicialComplexTemplate<T>::clear() {
// we need to clear some individual index sets,
// since _maxcard many may contain elements and
// at least init_size many will not be destroyed by resize:
if (empty()) {
return *this;
}
for (parameter_type i = _mincard; i < std::min<parameter_type>(init_size, _maxcard); ++i) {
_index_set[i].clear();
}
_mincard = 0;
_maxcard = 0;
resize(_maxcard);
_index_set.reserve(init_capacity);
return *this;
}
// adding and deleting a simplex:
template<class T>
inline SimplicialComplexTemplate<T>& SimplicialComplexTemplate<T>::operator+=(const Simplex& simp) {
return insert(simp, static_cast<parameter_type>(simp.card()));
}
template<class T>
inline SimplicialComplexTemplate<T>& SimplicialComplexTemplate<T>::insert(const Simplex& simp) {
return insert(simp,static_cast<parameter_type>(simp.card()));
}
template<class T>
inline SimplicialComplexTemplate<T>& SimplicialComplexTemplate<T>::operator-=(const Simplex& simp) {
return erase(simp,static_cast<parameter_type>(simp.card()));
}
template<class T>
inline SimplicialComplexTemplate<T>& SimplicialComplexTemplate<T>::erase(const Simplex& simp) {
return erase(simp,static_cast<parameter_type>(simp.card()));
}
template<class T>
inline SimplicialComplexTemplate<T>& SimplicialComplexTemplate<T>::operator^=(const Simplex& simp) {
return exclusiveor(simp,static_cast<parameter_type>(simp.card()));
}
template<class T>
inline SimplicialComplexTemplate<T>& SimplicialComplexTemplate<T>::exclusiveor(const Simplex& simp) {
return exclusiveor(simp,static_cast<parameter_type>(simp.card()));
}
// union, difference, and intersection with simplicial complexes, a new set is returned:
template<class T>
inline SimplicialComplexTemplate<T> SimplicialComplexTemplate<T>::operator+(const Simplex& simp) const {
SimplicialComplexTemplate<T> s(*this);
s += simp;
return s;
}
template<class T>
inline SimplicialComplexTemplate<T> SimplicialComplexTemplate<T>::insert(const Simplex& simp) const {
SimplicialComplexTemplate<T> s(*this);
s.insert(simp);
return s;
}
template<class T>
inline SimplicialComplexTemplate<T> SimplicialComplexTemplate<T>::insert(const Simplex& simp,
const parameter_type card) const {
SimplicialComplexTemplate<T> s(*this);
s.insert(simp, card);
return s;
}
template<class T>
inline SimplicialComplexTemplate<T> SimplicialComplexTemplate<T>::operator-(const Simplex& simp) const {
SimplicialComplexTemplate<T> s(*this);
s -= simp;
return s;
}
template<class T>
inline SimplicialComplexTemplate<T> SimplicialComplexTemplate<T>::erase(const Simplex& simp) const {
SimplicialComplexTemplate<T> s(*this);
s.erase(simp);
return s;
}
template<class T>
inline SimplicialComplexTemplate<T> SimplicialComplexTemplate<T>::erase(const Simplex& simp,
const parameter_type card) const {
SimplicialComplexTemplate<T> s(*this);
s.erase(simp,card);
return s;
}
template<class T>
inline SimplicialComplexTemplate<T> SimplicialComplexTemplate<T>::operator^(const Simplex& simp) const {
SimplicialComplexTemplate<T> s(*this);
s ^= simp;
return s;
}
template<class T>
inline SimplicialComplexTemplate<T> SimplicialComplexTemplate<T>::exclusiveor(const Simplex& simp) const {
SimplicialComplexTemplate<T> s(*this);
s.exclusiveor(simp);
return s;
}
template<class T>
inline SimplicialComplexTemplate<T> SimplicialComplexTemplate<T>::exclusiveor(const Simplex& simp,
const parameter_type card) const {
SimplicialComplexTemplate<T> s(*this);
s.exclusiveor(simp,card);
return s;
}
// join:
template<class T>
inline SimplicialComplexTemplate<T> SimplicialComplexTemplate<T>::join(const Simplex& simp) const {
return join(simp, static_cast<parameter_type>(simp.card()));
}
// friends:
template<class T>
inline std::istream& operator>>(std::istream& ist, SimplicialComplexTemplate<T>& st) {
return st.read(ist);
}
template<class T>
inline std::ostream& operator<<(std::ostream& ost, const SimplicialComplexTemplate<T>& st) {
return st.write(ost);
}
template<class T>
const T SimplicialComplexTemplate<T>::empty_indexset = T();
template<class T>
const SimplicialComplexTemplate<T> SimplicialComplexTemplate<T>::empty_complex = SimplicialComplexTemplate<T>();
// the following is necessary on systems where explicit template instantiation
// does not work as advertized:
}; // namespace topcom
#include "SimplicialComplexTemplate_Definitions.hh"
#endif
// eof SimplicialComplexTemplate_Declarations.hh
|
