The Fib multimedia system
Fib is a system for storing multimedia data (like images or films).
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
version.h File Reference
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros

#define FIB_ALGORITHMS_VERSION   1
#define FIB_ALGORITHMS_VERSION_NAME   V0.1.0
#define FEATURE_REMOVE_TOPMOST_UNDEROBJECTS
#define FEATURE_STORE_EVALUED_UNDEROBJECT_NUMBERS
#define FEATURE_LINEAR_EQUIATION_PRECISION_FOR_NULL
#define FEATURE_ND1_POLYNOM_TO_HORN_SCHEMA_FIB_UNDERFUNCTION
#define FEATURE_INEQUIATION_EVALUE_FAST
#define FEATURE_HYPERPLANE_BODY_OPTIMIZE_IS_PART_INEQUIATIONS
#define FEATURE_NCLUSTER_CLUSTER_IN_ONE_STEP
#define FEATURE_HYPERPLANE_BODY_SIMPLE_ADD_INEQUIATIONS_NO_DOUBLE_POINTS
#define FEATURE_C_SPLINE_USE_GLP_LIB_LINAR_PROBLEM_SOLVING
#define FEATURE_GLPK_USE_MUTEX_LINAR_PROBLEM_SOLVING

Macro Definition Documentation

#define FEATURE_C_SPLINE_USE_GLP_LIB_LINAR_PROBLEM_SOLVING

With this feature the glp library (extern package) linear solver will be used to find a spline for a vector of range data points.

See also:
fib::algorithms::nD1::cSpline<tX, tY>::evalueSpline()

created: 16.09.2012 Betti Oesterholz Status: implemened and tested(13.10.2012)

Definition at line 210 of file version.h.

#define FEATURE_GLPK_USE_MUTEX_LINAR_PROBLEM_SOLVING

With this feature the glp library (extern package) linear solver will be used with a mutex switch, so it can run in treads. If the glp libary is tread save this feature can be deactivated. Make sure to include mutexGlpkSolver.inc .

See also:
mutexGlpkSolver.inc
FEATURE_C_SPLINE_USE_GLP_LIB_LINAR_PROBLEM_SOLVING
fib::algorithms::nD1::cSpline<tX, tY>::evalueSpline()

created: 26.09.2012 Betti Oesterholz Status: implemened and tested(13.10.2012)

Definition at line 227 of file version.h.

#define FEATURE_HYPERPLANE_BODY_OPTIMIZE_IS_PART_INEQUIATIONS

With this feature the isPart() method will optimize the inequiations when evaluing if a point is part of the body. The first inequiation found, which the point dos not fulfill, will be put to the front of the inequiation list, so its checked as the first inequiation in the next isPart() call.

See also:
fib::algorithms::nDn::cHyperplaneBody<tFactors>::isPart()

created: 04.04.2011 Betti Oesterholz Status: implemened and tested(04.04.2011)

Definition at line 147 of file version.h.

#define FEATURE_HYPERPLANE_BODY_SIMPLE_ADD_INEQUIATIONS_NO_DOUBLE_POINTS

With this feature the addInequiation() function of the class cHyperplaneBodySimple will remove double points wich are. Ther will allways just one point, which is contained in specific set of hyperplanes. This will save memmory and time.

See also:
fib::algorithms::nDn::cHyperplaneBodySimple<tFactors>::addInequiation()

created: 17.04.2011 Betti Oesterholz Status: implemened and tested(17.04.2011)

Definition at line 195 of file version.h.

#define FEATURE_INEQUIATION_EVALUE_FAST

With this feature the methods for evaluing an inequiation won't use the slower add and sub functions from fibDatatyps.h .

See also:
fib::algorithms::nLinearInequation::cInequation<tFactors>::evalue()
fib::algorithms::nLinearInequation::cInequation<tFactors>::evalueValue() Beware: If you comment FEATURE_INEQUIATION_EVALUE_FAST out you will get more errors with tHyperplaneBody.

created: 04.04.2011 Betti Oesterholz Status: implemened and tested(04.04.2011)

Definition at line 131 of file version.h.

#define FEATURE_LINEAR_EQUIATION_PRECISION_FOR_NULL

With this feature the addition of to equiations values will be 0, if the negative of one values is allmost equal to the other value. In this way the precision of the variable values is not relevant.

See also:
fib::algorithms::nLinearEquation::cLinearEquation<tFactors>::operator+( const cLinearEquation<tFactors> & equiation )

created: 17.01.2011 Betti Oesterholz Status: implemened and tested(17.01.2011)

Definition at line 101 of file version.h.

#define FEATURE_NCLUSTER_CLUSTER_IN_ONE_STEP

With this feature the addInequiation() method will also work on big hyperpbodies. Without the feature addInequiation() will work faster, but produce errors on big hyper bodys (don't use a to big maxValue when intitializing the cHyperplaneBody).

See also:
fib::algorithms::nDn::cHyperplaneBodySimple<tFactors>::addInequiation() TODO: feature did not work correct (? not needed with feature FEATURE_C_SPLINE_USE_GLP_LIB_LINAR_PROBLEM_SOLVING)

created: 09.04.2011 Betti Oesterholz Status: implemened With this feature the cluster() function of nCluster will create the mapping for the cluster in one step. This will save memmory and time.

See also:
fib::algorithms::nCluster::cluster()

created: 11.04.2011 Betti Oesterholz Status: implemened and tested(11.04.2011)

Definition at line 180 of file version.h.

#define FEATURE_ND1_POLYNOM_TO_HORN_SCHEMA_FIB_UNDERFUNCTION

With this feature the method toFibUnderFunction() of the nD1::cPolynom class will convert the polynom to an fub underfunction polynom in the horn scheme form.

See also:
fib::algorithms::nD1::cPolynom<tX, tY>::toFibUnderFunction()

created: 10.03.2011 Betti Oesterholz Status: implemened and tested(10.03.2011)

Definition at line 115 of file version.h.

#define FEATURE_REMOVE_TOPMOST_UNDEROBJECTS

With this feature the removeOverwrittenUnderObjects() function will remove only the topmost overwritten underobjects.

See also:
fib::algorithms::nReduceFibObject::removeOverwrittenUnderObjects()

created: 11.09.2010 Betti Oesterholz Status: implemened and tested(05.12.2010)

Definition at line 70 of file version.h.

#define FEATURE_STORE_EVALUED_UNDEROBJECT_NUMBERS

With this feature the removeOverwrittenUnderObjects() function will store the evalued underobject numbers (

See also:
cFibElment::getObjectPointsForElement()) and will not evalue them again while reevaluing a point.
fib::algorithms::nReduceFibObject::removeOverwrittenUnderObjects()
fib::algorithms::nReduceFibObject::nRemoveOverwrittenUnderObjects::cEvalueUnderObjects::evalueElement()
fib::algorithms::nReduceFibObject::nRemoveOverwrittenUnderObjects::cEvalueUnderObjects::mapLiUnderobjects

created: 05.12.2010 Betti Oesterholz Status: implemened and tested(05.12.2010)

Definition at line 87 of file version.h.

#define FIB_ALGORITHMS_VERSION   1

file name: version.h

Author:
Betti Oesterholz
Date:
11.06.2010 webma.nosp@m.ster.nosp@m.@BioK.nosp@m.om.i.nosp@m.nfo

System: C++

This file contains switches for the different fib -algorithms -versions. Copyright (C) GPL3 2009 Betti Oesterholz

This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.

This file contains the versionsinformation for the Fib -Multimedialanguage algorithms implementations. This includes descriptions of declarations for versioned programming switches.

Definition at line 51 of file version.h.

#define FIB_ALGORITHMS_VERSION_NAME   V0.1.0

Definition at line 52 of file version.h.