Changeset 3060 for GTP/trunk/App/Demos/Vis/FriendlyCulling/src/RenderQueue.h

Timestamp:

10/21/08 23:20:17 (16 years ago)

Author:

mattausch

Message:

updated render queue: as we assume incoming nodes to be sorted front to back,
no sorting is required anymore

File:

• GTP/trunk/App/Demos/Vis/FriendlyCulling/src/RenderQueue.h (modified) (5 diffs)

GTP/trunk/App/Demos/Vis/FriendlyCulling/src/RenderQueue.h

@@ -17 +17 @@
 struct RenderQueueBucket
 {
+        inline bool IsEmpty() const { return mShapes.empty();}
+
         ////////
         //-- the attributes used to sort the materials
-        /// texture parameters
+        
+        // texture related parameters
         int mTexHeight;
         int mTexWidth;
@@ -39 +42 @@
 
         /// minimal distance to the camera
-        float mMinDistance;
+        //float mMinDistance;
 
         /// the shapes that belong to a bucket
@@ -49 +52 @@
         to minimize state changes while approximately keeping front-to-back order
         The implementation roughly follows the suggested implementation in 
-        Tom Forsyth's article on render state changes. It requires sorting only on 
-        bucket level and therefore has very     low overhead.
+        Tom Forsyth's article on render state changes. It assumes that the incoming
+        objecs are roughly front to back level and therefore does not require any sorting 
+        and therefore has very  low overhead.
 */
 class RenderQueue
@@ -88 +92 @@
 protected:
 
-        void Sort();
+        //void Sort();
 
         inline bool FitsInBucket(Shape *shape, size_t idx) const;
@@ -100 +104 @@
 
         ///////////
+        //-- members
 
+        // the current render state
         RenderState *mState;
         
         Camera *mCamera;
-        //SceneEntityContainer mEntities;
-        int mMinSizeForSorting;
         /// each bucket contains objects with similar materials that don't cause a hard state change
         std::vector<RenderQueueBucket *> mBuckets;
+        /// this are the buckets that where touched until the last clear. They are sorted by distance
+        std::vector<RenderQueueBucket *> mActiveBuckets;
 
         int mNumEntries;