| digiKam Developer Documentation Professional Photo Management with the Power of Open Source

Loading...
Searching...
No Matches
Digikam::ItemHistoryGraphData Member List

This is the complete list of members for Digikam::ItemHistoryGraphData, including all inherited members.

addEdge(const Vertex &v1, const Vertex &v2) (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
addHistory(const DImageHistory &givenHistory, qlonglong extraCurrent=0) (defined in Digikam::ItemHistoryGraphData) | Digikam::ItemHistoryGraphData |
addVertex(const HistoryImageId &id) (defined in Digikam::ItemHistoryGraphData) | Digikam::ItemHistoryGraphData |
addVertex(const QList< HistoryImageId > &imageIds) (defined in Digikam::ItemHistoryGraphData) | Digikam::ItemHistoryGraphData |
addVertex(qlonglong id) (defined in Digikam::ItemHistoryGraphData) | Digikam::ItemHistoryGraphData |
addVertex(const ItemInfo &info) (defined in Digikam::ItemHistoryGraphData) | Digikam::ItemHistoryGraphData |
addVertex() (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
addVertex(const VertexProperties &properties) (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
addVertexScanned(qlonglong id) (defined in Digikam::ItemHistoryGraphData) | Digikam::ItemHistoryGraphData |
adjacency_iter typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
adjacency_vertex_range_t typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
AdjacencyFlags enum name | Digikam::Graph< VertexProperties, EdgeProperties > |
adjacentVertices(const Vertex &v, AdjacencyFlags flags=AllEdges) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
AllEdges enum value (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
alwaysFalse(const T &, const T &) (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline static
applyProperties(Vertex &v, const QList< ItemInfo > &infos, const QList< HistoryImageId > &ids) (defined in Digikam::ItemHistoryGraphData) | Digikam::ItemHistoryGraphData | protected
BreadthFirstOrder enum value (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
categorize() const (defined in Digikam::ItemHistoryGraphData) | Digikam::ItemHistoryGraphData |
clear() (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
const_edge_property_map_t typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
const_vertex_index_map_t typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
const_vertex_property_map_t typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
CopyAllProperties enum value (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
CopyEdgeProperties enum value (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
copyProperties(Graph &other, GraphCopyFlags flags, const std::vector< vertex_t > &copiedVertices) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline protected
CopyVertexProperties enum value (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
degree_t typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
DepthFirstOrder enum value (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
direction (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | protected
edge(const Vertex &v1, const Vertex &v2) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
edge_iter typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
edge_property_map_t typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
edge_range_t typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
edge_t typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
edgeCount() const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
edgeDifference(const Graph &other, const std::vector< vertex_t > &copiedVertices) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline protected
EdgePair typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
edgePairs() const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
edges(const Vertex &v, AdjacencyFlags flags=AllEdges) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
edges() const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
EdgesToLeaf enum value | Digikam::Graph< VertexProperties, EdgeProperties > |
EdgesToRoot enum value (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
findVertexByProperties(const T &value) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
findZeroDegree(bool inOrOut) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline protected
findZeroDegreeFrom(const Vertex &v, bool inOrOut) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline protected
getGraph() const | Digikam::Graph< VertexProperties, EdgeProperties > | inline
graph (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | protected
Graph(MeaningOfDirection dir=ParentToChild) (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline explicit
Graph(const Graph &g) (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
graph_traits typedef | Digikam::Graph< VertexProperties, EdgeProperties > |
GraphContainer typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
GraphCopyFlags enum name (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
hasEdge(const Vertex &v1, const Vertex &v2) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
hasEdges(const Vertex &v, AdjacencyFlags flags=AllEdges) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
hasEdges() const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
in_edge_iter typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
InboundEdges enum value (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
inDegree(const Vertex &v) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
inv_adjacency_iter typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
inv_adjacency_vertex_range_t typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
isConnected(const Vertex &v1, const Vertex &v2) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
isEmpty() const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
isEmptyRange(const range_t &range) (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline protected static
isLeaf(const Vertex &v) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
isRoot(const Vertex &v) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
ItemHistoryGraphData() (defined in Digikam::ItemHistoryGraphData) | Digikam::ItemHistoryGraphData | inline
ItemHistoryGraphData(const HistoryGraph &g) (defined in Digikam::ItemHistoryGraphData) | Digikam::ItemHistoryGraphData | inline explicit
leaves() const | Digikam::Graph< VertexProperties, EdgeProperties > | inline
leavesFrom(const Vertex &v) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
listPath(const Vertex &root, const Vertex &target, const VertexVertexMap &predecessors, MeaningOfDirection dir=ParentToChild) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline protected
longestPathTouching(const Vertex &v) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline
longestPathTouching(const Vertex &v, LessThan lessThan) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
meaningOfDirection() const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
mostRemoteNodes(const VertexIntMap &distances) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline protected
operator=(const HistoryGraph &g) (defined in Digikam::ItemHistoryGraphData) | Digikam::ItemHistoryGraphData | inline
operator=(const Graph &other) (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
out_edge_iter typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
out_edge_range_t typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
OutboundEdges enum value (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
outDegree(const Vertex &v) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
properties(const Vertex &v) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
properties(const Vertex &v) (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
properties(const Vertex &v1, const Vertex &v2) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
properties(const Edge &e) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
properties(const Edge &e) (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
remove(const Vertex &v) (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
removeNextUnresolvedVertex(int begin) (defined in Digikam::ItemHistoryGraphData) | Digikam::ItemHistoryGraphData |
ReturnOrder enum name (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
roots() const | Digikam::Graph< VertexProperties, EdgeProperties > | inline
rootsOf(const Vertex &v) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline
setProperties(const Vertex &v, const VertexProperties &props) (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
setProperties(const Edge &e, const EdgeProperties &props) (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
shortestDistancesFrom(const Vertex &v) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline
shortestPath(const Vertex &v1, const Vertex &v2) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline
source(const Edge &e) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
target(const Edge &e) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
toEdgeList(const range_t &range) (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline protected static
toInfoList(const QList< Vertex > &vertices) const (defined in Digikam::ItemHistoryGraphData) | Digikam::ItemHistoryGraphData | inline
toList(const range_t &range) | Digikam::Graph< VertexProperties, EdgeProperties > | inline protected static
topologicalSort() const | Digikam::Graph< VertexProperties, EdgeProperties > | inline
toVertexList(const range_t &range) (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline protected static
transitiveClosure(GraphCopyFlags flags=CopyAllProperties) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline
transitiveReduction(QList< Edge > *removedEdges=0, GraphCopyFlags flags=CopyAllProperties) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline
treeFromPredecessors(const Vertex &v, const VertexVertexMap &predecessors) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline protected
treeFromPredecessorsRecursive(const Vertex &v, QList< Vertex > &vertices, const VertexVertexMap &predecessors) const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline protected
vertex_index_map_t typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
vertex_iter typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
vertex_property_map_t typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
vertex_range_t typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
vertex_t typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
vertexCount() const | Digikam::Graph< VertexProperties, EdgeProperties > | inline
VertexIntMap typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
VertexIntMapAdaptor typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
VertexPair typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
VertexVertexMap typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
VertexVertexMapAdaptor typedef (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > |
vertices() const (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | inline
verticesBreadthFirst(const Vertex &givenRef=Vertex()) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline
verticesDepthFirstSorted(const Vertex &givenRef, LessThan lessThan) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline
verticesDominatedBy(const Vertex &v, const Vertex &root, ReturnOrder order=BreadthFirstOrder) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline
verticesDominatedBy(const Vertex &v, const Vertex &root, const QList< Vertex > &presortedVertices) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline
verticesDominatedByDepthFirstSorted(const Vertex &v, const Vertex &root, LessThan lessThan) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline
~Graph()=default (defined in Digikam::Graph< VertexProperties, EdgeProperties >) | Digikam::Graph< VertexProperties, EdgeProperties > | virtual