76 for(
int i=0;i<world.Size();i++)
78 Room *r = world.Index(i);
80 treestates[i] =
new TreeState;
81 PrepareTree(*drawable, *treestates[i]);
86 Room *currentroom = world.Index(roomnum);
87 ObjectTree *drawable = currentroom->
Drawables();
88 RenderTree(*drawable, time, treestates[roomnum]);
92 std::map<roomnum, TreeState*> treestates;
char world[]
Definition test.cpp:7
Definition Containment.hh:34
virtual Array< int, Elem * > * Children() const =0
Definition Containment.hh:27
virtual Container * Parent() const =0
Definition VectorTools.hh:279
Definition Containment.hh:47
virtual int PortalNum() const =0
virtual Matrix Position() const =0
Definition Containment.hh:40
virtual PortalPeer * First() const =0
virtual PortalPeer * Second() const =0
Definition Containment.hh:65
virtual void Render() const =0
Definition Containment.hh:54
virtual ObjectTree * Drawables() const =0
virtual Array< int, PortalPeer * > * Portals() const =0
void PrepareWorld()
Definition Containment.hh:74
void RenderOne(int roomnum, Matrix pos, float time) const
Definition Containment.hh:84
WorldRenderer(World &world)
Definition Containment.hh:73
Definition Containment.hh:60
virtual Array< int, Portal * > * Portals() const =0