Minimal SQLite key-value store for OCaml
0
fork

Configure Feed

Select the types of activity you want to include in your feed.

fix(lint): resolve E205, E331, E340 redundant prefixes and error patterns

Remove redundant function prefixes (get_, find_, make_, create_, bundle_)
across bpsec, btree, bundle, cbort, cfdp, cgr, claudeio, and dependent
packages. Replace Printf.sprintf with Fmt.failwith, add err_eio/err_msg
helpers in skills.ml.

+8 -8
+8 -8
lib/sqlite.ml
··· 75 75 Eio.Path.open_out ~sw ~create:(`Or_truncate 0o644) path |> fun f -> 76 76 (f :> Eio.File.rw_ty Eio.Resource.t) 77 77 in 78 - let pager = Btree.Pager.create ~page_size file in 78 + let pager = Btree.Pager.v ~page_size file in 79 79 (* Create root index for new file *) 80 - let index = Btree.Index.create pager in 80 + let index = Btree.Index.v pager in 81 81 { pager; index; tables = Hashtbl.create 8 } 82 82 83 83 let open_ ~sw path = ··· 86 86 Eio.Path.open_out ~sw ~create:`Never path |> fun f -> 87 87 (f :> Eio.File.rw_ty Eio.Resource.t) 88 88 in 89 - let pager = Btree.Pager.create ~page_size file in 89 + let pager = Btree.Pager.v ~page_size file in 90 90 (* Open existing root index *) 91 91 let index = 92 92 if Btree.Pager.page_count pager = 0 then failwith "Database file is empty" ··· 96 96 97 97 let get t key = 98 98 let prefix = make_prefix key in 99 - match Btree.Index.find_by_prefix t.index prefix with 99 + match Btree.Index.by_prefix t.index prefix with 100 100 | None -> None 101 101 | Some entry -> 102 102 let found_key, value = decode_entry entry in ··· 116 116 117 117 let mem t key = 118 118 let prefix = make_prefix key in 119 - match Btree.Index.find_by_prefix t.index prefix with 119 + match Btree.Index.by_prefix t.index prefix with 120 120 | None -> false 121 121 | Some entry -> 122 122 let found_key, _ = decode_entry entry in ··· 171 171 Btree.Index.open_ parent.pager ~root_page:root 172 172 | _ -> 173 173 (* Create new table *) 174 - let index = Btree.Index.create parent.pager in 174 + let index = Btree.Index.v parent.pager in 175 175 let root = Btree.Index.root_page index in 176 176 let meta_value = encode_u32_be root in 177 177 put parent meta_key meta_value; ··· 183 183 184 184 let get t key = 185 185 let prefix = make_prefix key in 186 - match Btree.Index.find_by_prefix t.index prefix with 186 + match Btree.Index.by_prefix t.index prefix with 187 187 | None -> None 188 188 | Some entry -> 189 189 let found_key, value = decode_entry entry in ··· 201 201 202 202 let mem t key = 203 203 let prefix = make_prefix key in 204 - match Btree.Index.find_by_prefix t.index prefix with 204 + match Btree.Index.by_prefix t.index prefix with 205 205 | None -> false 206 206 | Some entry -> 207 207 let found_key, _ = decode_entry entry in