Home
last modified time | relevance | path

Searched refs:MAXNODES (Results 1 – 25 of 125) sorted by relevance

12345

/dports/audio/bschaffl-lv2/BSchaffl-1.4.8/src/
H A DSelection.hpp35 using std::array<bool, MAXNODES>::operator[];
36 using std::array<bool, MAXNODES>::fill;
37 using std::array<bool, MAXNODES>::at;
56 if (pos >= MAXNODES) return MAXNODES; in getSelectedAntecessor()
63 return MAXNODES; in getSelectedAntecessor()
68 if (pos >= MAXNODES) return MAXNODES; in getSelectedSuccessor()
75 return MAXNODES; in getSelectedSuccessor()
80 if (pos >= MAXNODES) return MAXNODES; in getUnselectedAntecessor()
87 return MAXNODES; in getUnselectedAntecessor()
92 if (pos >= MAXNODES) return MAXNODES; in getUnselectedSuccessor()
[all …]
/dports/audio/bshapr-lv2/BShapr-0.13/src/
H A DSelection.hpp35 using std::array<bool, MAXNODES>::operator[];
36 using std::array<bool, MAXNODES>::fill;
37 using std::array<bool, MAXNODES>::at;
56 if (pos >= MAXNODES) return MAXNODES; in getSelectedAntecessor()
63 return MAXNODES; in getSelectedAntecessor()
68 if (pos >= MAXNODES) return MAXNODES; in getSelectedSuccessor()
75 return MAXNODES; in getSelectedSuccessor()
80 if (pos >= MAXNODES) return MAXNODES; in getUnselectedAntecessor()
87 return MAXNODES; in getUnselectedAntecessor()
92 if (pos >= MAXNODES) return MAXNODES; in getUnselectedSuccessor()
[all …]
/dports/audio/bharvestr-lv2/BHarvestr-7e6a1e7c81d0af61d4fabcd823978d62c8970502/src/
H A DSelection.hpp35 using std::array<bool, MAXNODES>::operator[];
36 using std::array<bool, MAXNODES>::fill;
37 using std::array<bool, MAXNODES>::at;
56 if (pos >= MAXNODES) return MAXNODES; in getSelectedAntecessor()
63 return MAXNODES; in getSelectedAntecessor()
68 if (pos >= MAXNODES) return MAXNODES; in getSelectedSuccessor()
75 return MAXNODES; in getSelectedSuccessor()
80 if (pos >= MAXNODES) return MAXNODES; in getUnselectedAntecessor()
87 return MAXNODES; in getUnselectedAntecessor()
92 if (pos >= MAXNODES) return MAXNODES; in getUnselectedSuccessor()
[all …]
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/MATCH/include/
H A Duser.h23 #define MAXNODES 200 macro
44 int cost[MAXNODES][MAXNODES];
46 int match1[MAXNODES*(MAXNODES-1)/2];
48 int match2[MAXNODES*(MAXNODES-1)/2];
50 int index[MAXNODES][MAXNODES];
/dports/multimedia/lives/lives-3.2.0/lives-plugins/weed-plugins/
H A Dnn_programmer.c43 #define MAXNODES 128 macro
55 sdata->vals = weed_malloc(MAXNODES * 2 * MAXNODES * sizeof(double)); in nnprog_init()
62 sdata->constvals = weed_malloc(MAXNODES * sizeof(double)); in nnprog_init()
70 for (i = 0; i < MAXNODES * 2; i++) { in nnprog_init()
71 if (i < MAXNODES) sdata->constvals[i] = drand(2.) - 1.; in nnprog_init()
72 for (j = 0; j < MAXNODES; j++) { in nnprog_init()
73 sdata->vals[i * MAXNODES + j] = drand(2.) - 1.; in nnprog_init()
108 if (i < MAXNODES) { in nnprog_process()
121 for (j = 0; j < MAXNODES; j++) { in nnprog_process()
202 weed_plant_t *out_params[MAXNODES * 2 + 1];
[all …]
/dports/comms/tlf/tlf-tlf-1.4.1/src/
H A Dlancode.c50 int bc_socket_descriptor[MAXNODES];
55 struct sockaddr_in bc_address[MAXNODES];
56 struct hostent *bc_hostbyname[MAXNODES];
58 char bc_hostaddress[MAXNODES][16];
59 char bc_hostservice[MAXNODES][16] = {
60 [0 ... MAXNODES - 1] = { [0 ... 15] = 0 }
65 int send_error_limit[MAXNODES];
73 int send_error[MAXNODES];
75 int send_packets[MAXNODES];
80 freq_t node_frequencies[MAXNODES];
/dports/games/openjk/OpenJK-07675e2/code/Ragl/
H A Dgraph_vs.h206 CAPACITY = MAXNODES,
528 for (int i=0; i<MAXNODES; i++) in clear_edges()
902 return (size()==MAXNODES); in full()
911 for (int i=0; i<MAXNODES; i++) in clear()
951 assert(size()<MAXNODES); in push()
1059 assert(a>=0 && b>=0 && a<MAXNODES && b<MAXNODES); in swap()
1070 mData[MAXNODES] = mData[a]; // a->TEMP in swap()
1072 mData[b] = mData[MAXNODES]; // TEMP->B in swap()
1522 ratl::bits_vs<MAXNODES> mClosed;
1650 ratl::queue_vs<search_node, MAXNODES> open; in bfs()
[all …]
H A Dgraph_region.h61 template <class TNODE, int MAXNODES, class TEDGE, int MAXEDGES, int NUM_EDGES_PER_NODE, int MAXR…
79 typedef ragl::graph_vs<TNODE, MAXNODES, TEDGE, MAXEDGES, NUM_EDGES_PER_NODE> TGraph;
80 typedef ratl::vector_vs<int, MAXNODES> TRegions;
105 mRegions.resize(MAXNODES, (int)NULL_REGION); in clear()
240 for (int indexA=0; indexA<MAXNODES; indexA++) in find_region_edges()
245 for (int indexB=0; indexB<MAXNODES; indexB++) in find_region_edges()
305 for (int i=0; i<MAXNODES; i++) in assign()
/dports/math/scalapack/scalapack-2.1.0/TESTING/EIG/
H A Dpcgsepdriver.f61 INTEGER CONTEXT, IAM, INFO, ISIEEE, MAXNODES, NNOCHECK,
104 READ( NIN, FMT = * )MAXNODES
109 CALL BLACS_SETUP( IAM, MAXNODES )
110 NPROCS = MAXNODES
H A Dpdgsepdriver.f67 INTEGER CONTEXT, IAM, INFO, ISIEEE, MAXNODES, NNOCHECK, variable
110 READ( NIN, FMT = * )MAXNODES
115 CALL BLACS_SETUP( IAM, MAXNODES )
116 NPROCS = MAXNODES
H A Dpzseprdriver.f53 INTEGER CONTEXT, IAM, INFO, ISIEEE, MAXNODES, NNOCHECK, variable
96 READ( NIN, FMT = * )MAXNODES
101 CALL BLACS_SETUP( IAM, MAXNODES )
102 NPROCS = MAXNODES
H A Dpcseprdriver.f53 INTEGER CONTEXT, IAM, INFO, ISIEEE, MAXNODES, NNOCHECK, variable
96 READ( NIN, FMT = * )MAXNODES
101 CALL BLACS_SETUP( IAM, MAXNODES )
102 NPROCS = MAXNODES
H A Dpdseprdriver.f53 INTEGER CONTEXT, IAM, INFO, ISIEEE, MAXNODES, NNOCHECK, variable
96 READ( NIN, FMT = * )MAXNODES
101 CALL BLACS_SETUP( IAM, MAXNODES )
102 NPROCS = MAXNODES
H A Dpsgsepdriver.f67 INTEGER CONTEXT, IAM, INFO, ISIEEE, MAXNODES, NNOCHECK, variable
110 READ( NIN, FMT = * )MAXNODES
115 CALL BLACS_SETUP( IAM, MAXNODES )
116 NPROCS = MAXNODES
H A Dpzgsepdriver.f67 INTEGER CONTEXT, IAM, INFO, ISIEEE, MAXNODES, NNOCHECK, variable
110 READ( NIN, FMT = * )MAXNODES
115 CALL BLACS_SETUP( IAM, MAXNODES )
116 NPROCS = MAXNODES
H A Dpzsepdriver.f67 INTEGER CONTEXT, IAM, INFO, ISIEEE, MAXNODES, NNOCHECK, variable
110 READ( NIN, FMT = * )MAXNODES
115 CALL BLACS_SETUP( IAM, MAXNODES )
116 NPROCS = MAXNODES
H A Dpcsepdriver.f61 INTEGER CONTEXT, IAM, INFO, ISIEEE, MAXNODES, NNOCHECK,
104 READ( NIN, FMT = * )MAXNODES
109 CALL BLACS_SETUP( IAM, MAXNODES )
110 NPROCS = MAXNODES
H A Dpsseprdriver.f53 INTEGER CONTEXT, IAM, INFO, ISIEEE, MAXNODES, NNOCHECK, variable
96 READ( NIN, FMT = * )MAXNODES
101 CALL BLACS_SETUP( IAM, MAXNODES )
102 NPROCS = MAXNODES
H A Dpdsepdriver.f71 INTEGER CONTEXT, IAM, INFO, ISIEEE, MAXNODES, NNOCHECK, variable
114 READ( NIN, FMT = * )MAXNODES
119 CALL BLACS_SETUP( IAM, MAXNODES )
120 NPROCS = MAXNODES
H A Dpssepdriver.f71 INTEGER CONTEXT, IAM, INFO, ISIEEE, MAXNODES, NNOCHECK, variable
114 READ( NIN, FMT = * )MAXNODES
119 CALL BLACS_SETUP( IAM, MAXNODES )
120 NPROCS = MAXNODES
H A Dpdsvddriver.f45 INTEGER CONTEXT, ERR, I, IAM, J, K, LWORK, MAXNODES, variable
78 READ( NIN, FMT = * )MAXNODES
82 CALL BLACS_SETUP( IAM, MAXNODES )
83 NPROCS = MAXNODES
H A Dpssvddriver.f45 INTEGER CONTEXT, ERR, I, IAM, J, K, LWORK, MAXNODES, variable
78 READ( NIN, FMT = * )MAXNODES
82 CALL BLACS_SETUP( IAM, MAXNODES )
83 NPROCS = MAXNODES
/dports/graphics/gpxsee/GPXSee-7.32/src/common/
H A Drtree.h54 MAXNODES = TMAXNODES, ///< Max elements in node enumerator
281 Branch m_branch[MAXNODES]; ///< Branch
294 int m_partition[MAXNODES+1];
297 int m_taken[MAXNODES+1];
302 Branch m_branchBuf[MAXNODES+1];
355 Q_ASSERT(MAXNODES > MINNODES); in RTree()
883 Q_ASSERT(a_node->m_count == MAXNODES); in GetBranches()
886 for (int index=0; index < MAXNODES; ++index) in GetBranches()
888 a_parVars->m_branchBuf[MAXNODES] = *a_branch; in GetBranches()
889 a_parVars->m_branchCount = MAXNODES + 1; in GetBranches()
[all …]
/dports/net/seda/seda-release-20020712/seda/src/seda/sandStorm/lib/aSocket/test/bench/
H A Ddo-run.pl23 $MAXNODES = 16;
37 while ($nodes > $MAXNODES) {
/dports/x11-toolkits/gtkextra/gtkextra-3.3.4/gtkextra/
H A Dtestgtkplot3d.c107 #define MAXNODES 50000 macro
247 x= g_new(gdouble,MAXNODES); in main()
248 y= g_new(gdouble,MAXNODES); in main()
249 z= g_new(gdouble,MAXNODES); in main()
250 while (fgets(buffer,1000,f) && cnt<MAXNODES) in main()

12345