remordered.h File Reference

A utility procedure for removing an ordered set from another ordered set. More...

#include "chomp/system/config.h"

Go to the source code of this file.

Functions
template<class Vector1T , class Vector2T >
void	removeOrdered (Vector1T &K, const Vector2T &L)
	From the given set of objects, removes another one in such a way that the order of objects in the first one is preserved. More...

Detailed Description

A utility procedure for removing an ordered set from another ordered set.

Definition in file remordered.h.

Function Documentation

removeOrdered()

template<class Vector1T , class Vector2T >

void removeOrdered ( Vector1T &  K, const Vector2T &  L  )

inline

From the given set of objects, removes another one in such a way that the order of objects in the first one is preserved.

In order to achieve this, this procedure creates a new vector that contains all the elements appearing in K that are not in L. This procedure is intended to be applied to hashed sets and filtered complexes, or to other containers that provide a few basic interface features, as one can see in the code. It is thus very inefficient and thus should be used with care.

Definition at line 49 of file remordered.h.

Referenced by readFilteredComplexes().