2009/3/18 erik quanstrom <quans...@coraid.com>: > the total cost is O(maximum token length) for the > whole input. how could this be a problem?
well, if there's only one token (e.g. when ifs=''), it's actually O(n^2), assuming that realloc copies every time. but your first argument is sufficient. i acquiesce.
