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.

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
addVertexScanned(qlonglong id) (defined in Digikam::ItemHistoryGraphData)Digikam::ItemHistoryGraphData
AdjacencyFlags enum nameDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >
applyProperties(Vertex &v, const QList< ItemInfo > &infos, const QList< HistoryImageId > &ids) (defined in Digikam::ItemHistoryGraphData)Digikam::ItemHistoryGraphDataprotected
categorize() const (defined in Digikam::ItemHistoryGraphData)Digikam::ItemHistoryGraphData
copyProperties(Graph &other, GraphCopyFlags flags, const std::vector< vertex_t > &copiedVertices) constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inlineprotected
edgeDifference(const Graph &other, const std::vector< vertex_t > &copiedVertices) constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inlineprotected
EdgesToLeaf enum valueDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >
findZeroDegree(bool inOrOut) constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inlineprotected
getGraph() constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inline
graph_traits typedefDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >
ItemHistoryGraphData() (defined in Digikam::ItemHistoryGraphData)Digikam::ItemHistoryGraphDatainline
ItemHistoryGraphData(const HistoryGraph &g) (defined in Digikam::ItemHistoryGraphData)Digikam::ItemHistoryGraphDatainlineexplicit
leaves() constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inline
listPath(const Vertex &root, const Vertex &_target, const VertexVertexMap &predecessors, MeaningOfDirection dir=ParentToChild) constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inlineprotected
longestPathTouching(const Vertex &v) constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inline
mostRemoteNodes(const VertexIntMap &distances) constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inlineprotected
operator=(const HistoryGraph &g) (defined in Digikam::ItemHistoryGraphData)Digikam::ItemHistoryGraphDatainline
removeNextUnresolvedVertex(int begin) (defined in Digikam::ItemHistoryGraphData)Digikam::ItemHistoryGraphData
roots() constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inline
rootsOf(const Vertex &v) constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inline
shortestDistancesFrom(const Vertex &v) constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inline
shortestPath(const Vertex &v1, const Vertex &v2) constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inline
toInfoList(const QList< Vertex > &vertices) const (defined in Digikam::ItemHistoryGraphData)Digikam::ItemHistoryGraphDatainline
toList(const range_t &range)Digikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inlineprotectedstatic
topologicalSort() constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inline
transitiveClosure(GraphCopyFlags flags=CopyAllProperties) constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inline
transitiveReduction(QList< Edge > *removedEdges=0, GraphCopyFlags flags=CopyAllProperties) constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inline
vertexCount() constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inline
verticesBreadthFirst(const Vertex &givenRef=Vertex()) constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inline
verticesDepthFirstSorted(const Vertex &givenRef, LessThan lessThan) constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inline
verticesDominatedBy(const Vertex &v, const Vertex &root, ReturnOrder order=BreadthFirstOrder) constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inline
verticesDominatedBy(const Vertex &v, const Vertex &root, const QList< Vertex > &presortedVertices) constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inline
verticesDominatedByDepthFirstSorted(const Vertex &v, const Vertex &root, LessThan lessThan) constDigikam::Graph< HistoryVertexProperties, HistoryEdgeProperties >inline