I use it when I have candidate libraries to solve a problem, or I just want to find out how things work. Most recently I pointed it at fzf and was able to pull the insensitive SIMD matching it uses and speed my own projects up.

I can’t find it right now, but there was a post about how ripgrep worked from a someone who walked through the code finding interesting patterns and doing a write up on it. With this I get it over any codebase I find interesting, or can even compare them.

    We routinely see rg invocations that take more than 15 seconds

Now I totally believe codebases like this exist, but surely they aren't that common? I could understand this is for a single customer though!

Where this does fall down though is having to maintain that index. That's actually why when I was working on my own local code search tool boyter/cs on github I also just brute forced it. No index no problems, and with desktop CPU's coming out with 200mb of cache these days it seems increasingly like a winning approach.

There was this post from cursor https://cursor.com/blog/fast-regex-search today about building an index for agents due to them hitting a limit on ripgrep, but I’m not sure what codebase they are hitting that warrants it. Especially since they would have to be at 100-200 GB to be getting to 15s of runtime. Unless it’s all matches that is.

Also localhost and presumably this are good for validating your logic before you throw in roles, network and everything else that can be an issue on AWS.

Confirm it runs in this, and 99% of the time the issue when you deploy is something in the AWS config, not your logic.

Comments URL: https://news.ycombinator.com/item?id=47361913

Points: 330

# Comments: 171

Comments URL: https://news.ycombinator.com/item?id=47319436

Points: 1

# Comments: 0

Comments URL: https://news.ycombinator.com/item?id=47228931

Points: 2

# Comments: 0

Stop reading the news. It makes you depressed or angry. Go hiking. Walk on the beach. Play with a dog or your children. Climb a tree.

Leave the slave slab phone at home, or delete every news and social app. Do not browse the web. Take a book and read.

It will be hard at first. Then it gets easier. Best thing I ever did.

Reminder. What passes for news today wouldn’t have registered for most people 100 years ago.

Comments URL: https://news.ycombinator.com/item?id=47162560

Points: 2

# Comments: 0

So arguably you never need frame gen for a game, since it only really works when it’s already pretty nice.

Serena looks to be a precision tool. Since it uses uses LSP its able to replicate a lot of what a IDE would allow and IDE for LLM's.

cs by contrast is more of a discovery tool. When you're trying to find where the work actually happens it can help you, and since there is no index involved you can get going instantly on any codebase while they are index.

You could use cs for instant to find where the complexity lies, and then use Serena to modify it.

Turns out it can, and so I iterated on the idea, building it into a full CLI tool. Recently I wanted to improve it by adding relevance of tools like Sourcegraph or Zoekt but again without adding an index.

cs uses scc https://github.com/boyter/scc to understand the structure of the file on the fly. As such it can filter searches to code, comments or strings. It also applies a weighted BM25 algorithm where matches in actual code rank higher than matches in comments (by default).

I also added a complexity gravity weight using the cyclomatic complexity output from scc as it scans. So if you're searching for a function, the implementation should rank higher than the interface.

    cs "authenticate" --gravity=brain           # Find the complex implementation, not the interface
    cs "FIXME OR TODO OR HACK" --only-comments  # Search only in comments, not code or strings
    cs "error" --only-strings                   # Find where error messages are defined
    cs "handleRequest" --only-usages            # Find every call site, skip the definition

Since it's doing analysis and complexity math on the fly, it's slower than any grep. However, on an M1 Mac, it can scan and rank the entire 40M+ line Linux kernel in ~6 seconds.

Live demo (running over its own source code in HTTP mode): https://codespelunker.boyter.org/ GitHub: https://github.com/boyter/cs

Comments URL: https://news.ycombinator.com/item?id=47115409

Points: 15

# Comments: 2

    Request URL https://lightwave.so/api/register/ephemeral
    Request Method POST 
    Status Code 429 Too Many Requests

Comments URL: https://news.ycombinator.com/item?id=46626602

Points: 2

# Comments: 0

Comments URL: https://news.ycombinator.com/item?id=46595064

Points: 40

# Comments: 19

Your response is where it should go when things get rude, but you don't want to start there.

Comments URL: https://news.ycombinator.com/item?id=45950546

Points: 1

# Comments: 0

Comments URL: https://news.ycombinator.com/item?id=45923955

Points: 2

# Comments: 1