Hi, I'm not sure whether this is fast or just overtly complex.
I need to build a list of nodes that can be worked on fast. csArray<Node> nodes; // node id, array index csHash<VNodeID, int> node_lookup; So when I create a new node, I check to see if theres any unitialised nodes, else I create a new one and push it to nodes. Then I add a key. When I delete a node, I unitialise it and delete the key. Is there any speed advantage here? Or is this plain stupid? Should I just do csHash<VNodeID, Node> instead? As an alternative I can also use Node* instead of Node which preserves memory and check for NULL values, but theres a new every so often... Thanks. ------------------------------------------------------------------------- Using Tomcat but need to do more? Need to support web services, security? Get stuff done quickly with pre-integrated technology to make your job easier Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642 _______________________________________________ Crystal-main mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/crystal-main Unsubscribe: mailto:[EMAIL PROTECTED]
