emqx/apps/emqx_ft
Andrew Mayorov 130601376a perf(ft-asm): express coverage through shortest path on graph
Coverage becomes the shortest path problem on graph where nodes are
offsets and edges are nodes' segments. Implement a simple Dijkstra
algorithm to find one.
2023-04-07 17:25:22 +03:00
..
etc feat(ft): add tests for remote reader 2023-04-07 17:25:21 +03:00
i18n feat(ft): add schema descriptions 2023-04-07 17:25:21 +03:00
include feat(ft): removed replicated data 2023-04-07 17:25:21 +03:00
src perf(ft-asm): express coverage through shortest path on graph 2023-04-07 17:25:22 +03:00
test test(ft-asm): add property tests for file assembly 2023-04-07 17:25:22 +03:00
README.md feat(ft): add file transfer app and bootstrap replicated ft data structure 2023-04-07 17:25:21 +03:00
rebar.config feat(ft): add file transfer app and bootstrap replicated ft data structure 2023-04-07 17:25:21 +03:00

emqx_ft

EMQX file transfer over MQTT

Build

$ rebar3 compile