Changeset 488
- Timestamp:
- 12/06/10 16:24:09 (14 years ago)
- Location:
- trunk/yao/src/YAOObjects
- Files:
-
- 5 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/yao/src/YAOObjects/Connection.hpp
r28 r488 51 51 * If the member concern both stages we do not put anything. 52 52 * 53 * The class has some significant property: "from", "N ° output", "Ci", "Cj", "Ck", "Ct", "to", "N°input". These can be retrieved with the methods:53 * The class has some significant property: "from", "Nï¿œ output", "Ci", "Cj", "Ck", "Ct", "to", "Nï¿œ input". These can be retrieved with the methods: 54 54 * getPropertyCount, getPropertyName and getProperty. These methods are useful above all in the second stage and they are used to shows 55 55 * in a structured way the properties of the theConnectionTable object that is a table composed of Connection objects. … … 73 73 74 74 //! Default constructor. 75 Connection(): reli(0), relj(0), relk(0), relt(0), inBegin(0), inEnd(0), outBegin(0), outEnd(0), t(false), T(false){}75 Connection(): inBegin(0), outBegin(0), inEnd(0), outEnd(0), reli(0), relj(0), relk(0), relt(0), t(false), T(false){} 76 76 77 77 /** … … 405 405 /** 406 406 * Allows to have a nice and automatic visualization of the Connection object elements. 407 * In this method we retrive this kind of propertis: "from", "N ° output", "Ci", "Cj", "Ck", "Ct", "to", "N°input".407 * In this method we retrive this kind of propertis: "from", "Nï¿œ output", "Ci", "Cj", "Ck", "Ct", "to", "Nï¿œ input". 408 408 * These are prefixed string that never change. 409 409 * @param anIndex is the number of property required. … … 418 418 /** 419 419 * Allows to have a nice and automatic visualization of the Connection object elements. 420 * In this method we retrive the value of significant property: "from", "N ° output", "Ci", "Cj", "Ck", "Ct", "to", "N°input".420 * In this method we retrive the value of significant property: "from", "Nï¿œ output", "Ci", "Cj", "Ck", "Ct", "to", "Nï¿œ input". 421 421 * In function of the integer in input to the method we retrieve the respective property. 422 422 * @param anIndex is the number of property required. … … 455 455 short reli, relj, relk; 456 456 457 //! Relative or absolute displacement for t and T coordinates. 457 //! Relative or absolute displacement for t and T coordinates. 458 458 //! 0 ==> t not present in the ctin-m directive; 459 459 //! -1 ==> absolute displacement; … … 461 461 //! 2 ==> relative displacement if the input trajectory is different from the output trajectory and we have 't' in the description file. 462 462 //! In this case we have to translate the instants from the inTraj to the outTraj. 463 short relt; 463 short relt; 464 464 bool ctinType; //!< True if ctin, false if ctinm. 465 465 … … 470 470 /** 471 471 * Allows to have a nice and automatic visualization of the Connection object elements. 472 * In this method we retrive the value of significant property: "from", "N ° output", "Ci", "Cj", "Ck", "Ct", "to", "N°input".472 * In this method we retrive the value of significant property: "from", "Nï¿œ output", "Ci", "Cj", "Ck", "Ct", "to", "Nï¿œ input". 473 473 * In function of the integer in input to the method we retrieve the respective property. 474 474 * @param anIndex is the number of property required. -
trunk/yao/src/YAOObjects/Operator.hpp
r1 r488 49 49 */ 50 50 Operator(const std::string& aName=""): 51 Component<Trajectory>(aName, 0), theType(Operator::M), counterOrderHeader(false), counterOrderBody(false){}51 Component<Trajectory>(aName, 0), counterOrderHeader(false), counterOrderBody(false), theType(Operator::M) {} 52 52 53 53 /** … … 59 59 */ 60 60 Operator(const std::string& aName, const Trajectory* aParent, std::vector<int> aShape, Type aType=Operator::M): 61 Component<Trajectory>(aName, aParent), SpaceExtent(aShape), theType(aType), counterOrderHeader(false), counterOrderBody(false){}61 Component<Trajectory>(aName, aParent), SpaceExtent(aShape), counterOrderHeader(false), counterOrderBody(false), theType(aType){} 62 62 63 63 /** -
trunk/yao/src/YAOObjects/Order.cpp
r484 r488 210 210 */ 211 211 void Order::reverseTokenList(struct st_token *atoken){ 212 struct st_token *q0 , *q1; // Pointer on the begin of the list_inst of the chain.212 struct st_token *q0=NULL, *q1=NULL; // Pointer on the begin of the list_inst of the chain. 213 213 struct st_token *p1, *p2, *pe;// Pointer that allow the reverse of the list elements and that progress each time 214 214 … … 360 360 // ---------------------------------------------------------------------------- 361 361 362 int nbSpace ;362 int nbSpace = 0; 363 363 364 364 // For all the order object inside the order table … … 856 856 stringstream theConnection; 857 857 858 858 859 theConnection << itSource -> getName() << "(" << tok_tab -> getI() << ", " << tok_tab -> getJ() << ", " << tok_tab -> getK() << ") ==> " << itTarget -> getName() << " : "; 860 861 859 862 860 863 // Keep connections if the moduls are integrated in an order statement … … 1291 1294 // ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 1292 1295 1293 if(itSource -> getAxisVal(numDim) > 0 && valCijk[itSource -> getAxisNumber(numDim) - 1] > 0) return 1; 1296 if(itSource -> getAxisVal(numDim) > 0 && valCijk[itSource -> getAxisNumber(numDim) - 1] > 0) 1297 return 1; 1294 1298 1295 1299 } … … 1389 1393 // --------------------------------------------------------- 1390 1394 1391 for( int noTraj = 0; noTraj < trajVector.size(); noTraj++)1395 for(unsigned int noTraj = 0; noTraj < trajVector.size(); noTraj++) 1392 1396 1393 1397 // If the trajectory match the current one, then it should be considerated as already integrated … … 1434 1438 // ----------------------- 1435 1439 1436 for( int i = 0; i < spacesList.size(); i++) add_vertex(spaceGraph);1440 for(unsigned int i = 0; i < spacesList.size(); i++) add_vertex(spaceGraph); 1437 1441 1438 1442 // Register the space name inside each vertex … … 1498 1502 // ------------------------- 1499 1503 1500 for( int noTraj = 0; noTraj < trajVector.size(); noTraj++) {1504 for(unsigned int noTraj = 0; noTraj < trajVector.size(); noTraj++) { 1501 1505 1502 1506 int orderId = -1; … … 1505 1509 // ------------------ 1506 1510 1507 for( int noSpace = 0; noSpace < topoOrder.size(); noSpace++) {1511 for(unsigned int noSpace = 0; noSpace < topoOrder.size(); noSpace++) { 1508 1512 1509 1513 // In the order that have been defined to the spaces by the topological sort … … 1543 1547 // -------------------------------- 1544 1548 1545 for( int noTraj = 0; noTraj < trajOrder.size(); noTraj++) {1549 for(unsigned int noTraj = 0; noTraj < trajOrder.size(); noTraj++) { 1546 1550 1547 1551 // For all the space numbers 1548 1552 // ------------------------- 1549 1553 1550 for( int noSpace = 0; noSpace < topoOrder.size(); noSpace++) {1554 for(unsigned int noSpace = 0; noSpace < topoOrder.size(); noSpace++) { 1551 1555 1552 1556 // In the order that have been defined to the spaces by the topological sort … … 1809 1813 1810 1814 1811 /* 1815 1812 1816 * Perform the spaceintraj writting. 1813 1817 * For each trajectory in the trajectories order that have been performed (maybe not needed). … … 1819 1823 // -------------------------------- 1820 1824 1821 for( int noTraj = 0; noTraj < trajOrder.size(); noTraj++) {1825 for(unsigned int noTraj = 0; noTraj < trajOrder.size(); noTraj++) { 1822 1826 1823 1827 ofstream hiddenFile; … … 1848 1852 // ------------------------- 1849 1853 1850 for( int noSpace = 0; noSpace < topoOrder.size(); noSpace++) {1854 for(unsigned int noSpace = 0; noSpace < topoOrder.size(); noSpace++) { 1851 1855 1852 1856 // In the order that have been defined to the spaces by the topological sort … … 1891 1895 1892 1896 1893 int Order::getModulIndex(string mod, const vector<string>& tab, int index) { for(int i = 0; i < index; i++) if(tab[i] == mod) return i; } 1897 int Order::getModulIndex(string mod, const vector<string>& tab, int index) 1898 { 1899 for(int i = 0; i < index; i++) 1900 if(tab[i] == mod) 1901 return i; 1902 } 1894 1903 1895 1904 void Order::to3D(int nbDim, vector<int>& valCi, vector<int>& valCj, vector<int>& valCk, int nbEdges) { … … 1919 1928 // --------------------------------------------------------------- 1920 1929 1921 for( int i = 0; i < modulList.size(); i++) add_vertex(currentGraph);1922 1923 for( int i = 0; i < edgeArray.size(); i++) add_edge(edgeArray[i].first, edgeArray[i].second, currentGraph);1930 for(unsigned int i = 0; i < modulList.size(); i++) add_vertex(currentGraph); 1931 1932 for(unsigned int i = 0; i < edgeArray.size(); i++) add_edge(edgeArray[i].first, edgeArray[i].second, currentGraph); 1924 1933 1925 1934 … … 1979 1988 // ----------------------------------------------------- 1980 1989 1981 for( int noComp3D = 0; noComp3D < outerComp.size(); noComp3D++) {1990 for(unsigned int noComp3D = 0; noComp3D < outerComp.size(); noComp3D++) { 1982 1991 1983 1992 // Display all relevant informations on components : dimension and sign of the three first axis … … 1999 2008 // ------------------------------------------------------ 2000 2009 2001 for( int noComp3D = 0; noComp3D < outerComp.size(); noComp3D++) {2010 for(unsigned int noComp3D = 0; noComp3D < outerComp.size(); noComp3D++) { 2002 2011 2003 2012 // For all 2D component embedded in the vector middleComp 2004 2013 // ------------------------------------------------------- 2005 2014 2006 for( int noComp2D = 0; noComp2D < middleComp[noComp3D][noFixed1].size(); noComp2D++) {2015 for(unsigned int noComp2D = 0; noComp2D < middleComp[noComp3D][noFixed1].size(); noComp2D++) { 2007 2016 2008 2017 // For all 1D component embedded in the vector innerComp 2009 2018 // ----------------------------------------------------- 2010 2019 2011 for( int noComp1D = 0; noComp1D < innerComp[noComp3D][noFixed1][noComp2D][noFixed2].size(); noComp1D++) {2020 for(unsigned int noComp1D = 0; noComp1D < innerComp[noComp3D][noFixed1][noComp2D][noFixed2].size(); noComp1D++) { 2012 2021 2013 2022 // Display all relevant informations on components : dimension and sign of the remaining axis then embedded moduls … … 2019 2028 << innerComp[noComp3D][noFixed1][noComp2D][noFixed2][noComp1D].cfcSign[0].second << ", modulees : "; 2020 2029 2021 for( int noMod = 0; noMod < innerComp[noComp3D][noFixed1][noComp2D][noFixed2][noComp1D].embeddedModuls.size(); noMod++) {2030 for(unsigned int noMod = 0; noMod < innerComp[noComp3D][noFixed1][noComp2D][noFixed2][noComp1D].embeddedModuls.size(); noMod++) { 2022 2031 2023 2032 cout << boost::get(boost::vertex_name_t(), myGraph, innerComp[noComp3D][noFixed1][noComp2D][noFixed2][noComp1D].embeddedModuls[noMod]) << " "; … … 2053 2062 // ----------------------------------------------------------------------------- 2054 2063 2055 for( int i = 0; i < outerComponentsList.size(); i++) put(get(boost::vertex_affected_comp_t(), myGraph), i, outerComponentsList[i]);2064 for(unsigned int i = 0; i < outerComponentsList.size(); i++) put(get(boost::vertex_affected_comp_t(), myGraph), i, outerComponentsList[i]); 2056 2065 2057 2066 // Setting the number of components that have been detected … … 2394 2403 vector<cfcStruct> sortedOuterCfcStructTable; 2395 2404 2396 for( int noComponent = 0; noComponent < topoOrder.size(); noComponent++) {2405 for(unsigned int noComponent = 0; noComponent < topoOrder.size(); noComponent++) { 2397 2406 2398 2407 sortedOuterCfcStructTable.push_back(outerComp[topoOrder[noComponent]]); … … 2406 2415 outerComp.clear(); 2407 2416 2408 for( int noComponent = 0; noComponent < topoOrder.size(); noComponent++) {2417 for(unsigned int noComponent = 0; noComponent < topoOrder.size(); noComponent++) { 2409 2418 2410 2419 isImposed[noComponent][0] = sortedIsImposed[noComponent][0]; … … 2432 2441 // ---------------------------------------------------------------------------------------- 2433 2442 2434 for( int noComp3D = 0; noComp3D < outerComp.size(); noComp3D++) middleComp[noComp3D] = new cfcStructTableType[3];2443 for(unsigned int noComp3D = 0; noComp3D < outerComp.size(); noComp3D++) middleComp[noComp3D] = new cfcStructTableType[3]; 2435 2444 2436 2445 // Set the inner component (1D) array second dimension to 3 (one by first fixed dimension) 2437 2446 // --------------------------------------------------------------------------------------- 2438 2447 2439 for( int noComp3D = 0; noComp3D < outerComp.size(); noComp3D++) innerComp[noComp3D] = new cfcStructTableType**[3];2448 for(unsigned int noComp3D = 0; noComp3D < outerComp.size(); noComp3D++) innerComp[noComp3D] = new cfcStructTableType**[3]; 2440 2449 2441 2450 // For each 3D component 2442 2451 // --------------------- 2443 2452 2444 for( int noComp = 0; noComp < outerComp.size(); noComp++) {2453 for(unsigned int noComp = 0; noComp < outerComp.size(); noComp++) { 2445 2454 2446 2455 // Create a graph that just contain vertices and edges included in the current 3D component (ie extract the current 3D component from the main graph) … … 2511 2520 // ----------------------------------- 2512 2521 2513 for( int i = 0; i < edgeIterVector.size(); i++)2522 for(unsigned int i = 0; i < edgeIterVector.size(); i++) 2514 2523 2515 2524 // If the edge does not connect two nodes of the component "noComp" given as parameter (ie. if the edge is not fully integrated in the comoponent) … … 2543 2552 // ----------------------------------- 2544 2553 2545 for( int i = 0; i < vertexIterVector.size(); i++)2554 for(unsigned int i = 0; i < vertexIterVector.size(); i++) 2546 2555 2547 2556 // If the vertex is not a part of the component "noComp" given as parameter … … 2562 2571 cout << endl << "showMiddle(" << noFixed1 << ")"; 2563 2572 2564 for( int noComp3D = 0; noComp3D < outerComp.size(); noComp3D++) {2565 2566 for( int noComp2D = 0; noComp2D < middleComp[noComp3D][noFixed1].size(); noComp2D++) {2573 for(unsigned int noComp3D = 0; noComp3D < outerComp.size(); noComp3D++) { 2574 2575 for(unsigned int noComp2D = 0; noComp2D < middleComp[noComp3D][noFixed1].size(); noComp2D++) { 2567 2576 2568 2577 cout << endl << "middleComp[" << noComp3D << "][" << noFixed1 << "][" << noComp2D << "].cfcSign[0].first : " … … 2574 2583 cout << endl; 2575 2584 2576 for( int noMod = 0; noMod < middleComp[noComp3D][noFixed1][noComp2D].embeddedModuls.size(); noMod++) {2585 for(unsigned int noMod = 0; noMod < middleComp[noComp3D][noFixed1][noComp2D].embeddedModuls.size(); noMod++) { 2577 2586 2578 2587 cout << endl << "middleComp[" << noComp3D << "][" << noFixed1 << "][" << noComp2D << "].EmbeddedModuls[" << noMod << "] : " … … 2643 2652 // -------------------------------------------------------------------------------------------------------------- 2644 2653 2645 for( int noVertex = 0; noVertex < boost::num_vertices(upperGraph); noVertex++) add_vertex(outGraph);2654 for(unsigned int noVertex = 0; noVertex < boost::num_vertices(upperGraph); noVertex++) add_vertex(outGraph); 2646 2655 2647 2656 // Add one edge for each edge of the graph that have to be copied (the vertices are created with the same indexes than in the original graph and then the edges connect the right vertices) … … 3035 3044 // ---------------------------------------------------------------------------------- 3036 3045 3037 for( int i = 0; i < fixedComponentsList.size(); i++) put(get(boost::vertex_affected_comp_t(), currentGraph), i, fixedComponentsList[i]);3046 for(unsigned int i = 0; i < fixedComponentsList.size(); i++) put(get(boost::vertex_affected_comp_t(), currentGraph), i, fixedComponentsList[i]); 3038 3047 3039 3048 // Get the number of 1D components detected … … 3062 3071 // ---------------------------------- 3063 3072 3064 for( int noComp1D = 0; noComp1D < innerComp[noComp3D][noFixed1][noComp2D][noFixed2].size(); noComp1D++) {3073 for(unsigned int noComp1D = 0; noComp1D < innerComp[noComp3D][noFixed1][noComp2D][noFixed2].size(); noComp1D++) { 3065 3074 3066 3075 innerComp[noComp3D][noFixed1][noComp2D][noFixed2][noComp1D].cfcSign.resize(1); … … 3073 3082 // -------------------------------------------------------------------------------- 3074 3083 3075 for( int i = 0; i < fixedComponentsList.size(); i++) {3084 for(unsigned int i = 0; i < fixedComponentsList.size(); i++) { 3076 3085 3077 3086 innerComp[noComp3D][noFixed1][noComp2D][noFixed2][fixedComponentsList[i]].embeddedModuls.push_back(boost::get(boost::vertex_original_id_t(), currentGraph, i)); … … 3124 3133 boost::topological_sort(currentGraph, std::front_inserter(topoOrder), boost::vertex_index_map(boost::identity_property_map())); 3125 3134 3126 for( int i = 0; i < topoOrder.size(); i++) put(get(boost::vertex_topo_order_t(), currentGraph), topoOrder[i], i);3135 for(unsigned int i = 0; i < topoOrder.size(); i++) put(get(boost::vertex_topo_order_t(), currentGraph), topoOrder[i], i); 3127 3136 3128 3137 // ETAPE 5.2 DE LA PROCEDURE A UNE DIMENSION … … 3132 3141 // ----------------------------------------------------- 3133 3142 3134 for( int noComp1D = 0; noComp1D < innerComp[noComp3D][noFixed1][noComp2D][noFixed2].size(); noComp1D++) {3135 3136 for( int noMod = 0; noMod < innerComp[noComp3D][noFixed1][noComp2D][noFixed2][noComp1D].embeddedModuls.size(); noMod++) {3137 3138 for( int noMod2 = noMod + 1; noMod2 < innerComp[noComp3D][noFixed1][noComp2D][noFixed2][noComp1D].embeddedModuls.size(); noMod2++) {3143 for(unsigned int noComp1D = 0; noComp1D < innerComp[noComp3D][noFixed1][noComp2D][noFixed2].size(); noComp1D++) { 3144 3145 for(unsigned int noMod = 0; noMod < innerComp[noComp3D][noFixed1][noComp2D][noFixed2][noComp1D].embeddedModuls.size(); noMod++) { 3146 3147 for(unsigned int noMod2 = noMod + 1; noMod2 < innerComp[noComp3D][noFixed1][noComp2D][noFixed2][noComp1D].embeddedModuls.size(); noMod2++) { 3139 3148 3140 3149 if(get(boost::vertex_topo_order_t(), currentGraph, innerComp[noComp3D][noFixed1][noComp2D][noFixed2][noComp1D].embeddedModuls[noMod]) > … … 3177 3186 vector<cfcStruct> sortedCfcStructTable; 3178 3187 3179 for( int noComponent = 0; noComponent < reducedTopoOrder.size(); noComponent++) sortedCfcStructTable.push_back(innerComp[noComp3D][noFixed1][noComp2D][noFixed2][reducedTopoOrder[noComponent]]);3188 for(unsigned int noComponent = 0; noComponent < reducedTopoOrder.size(); noComponent++) sortedCfcStructTable.push_back(innerComp[noComp3D][noFixed1][noComp2D][noFixed2][reducedTopoOrder[noComponent]]); 3180 3189 3181 3190 innerComp[noComp3D][noFixed1][noComp2D][noFixed2].clear(); 3182 3191 3183 for( int noComponent = 0; noComponent < reducedTopoOrder.size(); noComponent++) innerComp[noComp3D][noFixed1][noComp2D][noFixed2].push_back(sortedCfcStructTable[noComponent]);3192 for(unsigned int noComponent = 0; noComponent < reducedTopoOrder.size(); noComponent++) innerComp[noComp3D][noFixed1][noComp2D][noFixed2].push_back(sortedCfcStructTable[noComponent]); 3184 3193 3185 3194 } … … 3210 3219 // ------------------------------- 3211 3220 3212 for( int i = 0; i < edgeIterVector.size(); i++) {3221 for(unsigned int i = 0; i < edgeIterVector.size(); i++) { 3213 3222 3214 3223 // If the sign value for the edge is not null for the dimension "noFixedDim" given as parameter, then delete the edge … … 3284 3293 // ------------------------------------------------------------------------------ 3285 3294 3286 for( int i = 0; i < middleComponentsList.size(); i++) put(get(boost::vertex_affected_comp_t(), fixedGraph), i, middleComponentsList[i]);3295 for(unsigned int i = 0; i < middleComponentsList.size(); i++) put(get(boost::vertex_affected_comp_t(), fixedGraph), i, middleComponentsList[i]); 3287 3296 3288 3297 // Setting the number of components that have been detected … … 3461 3470 vector<cfcStruct> sortedCfcStructTable; 3462 3471 3463 for( int noComponent = 0; noComponent < topoOrder.size(); noComponent++) sortedCfcStructTable.push_back(middleComp[noComp][fixedDim][topoOrder[noComponent]]);3472 for(unsigned int noComponent = 0; noComponent < topoOrder.size(); noComponent++) sortedCfcStructTable.push_back(middleComp[noComp][fixedDim][topoOrder[noComponent]]); 3464 3473 3465 3474 middleComp[noComp][fixedDim].clear(); 3466 3475 3467 for( int noComponent = 0; noComponent < topoOrder.size(); noComponent++) middleComp[noComp][fixedDim].push_back(sortedCfcStructTable[noComponent]);3476 for(unsigned int noComponent = 0; noComponent < topoOrder.size(); noComponent++) middleComp[noComp][fixedDim].push_back(sortedCfcStructTable[noComponent]); 3468 3477 3469 3478 } … … 3537 3546 // ----------------------------------------------- 3538 3547 3539 for( int noComp3D = 0; noComp3D < outerComp.size(); noComp3D++) {3548 for(unsigned int noComp3D = 0; noComp3D < outerComp.size(); noComp3D++) { 3540 3549 3541 3550 // For all the components embedded in the 2D graph coming from the current 3D component 3542 3551 // ------------------------------------------------------------------------------------ 3543 3552 3544 for( int noComp2D = 0; noComp2D < middleComp[noComp3D][0].size(); noComp2D++) {3553 for(unsigned int noComp2D = 0; noComp2D < middleComp[noComp3D][0].size(); noComp2D++) { 3545 3554 3546 3555 // For all the components embedded in the 1D graph coming from the current 2D component 3547 3556 // ------------------------------------------------------------------------------------ 3548 3557 3549 for( int noComp1D = 0; noComp1D < innerComp[noComp3D][0][noComp2D][1].size(); noComp1D++) {3558 for(unsigned int noComp1D = 0; noComp1D < innerComp[noComp3D][0][noComp2D][1].size(); noComp1D++) { 3550 3559 3551 3560 // Get the value of the first axis (third in the data structure as it is a 3D data structure, no need to get the number of the axis as there is only one) … … 3567 3576 // -------------------------------------------------------- 3568 3577 3569 for( int noMod = 0; noMod < innerComp[noComp3D][0][noComp2D][1][noComp1D].embeddedModuls.size(); noMod++) {3578 for(unsigned int noMod = 0; noMod < innerComp[noComp3D][0][noComp2D][1][noComp1D].embeddedModuls.size(); noMod++) { 3570 3579 3571 3580 // Insert the modules after the paramaters … … 3599 3608 // ---------------------------------------- 3600 3609 3601 for( int noComp3D = 0; noComp3D < outerComp.size(); noComp3D++) {3610 for(unsigned int noComp3D = 0; noComp3D < outerComp.size(); noComp3D++) { 3602 3611 3603 3612 // For all components in the 2D graph coming from the current 3D component with the first axis fixed 3604 3613 // ------------------------------------------------------------------------------------------------- 3605 3614 3606 for( int noComp2D = 0; noComp2D < middleComp[noComp3D][0].size(); noComp2D++) {3615 for(unsigned int noComp2D = 0; noComp2D < middleComp[noComp3D][0].size(); noComp2D++) { 3607 3616 3608 3617 // Get the the the first axis dimension (second in the data structure as it is a 3D data structure) … … 3650 3659 // ----------------------------------------------------------------------------------------------------- 3651 3660 3652 for( int noComp1D = 0; noComp1D < innerComp[noComp3D][0][noComp2D][noFixed1].size(); noComp1D++) {3661 for(unsigned int noComp1D = 0; noComp1D < innerComp[noComp3D][0][noComp2D][noFixed1].size(); noComp1D++) { 3653 3662 3654 3663 // For all the moduls embedded in the current 1D component 3655 3664 // ------------------------------------------------------- 3656 3665 3657 for( int noMod = 0; noMod < innerComp[noComp3D][0][noComp2D][noFixed1][noComp1D].embeddedModuls.size(); noMod++) {3666 for(unsigned int noMod = 0; noMod < innerComp[noComp3D][0][noComp2D][noFixed1][noComp1D].embeddedModuls.size(); noMod++) { 3658 3667 3659 3668 // Insert the modul name in the current order parameter … … 3679 3688 // ------------------------------------------------------------------------------------------------- 3680 3689 3681 for( int noComp1D = 0; noComp1D < innerComp[noComp3D][0][noComp2D][noFixed1].size(); noComp1D++) {3690 for(unsigned int noComp1D = 0; noComp1D < innerComp[noComp3D][0][noComp2D][noFixed1].size(); noComp1D++) { 3682 3691 3683 3692 // Get the second axis dimension (third in the data structure as it is a 3D data structure) … … 3704 3713 // ------------------------------------------------------- 3705 3714 3706 for( int noMod = 0; noMod < innerComp[noComp3D][0][noComp2D][noFixed1][noComp1D].embeddedModuls.size(); noMod++) {3715 for(unsigned int noMod = 0; noMod < innerComp[noComp3D][0][noComp2D][noFixed1][noComp1D].embeddedModuls.size(); noMod++) { 3707 3716 3708 3717 // Insert the modul name in the current order parameter … … 3738 3747 // ----------------------------------------------- 3739 3748 3740 for( int noComp3D = 0; noComp3D < outerComp.size(); noComp3D++) {3749 for(unsigned int noComp3D = 0; noComp3D < outerComp.size(); noComp3D++) { 3741 3750 3742 3751 // Get the axis number (dimension) and the axis value of the first axis crossed in the order statement … … 3789 3798 // ----------------------------------------------------------------------------------------------------------------------- 3790 3799 3791 for( int noComp2D = 0; noComp2D < middleComp[noComp3D][noFixed1].size(); noComp2D++) {3800 for(unsigned int noComp2D = 0; noComp2D < middleComp[noComp3D][noFixed1].size(); noComp2D++) { 3792 3801 3793 3802 // Get the number of the second axis crossed in the order statement … … 3799 3808 // ------------------------------------------------------------------------------------------------------------------------- 3800 3809 3801 for( int noComp1D= 0; noComp1D < innerComp[noComp3D][noFixed1][noComp2D][noAxis2].size(); noComp1D++) {3810 for(unsigned int noComp1D= 0; noComp1D < innerComp[noComp3D][noFixed1][noComp2D][noAxis2].size(); noComp1D++) { 3802 3811 3803 3812 // For all moduls embedded in the current 1D graph component 3804 3813 // --------------------------------------------------------- 3805 3814 3806 for( int noMod = 0; noMod < innerComp[noComp3D][noFixed1][noComp2D][noAxis2][noComp1D].embeddedModuls.size(); noMod++) {3815 for(unsigned int noMod = 0; noMod < innerComp[noComp3D][noFixed1][noComp2D][noAxis2][noComp1D].embeddedModuls.size(); noMod++) { 3807 3816 3808 3817 // Display the modul name (that will appear after the order paramaters that have been read before) … … 3827 3836 // ----------------------------------------------------------------------------------------------------------------------- 3828 3837 3829 for( int noComp2D = 0; noComp2D < middleComp[noComp3D][noFixed1].size(); noComp2D++) {3838 for(unsigned int noComp2D = 0; noComp2D < middleComp[noComp3D][noFixed1].size(); noComp2D++) { 3830 3839 3831 3840 … … 3838 3847 // ------------------------------------------------------------------------------------------------------------------------- 3839 3848 3840 for( int noComp1D = 0; noComp1D < innerComp[noComp3D][noFixed1][noComp2D][noAxis2].size(); noComp1D++) {3849 for(unsigned int noComp1D = 0; noComp1D < innerComp[noComp3D][noFixed1][noComp2D][noAxis2].size(); noComp1D++) { 3841 3850 3842 3851 // Get the number of the third axis crossed in the order statement … … 3864 3873 // --------------------------------------------------------- 3865 3874 3866 for( int noMod = 0; noMod < innerComp[noComp3D][noFixed1][noComp2D][noAxis2][noComp1D].embeddedModuls.size(); noMod++) {3875 for(unsigned int noMod = 0; noMod < innerComp[noComp3D][noFixed1][noComp2D][noAxis2][noComp1D].embeddedModuls.size(); noMod++) { 3867 3876 3868 3877 // Display the modul name (that will appear after the order paramaters that have been read before) … … 3891 3900 // ----------------------------------------------------------------------------------------------------------------------- 3892 3901 3893 for( int noComp2D = 0; noComp2D < middleComp[noComp3D][noFixed1].size(); noComp2D++) {3902 for(unsigned int noComp2D = 0; noComp2D < middleComp[noComp3D][noFixed1].size(); noComp2D++) { 3894 3903 3895 3904 // Get the number of the second axis crossed in the order statement … … 3942 3951 // ------------------------------------------------------------------------------------------------------------------------------ 3943 3952 3944 for( int noComp1D= 0; noComp1D < innerComp[noComp3D][noFixed1][noComp2D][noAxis2].size(); noComp1D++) {3953 for(unsigned int noComp1D= 0; noComp1D < innerComp[noComp3D][noFixed1][noComp2D][noAxis2].size(); noComp1D++) { 3945 3954 3946 3955 // For all moduls embedded in the current 1D graph component 3947 3956 // --------------------------------------------------------- 3948 3957 3949 for( int noMod = 0; noMod < innerComp[noComp3D][noFixed1][noComp2D][noAxis2][noComp1D].embeddedModuls.size(); noMod++) {3958 for(unsigned int noMod = 0; noMod < innerComp[noComp3D][noFixed1][noComp2D][noAxis2][noComp1D].embeddedModuls.size(); noMod++) { 3950 3959 3951 3960 // Display the modul name (that will appear after the order paramaters that have been readen before) … … 3970 3979 // ------------------------------------------------------------------------------------------------------------------------------ 3971 3980 3972 for( int noComp1D= 0; noComp1D < innerComp[noComp3D][noFixed1][noComp2D][noAxis2].size(); noComp1D++) {3981 for(unsigned int noComp1D= 0; noComp1D < innerComp[noComp3D][noFixed1][noComp2D][noAxis2].size(); noComp1D++) { 3973 3982 3974 3983 // Get the number of the third axis crossed in the order statement … … 3996 4005 // --------------------------------------------------------- 3997 4006 3998 for( int noMod = 0; noMod < innerComp[noComp3D][noFixed1][noComp2D][noAxis2][noComp1D].embeddedModuls.size(); noMod++) {4007 for(unsigned int noMod = 0; noMod < innerComp[noComp3D][noFixed1][noComp2D][noAxis2][noComp1D].embeddedModuls.size(); noMod++) { 3999 4008 4000 4009 // Display the modul name (that will appear after the order paramaters that have been readen before) … … 4311 4320 // ------------------------------- 4312 4321 4313 for( int i = 0; i < edgeIterVector.size(); i++) boost::remove_edge(*(edgeIterVector[i]), currentGraph);4322 for(unsigned int i = 0; i < edgeIterVector.size(); i++) boost::remove_edge(*(edgeIterVector[i]), currentGraph); 4314 4323 4315 4324 // Putting iterators inside a vector is more convenient , especially for deletions … … 4333 4342 // ----------------------------------- 4334 4343 4335 for(int i = 0; i < vertexIterVector.size(); i++) boost::remove_vertex(*(vertexIterVector[i]), currentGraph); 4344 for(unsigned int i = 0; i < vertexIterVector.size(); i++) 4345 boost::remove_vertex(*(vertexIterVector[i]), currentGraph); 4336 4346 4337 4347 -
trunk/yao/src/YAOObjects/Order.hpp
r480 r488 199 199 /** 200 200 * Set up all the loops by scanning the order directives. 201 * For each module, adds order information (axis order and direction, sequence with other modules, loop identifier ) 201 202 */ 202 203 void setLoop(Table<Connection>& theConnectionTable, Table<Modul>& theModulTable, Table<Space>& theSpaceTable, Table<Operator>& theOperatorTable, Table<Order>& theOrderTable); … … 274 275 275 276 /** 276 * A string that contain the project name given as a param ater to automaticOrderGenerator (declared here to avoid changing all the function calls)277 * A string that contain the project name given as a parameter to automaticOrderGenerator (declared here to avoid changing all the function calls) 277 278 */ 278 279 string theProject; -
trunk/yao/src/YAOObjects/SpaceExtent.hpp
r1 r488 55 55 */ 56 56 int getYA(short YAx) const { 57 if(YAx==1) return theShape.size()? theShape[0] : 0; 58 if(YAx==2) return theShape.size() >= 2? theShape[1] : 0; 59 if(YAx==3) return theShape.size() == 3? theShape[2] : 0; 57 if(YAx==1) return theShape.size()? theShape[0] : 0; 58 if(YAx==2) return theShape.size() >= 2? theShape[1] : 0; 59 if(YAx==3) return theShape.size() == 3? theShape[2] : 0; 60 // Erroneous case 61 // 0 is better than nothing.. 62 return 0; 60 63 } 61 64
Note: See TracChangeset
for help on using the changeset viewer.