5 #ifndef BPP_PHYL_TREE_BIPARTITIONTOOLS_H
6 #define BPP_PHYL_TREE_BIPARTITIONTOOLS_H
47 static void bit1(
int* list,
int num);
54 static void bit0(
int* list,
int num);
68 static void bitAnd(
int* listet,
int* list1,
int* list2,
size_t len);
82 static void bitOr(
int* listou,
int* list1,
int* list2,
size_t len);
95 static void bitNot(
int* listnon,
int* list,
size_t len);
100 static bool testBit(
int* list,
int num);
108 static std::unique_ptr<BipartitionList>
mergeBipartitionLists(
const std::vector<std::unique_ptr<BipartitionList>>& vecBipartL,
bool checkElements =
true);
132 static std::unique_ptr<VectorSiteContainer>
MRPEncode(
133 const std::vector<std::unique_ptr<BipartitionList>>& vecBipartL);
143 const std::vector<std::unique_ptr<BipartitionList>>& vecBipartL);
This class deals with the bipartitions defined by trees.
Defines the basic types of data flow nodes.