| virtual | ~HitSet() |
| Bool_t | CheckMatch(const TBits* bits) const |
| static Bool_t | CheckMatch(const TreeSearch::Hset_t& hits, const TBits* bits) |
| static TClass* | Class() |
| static UInt_t | GetMatchValue(const TreeSearch::Hset_t& hits) |
| TreeSearch::HitSet | HitSet() |
| TreeSearch::HitSet | HitSet(const TreeSearch::HitSet&) |
| virtual TClass* | IsA() const |
| Bool_t | IsSimilarTo(const TreeSearch::HitSet& tryset, Int_t maxdist = 0) const |
| TreeSearch::HitSet& | operator=(const TreeSearch::HitSet&) |
| virtual void | ShowMembers(TMemberInspector& insp, char* parent) |
| virtual void | Streamer(TBuffer& b) |
| void | StreamerNVirtual(TBuffer& b) |
| TreeSearch::Hset_t | hits | Hits associated with a pattern |
| UInt_t | nplanes | number of active planes |
| UInt_t | plane_pattern | Bit pattern of plane numbers occupied by hits |
| UInt_t | used | Pattern has been assigned to a road |
| Inheritance Chart: | |||||
|
If maxdist == 0: Similar to STL includes() algorithm, but allows tryset to have additional hits in a given wire plane if there is at least one included hit in that plane. Example: the following matches, despite the extra hit in "try": this: 30/ 32/40/50/51 try: --/31 32/40/50/51 Standard includes() implies intersection == set2. This algorithm tests planepattern(intersection) == planepattern(set2) If maxdist > 0: Same as above, but consider hits "equal" not only if they are identical but also if their wire numbers are at most maxdist apart. Exmaple: the following two patters are "similar" with maxdist = 1: this: 30/32/40/50/51 try: 31/32/40/50/51 This mode can be used to build "clusters" of patterns.