Very basic database of SIFT points. More...

Detailed Description

Very basic database of SIFT points.

The underlying data structure is a list.

Definition at line 59 of file dataBase.hpp.

#include <dataBase.hpp>

Public Member Functions
bool	findPoint (SiftPoint &pt, bool addToDb=false)
	Search for pt in the database.
template<class Container >
void	processPoints (Container &siftPoints, bool addToDb=false)
Private Types
typedef std::list< DBKey >	DBKeysType
Private Member Functions
DBKey::IdType	getId ()
Private Attributes
DBKey::IdType	idFactory
DBKeysType	p_dbKeys

Member Function Documentation

bool jafar::sift::DataBase::findPoint	(	SiftPoint &	pt,
		bool	addToDb = `false`
	)

Search for pt in the database.

If the point is found in the database, or if it is added to the database, it will get the corresponding id.

Parameters:

addToDb if true, and if the point is not found, then the point is added.

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