Get entry from hash table, pruning any deleted nodes */
| 257 | |
| 258 | /* Get entry from hash table, pruning any deleted nodes */ |
| 259 | struct LNLib::Halfedge* LNLib::VoronoiDiagramGenerator::ELgethash(int b) |
| 260 | { |
| 261 | struct Halfedge* he; |
| 262 | |
| 263 | if (b < 0 || b >= ELhashsize) |
| 264 | return((struct Halfedge*)NULL); |
| 265 | he = ELhash[b]; |
| 266 | if (he == (struct Halfedge*)NULL || he->ELedge != (struct Edge*)DELETED) |
| 267 | return (he); |
| 268 | |
| 269 | /* Hash table points to deleted half edge. Patch as necessary. */ |
| 270 | ELhash[b] = (struct Halfedge*)NULL; |
| 271 | if ((he->ELrefcnt -= 1) == 0) |
| 272 | makefree((Freenode*)he, &hfl); |
| 273 | return ((struct Halfedge*)NULL); |
| 274 | } |
| 275 | |
| 276 | struct LNLib::Halfedge* LNLib::VoronoiDiagramGenerator::ELleftbnd(struct PointVDG* p) |
| 277 | { |
nothing calls this directly
no outgoing calls
no test coverage detected