mirror of
https://github.com/vacp2p/linea-monorepo.git
synced 2026-01-09 04:08:01 -05:00
7334693931
* bench(global): adds a benchmark for the global constraint compiler * perf(merging): accumulates the factors before creating the expression * perf(product): computes the ESH without using a smart-vector * perf(factor): preallocations in the factorization algorithm * perf(removeZeroes): implements a lazy allocation mechanism in removeZeroCoeffs * perfs(alloc): counts the ret elements before returning in expandTerms to minimze the number of allocations. * perf(factor): use an integer map instead of a field.Element map when possible * fixup(expands): fix the skip condition for term expansion * perf(constructor): improves the immutable constructors to reduce the number of calls to NewProduct and NewLinComb * feat(repr): adds a json repr function to help debugging * test(constructor): cleans the test of the constructors * perf(factor): address maps using the first limb of a field.Element instead of the full field.Element * fixup(commit): adds missing file in previous commit * perf(factor): reduce the number of calls to rankChildren * perf(rmpolyeval): creates the equivalent expression more directly to save on unnecessary optims * perf(factors): use a counter in getCommonProdParentOfCs * perf(factor): remove map copy from findGdChildrenGroup and replace getCommonProdParent by a simpler function * clean(factor): remove unneeded function and imports * feat(utils): adds a generic sort interface implementation * perf(rankChildren): lazy allocation of the map to save on allocations * perf(factorize): reduces the loop-bound for factorizeExpression * (chore): fix a missing argument and format gofmt * feat: readd test --------- Signed-off-by: AlexandreBelling <alexandrebelling8@gmail.com> Co-authored-by: gusiri <dreamerty@postech.ac.kr>
23 lines
464 B
Go
23 lines
464 B
Go
package utils
|
|
|
|
// GenSorter is a generic interface implementing [sort.Interface]
|
|
// but let the user provide the methods directly as closures.
|
|
// Without needing to implement a new custom type.
|
|
type GenSorter struct {
|
|
LenFn func() int
|
|
SwapFn func(int, int)
|
|
LessFn func(int, int) bool
|
|
}
|
|
|
|
func (s GenSorter) Len() int {
|
|
return s.LenFn()
|
|
}
|
|
|
|
func (s GenSorter) Swap(i, j int) {
|
|
s.SwapFn(i, j)
|
|
}
|
|
|
|
func (s GenSorter) Less(i, j int) bool {
|
|
return s.LessFn(i, j)
|
|
}
|