That shouldn't be a problem as long as you use an stable sort implementation or alternatively the line number or a timestamp as the secondary sorting key.
In reply to Re^3: Reducing memory usage while matching log entries
by salva
in thread Reducing memory usage while matching log entries
by matt.tovey
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |