/usr/include/tulip/Ordering.h is in libtulip-dev 3.1.2-2.3ubuntu3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 | //-*-c++-*-
/**
Authors: David Auber, Patrick Mary, Morgan Mathiaut
from the LaBRI Visualization Team
Email : auber@tulip-software.org
Last modification : 13/03/2009
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
*/
#ifndef ORDERING_H
#define ORDERING_H
#include <tulip/Face.h>
#include <tulip/PlanarConMap.h>
#include <tulip/Node.h>
#include <vector>
#include <map>
#include <stdio.h>
#include <tulip/MutableContainer.h>
#include <tulip/PluginProgress.h>
#ifndef DOXYGEN_NOTFOR_USER
namespace tlp {
class TLP_SCOPE Ordering : public std::vector<std::vector<node> > {
public :
typedef struct FaceAndPos_ {
Face face;
node n_first;
node n_last;
} FaceAndPos;
std::vector<edge> getDummyEdges(){ return dummy_edge; }
Ordering(PlanarConMap * G, PluginProgress* pluginProgress = 0,
int minProgress = 0, int deltaProgress = 0, int maxProgress = 0);
~Ordering();
private :
PlanarConMap * Gp;
MutableContainer<int> oute;
MutableContainer<int> outv;
MutableContainer<bool> visitedNodes;
MutableContainer<bool> visitedFaces;
MutableContainer<bool> markedFaces;
MutableContainer<int> seqP;
MutableContainer<bool> isOuterFace;
MutableContainer<bool> contour;
MutableContainer<bool> is_selectable;
MutableContainer<bool> is_selectable_visited;
MutableContainer<bool> is_selectable_face;
MutableContainer<bool> is_selectable_visited_face;
MutableContainer<node> left;
MutableContainer<node> right;
bool existMarkedF;
FaceAndPos minMarkedFace ;
Face ext;
std::vector<node> v1;
std::vector<edge> dummy_edge;
node getLastOfQ(Face f, node prec, node n, edge e);
node getLastOfP(Face f, node prec, node n,edge e);
std::vector<node> getPathFrom(std::vector<node> fn, int from);
int infFaceSize();
void updateOutAndVisitedFaces(Face f);
void updateContourLeftRight(node prec, node n, edge e, node last);
void updateNewSelectableNodes(node node_f, node no_tmp2,edge ed_tmp, node node_last,std::vector<Face> v_faces, bool one_face = false, bool was_visited = false, bool selection_face = false);
void updateSelectableFaces(std::vector<Face> v_faces);
int seqp(Face f);
void minMarkedf();
void setMinMarkedFace(Face f);
struct augmentableAndNodes_ getAugAndNodes(Face f);
void augment(Face f, node prec, node n, node prec_last, node last, int nbNewFace, bool pair);
void selectAndUpdate(Face f);
void selectAndUpdate(node n);
bool isSelectable(node n);
void init();
void init_v1(std::vector<node> fn);
void init_selectableNodes();
void init_selectableFaces();
void init_outv_oute();
void init_seqP();
void init_outerface();
};
}
#endif
#endif
|