In SAS IML there is a function called ALLCOMB that can create a matrix of all possible combinations. This is a very helpful function but if the number of combinations is for n=large it doesn't work as well from an efficiency point of view. I was wondering if any one has created hash tables of all possible combinations to improve the efficiency. I know how to either use allcomb or do loops to create a matrix but instead I would like to create a Hash table lookup of the combinations in each row. Thanks
I would not think Hash could contain so many combinations. and it must be exploded .
April 27 – 30 | Gaylord Texan | Grapevine, Texas
Registration is open
Walk in ready to learn. Walk out ready to deliver. This is the data and AI conference you can't afford to miss. Register now and lock in 2025 pricing—just $495!