dborovikov
Joined 3 years ago
Karma
21
Submissions
7
Member since
Jan 30
Recent submissions
Comment · 2 months ago
AI as a problem is illusion. Just don't use it. It's that easy.
Comment · 2 months ago
Well, as far as I know, the internal config systems of most popular distros like Debian, Arch, even NixOS are all Bash. There is nothing that makes Omarchy fundamentally bad design; it's pretty average.
Comment · 2 months ago
They move fast, that's for sure. But it also means they explore and fix problems fast. I don't think there is only "slow and careful" way to create things.
Comment · 2 months ago
“Full of security holes" - and two examples in the article have been swiftly addressed, ignoring that there is a whole dedicated security team https://omarchy.org/teams/
What kind of blogging is this?
Comment · 1 year ago
I got tired of scrolling through poorly organized Go methods, so I built gomsort - a tool that automatically sorts methods within types using call graph analysis.
The Problem: Methods in Go structs are often randomly ordered, making code hard to follow. You end up with public entry points scattered between private helpers.
The Solution: gomsort analyzes your call graphs and sorts methods by: 1. Public methods first 2. Entry points (low call depth) before helpers 3. Shared utilities (high in-degree) at the bottom
Example transformation:
// Before - random order
func (s *Server) helper() string { return "help" }
func (s *Server) Start() error { return s.connect() }
func (s *Server) connect() error { s.helper(); return nil }
func (s *Server) Stop() error { return nil }
// After - logical flow
func (s *Server) Start() error { return s.connect() }
func (s *Server) Stop() error { return nil }
func (s *Server) connect() error { s.helper(); return nil }
func (s *Server) helper() string { return "help" }
Install: go install github.com/borovikovd/gomsort@latest
Repo: https://github.com/borovikovd/gomsort
What do you think? Would this help your codebases?