mirror of
https://github.com/chshersh/github-tui.git
synced 2024-09-11 10:35:35 +03:00
138 lines
3.7 KiB
OCaml
138 lines
3.7 KiB
OCaml
type file_contents = {
|
|
lines : Pretty.doc array;
|
|
offset : int;
|
|
}
|
|
|
|
type tree =
|
|
| File of string * file_contents lazy_t
|
|
| Dir of string * tree array
|
|
|
|
let file_name = function
|
|
| File (name, _) -> name
|
|
| Dir (name, _) -> name
|
|
|
|
(* A files comparison:
|
|
|
|
1. Directories before files
|
|
2. Otherwise, lexicographically
|
|
*)
|
|
let order_files t1 t2 =
|
|
match (t1, t2) with
|
|
| Dir _, File _ -> -1
|
|
| File _, Dir _ -> 1
|
|
| _, _ -> String.compare (file_name t1) (file_name t2)
|
|
|
|
let rec sort_tree = function
|
|
| File (name, contents) -> File (name, contents)
|
|
| Dir (name, children) ->
|
|
Array.sort order_files children;
|
|
Dir (name, Array.map sort_tree children)
|
|
|
|
(* Reads file contents using 'bat' to have pretty syntax highlighting *)
|
|
let read_file_contents path =
|
|
let cmd =
|
|
"bat --style=numbers,changes --color=always --italic-text=always \
|
|
--paging=never --terminal-width=80 " ^ path
|
|
in
|
|
let contents = Shell.proc_stdout cmd in
|
|
let lines =
|
|
contents
|
|
|> String.split_on_char '\n'
|
|
|> List.map Pretty.str
|
|
|> Array.of_list
|
|
in
|
|
let offset = 0 in
|
|
{ lines; offset }
|
|
|
|
let rec to_tree path =
|
|
if Sys.is_directory path then
|
|
let children =
|
|
Array.map
|
|
(fun child_name -> to_tree (Filename.concat path child_name))
|
|
(Sys.readdir path)
|
|
in
|
|
let dirname = Filename.basename path in
|
|
Dir (dirname, children)
|
|
else File (Filename.basename path, lazy (read_file_contents path))
|
|
|
|
let read_tree path = path |> to_tree |> sort_tree
|
|
|
|
type dir_cursor = {
|
|
pos : int;
|
|
files : tree array;
|
|
}
|
|
|
|
type cursor =
|
|
| Dir_cursor of dir_cursor
|
|
| File_cursor of string * file_contents
|
|
|
|
let file_at cursor = cursor.files.(cursor.pos)
|
|
|
|
type zipper = {
|
|
parents : dir_cursor list;
|
|
current : cursor;
|
|
}
|
|
|
|
let zip_it trees =
|
|
{ parents = []; current = Dir_cursor { pos = 0; files = trees } }
|
|
|
|
let zipper_parents zipper =
|
|
List.map (fun cursor -> file_name (file_at cursor)) zipper.parents
|
|
|
|
(* TODO: Horrible hardcoding of maximum lines view *)
|
|
let span = 40
|
|
|
|
let go_down zipper =
|
|
match zipper.current with
|
|
| Dir_cursor cursor ->
|
|
let len = Array.length cursor.files in
|
|
let new_pos = (cursor.pos + 1) mod len in
|
|
let new_cursor = Dir_cursor { cursor with pos = new_pos } in
|
|
{ zipper with current = new_cursor }
|
|
| File_cursor (name, cursor) ->
|
|
let new_offset = cursor.offset + 1 in
|
|
let new_cursor =
|
|
File_cursor (name, { cursor with offset = new_offset })
|
|
in
|
|
let len = Array.length cursor.lines in
|
|
if new_offset + span > len then zipper
|
|
else { zipper with current = new_cursor }
|
|
|
|
let go_up zipper =
|
|
match zipper.current with
|
|
| Dir_cursor cursor ->
|
|
let len = Array.length cursor.files in
|
|
let new_pos = (cursor.pos + len - 1) mod len in
|
|
let new_cursor = Dir_cursor { cursor with pos = new_pos } in
|
|
{ zipper with current = new_cursor }
|
|
| File_cursor (name, cursor) ->
|
|
let new_offset = max 0 (cursor.offset - 1) in
|
|
let new_cursor =
|
|
File_cursor (name, { cursor with offset = new_offset })
|
|
in
|
|
{ zipper with current = new_cursor }
|
|
|
|
let go_next zipper =
|
|
match zipper.current with
|
|
| File_cursor _ -> zipper
|
|
| Dir_cursor cursor -> (
|
|
let next = file_at cursor in
|
|
match next with
|
|
| File (name, contents) ->
|
|
{
|
|
parents = cursor :: zipper.parents;
|
|
current = File_cursor (name, Lazy.force contents);
|
|
}
|
|
| Dir (_, next) ->
|
|
if Array.length next = 0 then zipper
|
|
else
|
|
{
|
|
parents = cursor :: zipper.parents;
|
|
current = Dir_cursor { pos = 0; files = next };
|
|
})
|
|
|
|
let go_back zipper =
|
|
match zipper.parents with
|
|
| [] -> zipper
|
|
| current :: parents -> { parents; current = Dir_cursor current }
|