Public Member Functions | Public Attributes | List of all members
ML::Dbscan::VertexDeg::Pack< Type, Index_ > Struct Template Reference

#include <pack.h>

Collaboration diagram for ML::Dbscan::VertexDeg::Pack< Type, Index_ >:
Collaboration graph

Public Member Functions

void resetArray (cudaStream_t stream, Index_ vdlen)
 reset the output array before calling the actual kernel More...
 

Public Attributes

raft::neighbors::ball_cover::BallCoverIndex< Index_, Type, Index_, Index_ > * rbc_index
 
Index_ * vd
 
Type * weight_sum
 
Index_ * ia
 
rmm::device_uvector< Index_ > * ja
 
Index_ max_k
 
bool * adj
 
const Type * x
 
const Type * sample_weight
 
Type eps
 
Index_ N
 
Index_ D
 

Member Function Documentation

◆ resetArray()

template<typename Type , typename Index_ >
void ML::Dbscan::VertexDeg::Pack< Type, Index_ >::resetArray ( cudaStream_t  stream,
Index_  vdlen 
)
inline

reset the output array before calling the actual kernel

Parameters
streamcuda stream where to perform this operation
vdlenlength of the vertex degree array

Member Data Documentation

◆ adj

template<typename Type , typename Index_ >
bool* ML::Dbscan::VertexDeg::Pack< Type, Index_ >::adj

the dense adjacency matrix

◆ D

template<typename Type , typename Index_ >
Index_ ML::Dbscan::VertexDeg::Pack< Type, Index_ >::D

dataset dimensionality

◆ eps

template<typename Type , typename Index_ >
Type ML::Dbscan::VertexDeg::Pack< Type, Index_ >::eps

epsilon neighborhood thresholding param

◆ ia

template<typename Type , typename Index_ >
Index_* ML::Dbscan::VertexDeg::Pack< Type, Index_ >::ia

the CSR adjacency matrix

◆ ja

template<typename Type , typename Index_ >
rmm::device_uvector<Index_>* ML::Dbscan::VertexDeg::Pack< Type, Index_ >::ja

◆ max_k

template<typename Type , typename Index_ >
Index_ ML::Dbscan::VertexDeg::Pack< Type, Index_ >::max_k

iff > 0 maximum expected rowlength

◆ N

template<typename Type , typename Index_ >
Index_ ML::Dbscan::VertexDeg::Pack< Type, Index_ >::N

number of points in the dataset

◆ rbc_index

template<typename Type , typename Index_ >
raft::neighbors::ball_cover::BallCoverIndex<Index_, Type, Index_, Index_>* ML::Dbscan::VertexDeg::Pack< Type, Index_ >::rbc_index

optional rbc index

◆ sample_weight

template<typename Type , typename Index_ >
const Type* ML::Dbscan::VertexDeg::Pack< Type, Index_ >::sample_weight

weighted vertex degree

◆ vd

template<typename Type , typename Index_ >
Index_* ML::Dbscan::VertexDeg::Pack< Type, Index_ >::vd

vertex degree array Last position is the sum of all elements in this array (excluding it) Hence, its length is one more than the number of points

◆ weight_sum

template<typename Type , typename Index_ >
Type* ML::Dbscan::VertexDeg::Pack< Type, Index_ >::weight_sum

weighted vertex degree

◆ x

template<typename Type , typename Index_ >
const Type* ML::Dbscan::VertexDeg::Pack< Type, Index_ >::x

input dataset


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