fix naming

cocos · Aug 10, 2023 · 60a89e2 · 60a89e2
1 parent 22eca7f
commit 60a89e2
Show file tree

Hide file tree

Showing 2 changed files with 11 additions and 11 deletions.
diff --git a/native/cocos/renderer/pipeline/custom/FGDispatcherTypes.h b/native/cocos/renderer/pipeline/custom/FGDispatcherTypes.h
@@ -123,7 +123,7 @@ struct FGRenderPassInfo {
     FGRenderPassInfo& operator=(FGRenderPassInfo&& rhs) = default;
     FGRenderPassInfo& operator=(FGRenderPassInfo const& rhs) = default;
 
-    std::vector<LayoutAccess> colorAccesses;
+    ccstd::vector<LayoutAccess> colorAccesses;
     LayoutAccess dsAccess;
     LayoutAccess dsResolveAccess;
     gfx::RenderPassInfo rpInfo;
@@ -144,23 +144,23 @@ struct Barrier {
 };
 
 struct BarrierNode {
-    std::vector<Barrier> frontBarriers;
-    std::vector<Barrier> rearBarriers;
+    ccstd::vector<Barrier> frontBarriers;
+    ccstd::vector<Barrier> rearBarriers;
 };
 
 struct SliceNode {
     bool full{false};
-    std::vector<uint32_t> mips;
+    ccstd::vector<uint32_t> mips;
 };
 
 struct TextureNode {
     bool full{false};
-    std::vector<SliceNode> slices;
+    ccstd::vector<SliceNode> slices;
 };
 
 struct ResourceNode {
     bool full{false};
-    std::vector<TextureNode> planes;
+    ccstd::vector<TextureNode> planes;
 };
 
 struct ResourceAccessGraph {

diff --git a/native/cocos/renderer/pipeline/custom/FrameGraphDispatcher.cpp b/native/cocos/renderer/pipeline/custom/FrameGraphDispatcher.cpp
@@ -365,11 +365,11 @@ LayoutAccess FrameGraphDispatcher::getResourceAccess(ResourceGraph::vertex_descr
 using PmrString = ccstd::pmr::string;
 using EdgeList = std::pair<RelationGraph::edge_descriptor, RelationGraph::edge_descriptor>;
 using CloseCircuit = std::pair<EdgeList, EdgeList>;
-using CloseCircuits = std::vector<CloseCircuit>;
+using CloseCircuits = ccstd::vector<CloseCircuit>;
 using RelationVert = RelationGraph::vertex_descriptor;
-using RelationVerts = std::vector<RelationVert>;
+using RelationVerts = ccstd::vector<RelationVert>;
 using RelationEdge = RelationGraph::edge_descriptor;
-using RelationEdges = std::vector<RelationEdge>;
+using RelationEdges = ccstd::vector<RelationEdge>;
 using ScoreMap = std::map<RelationVert, std::pair<int64_t /*backward*/, int64_t /*forward*/>>;
 using RasterViewsMap = PmrTransparentMap<ccstd::pmr::string, RasterView>;
 using ComputeViewsMap = PmrTransparentMap<ccstd::pmr::string, ccstd::pmr::vector<ComputeView>>;
@@ -2418,7 +2418,7 @@ void passReorder(FrameGraphDispatcher &fgDispatcher) {
         boost::transitive_closure(relationGraph, relationGraphTc);
 
         CloseCircuits circuits;
-        std::vector<ResourceAccessGraph::edge_descriptor> crossEdges;
+        ccstd::vector<ResourceAccessGraph::edge_descriptor> crossEdges;
         PassVisitor visitor(relationGraphTc, circuits);
         auto colors = relationGraph.colors(scratch);
         boost::depth_first_search(relationGraph, visitor, get(colors, relationGraph));
@@ -2446,7 +2446,7 @@ void passReorder(FrameGraphDispatcher &fgDispatcher) {
         RelationVerts candidates;
         candidates.push_back(EXPECT_START_ID);
 
-        std::vector<RelationVert> candidateBuffer;
+        ccstd::vector<RelationVert> candidateBuffer;
         uint32_t coloredVerts = 0;
         while (coloredVerts < relationGraph._vertices.size()) {
             // decreasing order, pop back from vector, push into queue, then it's ascending order.