This repository has been archived by the owner on Dec 29, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 541
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
7ad8903
commit 55e8e65
Showing
5 changed files
with
419 additions
and
42 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,125 @@ | ||
| // Copyright 2015 Google Inc. All Rights Reserved. | ||
| // | ||
| // Licensed under the Apache License, Version 2.0 (the "License"); | ||
| // you may not use this file except in compliance with the License. | ||
| // You may obtain a copy of the License at | ||
| // | ||
| // http://www.apache.org/licenses/LICENSE-2.0 | ||
| // | ||
| // Unless required by applicable law or agreed to in writing, software | ||
| // distributed under the License is distributed on an "AS IS" BASIS, | ||
| // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
| // See the License for the specific language governing permissions and | ||
| // limitations under the License. | ||
|
|
||
| package jvm | ||
|
|
||
| // This class represents a list as a persistent n-ary tree | ||
| // This has much slower access and updates than a real list but has the advantage | ||
| // of sharing memory with previous versions of the list when only a few elements | ||
| // are changed. See http://en.wikipedia.org/wiki/Persistent_data_structure//Trees | ||
| // Also, default values are not stored, so this is good for sparse arrays | ||
| type ImmutableTreeListᐸElementTᐳ struct { | ||
| missing ElementT | ||
| direct [16]ElementT | ||
| children [16]*ImmutableTreeListᐸElementTᐳ | ||
| } | ||
|
|
||
| func newTreeListᐸElementTᐳ(missing ElementT) *ImmutableTreeListᐸElementTᐳ { | ||
| self := ImmutableTreeListᐸElementTᐳ{missing: missing} | ||
| for i := 0; i < 16; i++ { | ||
| self.direct[i] = missing | ||
| } | ||
| // Subtrees allocated lazily | ||
| return &self | ||
| } | ||
|
|
||
| func (self *ImmutableTreeListᐸElementTᐳ) get(i uint16) ElementT { | ||
| if i < 16 { | ||
| return self.direct[i] | ||
| } | ||
| i -= 16 | ||
|
|
||
| ci := i % 16 | ||
| i = i / 16 | ||
| child := self.children[ci] | ||
| if child == nil { | ||
| return self.missing | ||
| } | ||
| return child.get(i) | ||
| } | ||
|
|
||
| func (self *ImmutableTreeListᐸElementTᐳ) set(i uint16, val ElementT) *ImmutableTreeListᐸElementTᐳ { | ||
| if i < 16 { | ||
| if val == self.direct[i] { | ||
| return self | ||
| } | ||
|
|
||
| temp := self.direct | ||
| temp[i] = val | ||
| return &ImmutableTreeListᐸElementTᐳ{self.missing, temp, self.children} | ||
| } | ||
|
|
||
| i -= 16 | ||
|
|
||
| ci := i % 16 | ||
| i = i / 16 | ||
| child := self.children[ci] | ||
|
|
||
| if child == nil { | ||
| if val == self.missing { | ||
| return self | ||
| } | ||
| child = newTreeListᐸElementTᐳ(self.missing).set(i, val) | ||
| } else { | ||
| if val == child.get(i) { | ||
| return self | ||
| } | ||
| child = child.set(i, val) | ||
| } | ||
|
|
||
| temp := self.children | ||
| temp[ci] = child | ||
| return &ImmutableTreeListᐸElementTᐳ{self.missing, self.direct, temp} | ||
| } | ||
|
|
||
| func (left *ImmutableTreeListᐸElementTᐳ) merge(right *ImmutableTreeListᐸElementTᐳ, f func(ElementT, ElementT) ElementT) *ImmutableTreeListᐸElementTᐳ { | ||
| // Effectively computes [func(x, y) for x, y in zip(left, right)] | ||
| // Assume func(x, x) == x | ||
| if left == right { | ||
| return left | ||
| } | ||
|
|
||
| if left == nil { | ||
| left, right = right, left | ||
| } | ||
|
|
||
| missing := left.missing | ||
| direct := [16]ElementT{} | ||
| children := [16]*ImmutableTreeListᐸElementTᐳ{} | ||
|
|
||
| if right == nil { | ||
| for i, x := range left.direct { | ||
| direct[i] = f(x, missing) | ||
| } | ||
| for i, child := range left.children { | ||
| children[i] = child.merge(nil, f) | ||
| } | ||
| } else { | ||
| for i, x := range left.direct { | ||
| direct[i] = f(x, right.direct[i]) | ||
| } | ||
| for i, child := range left.children { | ||
| children[i] = child.merge(right.children[i], f) | ||
| } | ||
|
|
||
| if direct == right.direct && children == right.children { | ||
| return right | ||
| } | ||
| } | ||
|
|
||
| if direct == left.direct && children == left.children { | ||
| return left | ||
| } | ||
| return &ImmutableTreeListᐸElementTᐳ{missing, direct, children} | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,125 @@ | ||
| // Copyright 2015 Google Inc. All Rights Reserved. | ||
| // | ||
| // Licensed under the Apache License, Version 2.0 (the "License"); | ||
| // you may not use this file except in compliance with the License. | ||
| // You may obtain a copy of the License at | ||
| // | ||
| // http://www.apache.org/licenses/LICENSE-2.0 | ||
| // | ||
| // Unless required by applicable law or agreed to in writing, software | ||
| // distributed under the License is distributed on an "AS IS" BASIS, | ||
| // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
| // See the License for the specific language governing permissions and | ||
| // limitations under the License. | ||
|
|
||
| package jvm | ||
|
|
||
| // This class represents a list as a persistent n-ary tree | ||
| // This has much slower access and updates than a real list but has the advantage | ||
| // of sharing memory with previous versions of the list when only a few elements | ||
| // are changed. See http://en.wikipedia.org/wiki/Persistent_data_structure//Trees | ||
| // Also, default values are not stored, so this is good for sparse arrays | ||
| type ImmutableTreeListᐸboolᐳ struct { | ||
| missing bool | ||
| direct [16]bool | ||
| children [16]*ImmutableTreeListᐸboolᐳ | ||
| } | ||
|
|
||
| func newTreeListᐸboolᐳ(missing bool) *ImmutableTreeListᐸboolᐳ { | ||
| self := ImmutableTreeListᐸboolᐳ{missing: missing} | ||
| for i := 0; i < 16; i++ { | ||
| self.direct[i] = missing | ||
| } | ||
| // Subtrees allocated lazily | ||
| return &self | ||
| } | ||
|
|
||
| func (self *ImmutableTreeListᐸboolᐳ) get(i uint16) bool { | ||
| if i < 16 { | ||
| return self.direct[i] | ||
| } | ||
| i -= 16 | ||
|
|
||
| ci := i % 16 | ||
| i = i / 16 | ||
| child := self.children[ci] | ||
| if child == nil { | ||
| return self.missing | ||
| } | ||
| return child.get(i) | ||
| } | ||
|
|
||
| func (self *ImmutableTreeListᐸboolᐳ) set(i uint16, val bool) *ImmutableTreeListᐸboolᐳ { | ||
| if i < 16 { | ||
| if val == self.direct[i] { | ||
| return self | ||
| } | ||
|
|
||
| temp := self.direct | ||
| temp[i] = val | ||
| return &ImmutableTreeListᐸboolᐳ{self.missing, temp, self.children} | ||
| } | ||
|
|
||
| i -= 16 | ||
|
|
||
| ci := i % 16 | ||
| i = i / 16 | ||
| child := self.children[ci] | ||
|
|
||
| if child == nil { | ||
| if val == self.missing { | ||
| return self | ||
| } | ||
| child = newTreeListᐸboolᐳ(self.missing).set(i, val) | ||
| } else { | ||
| if val == child.get(i) { | ||
| return self | ||
| } | ||
| child = child.set(i, val) | ||
| } | ||
|
|
||
| temp := self.children | ||
| temp[ci] = child | ||
| return &ImmutableTreeListᐸboolᐳ{self.missing, self.direct, temp} | ||
| } | ||
|
|
||
| func (left *ImmutableTreeListᐸboolᐳ) merge(right *ImmutableTreeListᐸboolᐳ, f func(bool, bool) bool) *ImmutableTreeListᐸboolᐳ { | ||
| // Effectively computes [func(x, y) for x, y in zip(left, right)] | ||
| // Assume func(x, x) == x | ||
| if left == right { | ||
| return left | ||
| } | ||
|
|
||
| if left == nil { | ||
| left, right = right, left | ||
| } | ||
|
|
||
| missing := left.missing | ||
| direct := [16]bool{} | ||
| children := [16]*ImmutableTreeListᐸboolᐳ{} | ||
|
|
||
| if right == nil { | ||
| for i, x := range left.direct { | ||
| direct[i] = f(x, missing) | ||
| } | ||
| for i, child := range left.children { | ||
| children[i] = child.merge(nil, f) | ||
| } | ||
| } else { | ||
| for i, x := range left.direct { | ||
| direct[i] = f(x, right.direct[i]) | ||
| } | ||
| for i, child := range left.children { | ||
| children[i] = child.merge(right.children[i], f) | ||
| } | ||
|
|
||
| if direct == right.direct && children == right.children { | ||
| return right | ||
| } | ||
| } | ||
|
|
||
| if direct == left.direct && children == left.children { | ||
| return left | ||
| } | ||
| return &ImmutableTreeListᐸboolᐳ{missing, direct, children} | ||
| } |
Oops, something went wrong.