OK, Now I get what you are saying. I should always insert the ACL's with larger ranges in to the tree first. I also take that you suggest to go ahead with creating a Tree to get this done. Let me try this and update back how it works!
Thanks for your useful comments so far!
In reply to Re^6: How to create a Tree::DAG_Node tree with sorted hash elements
by benny_vroom
in thread How to create a Tree::DAG_Node tree with sorted hash elements
by benny_vroom
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |