Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
behdad
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
4 ms
·
1.
▲
by
behdad
6d ago
I use it extensively to preserve images and formatting, in the pageless layout. I haven't tested it much with tables. Give it a try and file issues if it doesn't work well and I'll pass on to my agents. Thanks!
2.
▲
by
behdad
6d ago
Good question, isn't it? GDocs has a "publish to web" feature, but it's vastly broken and loses formatting and image sizing and everything. It's just not priority for Google.
3.
▲
by
behdad
6d ago
Possibly. I wasn't determined enough to look into that. Plus, it's easier for me to batch download my documents from the terminal. Note that it will be a HTML plus directory of images, so you need to return an archive.
4.
▲
Show HN: Gdocs-me-up: a high-fidelity Google Docs exporter
(github.com)
18 points
by
behdad
7d ago
|
8 comments
5.
▲
by
behdad
1mo ago
Thanks. :) Yeah this is not the main wedding invitation. There's a proper HTML with details. This is extra me going wild with the agents fun side. If we were to expect people to finish this to get to the RSVP, we'd have exactly tw
6.
▲
Show HN: Loft Day – a wedding invitation turned point-and-click game
(marketa.behdad.org)
9 points
by
behdad
1mo ago
|
6 comments
7.
▲
by
behdad
6mo ago
msdf still suffers from detail loss at large sizes, which this method doesn't have.
8.
▲
HarfBuzz at 20
(docs.google.com)
1 points
by
behdad
8mo ago
|
1 comments
9.
▲
by
behdad
8mo ago
A wave of manic energy in December had me put together a long deck called "HarfBuzz at 20! " , celebrating 20 years of HarfBuzz. I designed the deck to be presented at the #WebEnginesHackfest later this year. Then reality hit that
10.
▲
HarfBust: A font software puzzle for the curious
(behdad.github.io)
3 points
by
behdad
1y ago
|
1 comments
11.
▲
by
behdad
1y ago
I have a puzzle for the hacker in you: The font HarfBust.ttf is an offshoot of Anton Regular, with a twist: - On software using HarfBuzz (as far back as you go, back to the 2000s) and HarfBuzz only, it will ligate "HarfBuzz" t
12.
▲
by
behdad
1y ago
Thank you for the question. Rasterization is not my specialty. There definitely is still immense amount of research going into rasterizing fonts and 2D graphics on the GPU efficiently. Here's the latest from Raph Levien's research
13.
▲
We maintain HarfBuzz – Ask us anything (or tell us what confused you)
(old.reddit.com)
4 points
by
behdad
1y ago
|
4 comments
14.
▲
by
behdad
1y ago
We’re the maintainers of HarfBuzz, the open-source text shaping engine used by browsers, operating systems, and applications to render all text, including supporting scripts like Arabic, Devanagari, Khmer, CJK, and more. HarfBuzz is known f
15.
▲
by
behdad
2y ago
Browser zoom works fine for me. Does it not for you?
16.
▲
by
behdad
2y ago
Hi. As mentioned, I'll expand on my motivations in a future paper. -behdad
17.
▲
State of Text Rendering 2024
(behdad.org)
204 points
by
behdad
2y ago
|
66 comments
18.
▲
by
behdad
3y ago
Like it or not for hiring purposes it does.
19.
▲
by
behdad
3y ago
How does that work with new grads?
20.
▲
by
behdad
3y ago
Assuming that the dictionary is arbitrary as well, just comparing the string to the strings in the dictionary (or hashing it) it takes O(n), regardless of the data-structure you use.
21.
▲
by
behdad
3y ago
That is a correct solution. The one I was talking about would stop after just trying "The" and "reis".
22.
▲
by
behdad
3y ago
My bad. The dictionary should be {"the", "there", "is"}.
23.
▲
by
behdad
3y ago
Imagine the string "there is", and the dictionary {"the", "there", "is"}.
24.
▲
by
behdad
3y ago
I beg to differ, this is exactly the opposite of a manhole problem, which I tried to explain, which I clearly failed.
25.
▲
by
behdad
3y ago
My mid-mark would be where someone could write the code for the brute-force answer for both parts but couldn't get the memoize / dynamic-programming solution. That would be where I'd say "I'm not sure, look at other
26.
▲
by
behdad
3y ago
You'd be surprised.. but we're trying to distinguish between someone who can code simple algorithms versus one who can't.
27.
▲
by
behdad
3y ago
Typically candidates are scored on a scale. And there are multiple interviews. The final hire / no-hire is decided based on the scores and written feedback from all interviews.
28.
▲
by
behdad
3y ago
It is true that many companies, Google included, have added area-specific questions including some for frontend webdev if I remember correctly.
29.
▲
by
behdad
3y ago
As someone who actually uses algorithms and data-structures in their job, I disagree.
30.
▲
by
behdad
3y ago
Thanks. That's definitely an interesting question. How does it do with new grads? How do you grade people on that on a numerical scale? Curious.
More ›