@@ -18,36 +18,6 @@ defmodule SQL.Lexer do
1818 end
1919 end
2020
21- # for {size, values} <- tl(Unicode.Set.to_pattern!("[[:Lu:], [:Ll:], [:Lt:], [:Lm:], [:Lo:], [:Nl:]]")) |> Enum.group_by(&byte_size/1), into: %{} do
22- # case size do
23- # 1 -> {size, Enum.map(values, fn <<b>> -> b end)}
24- # 2 -> {size, Enum.group_by(Enum.map(values, fn <<a, b>> -> [a, b] end), &hd/1, &tl/1) |> Map.new(fn {k, v} ->
25- # [f|v] = List.flatten(v)
26- # {range, acc} = Enum.reduce(v, {{f, f}, []}, fn x, {{f, l}, acc} -> if l+1 == x, do: {{f, x}, acc}, else: {{x, x}, [{f, l}|acc]} end)
27- # {k, [range|acc]}
28- # end)}
29- # 3 -> {size, Enum.group_by(Enum.map(values, fn <<a, b, c>> -> [a, b, c] end), &hd/1, &tl/1) |> Map.new(fn {k, v} ->
30- # v = Map.new(Enum.group_by(v, &hd/1, &tl/1), fn {k, v} ->
31- # [f|v] = List.flatten(v)
32- # {range, acc} = Enum.reduce(v, {{f, f}, []}, fn x, {{f, l}, acc} -> if l+1 == x, do: {{f, x}, acc}, else: {{x, x}, [{f, l}|acc]} end)
33- # {k, [range|acc]}
34- # end)
35- # {k, v}
36- # end)}
37- # 4 -> {size, Enum.group_by(Enum.map(values, fn <<a, b, c, d>> -> [a, b, c, d] end), &hd/1, &tl/1) |> Map.new(fn {k, v} -> {k, Enum.group_by(v, &hd/1, &tl/1) |> Map.new(fn {k, v} ->
38- # {k,
39- # Enum.group_by(v, &hd/1, &tl/1)
40- # |> Map.new(fn {k, v} ->
41- # [f|v] = List.flatten(v)
42- # {range, acc} = Enum.reduce(v, {{f, f}, []}, fn x, {{f, l}, acc} -> if l+1 == x, do: {{f, x}, acc}, else: {{x, x}, [{f, l}|acc]} end)
43- # {k, [range|acc]}
44- # end)
45- # }
46- # end)} end)}
47- # end
48- # end
49- # 1509 + 11955 + 29
50-
5121 defp lex ( rest , context , line , column , ol , oc , acc ) do
5222 case rest do
5323 << 226 , 129 , 166 , _ :: binary >> -> { :error , :bidi , line , column }
0 commit comments