mirror of
https://codeberg.org/forgejo/forgejo.git
synced 2024-12-22 16:47:30 +00:00
5b89670a31
One of the proposals in #23328 This PR introduces a simple expression calculator (templates/eval/eval.go), it can do basic expression calculations. Many untested template helper functions like `Mul` `Add` can be replaced by this new approach. Then these `Add` / `Mul` / `percentage` / `Subtract` / `DiffStatsWidth` could all use this `Eval`. And it provides enhancements for Golang templates, and improves readability. Some examples: ---- * Before: `{{Add (Mul $glyph.Row 12) 12}}` * After: `{{Eval $glyph.Row "*" 12 "+" 12}}` ---- * Before: `{{if lt (Add $i 1) (len $.Topics)}}` * After: `{{if Eval $i "+" 1 "<" (len $.Topics)}}` ## FAQ ### Why not use an existing expression package? We need a highly customized expression engine: * do the calculation on the fly, without pre-compiling * deal with int/int64/float64 types, to make the result could be used in Golang template. * make the syntax could be used in the Golang template directly * do not introduce too much complex or strange syntax, we just need a simple calculator. * it needs to strictly follow Golang template's behavior, for example, Golang template treats all non-zero values as truth, but many 3rd packages don't do so. ### What's the benefit? * Developers don't need to add more `Add`/`Mul`/`Sub`-like functions, they were getting more and more. Now, only one `Eval` is enough for all cases. * The new code reads better than old `{{Add (Mul $glyph.Row 12) 12}}`, the old one isn't familiar to most procedural programming developers (eg, the Golang expression syntax). * The `Eval` is fully covered by tests, many old `Add`/`Mul`-like functions were never tested. ### The performance? It doesn't use `reflect`, it doesn't need to parse or compile when used in Golang template, the performance is as fast as native Go template. ### Is it too complex? Could it be unstable? The expression calculator program is a common homework for computer science students, and it's widely used as a teaching and practicing purpose for developers. The algorithm is pretty well-known. The behavior can be clearly defined, it is stable. |
||
|---|---|---|
| .. | ||
| filebuffer | ||
| error.go | ||
| file_unix.go | ||
| file_unix_test.go | ||
| file_windows.go | ||
| io.go | ||
| keypair.go | ||
| keypair_test.go | ||
| legacy.go | ||
| legacy_test.go | ||
| pack.go | ||
| pack_test.go | ||
| paginate.go | ||
| paginate_test.go | ||
| path.go | ||
| path_test.go | ||
| remove.go | ||
| sanitize.go | ||
| sanitize_test.go | ||
| sec_to_time.go | ||
| sec_to_time_test.go | ||
| shellquote.go | ||
| shellquote_test.go | ||
| slice.go | ||
| slice_test.go | ||
| string.go | ||
| string_test.go | ||
| timer.go | ||
| truncate.go | ||
| truncate_test.go | ||
| url.go | ||
| util.go | ||
| util_test.go | ||