Performance Review: Optimize Field Column Index Lookup and Boolean Parsing

[DISTREAT]

Performance Review: Field Column Lookup and Boolean Parsing

1. Field Column Index Lookup (findColumnIndexesByValue)

• Current Concern: The function searches for each field's column index by value on every invocation, using findColumnIndexesByValue, which performs a linear search.
• Scalability Impact: For tables with many fields, or when the function is invoked frequently within loops, this results in O(n*m) complexity, where n = number of fields and m = number of columns.
• Recommendation: To mitigate repeated linear searches and improve performance, consider caching the column index mapping after the first lookup. This will reduce complexity for repeated accesses and provide a significant speedup for large or frequently processed tables.

2. Boolean Value Parsing (std.ascii.allocLowerString)

• Current Concern: Memory is allocated by std.ascii.allocLowerString for every boolean value parsed, and freed with defer.
• Performance Note: Since boolean values are short, converting the value to lowercase in-place in a small stack buffer may yield better performance than repeated heap allocations.
• Recommendation: Refactor the relevant code to convert boolean values to lowercase in-place, avoiding heap allocation where possible.

---

These optimizations are recommended to improve efficiency—especially in data-heavy or tight-loop scenarios—and to overall reduce memory allocations and time complexity for CSV parsing.