Packages
maru
0.8.2
0.14.0-pre.1
0.13.2
0.13.1
0.13.0
0.12.5
0.12.4
0.12.3
0.12.2
0.12.1
0.12.0
0.11.5
0.11.4
0.11.3
0.11.2
0.11.1
0.11.0
0.10.6
0.10.5
0.10.4
0.10.3
0.10.2
0.10.1
0.10.0
0.9.6
0.9.5
0.9.4
0.9.3
0.9.2
0.9.1
0.9.0
0.8.5
0.8.4
0.8.3
0.8.2
0.8.1
0.8.0
0.7.2
0.7.1
0.7.0
0.6.0
0.5.1
0.5.0
0.4.1
0.4.0
0.3.1
0.3.0
0.2.10
0.2.9
0.2.8
0.2.7
0.2.6
0.2.5
REST-like API micro-framework for elixir inspired by grape.
Current section
Files
Jump to
Current section
Files
lib/maru/builder/routers.ex
defmodule Maru.Builder.Routers do
@moduledoc false
@doc """
Generate router list for `maru.routers` task and (maru_swagger)[https://hex.pm/packages/maru_swagger].
Algorithm:
1. Traversal modules to find all modules.
2. Topological sort modules by module extended.
3. Generate endpoints of sorted modules.
4. Group modules by `version`.
"""
def generate(module) do
all_modules =
module
|> traversal_module
|> topological_sort([])
|> Enum.reduce(%{}, fn ({module, options}, acc) ->
generate_module(module, options, acc)
end)
generate_detail(module, [], nil, all_modules)
|> Enum.sort(fn ep1, ep2 -> ep1.version < ep2.version end)
|> Enum.group_by(fn ep -> ep.version end)
end
defp generate_detail(module, mount_path, mount_version, all_modules) do
module_endpoints =
all_modules[module]
|> Enum.map(&change_version(&1, mount_version))
|> Enum.map(fn endpoint -> %{endpoint | path: mount_path ++ endpoint.path} end)
mount_endpoints =
Enum.map(module.__routers__, fn {_, mounted, _} ->
m = mounted |> Keyword.fetch! :router
resource = mounted |> Keyword.fetch! :resource
version = mount_version || m.__version__
generate_detail(m, mount_path ++ resource.path, version, all_modules)
end) |> List.flatten
module_endpoints ++ mount_endpoints
end
defp traversal_module(module) do
[ {module, module.__extend__ |> get_extend_opts} |
for {_, mounted, _} <- module.__routers__ do
mounted |> Keyword.fetch!(:router) |> traversal_module
end
] |> List.flatten
end
defp topological_sort([], r), do: r |> Enum.reverse
defp topological_sort([{_, nil}=h | t], r) do
topological_sort(t, [h | r])
end
defp topological_sort([{_, opts}=h | t], r) do
depend = opts |> Keyword.fetch! :at
t
|> Enum.any?(fn
{m, _} when m == depend -> true
_ -> false
end)
|> if do
topological_sort(t ++ [h], r)
else
topological_sort(t, [h | r])
end
end
defp generate_module(module, options, generated) do
endpoints = module.__endpoints__
if is_nil(options) or is_nil(Keyword.get options, :extend) do
generated |> put_in [module], endpoints
else
extended_module = options |> Keyword.fetch! :at
extended_endpoints = generated[extended_module]
only = options |> Keyword.get :only, nil
except = options |> Keyword.get :except, nil
extended_endpoints =
extended_endpoints
|> Enum.map(&change_version(&1, options[:version]))
|> Enum.filter(&Maru.Plugs.Extend.filter_origin(&1, endpoints))
|> Enum.filter(&Maru.Plugs.Extend.filter_only(&1, only))
|> Enum.filter(&Maru.Plugs.Extend.filter_except(&1, except))
generated |> put_in [module], endpoints ++ extended_endpoints
end
end
defp change_version(endpoint, version) do
%{endpoint | version: version || endpoint.version}
end
defp get_extend_opts(nil), do: nil
defp get_extend_opts({_, opts, _}), do: opts
end