Searched defs:head (Results 1 - 4 of 4) sorted by relevance
/inkscape/src/util/ |
H A D | reverse-list.h | 25 typename Traits::ListCopy<InputIterator>::ResultList head; local 27 head = cons(*start, head); 30 return head;
|
H A D | filter-list.h | 26 ResultList head; local 32 head = tail = ResultList(*start); 42 return head;
|
/inkscape/cxxtest/cxxtest/ |
H A D | LinkedList.cpp | 16 Link *List::head() function in class:CxxTest::List 24 const Link *List::head() const function in class:CxxTest::List 56 for ( const Link *l = head(); l != 0; l = l->next() ) 63 Link *l = head(); 77 for ( Link *l = head(); l != 0; l = l->next() )
|
/inkscape/src/livarot/ |
H A D | PathCutting.cpp | 33 void Path::DashPolyline(float head,float tail,float body,int nbD,float *dashs,bool stPlain,float stOffset) argument 47 DashSubPath(i-lastMI,lastMP, orig_pts, head,tail,body,nbD,dashs,stPlain,stOffset); 55 DashSubPath(orig_pts.size() - lastMI, lastMP, orig_pts, head, tail, body, nbD, dashs, stPlain, stOffset); 96 void Path::DashSubPath(int spL, int spP, std::vector<path_lineto> const &orig_pts, float head,float tail,float body,int nbD,float *dashs,bool stPlain,float stOffset) argument 113 if ( totLength <= head+tail ) return; // tout mange par la tete et la queue 139 if ( curLength <= head && curLength+nl > head ) { 140 nl-=head-curLength; 141 curLength=head; 173 if ( curLength >= head /* [all...] |
Completed in 763 milliseconds