Cross Reference: /inkscape/src/libdepixelize/kopftracer2011.cpp

Lines Matching defs:it

5     This library is free software; you can redistribute it and/or modify it
19 This library is distributed in the hope that it will be useful,
143 for ( HomogeneousSplines<Precision>::iterator it = splines.begin(),
144 end = splines.end() ; it != end ; ++it ) {
146 it2 = it->vertices.begin(), end2 = it->vertices.end()
151 it2 = it->holes.begin(), end2 = it->holes.end()
359 for ( PixelGraph::iterator it = graph.begin(), end = graph.end() ; it != end
360 ; ++it ) {
361 if ( it->adj.top )
362 it->adj.top = similar_colors(it->rgba, (it - graph.width())->rgba);
363 if ( it->adj.topright ) {
364 it->adj.topright
365 = similar_colors(it->rgba, (it - graph.width() + 1)->rgba);
367 if ( it->adj.right )
368 it->adj.right = similar_colors(it->rgba, (it + 1)->rgba);
369 if ( it->adj.bottomright ) {
370 it->adj.bottomright
371 = similar_colors(it->rgba, (it + graph.width() + 1)->rgba);
373 if ( it->adj.bottom ) {
374 it->adj.bottom
375 = similar_colors(it->rgba, (it + graph.width())->rgba);
377 if ( it->adj.bottomleft ) {
378 it->adj.bottomleft
379 = similar_colors(it->rgba, (it + graph.width() - 1)->rgba);
381 if ( it->adj.left )
382 it->adj.left = similar_colors(it->rgba, (it - 1)->rgba);
383 if ( it->adj.topleft ) {
384 it->adj.topleft = similar_colors(it->rgba,
385 (it - graph.width() - 1)->rgba);
399 for ( typename T::reverse_iterator it = container.rbegin(),
400 end = container.rend() ; it != end ; ) {
404 PixelGraph::iterator a = it->first.first;
405 PixelGraph::iterator b = it->second.first;
406 PixelGraph::iterator c = it->second.second;
407 PixelGraph::iterator d = it->first.second;
411 ++it;
424 typename T::iterator current = --(it.base());
425 ++it;
517 PixelGraph::const_iterator it = i ? a : b;
522 const PixelGraph::const_iterator initial = it;
524 while ( it->adjsize() == 2 ) {
531 guintptr aux = (it->adj.top
532 * guintptr(to_ptr(graph.nodeTop(it))))
533 + (it->adj.topright
534 * guintptr(to_ptr(graph.nodeTopRight(it))))
535 + (it->adj.right
536 * guintptr(to_ptr(graph.nodeRight(it))))
537 + (it->adj.bottomright
538 * guintptr(to_ptr(graph.nodeBottomRight(it))))
539 + (it->adj.bottom
540 * guintptr(to_ptr(graph.nodeBottom(it))))
541 + (it->adj.bottomleft
542 * guintptr(to_ptr(graph.nodeBottomLeft(it))))
543 + (it->adj.left
544 * guintptr(to_ptr(graph.nodeLeft(it))))
545 + (it->adj.topleft
546 * guintptr(to_ptr(graph.nodeTopLeft(it))))
548 prev = it;
549 it = to_iter(reinterpret_cast<PixelGraph::Node const*>(aux));
553 if ( it == initial )
608 PixelGraph::const_iterator it = diagonals[MAIN_DIAGONAL].first.first;
610 it = graph.nodeTopLeft(it);
617 += similar_colors(it, diagonals[k].first.first->rgba,
620 it = (invert ? graph.nodeLeft(it) : graph.nodeRight(it));
622 it = (invert ? graph.nodeRight(it) : graph.nodeLeft(it));
626 it = graph.nodeBottom(it);