asadawadia

>how does it really end up running, does it run in javascript/typescript?

Yeah. `teak file.tk` runs it interpreter mode. `teakc file.tk > file.js` transpiles it to javascript code. Either way it runs on node. Didn't try out bun or deno

how are you running OW2? I am using steam and proton and it is so rough to play

Windows I get 300fps and on linux ~100 and frequent dips

Honestly! That was my thought too

That is so crazy expensive to install and $1000 / month electricity bill what!?

hahahaha

How do you handle abuse/malicious user code being run on your server ?

is the embedding for the whole file? or each 1024/512 byte chunk?

you don't

the data stays in PGDB - TSDB is an extension installed onto the data base server

nice very clean

never thought of bubbling up the DB Transaction ID up to the cookie layer

lol dude

do you use kemal?

you are 100% right

Nobody cares about anything except that coding question that is given during the interview

Even if you have an impressive portfolio of dev related work - the only thing you are judged on is that leetcode task during the interview

maybe at the vp/em level - where the job is talking it might be more appropriate

added raspberry pi's results too

how do you use that, though?

https://rcs.aawadia.dev/ is also using pg search

Ah, Thanks! Didn't consider/know that

i remember reading that too https://willi.am/blog/2014/10/14/for-the-last-time-git-store...

same scroll issues - firefox on 2019 macbook pro

nightmares

what a great explanation

is it possible to get only N closest points that match the distance predicate?

thanks - I really wanted a library like this on the JVM

`kdTree.findNearestNeighbor(point, 2);` does this return

1. A list of ALL points that match the distance predicate?

2. Are they sorted by distance to the target?

3. Is it possible to cap to only the closest N points?

Does this only optimize things like `select * from table where false` type stuff or can it optimize access paths as well? such as whether an index can be used? and what ranges? or should a sequential scan be used

sql can be arbitrarily nested/deep - so how does the code 'know' what to do

This comment might be confusing - I misread what the question was

I feed the cat for good karma

The picture stuff was to get a notification to tell when it was coming to eat

Go for it!

You can piggy back on my object detection api - it can detect birds - just tried with the image => https://images.unsplash.com/photo-1520638023360-6def43369781...

Request example => https://pastebin.com/1Wnyb6PD

Good karma mainly

There is a cat that wanders around my neighbourhood. I wanted to build something that would notify me whenever it came to my backyard. The post describes what I did

I started working on a website that can serve as a library for videos that are more conversation oriented. Logged in users can submit, search, like, comment, and browse right now

As part of this, I realized I search comments on reddit to find what people are talking about or what the general opinion is on something. So I started indexing the comments and exposed a search on the site to allow finding conversations on reddit

Around 250k comments have been indexed and I will continue indexing more

Lmk what you think and if you have any feedback

I really enjoy the form of content where it is a casual laid back conversation so i started working on a website that can serve as a library for these kinds of videos.

I am going to continue building out the features and the content library but logged in users can submit, search, like, comment, and browse right now

Lmk what you think and if you have any feedback