Home
last modified time | relevance | path

Searched refs:abacus (Results 1 – 25 of 1167) sorted by relevance

12345678910>>...47

/dports/misc/nut/nut-20.1/
H A Dranking.c93 float abacus[MAX_FOOD]; in rank_foods() local
209 abacus[count] = 0; in rank_foods()
221 else abacus[count] = 0; in rank_foods()
253 abacus[count] /= days; in rank_foods()
259 max = max_array(abacus); in rank_foods()
265 if ( abacus[max] == 0 ) in rank_foods()
322 abacus[max] = 0; in rank_foods()
323 max = max_array(abacus); in rank_foods()
331 if ( abacus[max] == 0 && max < FoodCount ) in rank_foods()
342 int max_array(float abacus[]) in max_array() argument
[all …]
H A Danameal.c244 int random_max_var_array(float abacus[], int last) in random_max_var_array() argument
251 if (abacus[count] > abacus[i]) in random_max_var_array()
256 else if (abacus[count] == abacus[i]) max_count++; in random_max_var_array()
264 if (abacus[count] == abacus[i]) rand_count--; in random_max_var_array()
/dports/math/ogdf/OGDF/include/ogdf/cluster/internal/
H A DCPlanaritySub.h47 class CPlanaritySub : public abacus::Sub {
51 explicit CPlanaritySub(abacus::Master *master);
52 …CPlanaritySub(abacus::Master *master, abacus::Sub *father, abacus::BranchRule *branchRule, List<ab…
58 virtual abacus::Sub *generateSon(abacus::BranchRule *rule) override;
76 int ret = abacus::Sub::optimize(); in optimize()
163 …inline int addPoolCons(ArrayBuffer<abacus::Constraint *> &cons, abacus::StandardPool<abacus::Const… in addPoolCons()
168 …inline int separateCutPool(abacus::StandardPool<abacus::Constraint, abacus::Variable> *pool, doubl… in separateCutPool()
186 List< abacus::Constraint* > criticalSinceBranching;
187 ArrayBuffer<abacus::Constraint* > bufferedForCreation;
190 void myAddVars(ArrayBuffer<abacus::Variable*>& b) { in myAddVars()
[all …]
H A DMaxCPlanarSub.h46 class MaxCPlanarSub : public abacus::Sub {
50 explicit MaxCPlanarSub(abacus::Master *master);
51 …MaxCPlanarSub(abacus::Master *master, abacus::Sub *father, abacus::BranchRule *branchRule, List<ab…
57 virtual abacus::Sub *generateSon(abacus::BranchRule *rule) override;
77 int ret = abacus::Sub::optimize(); in optimize()
164 …inline int addPoolCons(ArrayBuffer<abacus::Constraint *> &cons, abacus::StandardPool<abacus::Const… in addPoolCons()
168 …inline int separateCutPool(abacus::StandardPool<abacus::Constraint, abacus::Variable> *pool, doubl… in separateCutPool()
187 List< abacus::Constraint* > criticalSinceBranching;
188 ArrayBuffer<abacus::Constraint* > bufferedForCreation;
191 void myAddVars(ArrayBuffer<abacus::Variable*>& b) { in myAddVars()
[all …]
H A DMaxCPlanarMaster.h48 class MaxCPlanarMaster : public abacus::Master {
94 virtual abacus::Sub *firstSub() override;
175 …abacus::StandardPool<abacus::Constraint, abacus::Variable> *getCutConnPool() {return m_cutConnPool… in getCutConnPool()
177 …abacus::StandardPool<abacus::Constraint, abacus::Variable> *getCutKuraPool() {return m_cutKuraPool… in getCutKuraPool()
287 abacus::StandardPool< abacus::Constraint, abacus::Variable > *m_cutConnPool; //!< Connectivity Cuts
288 abacus::StandardPool< abacus::Constraint, abacus::Variable > *m_cutKuraPool; //!< Kuratowski Cuts
321 void getCoefficients(abacus::Constraint* con, const List<EdgeVar *> & orig,
H A DCP_MasterBase.h46 class CP_MasterBase : public abacus::Master {
154 …abacus::StandardPool<abacus::Constraint, abacus::Variable> *getCutConnPool() {return m_cutConnPool… in getCutConnPool()
156 …abacus::StandardPool<abacus::Constraint, abacus::Variable> *getCutKuraPool() {return m_cutKuraPool… in getCutKuraPool()
198 abacus::StandardPool< abacus::Constraint, abacus::Variable > *m_cutConnPool; //!< Connectivity Cuts
199 abacus::StandardPool< abacus::Constraint, abacus::Variable > *m_cutKuraPool; //!< Kuratowski Cuts
359 virtual void getCoefficients(abacus::Constraint* con, const List<CPlanarEdgeVar* > & connect,
H A Dbasics.h59 class BaseConstraint : public abacus::Constraint {
61 …BaseConstraint(abacus::Master *master, const abacus::Sub *sub, abacus::CSense::SENSE sense, double… in BaseConstraint()
62 abacus::Constraint(master, sub, sense, rhs, dynamic, local, liftable) { } in BaseConstraint()
67 virtual double coeff(const abacus::Variable *v) const = 0;
H A DMaxPlanarEdgesConstraint.h49 class MaxPlanarEdgesConstraint : public abacus::Constraint {
56 MaxPlanarEdgesConstraint(abacus::Master *master, int edgeBound, List<NodePair> &edges);
57 MaxPlanarEdgesConstraint(abacus::Master *master, int edgeBound);
63 virtual double coeff(const abacus::Variable *v) const override;
H A DEdgeVar.h43 class EdgeVar : public abacus::Variable {
48 EdgeVar(abacus::Master *master, double obj, EdgeType eType, node source, node target);
50 EdgeVar(abacus::Master *master, double obj, node source, node target);
52 EdgeVar(abacus::Master *master, double obj, double lbound, node source, node target);
H A DMinimalClusterConnection.h53 class MinimalClusterConnection : public abacus::Constraint {
55 MinimalClusterConnection(abacus::Master *master, List<NodePair> &edges);
60 virtual double coeff(const abacus::Variable *v) const override;
H A DClusterKuratowskiConstraint.h49 class ClusterKuratowskiConstraint : public abacus::Constraint {
51 ClusterKuratowskiConstraint(abacus::Master *master, int nEdges, SListPure<NodePair> &ks);
56 virtual double coeff(const abacus::Variable *v) const override;
H A DCutConstraint.h49 CutConstraint(abacus::Master *master, abacus::Sub *sub, List<NodePair> &edges);
54 virtual double coeff(const abacus::Variable *v) const override { in coeff()
/dports/misc/nut/nut-20.1/fltk/
H A DFoodRanking.cc155 for ( count = 1 ; count < FoodCount ; count++ ) if (abacus[count] > abacus[i]) i = count; in max_array()
194 abacus[count] /= days; in per_daily_recorded_meals()
205 abacus[max] = 0; in per_daily_recorded_meals()
235 abacus[max] = 0; in per_100_grams()
270 abacus[max] = 0; in per_100_grams_dry_weight()
306 abacus[max] = 0; in per_100_grams_within_food_group()
365 abacus[count] = 0; in per_serving_minimize()
377 abacus[max] = 0; in per_serving_minimize()
402 else abacus[count] = 0; in per_100_calories()
412 abacus[max] = 0; in per_100_calories()
[all …]
/dports/science/dalton/dalton-66052b3af5ea7225e31178bf9a8b031913c72190/cmake/
H A DSourcesDALTON.cmake82 DALTON/abacus/abaaat.F
84 DALTON/abacus/abadip.F
85 DALTON/abacus/abadrv.F
88 DALTON/abacus/abaenr.F
90 DALTON/abacus/abaexc.F
91 DALTON/abacus/abaflt.F
92 DALTON/abacus/abafmm.F
93 DALTON/abacus/abafsd.F
94 DALTON/abacus/abalnr.F
113 DALTON/abacus/abaqr.F
[all …]
/dports/math/ogdf/OGDF/include/ogdf/cluster/
H A DClusterPlanarity.h80 , m_optStatus(abacus::Master::STATUS::Unprocessed) in ClusterPlanarity()
133 abacus::Master::STATUS getOptStatus() { return m_optStatus; } in getOptStatus()
155 abacus::Master::STATUS &status);
216 abacus::StandardPool<abacus::Constraint, abacus::Variable> *connCon,
217 abacus::StandardPool<abacus::Variable, abacus::Constraint> *stdVar);
220 abacus::Master::STATUS m_optStatus; //<! Status of optimization, returned from abacus
H A DMaximumCPlanarSubgraph.h179 abacus::Master::STATUS &status);
246 abacus::StandardPool<abacus::Constraint, abacus::Variable> *connCon,
247 abacus::StandardPool<abacus::Variable, abacus::Constraint> *stdVar);
/dports/math/ogdf/OGDF/include/ogdf/graphalg/
H A DMinSteinerTreeDirectedCut.h371 abacus::NonDuplPool<abacus::Constraint, abacus::Variable> *cutPool() {return m_pCutPool;} in cutPool()
616 abacus::NonDuplPool<abacus::Constraint, abacus::Variable> *m_pCutPool;
695 Sub(abacus::Master *master, abacus::Sub *father, abacus::BranchRule *branchRule);
778 const abacus::Sub *sub,
785 abacus::VarType::TYPE vartype = abacus::VarType::Binary
821 abacus::CSense::SENSE sense = abacus::CSense::Less,
1286 abacus::VarType::TYPE vartype = abacus::VarType::Binary; in initializeOptimization()
1405 …m_pCutPool = new abacus::NonDuplPool<abacus::Constraint, abacus::Variable>(this, m_poolSizeInit, t… in initializeOptimization()
1519 : abacus::Sub(master,0,0,0) in Sub()
1535 MinSteinerTreeDirectedCut<T>::Sub::Sub(abacus::Master *master, abacus::Sub *father, abacus::BranchR… in Sub()
[all …]
/dports/devel/pear-PHP_ArrayOf/PHP_ArrayOf-0.2.1/tests/
H A DArrayOfAnything.inc10 * @author Philippe Jausions <Philippe.Jausions@11abacus.com>
11 * @copyight 2008 by Philippe Jausions / 11abacus
31 * @author Philippe Jausions <Philippe.Jausions@11abacus.com>
32 * @copyight 2008 by Philippe Jausions / 11abacus
H A DArrayOfInteger.inc10 * @author Philippe Jausions <Philippe.Jausions@11abacus.com>
11 * @copyight 2008 by Philippe Jausions / 11abacus
31 * @author Philippe Jausions <Philippe.Jausions@11abacus.com>
32 * @copyight 2008 by Philippe Jausions / 11abacus
H A DArrayOfString.inc10 * @author Philippe Jausions <Philippe.Jausions@11abacus.com>
11 * @copyight 2008 by Philippe Jausions / 11abacus
31 * @author Philippe Jausions <Philippe.Jausions@11abacus.com>
32 * @copyight 2008 by Philippe Jausions / 11abacus
/dports/math/ogdf/OGDF/include/ogdf/lib/abacus/
H A Dactive.inc31 #include <ogdf/lib/abacus/active.h>
32 #include <ogdf/lib/abacus/master.h>
33 #include <ogdf/lib/abacus/poolslotref.h>
34 #include <ogdf/lib/abacus/sparvec.h>
35 #include <ogdf/lib/abacus/convar.h>
36 #include <ogdf/lib/abacus/poolslot.h>
38 namespace abacus {
H A Dstandardpool.inc31 #include <ogdf/lib/abacus/cutbuffer.h>
32 #include <ogdf/lib/abacus/master.h>
33 #include <ogdf/lib/abacus/poolslot.h>
34 #include <ogdf/lib/abacus/constraint.h>
35 #include <ogdf/lib/abacus/variable.h>
36 #include <ogdf/lib/abacus/sub.h>
37 #include <ogdf/lib/abacus/bheap.h>
39 namespace abacus {
H A Dseparator.inc31 #include <ogdf/lib/abacus/separator.h>
32 #include <ogdf/lib/abacus/constraint.h>
33 #include <ogdf/lib/abacus/variable.h>
35 namespace abacus {
H A Dcutbuffer.inc31 #include <ogdf/lib/abacus/poolslotref.h>
32 #include <ogdf/lib/abacus/poolslot.h>
33 #include <ogdf/lib/abacus/cutbuffer.h>
34 #include <ogdf/lib/abacus/variable.h>
35 #include <ogdf/lib/abacus/constraint.h>
36 //#include <ogdf/lib/abacus/sorter.h>
40 namespace abacus {
H A Dlpsolution.inc31 #include <ogdf/lib/abacus/master.h>
32 #include <ogdf/lib/abacus/lpsolution.h>
33 #include <ogdf/lib/abacus/active.h>
34 #include <ogdf/lib/abacus/sub.h>
36 namespace abacus {

12345678910>>...47