t := tensor<f32([2, 3], [1.0, 2.0, 3.0, 4.0, 5.0, 6.0]);
2：工具名 + 输入 + 更长推理。新收录的资料对此有专业解读
，推荐阅读新收录的资料获取更多信息
Regex search 1 word from cursor, no center, wraparound move，这一点在新收录的资料中也有详细论述
CREATE TABLE test (id INTEGER PRIMARY KEY, name TEXT, value REAL);the column id becomes an alias for the internal rowid — the B-tree key itself. A query like WHERE id = 5 resolves to a direct B-tree search and scales O(log n). (I already wrote a TLDR piece about how B-trees work here.) The SQLite query planner documentation states: “the time required to look up the desired row is proportional to logN rather than being proportional to N as in a full table scan.” This is not an optimization. It is a fundamental design decision in SQLite’s query optimizer: