|
| From: | Werner LEMBERG |
| Subject: | Re: [ft-devel] [freetype2] master 758d55e: [truetype] Catch infinite recursion in subglyphs (#46372). |
| Date: | Wed, 04 Nov 2015 19:41:54 +0100 (CET) |
> I challenge you to implement the Tortoise-and-the-Hare algorithm for
> this!
>
> http://stackoverflow.com/questions/494830/how-to-determine-if-a-linked-list-has-a-cycle-using-only-two-memory-locations
I would rather use Brent's algorithm – and volunteers welcome :-) I'm
too busy (and actually also too lazy) to improve the code.
Werner
| [Prev in Thread] | Current Thread | [Next in Thread] |