Set of data objects.Class DataSet manages of sets of data objects of a template type DATA. For constructing a DataSet the maximum number of entries must be given. The current maximum number may be inquired with method max(). More...

#include <dataset.h>

Classes
struct	Item

Public Member Functions
Extension
Whenever a new element is added to a DataSet, the latter assigns it a DataKey. For this all methods that extend a DataSet by one ore more elements are provided with two signatures, one of them having a parameter for returning the assigned DataKey(s).
void	add (DataKey &newkey, const DATA &item)
	adds an element. More...

void	add (const DATA &item)
	adds element `item`. More...

void	add (DataKey newkey[], const DATA *item, int n)
	add several items. More...

void	add (const DATA *items, int n)
	adds `n` elements from `items`. More...

void	add (DataKey newkey[], const DataSet< DATA > &set)
	adds several new items. More...

void	add (const DataSet< DATA > &set)
	adds all elements of `set`. More...

DATA *	create (DataKey &newkey)
	creates new data element in DataSet. More...

DATA *	create ()
	creates new (uninitialized) data element in DataSet. More...

Shrinkage
When elements are removed from a DataSet, the remaining ones are renumbered from 0 through the new size()-1. How this renumbering is performed will not be revealed, since it might be target of future changes. However, some methods provide a parameter `int* perm`, which returns the new order after the removal: If `perm[i] < 0`, the element numbered i prior to the removal operation has been removed from the set. Otherwise, `perm[i] = j >= 0` means that the element with number i prior to the removal operation has been renumbered to j. Removing a single element from a DataSet yields a simple renumbering of the elements: The last element in the set (i.e., element num()-1) is moved to the index of the removed element.
void	remove (int removenum)
	removes the `removenum` 'th element. More...

void	remove (const DataKey &removekey)
	removes element with key `removekey`. More...

void	remove (int perm[])
	remove multiple elements. More...

void	remove (const DataKey keys, int n, int perm)
	remove `n` elements given by `keys` and `perm`. More...

void	remove (const DataKey *keys, int n)
	remove `n` elements given by `keys`. More...

void	remove (const int nums, int n, int perm)
	remove `n` elements given by `nums` and `perm`. More...

void	remove (const int *nums, int n)
	remove `n` elements with numbers `nums`. More...

void	clear ()
	remove all elements. More...

Access
When accessing elements from a DataSet with one of the index operators, it must be ensured that the index is valid for the DataSet. If this is not known afore, it is the programmers responsability to ensure this using the inquiry methods below.
DATA &	operator[] (int n)

const DATA &	operator[] (int n) const
	returns element number `n`. More...

DATA &	operator[] (const DataKey &k)

const DATA &	operator[] (const DataKey &k) const
	returns element with DataKey `k`. More...

Inquiry
int	max () const
	returns maximum number of elements that would fit into DataSet. More...

int	num () const
	returns number of elements currently in DataSet. More...

int	size () const
	returns the maximum DataKey::idx currently in DataSet. More...

DataKey	key (int n) const
	returns DataKey of `n` 'th element in DataSet. More...

DataKey	key (const DATA *item) const
	returns DataKey of element `item` in DataSet. More...

int	number (const DataKey &k) const
	returns the number of the element with DataKey `k` in DataSet or -1, if it doesn't exist. More...

int	number (const DATA *item) const
	returns the number of element `item` in DataSet, throws exception if it doesn't exist. More...

bool	has (const DataKey &k) const
	Is `k` a valid DataKey of an element in DataSet? More...

bool	has (int n) const
	Is `n` a valid number of an element in DataSet? More...

bool	has (const DATA *item) const
	Does `item` belong to DataSet? More...

Miscellaneous
ptrdiff_t	reMax (int newmax=0)
	resets max() to `newmax`. More...

bool	isConsistent () const
	consistency check. More...

Constructors / Destructors
	DataSet (int pmax=8)
	default constructor. More...

	DataSet (const DataSet &old)
	copy constructor. More...

DataSet< DATA > &	operator= (const DataSet< DATA > &rhs)
	assignment operator. More...

	~DataSet ()
	destructor. More...

Protected Attributes
Types
struct soplex::DataSet::Item *	theitem
	array of elements in the DataSet More...

Data
DataKey *	thekey
	DataKey::idx's of elements. More...

int	themax
	length of arrays theitem and thekey More...

int	thesize
	highest used element in theitem More...

int	thenum
	number of elements in DataSet More...

int	firstfree
	first unused element in theitem More...

Detailed Description

template<class DATA>
class soplex::DataSet< DATA >

Set of data objects.

Class DataSet manages of sets of data objects of a template type DATA. For constructing a DataSet the maximum number of entries must be given. The current maximum number may be inquired with method max().

Adding more then max() elements to a DataSet will core dump. However, method reMax() allows to reset max() without loss of elements currently in the DataSet. The current number of elements in a DataSet is returned by method num().

Adding elements to a DataSet is done via methods add() or create(), while remove() removes elements from a DataSet. When adding an element to a DataSet the new element is assigned a DataKey. DataKeys serve to access DATA elements in a set via a version of the subscript operator[](DataKey).

For convenience all elements in a DataSet are implicitely numbered from 0 through num()-1 and can be accessed with these numbers using a 2nd subscript operator[](int). The reason for providing DataKeys to access elements of a DataSet is that the Key of an element remains unchanged as long as the element is a member of the DataSet, while the numbers will change in an undefined way, if other elements are added to or removed from the DataSet.

The elements in a DataSet and their DataKeys are stored in two arrays:

theitem keeps the elements data along with their number stored in item.
thekey keeps the DataKey::idx's of the elements in a DataSet.

Both arrays have size themax.

In thekey only elements 0 thru thenum-1 contain DataKey::idx's of valid elements, i.e., elements currently in the DataSet. The current number of elements in the DataSet is counted in thenum.

In theitem only elements 0 thru thesize-1 are used, but only some of them actually contain real data elements of the DataSet. They are recognized by having info >= 0, which gives the number of that element. Otherwise info < 0 indicates an unused element. Unused elements are linked in a single linked list: starting with element -firstfree-1, the next free element is given by -info-1. The last free element in the list is marked by info == -themax-1. Finally all elements in theitem with index >= thesize are unused as well.

Warning: malloc/realloc and memcpy are used to handle the members of the set. If you use DataSet with something that is not a Data Object you will be in severe trouble.

Definition at line 87 of file dataset.h.

Constructor & Destructor Documentation

◆ DataSet() [1/2]

DataSet ( int pmax = 8 )

explicit

default constructor.

Definition at line 538 of file dataset.h.

◆ DataSet() [2/2]

DataSet ( const DataSet< DATA > & old )

copy constructor.

Definition at line 564 of file dataset.h.

◆ ~DataSet()

~DataSet ( )

destructor.

Definition at line 639 of file dataset.h.

Member Function Documentation

◆ add() [1/6]

void add	(	DataKey &	newkey,
		const DATA &	item
	)

adds an element.

Definition at line 126 of file dataset.h.

Referenced by DataSet< int >::add().

◆ add() [2/6]

void add ( const DATA & item )

adds element item.

Returns: 0 on success and non-zero, if an error occured.

Definition at line 137 of file dataset.h.

◆ add() [3/6]

void add	(	DataKey	newkey[],
		const DATA *	item,
		int	n
	)

add several items.

Definition at line 147 of file dataset.h.

◆ add() [4/6]

void add	(	const DATA *	items,
		int	n
	)

adds n elements from items.

Definition at line 157 of file dataset.h.

◆ add() [5/6]

void add	(	DataKey	newkey[],
		const DataSet< DATA > &	set
	)

adds several new items.

Definition at line 167 of file dataset.h.

◆ add() [6/6]

void add ( const DataSet< DATA > & set )

adds all elements of set.

Definition at line 176 of file dataset.h.

◆ clear()

void clear ( )

remove all elements.

Definition at line 344 of file dataset.h.

Referenced by DataSet< int >::operator=().

◆ create() [1/2]

DATA* create ( DataKey & newkey )

creates new data element in DataSet.

Returns: Pointer to the newly created element.

Definition at line 187 of file dataset.h.

◆ create() [2/2]

DATA* create ( )

creates new (uninitialized) data element in DataSet.

Returns: Pointer to the newly created element.

Definition at line 208 of file dataset.h.

Referenced by DataSet< int >::add(), and DataSet< int >::create().

◆ has() [1/3]

bool has ( const DataKey & k ) const

Is k a valid DataKey of an element in DataSet?

Definition at line 446 of file dataset.h.

Referenced by DataSet< int >::remove().

◆ has() [2/3]

bool has ( int n ) const

Is n a valid number of an element in DataSet?

Definition at line 452 of file dataset.h.

◆ has() [3/3]

bool has ( const DATA * item ) const

Does item belong to DataSet?

Definition at line 458 of file dataset.h.

◆ isConsistent()

bool isConsistent ( ) const

consistency check.

Definition at line 507 of file dataset.h.

Referenced by DataSet< int >::DataSet(), and DataSet< int >::operator=().

◆ key() [1/2]

DataKey key ( int n ) const

returns DataKey of n 'th element in DataSet.

Definition at line 409 of file dataset.h.

◆ key() [2/2]

DataKey key ( const DATA * item ) const

returns DataKey of element item in DataSet.

Definition at line 416 of file dataset.h.

◆ max()

int max ( ) const

returns maximum number of elements that would fit into DataSet.

Definition at line 391 of file dataset.h.

Referenced by DataSet< int >::add(), DataSet< int >::create(), and DataSet< int >::operator=().

◆ num()

int num ( ) const

returns number of elements currently in DataSet.

Definition at line 397 of file dataset.h.

Referenced by DataSet< int >::add(), DataSet< int >::create(), DataSet< int >::has(), DataSet< int >::key(), DataSet< int >::operator=(), and DataSet< int >::remove().

◆ number() [1/2]

int number ( const DataKey & k ) const

returns the number of the element with DataKey k in DataSet or -1, if it doesn't exist.

Definition at line 424 of file dataset.h.

Referenced by DataSet< int >::has(), DataSet< int >::key(), and DataSet< int >::remove().

◆ number() [2/2]

int number ( const DATA * item ) const

returns the number of element item in DataSet, throws exception if it doesn't exist.

Todo:: Please check whether this is correctly implemented!

Definition at line 435 of file dataset.h.

◆ operator=()

DataSet< DATA >& operator= ( const DataSet< DATA > & rhs )

assignment operator.

The assignment operator involves reMax()ing the lvalue DataSet to the size needed for copying all elements of the rvalue. After the assignment all DataKeys from the lvalue are valid for the rvalue as well. They refer to a copy of the corresponding data elements.

Definition at line 599 of file dataset.h.

◆ operator[]() [1/4]

DATA& operator[] ( int n )

Definition at line 361 of file dataset.h.

◆ operator[]() [2/4]

const DATA& operator[] ( int n ) const

returns element number n.

Definition at line 367 of file dataset.h.

◆ operator[]() [3/4]

DATA& operator[] ( const DataKey & k )

Definition at line 374 of file dataset.h.

◆ operator[]() [4/4]

const DATA& operator[] ( const DataKey & k ) const

returns element with DataKey k.

Definition at line 380 of file dataset.h.

◆ reMax()

ptrdiff_t reMax ( int newmax = 0 )

resets max() to newmax.

This method will not succeed if newmax < size(), in which case newmax == size() will be taken. As generally this method involves copying the DataSets elements in memory, reMax() returns the number of bytes the addresses of elements in the DataSet have been moved. Note, that this is identical for all elements in the DataSet.

Definition at line 486 of file dataset.h.

Referenced by DataSet< int >::operator=().

◆ remove() [1/7]

void remove ( int removenum )

removes the removenum 'th element.

Definition at line 232 of file dataset.h.

◆ remove() [2/7]

void remove ( const DataKey & removekey )

removes element with key removekey.

Definition at line 258 of file dataset.h.

◆ remove() [3/7]

void remove ( int perm[] )

remove multiple elements.

This method removes all elements for the DataSet with an index i such that perm[i] < 0. Upon completion, perm contains the new numbering of elements.

Definition at line 268 of file dataset.h.

◆ remove() [4/7]

void remove	(	const DataKey *	keys,
		int	n,
		int *	perm
	)

remove n elements given by keys and perm.

Definition at line 305 of file dataset.h.

◆ remove() [5/7]

void remove	(	const DataKey *	keys,
		int	n
	)

remove n elements given by keys.

Definition at line 318 of file dataset.h.

◆ remove() [6/7]

void remove	(	const int *	nums,
		int	n,
		int *	perm
	)

remove n elements given by nums and perm.

Definition at line 324 of file dataset.h.

◆ remove() [7/7]

void remove	(	const int *	nums,
		int	n
	)

remove n elements with numbers nums.

Definition at line 337 of file dataset.h.

◆ size()

int size ( ) const

returns the maximum DataKey::idx currently in DataSet.

Definition at line 403 of file dataset.h.

Referenced by DataSet< int >::number(), DataSet< int >::operator=(), and DataSet< int >::reMax().

Member Data Documentation

◆ firstfree

int firstfree

protected

first unused element in theitem

Definition at line 112 of file dataset.h.

Referenced by DataSet< int >::DataSet(), DataSet< int >::operator=(), DataSet< int >::reMax(), and DataSet< int >::remove().

◆ theitem

struct soplex::DataSet::Item* theitem

protected

array of elements in the DataSet

Referenced by DataSet< int >::create(), DataSet< int >::DataSet(), DataSet< int >::has(), DataSet< int >::isConsistent(), DataSet< int >::number(), DataSet< int >::operator=(), DataSet< int >::operator[](), DataSet< int >::reMax(), DataSet< int >::remove(), and DataSet< int >::~DataSet().

◆ thekey

DataKey* thekey

protected

DataKey::idx's of elements.

Definition at line 108 of file dataset.h.

Referenced by DataSet< int >::DataSet(), and DataSet< int >::operator=().

◆ themax

int themax

protected

length of arrays theitem and thekey

Definition at line 109 of file dataset.h.

Referenced by DataSet< int >::DataSet(), DataSet< int >::max(), and DataSet< int >::operator=().

◆ thenum

int thenum

protected

number of elements in DataSet

Definition at line 111 of file dataset.h.

Referenced by DataSet< int >::create(), DataSet< int >::isConsistent(), DataSet< int >::num(), DataSet< int >::operator=(), and DataSet< int >::remove().

◆ thesize

int thesize

protected

highest used element in theitem

Definition at line 110 of file dataset.h.

Referenced by DataSet< int >::operator=(), DataSet< int >::remove(), and DataSet< int >::size().

SoPlex

Classes

Public Member Functions

Protected Attributes

Detailed Description

template<class DATA> class soplex::DataSet< DATA >

Constructor & Destructor Documentation

◆ DataSet() [1/2]

◆ DataSet() [2/2]

◆ ~DataSet()

Member Function Documentation

◆ add() [1/6]

◆ add() [2/6]

◆ add() [3/6]

◆ add() [4/6]

◆ add() [5/6]

◆ add() [6/6]

◆ clear()

◆ create() [1/2]

◆ create() [2/2]

◆ has() [1/3]

◆ has() [2/3]

◆ has() [3/3]

◆ isConsistent()

◆ key() [1/2]

◆ key() [2/2]

◆ max()

◆ num()

◆ number() [1/2]

◆ number() [2/2]

◆ operator=()

◆ operator[]() [1/4]

◆ operator[]() [2/4]

◆ operator[]() [3/4]

◆ operator[]() [4/4]

◆ reMax()

◆ remove() [1/7]

◆ remove() [2/7]

◆ remove() [3/7]

◆ remove() [4/7]

◆ remove() [5/7]

◆ remove() [6/7]

◆ remove() [7/7]

◆ size()

Member Data Documentation

◆ firstfree

◆ theitem

◆ thekey

◆ themax

◆ thenum

◆ thesize

template<class DATA>
class soplex::DataSet< DATA >