551
you are viewing a single comment's thread
view the rest of the comments
[-] snowe@programming.dev 13 points 1 year ago

Kagi is even better than DDG. Google is absolutely horrendous.

[-] qaz@lemmy.world 22 points 1 year ago* (last edited 1 year ago)

It’s interesting, but $120 a year is just too much for me.

[-] snowe@programming.dev 3 points 1 year ago

The lowest plan is only $54 a year and it’s most definitely worth it for the results.

[-] qaz@lemmy.world 3 points 1 year ago

300 searches a month is just way too little for my usage

[-] snowe@programming.dev 1 points 1 year ago

When you use 1/10th the searches because you get it all in the very first query your usage goes wayyyy down. even then, you aren't limited to 300 searches. you can go over, you just pay per search. and even with that if you can't do that then just default to DDG then. I found DDG to be terrible, not at all better than Bing by itself, so Kagi was something I tried and immediately fell in love with. It just works. And I don't have to worry about any of my data going anywhere at all, to any advertisers for anything, or for tracking, etc.

[-] qaz@lemmy.world 1 points 1 year ago* (last edited 1 year ago)

I've done 418 searches today and it's still noon. That's ~1254 a month. Even if my searches went down by 90% I'd still be 4.18 times over.

... Kagi was something I tried and immediately fell in love with. It just works.

Does it also work with very specific technical searches? Could it for example search for the behavior of atol when it encounters an alphabetical character? Neither Google, Bing nor DuckDuckGo provide me with an answer. Google doesn't even show cppreference in the top 5.

[-] snowe@programming.dev 1 points 1 year ago

Sorry I’m having trouble understanding what you’re asking for. You’ve done 418 searches in a single day? That would be 12958 a month so I’m not sure I’m reading your comment correctly.

Does it also work with very specific technical searches?

That’s pretty much exactly what I use it for.

Could it for example search for the behavior of when it encounters an alphabetical character?

I’m not sure what you’re asking here.

[-] qaz@lemmy.world 1 points 1 year ago* (last edited 1 year ago)

My comment wasn’t that clear. 1254 is with a 90% reduction and the example question about atol’s behavior was just an example. I looked it up earlier that day but was unable to find it using Google.

atol is a C/C++ function that takes in a char pointer and returns a long. I was trying to figure out if it would gracefully stop when it encountered non-numeric characters, if it would skip them or if it would cause undefined behavior.

this post was submitted on 27 Oct 2023
551 points (99.1% liked)

Technology

59598 readers
1733 users here now

This is a most excellent place for technology news and articles.


Our Rules


  1. Follow the lemmy.world rules.
  2. Only tech related content.
  3. Be excellent to each another!
  4. Mod approved content bots can post up to 10 articles per day.
  5. Threads asking for personal tech support may be deleted.
  6. Politics threads may be removed.
  7. No memes allowed as posts, OK to post as comments.
  8. Only approved bots from the list below, to ask if your bot can be added please contact us.
  9. Check for duplicates before posting, duplicates may be removed

Approved Bots


founded 1 year ago
MODERATORS