Skip to content

generics を用いた抽象化セグ木のプロトタイプ実装 #31

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Draft
wants to merge 1 commit into
base: master
Choose a base branch
from
+20 −19
Draft

generics を用いた抽象化セグ木のプロトタイプ実装 #31

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
39 changes: 20 additions & 19 deletions segtree/segtree.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,29 +4,30 @@ import (
internal "github.com/monkukui/ac-library-go/internal/bit"
)

type SegTree struct {
type SegTree[T any] struct {
Copy link

@github-actions github-actions bot Dec 15, 2021

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

🚫 [golangci] reported by reviewdog 🐶
expected ']', found any (typecheck)

n, size, log int
d []interface{}
op func(a, b interface{}) interface{}
e func() interface{}
d []T
op func(a, b T) T
e func() T
}

func (s *SegTree) update(k int) {
func (s *SegTree[T]) update(k int) {
s.d[k] = s.op(s.d[2*k], s.d[2*k+1])
}

func New(op func(a, b interface{}) interface{}, e func() interface{}, n int) *SegTree {
v := make([]interface{}, n)
func New[T any](op func(a, b T) T, e func() T, n int) *SegTree[T] {
v := make([]T, n)
for i := 0; i < n; i++ {
v[i] = e()
}
return NewBySlice(op, e, v)
}
func NewBySlice(op func(a, b interface{}) interface{}, e func() interface{}, v []interface{}) *SegTree {

func NewBySlice[T any](op func(a, b T) T, e func() T, v []T) *SegTree[T] {
n := len(v)
log := internal.CeilPow2(n)
log := CeilPow2(n)
size := 1 << log
d := make([]interface{}, 2*size)
d := make([]T, 2*size)
for i := 0; i < 2*size; i++ {
d[i] = e()
}
Expand All @@ -37,7 +38,7 @@ func NewBySlice(op func(a, b interface{}) interface{}, e func() interface{}, v [
d[i] = op(d[2*i], d[2*i+1])
}

return &SegTree{
return &SegTree[T]{
n: n,
size: size,
log: log,
Expand All @@ -47,7 +48,7 @@ func NewBySlice(op func(a, b interface{}) interface{}, e func() interface{}, v [
}
}

func (s *SegTree) Set(p int, x interface{}) {
func (s *SegTree[T]) Set(p int, x T) {
if p < 0 || s.n <= p {
panic("")
}
Expand All @@ -58,14 +59,14 @@ func (s *SegTree) Set(p int, x interface{}) {
}
}

func (s *SegTree) Get(p int) interface{} {
func (s *SegTree[T]) Get(p int) T {
if p < 0 || s.n <= p {
panic("")
}
return s.d[p+s.size]
}

func (s *SegTree) Prod(l, r int) interface{} {
func (s *SegTree[T]) Prod(l, r int) T {
if l < 0 || r < l || s.n < r {
panic("")
}
Expand All @@ -88,11 +89,11 @@ func (s *SegTree) Prod(l, r int) interface{} {
return s.op(sml, smr)
}

func (s *SegTree) AllProd() interface{} {
func (s *SegTree[T]) AllProd() T {
return s.d[1]
}

func (s *SegTree) MaxRight(l int, f func(x interface{}) bool) int {
func (s *SegTree[T]) MaxRight(l int, f func(x T) bool) int {
if l < 0 || s.n < l {
panic("")
}
Expand All @@ -105,7 +106,7 @@ func (s *SegTree) MaxRight(l int, f func(x interface{}) bool) int {
l += s.size
sm := s.e()
for {
for ; l%2 == 0; {
for l%2 == 0 {
l >>= 1
}
if !f(s.op(sm, s.d[l])) {
Expand All @@ -127,7 +128,7 @@ func (s *SegTree) MaxRight(l int, f func(x interface{}) bool) int {
return s.n
}

func (s *SegTree) MinLeft(r int, f func(x interface{}) bool) int {
func (s *SegTree[T]) MinLeft(r int, f func(x T) bool) int {
if r < 0 || s.n < r {
panic("")
}
Expand All @@ -141,7 +142,7 @@ func (s *SegTree) MinLeft(r int, f func(x interface{}) bool) int {
sm := s.e()
for {
r--
for ; r > 1 && r%2 == 1; {
for r > 1 && r%2 == 1 {
r >>= 1
}
if !f(s.op(s.d[r], sm)) {
Expand Down