TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Who Knew Email Subjects Are So Complicated

12 点作者 troygoode将近 4 年前

3 条评论

labawi将近 4 年前
Doesn&#x27;t base64 have a simple closed-form formula for the expansion, which can be easily inverted for a single-step calculation of max source length?<p>Something like<p>encoded_length = 4 * ceil(length &#x2F; 3) + len(prefix + suffix)<p>cut_at = floor((desired_length - len(prefix+suffix) &#x2F; 4) * 3<p>Then, you should also try to at least cut on a utf8 code-point boundary and maybe handle the whole unicode grapheme something something.
评论 #27465693 未加载
suhas_rd将近 4 年前
well written and insightful. Thank you for sharing your learning.
natSand将近 4 年前
great article!