More methods that can be faster than Base

Author: Jutho

src/TupleTools.jl

@@ -107,6 +107,24 @@ look as (t[1:i-1]..., t2..., t[i+1:end]). Note that element `t[i]` is deleted. U
 @inline _insertat(t::Tuple, i::Int, t2::Tuple) = i == 1 ? (t2..., tail(t)...) : (t[1], _insertat(tail(t), i-1, t2)...)
 @inline _insertat(t::Tuple{}, i::Int, t2::Tuple) = throw(BoundsError(t, i))
 
+"""
+    sum(t::Tuple)
+
+Returns the sum of the element of a tuple, or `0` for an empty tuple.
+"""
+@inline sum(t::Tuple{}) = 0
+@inline sum(t::Tuple{Any}) = t[1]
+@inline sum(t::Tuple) = t[1]+sum(tail(t))
+
+"""
+    prod(t::Tuple)
+
+Returns the product of the elements of a tuple, or `1` for an empty tuple.
+"""
+@inline prod(t::Tuple{}) = 1
+@inline prod(t::Tuple{Any}) = t[1]
+@inline prod(t::Tuple) = t[1]*prod(tail(t))
+
 """
     minimum(t::Tuple)
 

test/runtests.jl

@@ -28,12 +28,15 @@ i = rand(1:n)
 @test @inferred(TupleTools.insertat(t, i, (1,2,3))) == (vcat(p[1:i-1], [1,2,3], p[i+1:n])...)
 @test @inferred(TupleTools.vcat((1,2,3),4,(5,),(),(6,7,8))) == (1,2,3,4,5,6,7,8)
 
+@test @inferred(TupleTools.sum(t)) == sum(t)
+@test @inferred(TupleTools.prod(t)) == prod(t)
+
 @test @inferred(TupleTools.findmin(t)) == findmin(t)
 @test @inferred(TupleTools.findmax(t)) == findmax(t)
 @test @inferred(TupleTools.minimum(t)) == minimum(t)
 @test @inferred(TupleTools.maximum(t)) == maximum(t)
 @test @inferred(TupleTools.indmin(t)) == indmin(t)
-@test @inferred(TupleTools.indmax(t)) == indmin(t)
+@test @inferred(TupleTools.indmax(t)) == indmax(t)
 
 @test @inferred(TupleTools.sort(t; rev = true)) == (sort(p; rev = true)...)
 @test @inferred(TupleTools.sortperm(t)) == (sortperm(p)...)