This alternate function for computing the cache key was applied to common topologies with low-valence and simply packs integer bitfields with the topology of the face and all of its corners. It is typically 3x faster than the hashing method, but is suited for general use. Given the relatively low cost of computing the cache key (compared to building an irregular patch) use of this faster function
source not stored for this graph (policy: none)
nothing calls this directly
no test coverage detected