triggeralgs::dbscan::Cluster Struct Reference

#include <dbscan.hpp>

Collaboration diagram for triggeralgs::dbscan::Cluster:

Public Member Functions
	Cluster (int index_)
bool	maybe_add_new_hit (Hit *new_hit, float eps, int minPts)
void	add_hit (Hit *h)
void	steal_hits (Cluster &other)

Public Attributes
int	index { -1 }
Completeness	completeness { Completeness::kIncomplete }
float	latest_time { 0 }
Hit *	latest_core_point { nullptr }
HitSet	hits

Detailed Description

Definition at line 22 of file dbscan.hpp.

Constructor & Destructor Documentation

Cluster()

triggeralgs::dbscan::Cluster::Cluster ( int index_ )

inline

Definition at line 24 of file dbscan.hpp.

        : index{ index_ }
    {}

Member Function Documentation

add_hit()

void triggeralgs::dbscan::Cluster::add_hit

(

Hit *

h

)

Definition at line 63 of file dbscan.cpp.

{
    hits.insert(h);
    h->cluster = index;
    latest_time = std::max(latest_time, h->time);
    if (h->connectedness == Connectedness::kCore &&
        (!latest_core_point || h->time > latest_core_point->time)) {
        latest_core_point = h;
    }
}

maybe_add_new_hit()

bool triggeralgs::dbscan::Cluster::maybe_add_new_hit	(	Hit *	new_hit,
		float	eps,
		int	minPts )

Definition at line 31 of file dbscan.cpp.

{
    // Should we add this hit?
    bool do_add = false;
 
    // Hits earlier than new_hit time minus `eps` can't possibly be
    // neighbours, so start the search there in the sorted list of hits in this
    // cluster
    auto begin_it = std::lower_bound(
        hits.begin(), hits.end(), new_hit->time - eps, time_comp_lower);
 
    for (auto it = begin_it; it != hits.end(); ++it) {
        Hit* h = *it;
        if (h->add_potential_neighbour(new_hit, eps, minPts)) {
            do_add = true;
            if (h->neighbours.size() + 1 >= minPts) {
                h->connectedness = Connectedness::kCore;
            } else {
                h->connectedness = Connectedness::kEdge;
            }
        }
    } // end loop over hits in cluster
 
    if (do_add) {
        add_hit(new_hit);
    }
 
    return do_add;
}

steal_hits()

void triggeralgs::dbscan::Cluster::steal_hits

(

Cluster &

other

)

Definition at line 76 of file dbscan.cpp.

{
    // TODO: it might be faster to do some sort of explicit "merge" of the hits,
    // eg:
    //
    // this->hits.insert(other hits); // Inserts at end
    // std::inplace_merge(...)
    //
    // This might save some reallocations of the vector
    for (auto h : other.hits) {
        assert(h);
        add_hit(h);
    }
    other.hits.clear();
    other.completeness = Completeness::kComplete;
}

Member Data Documentation

completeness

Completeness triggeralgs::dbscan::Cluster::completeness { Completeness::kIncomplete }

Definition at line 32 of file dbscan.hpp.

{ Completeness::kIncomplete };

hits

HitSet triggeralgs::dbscan::Cluster::hits

Definition at line 38 of file dbscan.hpp.

index

int triggeralgs::dbscan::Cluster::index { -1 }

Definition at line 28 of file dbscan.hpp.

{ -1 };

latest_core_point

Hit* triggeralgs::dbscan::Cluster::latest_core_point { nullptr }

Definition at line 36 of file dbscan.hpp.

{ nullptr };

latest_time

float triggeralgs::dbscan::Cluster::latest_time { 0 }

Definition at line 34 of file dbscan.hpp.

{ 0 };

---

The documentation for this struct was generated from the following files:

• /github/workspace/dunedaq/sourcecode/triggeralgs/include/triggeralgs/dbscan/dbscan.hpp
• /github/workspace/dunedaq/sourcecode/triggeralgs/src/dbscan/dbscan.cpp