Bookmark Browsing History Collection

This article discusses the process of organizing directories using Termux and compares it with alternatives like Meilisearch, which consumes a lot of RAM. The author considers an alternative solution - ripgrep (rg) for faster searching, and provides an example shared on GitHub and various file-sharing platforms.

---

Bookmark Browsing Directory Tree Browsing History Collection

Using Kali forensic tool. (turned out not needed. just some googling for answers)

do you need to export your own good old notes? i mean mi notes. 2 phone numbers, 2 accounts. one with physical storage. the other you may want to download the mi note app and extract in the same way.

Organized under modifier termux ~/works/bookmark_dirtree_traverse. search via rg.

maybe we can organize directory trees using other methods, like some javascript library with both a search tool and a browsing tool. we can host a search engine via javascript, only static resources and client side computation.

this client side search engine usage example can be found at /data/data/com.termux/files/home/storage/shared/works/milkshake_server and ./external/milkshake_server. the js searching library is called fuse.js.

I have made this into meilisearch, and i have backed it up to github/james4ever0/notes2 and aliyunpan and baiduyunpan. desktop search experience is better. meilisearch consume too much ram. i consider to find alternatives with less ram consumption.

using rg will be much faster.