Downloaded 60 times
![type Buffer []Int
func (b Buffer) Swap(i, j int) {
b[i], b[j] = b[j], b[i]
}
func (b Buffer) Clone() Buffer {
s := make(Buffer, len(b))
copy(s, b)
return s
}
func (b Buffer) Move(i, n int) {
if n > len(b) - i {
n = len(b) - i
}
segment_to_move := b[:i].Clone()
copy(b, b[i:i + n])
copy(b[n:i + n], segment_to_move)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-53-2048.jpg)
![type Buffer []Int
func (b Buffer) Swap(i, j int) {
b[i], b[j] = b[j], b[i]
}
func (b Buffer) Clone() Buffer {
s := make(Buffer, len(b))
copy(s, b)
return s
}
func (b Buffer) Move(i, n int) {
if n > len(b) - i {
n = len(b) - i
}
segment_to_move := b[:i].Clone()
copy(b, b[i:i + n])
copy(b[n:i + n], segment_to_move)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-54-2048.jpg)
![type Buffer []Int
func (b Buffer) Swap(i, j int) {
b[i], b[j] = b[j], b[i]
}
func (b Buffer) Clone() Buffer {
s := make(Buffer, len(b))
copy(s, b)
return s
}
func (b Buffer) Move(i, n int) {
if n > len(b) - i {
n = len(b) - i
}
segment_to_move := b[:i].Clone()
copy(b, b[i:i + n])
copy(b[n:i + n], segment_to_move)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-55-2048.jpg)
![package main
import "fmt"
import "Integer"
func main() {
i := Integer.Buffer{0, 1, 2, 3, 4, 5}
b := i.Clone()
b.Swap(1, 2)
b.Move(3, 2)
b[0].Add(3) produces:
fmt.Printf("b[0:2] = %vn", b[:2]) b[0:2] = [6 4]
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-56-2048.jpg)
![package main
import "fmt"
import "Integer"
func main() {
i := Integer.Buffer{0, 1, 2, 3, 4, 5}
b := i.Clone()
b.Swap(1, 2)
b.Move(3, 2)
b[0].Add(3) produces:
fmt.Printf(“b[0:2] = %vn”, b[:2]) b[0:2] = [6 4]
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-57-2048.jpg)
![package main
import "fmt"
import "Integer"
func main() {
i := Integer.Buffer{0, 1, 2, 3, 4, 5}
b := i.Clone()
b.Swap(1, 2)
b.Move(3, 2)
b[0].Add(3) produces:
fmt.Printf("b[0:2] = %vn", b[:2]) b[0:2] = [6 4]
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-58-2048.jpg)
![package main
import "fmt"
import "Integer"
func main() {
i := Integer.Buffer{0, 1, 2, 3, 4, 5}
b := i.Clone()
b.Swap(1, 2)
b.Move(3, 2)
b[0].Add(3) produces:
fmt.Printf("b[0:2] = %vn", b[:2]) b[0:2] = [6 4]
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-59-2048.jpg)
![package main
import "fmt"
import "Integer"
func main() {
i := Integer.Buffer{0, 1, 2, 3, 4, 5}
b := i.Clone()
b.Swap(1, 2)
b.Move(3, 2)
b[0].Add(3) produces:
fmt.Printf("b[0:2] = %vn", b[:2]) b[0:2] = [6 4]
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-60-2048.jpg)
![package Vector
import . "Integer"
type Vector struct {
Buffer
}
func (v *Vector) Clone() *Vector {
return &Vector{v.Buffer.Clone()}
}
func (v *Vector) Slice(i, j int) Buffer {
return v.Buffer[i:j]
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-61-2048.jpg)
![package Vector
import . "Integer"
type Vector struct {
Buffer
}
func (v *Vector) Clone() *Vector {
return &Vector{v.Buffer.Clone()}
}
func (v *Vector) Slice(i, j int) Buffer {
return v.Buffer[i:j]
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-62-2048.jpg)
![package Vector
import . "Integer"
type Vector struct {
Buffer
}
func (v *Vector) Clone() *Vector {
return &Vector{v.Buffer.Clone()}
}
func (v *Vector) Slice(i, j int) Buffer {
return v.Buffer[i:j]
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-63-2048.jpg)
![package Vector
import . "Integer"
type Vector struct {
Buffer
}
func (v *Vector) Clone() *Vector {
return &Vector{v.Buffer.Clone()}
}
func (v *Vector) Slice(i, j int) Buffer {
return v.Buffer[i:j]
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-64-2048.jpg)
![package Vector
import . "Integer"
type Vector struct {
Buffer
}
func (v *Vector) Clone() *Vector {
return &Vector{v.Buffer.Clone()}
}
func (v *Vector) Slice(i, j int) Buffer {
return v.Buffer[i:j]
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-65-2048.jpg)
![type IAdder int
func (i IAdder) Add(j int) {
i[0] += i[j]
}
func (i IAdder) Subtract(j int) {
i[0] -= i[j]
}
func (i IAdder) Result() interface{} {
return i[0]
}
func (i IAdder) Reset() {
i[0] = *new(int)
}
func (i IAdder) Increment() {
i[0]++
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-69-2048.jpg)
![type IAdder int
func (i IAdder) Add(j int) {
i[0] += i[j]
}
func (i IAdder) Subtract(j int) {
i[0] -= i[j]
}
func (i IAdder) Result() interface{} {
return i[0]
}
func (i IAdder) Reset() {
i[0] = *new(int)
}
func (i IAdder) Increment() {
i[0]++
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-70-2048.jpg)
![type IAdder int
func (i IAdder) Add(j int) {
i[0] += i[j]
}
func (i IAdder) Subtract(j int) {
i[0] -= i[j]
}
func (i IAdder) Result() interface{} {
return i[0]
}
func (i IAdder) Reset() {
i[0] = *new(int)
}
func (i IAdder) Increment() {
i[0]++
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-71-2048.jpg)
![type FAdder []float32
func (f FAdder) Add(j int) {
f[0] += f[j]
}
func (f FAdder) Subtract(j int) {
f[0] -= f[j]
}
func (f FAdder) Result() interface{} {
return f[0]
}
func (f FAdder) Reset() {
f[0] = 0
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-72-2048.jpg)
![type FAdder []float32
func (f FAdder) Add(j int) {
f[0] += f[j]
}
func (f FAdder) Subtract(j int) {
f[0] -= f[j]
}
func (f FAdder) Result() interface{} {
return f[0]
}
func (f FAdder) Reset() {
f[0] = 0
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-73-2048.jpg)
![type FAdder []float32
func (f FAdder) Add(j int) {
f[0] += f[j]
}
func (f FAdder) Subtract(j int) {
f[0] -= f[j]
}
func (f FAdder) Result() interface{} {
return f[0]
}
func (f FAdder) Reset() {
f[0] = 0
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-74-2048.jpg)
![func (b Buffer) Eq(o Buffer) (r bool) {
if len(b) == len(o) {
for i := len(b) - 1; i > 0; i-- {
if b[i] != o[i] {
return
}
}
r = true
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-88-2048.jpg)
![func (b Buffer) Eq(o Buffer) (r bool) {
if len(b) == len(o) {
for i := len(b) - 1; i > 0; i-- {
if b[i] != o[i] {
return
}
}
r = true
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-89-2048.jpg)
![func (b Buffer) Eq(o Buffer) (r bool) {
if len(b) == len(o) {
for i := len(b) - 1; i > 0; i-- {
if b[i] != o[i] {
return
}
}
r = true
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-90-2048.jpg)
![func (b Buffer) Eq(o Buffer) (r bool) {
if len(b) == len(o) {
for i := len(b) - 1; i > 0; i-- {
if b[i] != o[i] {
return
}
}
r = true
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-91-2048.jpg)
![func (b Buffer) Eq(o Buffer) (r bool) {
if len(b) == len(o) {
for i := len(b) - 1; i > 0; i-- {
if b[i] != o[i] {
return
}
}
r = true
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-92-2048.jpg)
![func (b Buffer) Eq(o Buffer) (r bool) {
if len(b) == len(o) {
for i := len(b) - 1; i > 0; i-- {
if b[i] != o[i] {
return
}
}
r = true
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-93-2048.jpg)
![func (b Buffer) Eq(o Buffer) (r bool) {
if len(b) == len(o) {
for i := len(b) - 1; i > 0; i-- {
if b[i] != o[i] {
return
}
}
r = true
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-94-2048.jpg)
![package Vector
import "testing"
func TestVectorSwap(t *testing.T) {
i := Vector{Buffer{0, 1, 2, 3, 4, 5}}
v := i.Clone()
v.Swap(1, 2)
r := Vector{Buffer{0, 2, 1, 3, 4, 5}}
switch {
case !v.Eq(r.Buffer): fallthrough
case !v.Buffer.Eq(r.Buffer): t.Fatalf("b[0:5] = %v", v)
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-95-2048.jpg)
![package Vector
import "testing"
func TestVectorSwap(t *testing.T) {
i := Vector{Buffer{0, 1, 2, 3, 4, 5}}
v := i.Clone()
v.Swap(1, 2)
r := Vector{Buffer{0, 2, 1, 3, 4, 5}}
switch {
case !v.Eq(r.Buffer): fallthrough
case !v.Buffer.Eq(r.Buffer): t.Fatalf("b[0:5] = %v", v)
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-96-2048.jpg)
![package Vector
import "testing"
func TestVectorSwap(t *testing.T) {
i := Vector{Buffer{0, 1, 2, 3, 4, 5}}
v := i.Clone()
v.Swap(1, 2)
r := Vector{Buffer{0, 2, 1, 3, 4, 5}}
switch {
case !v.Eq(r.Buffer): fallthrough
case !v.Buffer.Eq(r.Buffer): t.Fatalf("b[0:5] = %v", v)
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-97-2048.jpg)
![package Vector
import "testing"
func TestVectorSwap(t *testing.T) {
i := Vector{Buffer{0, 1, 2, 3, 4, 5}}
v := i.Clone()
v.Swap(1, 2)
r := Vector{Buffer{0, 2, 1, 3, 4, 5}}
switch {
case !v.Eq(r.Buffer): fallthrough
case !v.Buffer.Eq(r.Buffer): t.Fatalf("b[0:5] = %v", v)
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-98-2048.jpg)
![package Vector
import "testing"
func TestVectorSwap(t *testing.T) {
i := Vector{Buffer{0, 1, 2, 3, 4, 5}}
v := i.Clone()
v.Swap(1, 2)
r := Vector{Buffer{0, 2, 1, 3, 4, 5}}
switch {
case !v.Eq(r.Buffer): fallthrough
case !v.Buffer.Eq(r.Buffer): t.Fatalf("b[0:5] = %v", v)
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-99-2048.jpg)
![package Vector
import "testing"
func TestVectorSwap(t *testing.T) {
i := Vector{Buffer{0, 1, 2, 3, 4, 5}}
v := i.Clone()
v.Swap(1, 2)
r := Vector{Buffer{0, 2, 1, 3, 4, 5}}
switch {
case !v.Eq(r.Buffer): fallthrough
case !v.Buffer.Eq(r.Buffer): t.Fatalf("b[0:5] = %v", v)
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-100-2048.jpg)
![package Vector
import "testing"
func TestVectorSwap(t *testing.T) {
i := Vector{Buffer{0, 1, 2, 3, 4, 5}}
v := i.Clone()
v.Swap(1, 2)
r := Vector{Buffer{0, 2, 1, 3, 4, 5}}
switch {
case !v.Eq(r.Buffer): fallthrough
case !v.Buffer.Eq(r.Buffer): t.Fatalf("b[0:5] = %v", v)
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-101-2048.jpg)
![package Vector
import "testing"
func TestVectorSwap(t *testing.T) {
i := Vector{Buffer{0, 1, 2, 3, 4, 5}}
v := i.Clone()
v.Swap(1, 2)
r := Vector{Buffer{0, 2, 1, 3, 4, 5}}
switch {
case !v.Eq(r.Buffer): fallthrough
case !v.Buffer.Eq(r.Buffer): t.Fatalf("b[0:5] = %v", v)
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-102-2048.jpg)
![import "fmt"
import "path"
import "runtime"
func StackTrace() {
var stack_trace []uintptr
var my_path string
runtime.Callers(1, stack_trace)
for i, u := range stack_trace {
if f := runtime.FuncForPC(u); f != nil {
file, line := f.FileLine(u)
switch filepath, filename := path.Split(file); {
case i == 0: my_path = filepath
case my_path != filepath: fmt.Printf("%v:%v", filename, line)
}
} else {
fmt.Println("(unknown)")
}
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-134-2048.jpg)
![import "fmt"
import "path"
import "runtime"
func StackTrace() {
var stack_trace []uintptr
var my_path string
runtime.Callers(1, stack_trace)
for i, u := range stack_trace {
if f := runtime.FuncForPC(u); f != nil {
file, line := f.FileLine(u)
switch filepath, filename := path.Split(file); {
case i == 0: my_path = filepath
case my_path != filepath: fmt.Printf("%v:%v", filename, line)
}
} else {
fmt.Println("(unknown)")
}
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-135-2048.jpg)
![import "fmt"
import "path"
import "runtime"
func StackTrace() {
var stack_trace []uintptr
var my_path string
runtime.Callers(1, stack_trace)
for i, u := range stack_trace {
if f := runtime.FuncForPC(u); f != nil {
file, line := f.FileLine(u)
switch filepath, filename := path.Split(file); {
case i == 0: my_path = filepath
case my_path != filepath: fmt.Printf("%v:%v", filename, line)
}
} else {
fmt.Println("(unknown)")
}
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-136-2048.jpg)
![import "fmt"
import "path"
import "runtime"
func StackTrace() {
var stack_trace []uintptr
var my_path string
runtime.Callers(1, stack_trace)
for i, u := range stack_trace {
if f := runtime.FuncForPC(u); f != nil {
file, line := f.FileLine(u)
switch filepath, filename := path.Split(file); {
case i == 0: my_path = filepath
case my_path != filepath: fmt.Printf("%v:%v", filename, line)
}
} else {
fmt.Println("(unknown)")
}
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-137-2048.jpg)
![import "fmt"
import "path"
import "runtime"
func StackTrace() {
var stack_trace []uintptr
var my_path string
runtime.Callers(1, stack_trace)
for i, u := range stack_trace {
if f := runtime.FuncForPC(u); f != nil {
file, line := f.FileLine(u)
switch filepath, filename := path.Split(file); {
case i == 0: my_path = filepath
case my_path != filepath: fmt.Printf("%v:%v", filename, line)
}
} else {
fmt.Println("(unknown)")
}
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-138-2048.jpg)
![import "fmt"
import "path"
import "runtime"
func StackTrace() {
var stack_trace []uintptr
var my_path string
runtime.Callers(1, stack_trace)
for i, u := range stack_trace {
if f := runtime.FuncForPC(u); f != nil {
file, line := f.FileLine(u)
switch filepath, filename := path.Split(file); {
case i == 0: my_path = filepath
case my_path != filepath: fmt.Printf("%v:%v", filename, line)
}
} else {
fmt.Println("(unknown)")
}
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-139-2048.jpg)
![import "fmt"
import "path"
import "runtime"
func StackTrace() {
var stack_trace []uintptr
var my_path string
runtime.Callers(1, stack_trace)
for i, u := range stack_trace {
if f := runtime.FuncForPC(u); f != nil {
file, line := f.FileLine(u)
switch filepath, filename := path.Split(file); {
case i == 0: my_path = filepath
case my_path != filepath: fmt.Printf("%v:%v", filename, line)
}
} else {
fmt.Println("(unknown)")
}
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-140-2048.jpg)
![import "fmt"
import "path"
import "runtime"
func StackTrace() {
var stack_trace []uintptr
var my_path string
runtime.Callers(1, stack_trace)
for i, u := range stack_trace {
if f := runtime.FuncForPC(u); f != nil {
file, line := f.FileLine(u)
switch filepath, filename := path.Split(file); {
case i == 0: my_path = filepath
case my_path != filepath: fmt.Printf("%v:%v", filename, line)
}
} else {
fmt.Println("(unknown)")
}
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-141-2048.jpg)
![import "fmt"
import "path"
import "runtime"
func StackTrace() {
var stack_trace []uintptr
var my_path string
runtime.Callers(1, stack_trace)
for i, u := range stack_trace {
if f := runtime.FuncForPC(u); f != nil {
file, line := f.FileLine(u)
switch filepath, filename := path.Split(file); {
case i == 0: my_path = filepath
case my_path != filepath: fmt.Printf("%v:%v", filename, line)
}
} else {
fmt.Println("(unknown)")
}
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-142-2048.jpg)
![import "fmt"
import "path"
import "runtime"
func StackTrace() {
var stack_trace []uintptr
var my_path string
runtime.Callers(1, stack_trace)
for i, u := range stack_trace {
if f := runtime.FuncForPC(u); f != nil {
file, line := f.FileLine(u)
switch filepath, filename := path.Split(file); {
case i == 0: my_path = filepath
case my_path != filepath: fmt.Printf("%v:%v", filename, line)
}
} else {
fmt.Println("(unknown)")
}
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-143-2048.jpg)
![import "fmt"
import "path"
import "runtime"
func StackTrace() {
var stack_trace []uintptr
var my_path string
runtime.Callers(1, stack_trace)
for i, u := range stack_trace {
if f := runtime.FuncForPC(u); f != nil {
file, line := f.FileLine(u)
switch filepath, filename := path.Split(file); {
case i == 0: my_path = filepath
case my_path != filepath: fmt.Printf("%v:%v", filename, line)
}
} else {
fmt.Println("(unknown)")
}
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-144-2048.jpg)
![package generalise
import "reflect"
func Allocate(i interface{}, limit... int) (n interface{}) {
switch v := reflect.ValueOf(i); v.Kind() {
case reflect.Slice: l := v.Cap()
if len(limit) > 0 {
l = limit[0]
}
n = reflect.MakeSlice(v.Type(), l, l).Interface()
case reflect.Map: n = reflect.MakeMap(v.Type()).Interface()
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-146-2048.jpg)
![package generalise
import "reflect"
func Allocate(i interface{}, limit... int) (n interface{}) {
switch v := reflect.ValueOf(i); v.Kind() {
case reflect.Slice: l := v.Cap()
if len(limit) > 0 {
l = limit[0]
}
n = reflect.MakeSlice(v.Type(), l, l).Interface()
case reflect.Map: n = reflect.MakeMap(v.Type()).Interface()
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-147-2048.jpg)
![package generalise
import . "reflect"
func Allocate(i interface{}, limit... int) (n interface{}) {
switch v := ValueOf(i); v.Kind() {
case Slice: l := v.Cap()
if len(limit) > 0 {
l = limit[0]
}
n = MakeSlice(v.Type(), l, l).Interface()
case Map: n = MakeMap(v.Type()).Interface()
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-148-2048.jpg)
![package generalise
import . "reflect"
func Allocate(i interface{}, limit... int) (n interface{}) {
switch v := ValueOf(i); v.Kind() {
case Slice: l := v.Cap()
if len(limit) > 0 {
l = limit[0]
}
n = MakeSlice(v.Type(), l, l).Interface()
case Map: n = MakeMap(v.Type()).Interface()
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-149-2048.jpg)
![package generalise
import . "reflect"
func Allocate(i interface{}, limit... int) (n interface{}) {
switch v := ValueOf(i); v.Kind() {
case Slice: l := v.Cap()
if len(limit) > 0 {
l = limit[0]
}
n = MakeSlice(v.Type(), l, l).Interface()
case Map: n = MakeMap(v.Type()).Interface()
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-150-2048.jpg)
![package generalise
import . "reflect"
func Allocate(i interface{}, limit... int) (n interface{}) {
switch v := ValueOf(i); v.Kind() {
case Slice: l := v.Cap()
if len(limit) > 0 {
l = limit[0]
}
n = MakeSlice(v.Type(), l, l).Interface()
case Map: n = MakeMap(v.Type()).Interface()
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-151-2048.jpg)
![package generalise
import . "reflect"
func Allocate(i interface{}, limit... int) (n interface{}) {
switch v := ValueOf(i); v.Kind() {
case Slice: l := v.Cap()
if len(limit) > 0 {
l = limit[0]
}
n = MakeSlice(v.Type(), l, l).Interface()
case Map: n = MakeMap(v.Type()).Interface()
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-152-2048.jpg)
![package generalise
import . "reflect"
func Allocate(i interface{}, limit... int) (n interface{}) {
switch v := ValueOf(i); v.Kind() {
case Slice: l := v.Cap()
if len(limit) > 0 {
l = limit[0]
}
n = MakeSlice(v.Type(), l, l).Interface()
case Map: n = MakeMap(v.Type()).Interface()
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-153-2048.jpg)
![package generalise
import . "reflect"
func Allocate(i interface{}, limit... int) (n interface{}) {
switch v := ValueOf(i); v.Kind() {
case Slice: l := v.Cap()
if len(limit) > 0 {
l = limit[0]
}
n = MakeSlice(v.Type(), l, l).Interface()
case Map: n = MakeMap(v.Type()).Interface()
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-154-2048.jpg)
![package generalise
import . "reflect"
func Allocate(i interface{}, limit... int) (n interface{}) {
switch v := ValueOf(i); v.Kind() {
case Slice: l := v.Cap()
if len(limit) > 0 {
l = limit[0]
}
n = MakeSlice(v.Type(), l, l).Interface()
case Map: n = MakeMap(v.Type()).Interface()
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-155-2048.jpg)
![package generalise
import . "reflect"
func Allocate(i interface{}, limit... int) (n interface{}) {
switch v := ValueOf(i); v.Kind() {
case Slice: l := v.Cap()
if len(limit) > 0 {
l = limit[0]
}
n = MakeSlice(v.Type(), l, l).Interface()
case Map: n = MakeMap(v.Type()).Interface()
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-156-2048.jpg)
![package generalise
import . "reflect"
func Allocate(i interface{}, limit... int) (n interface{}) {
switch v := ValueOf(i); v.Kind() {
case Slice: l := v.Cap()
if len(limit) > 0 {
l = limit[0]
}
n = MakeSlice(v.Type(), l, l).Interface()
case Map: n = MakeMap(v.Type()).Interface()
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-157-2048.jpg)
![package generalise
import . "reflect"
func Allocate(i interface{}, limit... int) (n interface{}) {
switch v := ValueOf(i); v.Kind() {
case Slice: l := v.Cap()
if len(limit) > 0 {
l = limit[0]
}
n = MakeSlice(v.Type(), l, l).Interface()
case Map: n = MakeMap(v.Type()).Interface()
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-158-2048.jpg)
![package generalise
import . "reflect"
func Allocate(i interface{}, limit... int) (n interface{}) {
switch v := ValueOf(i); v.Kind() {
case Slice: l := v.Cap()
if len(limit) > 0 {
l = limit[0]
}
n = MakeSlice(v.Type(), l, l).Interface()
case Map: n = MakeMap(v.Type()).Interface()
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-159-2048.jpg)
![package generalise
import . "reflect"
func Allocate(i interface{}, limit... int) (n interface{}) {
switch v := ValueOf(i); v.Kind() {
case Slice: l := v.Cap()
if len(limit) > 0 {
l = limit[0]
}
n = MakeSlice(v.Type(), l, l).Interface()
case Map: n = MakeMap(v.Type()).Interface()
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-160-2048.jpg)
![func TestAllocate(t *testing.T) {
var s2 []int
s1 := []int{0, 1, 2}
m := map[int] int{1: 1, 2: 2, 3: 3}
switch {
case throwsPanic(func() { s2 = Allocate(s1, 1).([]int) }):
t.Fatal("Unable to allocate new slice")
case len(s2) != 1 || cap(s2) != 1:
t.Fatalf("New slice should be %v not %v", make([]int, 0, 1), s2)
case throwsPanic(func() { Allocate(m) }):
t.Fatal("Unable to allocate new map")
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-161-2048.jpg)
![func TestAllocate(t *testing.T) {
var s2 []int
s1 := []int{0, 1, 2}
m := map[int] int{1: 1, 2: 2, 3: 3}
switch {
case throwsPanic(func() { s2 = Allocate(s1, 1).([]int) }):
t.Fatal("Unable to allocate new slice")
case len(s2) != 1 || cap(s2) != 1:
t.Fatalf("New slice should be %v not %v", make([]int, 0, 1), s2)
case throwsPanic(func() { Allocate(m) }):
t.Fatal("Unable to allocate new map")
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-162-2048.jpg)
![func TestAllocate(t *testing.T) {
var s2 []int
s1 := []int{0, 1, 2}
m := map[int] int{1: 1, 2: 2, 3: 3}
switch {
case throwsPanic(func() { s2 = Allocate(s1, 1).([]int) }):
t.Fatal("Unable to allocate new slice")
case len(s2) != 1 || cap(s2) != 1:
t.Fatalf("New slice should be %v not %v", make([]int, 0, 1), s2)
case throwsPanic(func() { Allocate(m) }):
t.Fatal("Unable to allocate new map")
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-163-2048.jpg)
![func TestAllocate(t *testing.T) {
var s2 []int
s1 := []int{0, 1, 2}
m := map[int] int{1: 1, 2: 2, 3: 3}
switch {
case throwsPanic(func() { s2 = Allocate(s1, 1).([]int) }):
t.Fatal("Unable to allocate new slice")
case len(s2) != 1 || cap(s2) != 1:
t.Fatalf("New slice should be %v not %v", make([]int, 0, 1), s2)
case throwsPanic(func() { Allocate(m) }):
t.Fatal("Unable to allocate new map")
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-164-2048.jpg)
![func TestAllocate(t *testing.T) {
var s2 []int
s1 := []int{0, 1, 2}
m := map[int] int{1: 1, 2: 2, 3: 3}
switch {
case throwsPanic(func() { s2 = Allocate(s1, 1).([]int) }):
t.Fatal("Unable to allocate new slice")
case len(s2) != 1 || cap(s2) != 1:
t.Fatalf("New slice should be %v not %v", make([]int, 0, 1), s2)
case throwsPanic(func() { Allocate(m) }):
t.Fatal("Unable to allocate new map")
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-165-2048.jpg)
![func TestAllocate(t *testing.T) {
var s2 []int
s1 := []int{0, 1, 2}
m := map[int] int{1: 1, 2: 2, 3: 3}
switch {
case throwsPanic(func() { s2 = Allocate(s1, 1).([]int) }):
t.Fatal("Unable to allocate new slice")
case len(s2) != 1 || cap(s2) != 1:
t.Fatalf("New slice should be %v not %v", make([]int, 0, 1), s2)
case throwsPanic(func() { Allocate(m) }):
t.Fatal("Unable to allocate new map")
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-166-2048.jpg)
![func TestAllocate(t *testing.T) {
var s2 []int
s1 := []int{0, 1, 2}
m := map[int] int{1: 1, 2: 2, 3: 3}
switch {
case throwsPanic(func() { s2 = Allocate(s1, 1).([]int) }):
t.Fatal("Unable to allocate new slice")
case len(s2) != 1 || cap(s2) != 1:
t.Fatalf("New slice should be %v not %v", make([]int, 0, 1), s2)
case throwsPanic(func() { Allocate(m) }):
t.Fatal("Unable to allocate new map")
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-167-2048.jpg)
![func TestAllocate(t *testing.T) {
var s2 []int
s1 := []int{0, 1, 2}
m := map[int] int{1: 1, 2: 2, 3: 3}
switch {
case throwsPanic(func() { s2 = Allocate(s1, 1).([]int) }):
t.Fatal("Unable to allocate new slice")
case len(s2) != 1 || cap(s2) != 1:
t.Fatalf("New slice should be %v not %v", make([]int, 0, 1), s2)
case throwsPanic(func() { Allocate(m) }):
t.Fatal("Unable to allocate new map")
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-168-2048.jpg)
![func TestAllocate(t *testing.T) {
var s2 []int
s1 := []int{0, 1, 2}
m := map[int] int{1: 1, 2: 2, 3: 3}
switch {
case throwsPanic(func() { s2 = Allocate(s1, 1).([]int) }):
t.Fatal("Unable to allocate new slice")
case len(s2) != 1 || cap(s2) != 1:
t.Fatalf("New slice should be %v not %v", make([]int, 0, 1), s2)
case throwsPanic(func() { Allocate(m) }):
t.Fatal("Unable to allocate new map")
}
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-169-2048.jpg)
![package raw
import . "reflect"
import "unsafe"
var _BYTE_SLICE Type = Typeof([]byte(nil))
type MemoryBlock interface {
ByteSlice() []byte
}
func valueHeader(v Value) (header *SliceHeader) {
if v.IsValid() {
s := int(v.Type().Size())
header = &SliceHeader{ v.UnsafeAddr(), s, s }
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-184-2048.jpg)
![package raw
import . "reflect"
import "unsafe"
var _BYTE_SLICE Type = Typeof([]byte(nil))
type MemoryBlock interface {
ByteSlice() []byte
}
func valueHeader(v Value) (header *SliceHeader) {
if v.IsValid() {
s := int(v.Type().Size())
header = &SliceHeader{ v.UnsafeAddr(), s, s }
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-185-2048.jpg)
![package raw
import . "reflect"
import "unsafe"
var _BYTE_SLICE Type = Typeof([]byte(nil))
type MemoryBlock interface {
ByteSlice() []byte
}
func valueHeader(v Value) (header *SliceHeader) {
if v.IsValid() {
s := int(v.Type().Size())
header = &SliceHeader{ v.UnsafeAddr(), s, s }
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-186-2048.jpg)
![package raw
import . "reflect"
import "unsafe"
var _BYTE_SLICE Type = Typeof([]byte(nil))
type MemoryBlock interface {
ByteSlice() []byte
}
func valueHeader(v Value) (header *SliceHeader) {
if v.IsValid() {
s := int(v.Type().Size())
header = &SliceHeader{ v.UnsafeAddr(), s, s }
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-187-2048.jpg)
![package raw
import . "reflect"
import "unsafe"
var _BYTE_SLICE Type = Typeof([]byte(nil))
type MemoryBlock interface {
ByteSlice() []byte
}
func valueHeader(v Value) (header *SliceHeader) {
if v.IsValid() {
s := int(v.Type().Size())
header = &SliceHeader{ v.UnsafeAddr(), s, s }
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-188-2048.jpg)
![package raw
import . "reflect"
import "unsafe"
var _BYTE_SLICE Type = Typeof([]byte(nil))
type MemoryBlock interface {
ByteSlice() []byte
}
func valueHeader(v Value) (header *SliceHeader) {
if v.IsValid() {
s := int(v.Type().Size())
header = &SliceHeader{ v.UnsafeAddr(), s, s }
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-189-2048.jpg)
![package raw
import . "reflect"
import "unsafe"
var _BYTE_SLICE Type = Typeof([]byte(nil))
type MemoryBlock interface {
ByteSlice() []byte
}
func valueHeader(v Value) (header *SliceHeader) {
if v.IsValid() {
s := int(v.Type().Size())
header = &SliceHeader{ v.UnsafeAddr(), s, s }
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-190-2048.jpg)
![package raw
import . "reflect"
import "unsafe"
var _BYTE_SLICE Type = Typeof([]byte(nil))
type MemoryBlock interface {
ByteSlice() []byte
}
func valueHeader(v Value) (header *SliceHeader) {
if v.IsValid() {
s := int(v.Type().Size())
header = &SliceHeader{ v.UnsafeAddr(), s, s }
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-191-2048.jpg)
![package raw
import . "reflect"
import "unsafe"
var _BYTE_SLICE Type = Typeof([]byte(nil))
type MemoryBlock interface {
ByteSlice() []byte
}
func valueHeader(v Value) (header *SliceHeader) {
if v.IsValid() {
s := int(v.Type().Size())
header = &SliceHeader{ v.UnsafeAddr(), s, s }
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-192-2048.jpg)
![package raw
import . "reflect"
import "unsafe"
var _BYTE_SLICE Type = Typeof([]byte(nil))
type MemoryBlock interface {
ByteSlice() []byte
}
func valueHeader(v Value) (header *SliceHeader) {
if v.IsValid() {
s := int(v.Type().Size())
header = &SliceHeader{ v.UnsafeAddr(), s, s }
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-193-2048.jpg)
![package raw
import . "reflect"
import "unsafe"
var _BYTE_SLICE Type = Typeof([]byte(nil))
type MemoryBlock interface {
ByteSlice() []byte
}
func valueHeader(v Value) (header *SliceHeader) {
if v.IsValid() {
s := int(v.Type().Size())
header = &SliceHeader{ v.UnsafeAddr(), s, s }
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-194-2048.jpg)
![package raw
import . "reflect"
import "unsafe"
var _BYTE_SLICE Type = Typeof([]byte(nil))
type MemoryBlock interface {
ByteSlice() []byte
}
func valueHeader(v Value) (header *SliceHeader) {
if v.IsValid() {
s := int(v.Type().Size())
header = &SliceHeader{ v.UnsafeAddr(), s, s }
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-195-2048.jpg)
![package raw
import . "reflect"
import "unsafe"
var _BYTE_SLICE Type = Typeof([]byte(nil))
type MemoryBlock interface {
ByteSlice() []byte
}
func valueHeader(v Value) (header *SliceHeader) {
if v.IsValid() {
s := int(v.Type().Size())
header = &SliceHeader{ v.UnsafeAddr(), s, s }
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-196-2048.jpg)
![package raw
import . "reflect"
import "unsafe"
var _BYTE_SLICE Type = Typeof([]byte(nil))
type MemoryBlock interface {
ByteSlice() []byte
}
func valueHeader(v Value) (header *SliceHeader) {
if v.IsValid() {
s := int(v.Type().Size())
header = &SliceHeader{ v.UnsafeAddr(), s, s }
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-197-2048.jpg)
![package raw
import . "reflect"
import "unsafe"
var _BYTE_SLICE Type = Typeof([]byte(nil))
type MemoryBlock interface {
ByteSlice() []byte
}
func valueHeader(v Value) (header *SliceHeader) {
if v.IsValid() {
s := int(v.Type().Size())
header = &SliceHeader{ v.UnsafeAddr(), s, s }
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-198-2048.jpg)
![package raw
import . "reflect"
import "unsafe"
var _BYTE_SLICE Type = Typeof([]byte(nil))
type MemoryBlock interface {
ByteSlice() []byte
}
func valueHeader(v Value) (header *SliceHeader) {
if v.IsValid() {
s := int(v.Type().Size())
header = &SliceHeader{ v.UnsafeAddr(), s, s }
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-199-2048.jpg)
![package raw
import . "reflect"
import "unsafe"
var _BYTE_SLICE Type = Typeof([]byte(nil))
type MemoryBlock interface {
ByteSlice() []byte
}
func valueHeader(v Value) (header *SliceHeader) {
if v.IsValid() {
s := int(v.Type().Size())
header = &SliceHeader{ v.UnsafeAddr(), s, s }
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-200-2048.jpg)
![package raw
import . "reflect"
import "unsafe"
var _BYTE_SLICE Type = Typeof([]byte(nil))
type MemoryBlock interface {
ByteSlice() []byte
}
func valueHeader(v Value) (header *SliceHeader) {
if v.IsValid() {
s := int(v.Type().Size())
header = &SliceHeader{ v.UnsafeAddr(), s, s }
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-201-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-222-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-223-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-224-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-225-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-226-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-227-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-228-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-229-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-230-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-231-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-232-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-233-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-234-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-235-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-236-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-237-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-238-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-239-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-240-2048.jpg)
![func ByteSlice(i interface{}) []byte {
switch i := i.(type) {
case []byte: return i
case MemoryBlock: return i.ByteSlice()
}
var header *SliceHeader
switch v := ValueOf(i); value.Kind() {
case Interface, Ptr: header = valueHeader(v.Elem())
case Slice: h, s, _ := SliceHeader(i)
header = Scale(h, s, 1)
case String: s := v.Get()
h := *(*StringHeader)(unsafe.Pointer(&s))
header = &SliceHeader{ h.Data, h.Len, h.Len }
default: header = valueHeader(v)
}
return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte)
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-241-2048.jpg)
![func main() {
s := []int{0, 1, 2, 3, 4, 5}
d := Transformation(func(x interface{}) interface{} {
return x.(int) * 2
}).Map(s)
sum := Combination(func(x, y interface{}) interface{} {
return x.(int) + y.(int)
})
fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0))
fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0))
}
produces:
s = [0 1 2 3 4 5], sum = 15
d = [0 2 4 6 8 10], sum = 30](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-326-2048.jpg)
![func main() {
s := []int{0, 1, 2, 3, 4, 5}
d := Transformation(func(x interface{}) interface{} {
return x.(int) * 2
}).Map(s)
sum := Combination(func(x, y interface{}) interface{} {
return x.(int) + y.(int)
})
fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0))
fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0))
}
produces:
s = [0 1 2 3 4 5], sum = 15
d = [0 2 4 6 8 10], sum = 30](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-327-2048.jpg)
![func main() {
s := []int{0, 1, 2, 3, 4, 5}
d := Transformation(func(x interface{}) interface{} {
return x.(int) * 2
}).Map(s)
sum := Combination(func(x, y interface{}) interface{} {
return x.(int) + y.(int)
})
fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0))
fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0))
}
produces:
s = [0 1 2 3 4 5], sum = 15
d = [0 2 4 6 8 10], sum = 30](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-328-2048.jpg)
![func main() {
s := []int{0, 1, 2, 3, 4, 5}
d := Transformation(func(x interface{}) interface{} {
return x.(int) * 2
}).Map(s)
sum := Combination(func(x, y interface{}) interface{} {
return x.(int) + y.(int)
})
fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0))
fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0))
}
produces:
s = [0 1 2 3 4 5], sum = 15
d = [0 2 4 6 8 10], sum = 30](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-329-2048.jpg)
![func main() {
s := []int{0, 1, 2, 3, 4, 5}
d := Transformation(func(x interface{}) interface{} {
return x.(int) * 2
}).Map(s)
sum := Combination(func(x, y interface{}) interface{} {
return x.(int) + y.(int)
})
fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0))
fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0))
}
produces:
s = [0 1 2 3 4 5], sum = 15
d = [0 2 4 6 8 10], sum = 30](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-330-2048.jpg)
![func main() {
s := []int{0, 1, 2, 3, 4, 5}
d := Transformation(func(x interface{}) interface{} {
return x.(int) * 2
}).Map(s)
sum := Combination(func(x, y interface{}) interface{} {
return x.(int) + y.(int)
})
fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0))
fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0))
}
produces:
s = [0 1 2 3 4 5], sum = 15
d = [0 2 4 6 8 10], sum = 30](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-331-2048.jpg)
![func main() {
s := []int{0, 1, 2, 3, 4, 5}
d := Transformation(func(x interface{}) interface{} {
return x.(int) * 2
}).Map(s)
sum := Combination(func(x, y interface{}) interface{} {
return x.(int) + y.(int)
})
fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0))
fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0))
}
produces:
s = [0 1 2 3 4 5], sum = 15
d = [0 2 4 6 8 10], sum = 30](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-332-2048.jpg)
![func main() {
s := []int{0, 1, 2, 3, 4, 5}
d := Transformation(func(x interface{}) interface{} {
return x.(int) * 2
}).Map(s)
sum := Combination(func(x, y interface{}) interface{} {
return x.(int) + y.(int)
})
fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0))
fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0))
}
produces:
s = [0 1 2 3 4 5], sum = 15
d = [0 2 4 6 8 10], sum = 30](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-333-2048.jpg)
![func main() {
s := []int{0, 1, 2, 3, 4, 5}
d := Transformation(func(x interface{}) interface{} {
return x.(int) * 2
}).Map(s)
sum := Combination(func(x, y interface{}) interface{} {
return x.(int) + y.(int)
})
fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0))
fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0))
}
produces:
s = [0 1 2 3 4 5], sum = 15
d = [0 2 4 6 8 10], sum = 30](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-334-2048.jpg)
![func main() {
s := []int{0, 1, 2, 3, 4, 5}
d := Transformation(func(x interface{}) interface{} {
return x.(int) * 2
}).Map(s)
sum := Combination(func(x, y interface{}) interface{} {
return x.(int) + y.(int)
})
fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0))
fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0))
}
produces:
s = [0 1 2 3 4 5], sum = 15
d = [0 2 4 6 8 10], sum = 30](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-335-2048.jpg)
![func main() {
s := []int{0, 1, 2, 3, 4, 5}
d := Transformation(func(x interface{}) interface{} {
return x.(int) * 2
}).Map(s)
sum := Combination(func(x, y interface{}) interface{} {
return x.(int) + y.(int)
})
fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0))
fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0))
}
produces:
s = [0 1 2 3 4 5], sum = 15
d = [0 2 4 6 8 10], sum = 30](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-336-2048.jpg)
![func main() {
s := []int{0, 1, 2, 3, 4, 5}
d := Transformation(func(x interface{}) interface{} {
return x.(int) * 2
}).Map(s)
sum := Combination(func(x, y interface{}) interface{} {
return x.(int) + y.(int)
})
fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0))
fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0))
}
produces:
s = [0 1 2 3 4 5], sum = 15
d = [0 2 4 6 8 10], sum = 30](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-337-2048.jpg)
![func main() {
s := []int{0, 1, 2, 3, 4, 5}
d := Transformation(func(x interface{}) interface{} {
return x.(int) * 2
}).Map(s)
sum := Combination(func(x, y interface{}) interface{} {
return x.(int) + y.(int)
})
fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0))
fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0))
}
produces:
s = [0 1 2 3 4 5], sum = 15
d = [0 2 4 6 8 10], sum = 30](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-338-2048.jpg)
![class Thread
def initialize
self[:Q] = Queue.new
end
def send *messages
messages.each { |m| self[:Q].enq m }
end
def bind_transmitter socket
key? :XMIT ? raise ArgumentError : self[:XMIT] = Thread.new() {
loop do
(m = self[:Q].deq) == :EXIT ? Thread.current.exit : socket.puts m
Thread.pass
end
socket.close
exit
}
end
def disconnect
send "Goodbye #{name}", :EXIT
end
end](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-341-2048.jpg)
![const(
OK = Errno(iota)
ERROR
CANTOPEN = Errno(14)
)
var errText = map[Errno]string {
ERROR: "SQL error or missing database",
CANTOPEN: "Unable to open the database file",
}
type Errno int
func (e Errno) String() (err string) {
if err = errText[e]; err == "" {
err = fmt.Sprintf("errno %v", int(e))
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-358-2048.jpg)
![const(
OK = Errno(iota)
ERROR
CANTOPEN = Errno(14)
)
var errText = map[Errno]string {
ERROR: "SQL error or missing database",
CANTOPEN: "Unable to open the database file",
}
type Errno int
func (e Errno) String() (err string) {
if err = errText[e]; err == "" {
err = fmt.Sprintf("errno %v", int(e))
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-359-2048.jpg)
![const(
OK = Errno(iota)
ERROR
CANTOPEN = Errno(14)
)
var errText = map[Errno]string {
ERROR: "SQL error or missing database",
CANTOPEN: "Unable to open the database file",
}
type Errno int
func (e Errno) String() (err string) {
if err = errText[e]; err == "" {
err = fmt.Sprintf("errno %v", int(e))
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-360-2048.jpg)
![const(
OK = Errno(iota)
ERROR
CANTOPEN = Errno(14)
)
var errText = map[Errno]string {
ERROR: "SQL error or missing database",
CANTOPEN: "Unable to open the database file",
}
type Errno int
func (e Errno) String() (err string) {
if err = errText[e]; err == "" {
err = fmt.Sprintf("errno %v", int(e))
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-361-2048.jpg)
![const(
OK = Errno(iota)
ERROR
CANTOPEN = Errno(14)
)
var errText = map[Errno]string {
ERROR: "SQL error or missing database",
CANTOPEN: "Unable to open the database file",
}
type Errno int
func (e Errno) String() (err string) {
if err = errText[e]; err == "" {
err = fmt.Sprintf("errno %v", int(e))
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-362-2048.jpg)
![const(
OK = Errno(iota)
ERROR
CANTOPEN = Errno(14)
)
var errText = map[Errno]string {
ERROR: "SQL error or missing database",
CANTOPEN: "Unable to open the database file",
}
type Errno int
func (e Errno) String() (err string) {
if err = errText[e]; err == "" {
err = fmt.Sprintf("errno %v", int(e))
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-363-2048.jpg)
![const(
OK = Errno(iota)
ERROR
CANTOPEN = Errno(14)
)
var errText = map[Errno]string {
ERROR: "SQL error or missing database",
CANTOPEN: "Unable to open the database file",
}
type Errno int
func (e Errno) String() (err string) {
if err = errText[e]; err == "" {
err = fmt.Sprintf("errno %v", int(e))
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-364-2048.jpg)
![const(
OK = Errno(iota)
ERROR
CANTOPEN = Errno(14)
)
var errText = map[Errno]string {
ERROR: "SQL error or missing database",
CANTOPEN: "Unable to open the database file",
}
type Errno int
func (e Errno) String() (err string) {
if err = errText[e]; err == "" {
err = fmt.Sprintf("errno %v", int(e))
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-365-2048.jpg)
![const(
OK = Errno(iota)
ERROR
CANTOPEN = Errno(14)
)
var errText = map[Errno]string {
ERROR: "SQL error or missing database",
CANTOPEN: "Unable to open the database file",
}
type Errno int
func (e Errno) String() (err string) {
if err = errText[e]; err == "" {
err = fmt.Sprintf("errno %v", int(e))
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-366-2048.jpg)
![const(
OK = Errno(iota)
ERROR
CANTOPEN = Errno(14)
)
var errText = map[Errno]string {
ERROR: "SQL error or missing database",
CANTOPEN: "Unable to open the database file",
}
type Errno int
func (e Errno) String() (err string) {
if err = errText[e]; err == "" {
err = fmt.Sprintf("errno %v", int(e))
}
return
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-367-2048.jpg)
![package main
// #include "ruby.h"
import "C"
import "fmt"
import "os"
type VALUE struct {
cptr *C.VALUE
}
func main() {
var stack_frame VALUE
defer func() { C.ruby_cleanup(0) }()
C.ruby_sysinit(len(os.Args), &os.Args[0])
C.ruby_init_stack(stack_frame.cptr)
C.ruby_init()
C.ruby_init_loadpath()
run_ruby()
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-389-2048.jpg)
![package main
// #include "ruby.h"
import "C"
import "fmt"
import "os"
type VALUE struct {
cptr *C.VALUE
}
func main() {
var stack_frame VALUE
defer func() { C.ruby_cleanup(0) }()
C.ruby_sysinit(len(os.Args), &os.Args[0])
C.ruby_init_stack(stack_frame.cptr)
C.ruby_init()
C.ruby_init_loadpath()
run_ruby()
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-390-2048.jpg)
![package main
// #include "ruby.h"
import "C"
import "fmt"
import "os"
type VALUE struct {
cptr *C.VALUE
}
func main() {
var stack_frame VALUE
defer func() { C.ruby_cleanup(0) }()
C.ruby_sysinit(len(os.Args), &os.Args[0])
C.ruby_init_stack(stack_frame.cptr)
C.ruby_init()
C.ruby_init_loadpath()
run_ruby()
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-391-2048.jpg)
![package main
// #include "ruby.h"
import "C"
import "fmt"
import "os"
type VALUE struct {
cptr *C.VALUE
}
func main() {
var stack_frame VALUE
defer func() { C.ruby_cleanup(0) }()
C.ruby_sysinit(len(os.Args), &os.Args[0])
C.ruby_init_stack(stack_frame.cptr)
C.ruby_init()
C.ruby_init_loadpath()
run_ruby()
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-392-2048.jpg)
![package main
// #include "ruby.h"
import "C"
import "fmt"
import "os"
type VALUE struct {
cptr *C.VALUE
}
func main() {
var stack_frame VALUE
defer func() { C.ruby_cleanup(0) }()
C.ruby_sysinit(len(os.Args), &os.Args[0])
C.ruby_init_stack(stack_frame.cptr)
C.ruby_init()
C.ruby_init_loadpath()
run_ruby()
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-393-2048.jpg)
![package main
// #include "ruby.h"
import "C"
import "fmt"
import "os"
type VALUE struct {
cptr *C.VALUE
}
func main() {
var stack_frame VALUE
defer func() { C.ruby_cleanup(0) }()
C.ruby_sysinit(len(os.Args), &os.Args[0])
C.ruby_init_stack(stack_frame.cptr)
C.ruby_init()
C.ruby_init_loadpath()
run_ruby()
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-394-2048.jpg)
![package main
// #include "ruby.h"
import "C"
import "fmt"
import "os"
type VALUE struct {
cptr *C.VALUE
}
func main() {
var stack_frame VALUE
defer func() { C.ruby_cleanup(0) }()
C.ruby_sysinit(len(os.Args), &os.Args[0])
C.ruby_init_stack(stack_frame.cptr)
C.ruby_init()
C.ruby_init_loadpath()
run_ruby()
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-395-2048.jpg)
![package main
// #include "ruby.h"
import "C"
import "fmt"
import "os"
type VALUE struct {
cptr *C.VALUE
}
func main() {
var stack_frame VALUE
defer func() { C.ruby_cleanup(0) }()
C.ruby_sysinit(len(os.Args), &os.Args[0])
C.ruby_init_stack(stack_frame.cptr)
C.ruby_init()
C.ruby_init_loadpath()
run_ruby()
}](https://image.slidesharecdn.com/presentation-111001175110-phpapp02/75/Go-lt-Ruby-396-2048.jpg)
Uploaded byEleanor McHugh
Go <-> Ruby
This document appears to be a series of slides from a lightning talk presentation comparing Go and Ruby programming languages. It discusses various differences between the two languages such as Go having static and strict typing while Ruby has dynamic and flexible typing. It also covers topics like memory layout, methods, inheritance between classes, and embedding types in Go. Code examples are provided to illustrate concepts in both languages.
More Related Content
![A Gopher's Guide to *NIX Plumbing [workshop remixes!]](https://cdn.slidesharecdn.com/ss_thumbnails/2025agophersguidetonixplumbingworkshop-251009084052-82af3656-thumbnail.jpg?width=640&height=640&fit=bounds)
![[2024] An Introduction to Functional Programming with Go [Y Combinator Remix]...](https://cdn.slidesharecdn.com/ss_thumbnails/2024anintroductiontofunctionalprogrammingwithgoycombinatorremix-241007114312-7e90a89d-thumbnail.jpg?width=640&height=640&fit=bounds)
![[2023] Putting the R! in R&D.pdf](https://cdn.slidesharecdn.com/ss_thumbnails/2023puttingtherinrd-231122234738-294b2909-thumbnail.jpg?width=640&height=640&fit=bounds)
![The Browser Environment - A Systems Programmer's Perspective [sinatra edition]](https://cdn.slidesharecdn.com/ss_thumbnails/2022thebrowserenvironment-asystemsprogrammersperspectivesinatraedition-220314193951-thumbnail.jpg?width=640&height=640&fit=bounds)
![An introduction to functional programming with Go [redux]](https://cdn.slidesharecdn.com/ss_thumbnails/anintroductiontofunctionalprogrammingwithgoredux-191022131211-thumbnail.jpg?width=640&height=640&fit=bounds)
Go <-> Ruby
- 1. Go <=> Ruby a selection of odd lightning talks @feyeleanor http://slides.games-with-brains.net/
- 2. The Wild-Eyed Screamer
- 3.
- 4.
- 5.
- 6.
- 7.
- 8. Hacker 101 this presentationcontains code
- 9. Hacker 101 this presentationcontains code that code is probably broken
- 10. Hacker 101 this presentationcontains code that code is probably broken if this bothers you - fix it
- 11. Hacker 101 this presentationcontains code that code is probably broken if this bothers you - fix it it’s called a learning experience
- 12. Hacker 101 this presentationcontains code that code is probably broken if this bothers you - fix it it’s called a learning experience and will make you a better persontm
- 13. Google Go it’s notjust for Google
- 14.
- 15.
- 16. of very fewwords
- 17. who lives atgoogle
- 18. package main import "fmt" constHELLO string = "hello" var WORLD string = "world" func main() { fmt.Println(HELLO, WORLD) }
- 19. package main import "fmt" constHELLO string = "hello" var WORLD string = "world" func main() { fmt.Println(HELLO, WORLD) }
- 20. package main import "fmt" constHELLO string = "hello" var WORLD string = "world" func main() { fmt.Println(HELLO, WORLD) }
- 21. package main import "fmt" constHELLO string = "hello" var WORLD string = "world" func main() { fmt.Println(HELLO, WORLD) }
- 22. package organisation import var, const, type declaration func, interface, map, struct, chan if ... else switch ... case ... fallthrough ... default select ... case control flow for for ... range break, continue go, goto, defer, return
- 23. boolean, numeric, array value structure, interface reference pointer, slice, string, map, channel invocation function, method, closure
- 24. Go Ruby compilation static AOT runtime mutable memory garbage collected syntax minimalist humanistic strong dynamic type embedding inheritance dispatch procedural invocation message passing semantics statements expressions
- 25. Ruby typing istricksy lies we tell ourself about type
- 26. superclass modules class modules message instance
- 27. superclass modules class modules type asserted instance
- 28. instance inherited class class expressed type modules
- 29. instance inherited class class expressed type modules
- 30. instance inherited class class expressed type modules
- 31. instance inherited class class expressed type modules
- 32. class Counter attr_writer :count def initialize @count = 0 end def Tick @count += 1 end end class DoubleCounter < Counter def Tick super @count += 1 end end n = new(DoubleCounter) puts n.Tick puts n.superclass.Tick
- 33. class Counter attr_writer :count def initialize @count = 0 end def Tick @count += 1 end end class DoubleCounter < Counter def Tick super @count += 1 end end n = new(DoubleCounter) puts n.Tick puts n.superclass.Tick
- 34. class Counter attr_writer :count def initialize @count = 0 end def Tick @count += 1 end end class DoubleCounter < Counter def Tick super @count += 1 end end n = new(DoubleCounter) puts n.Tick puts n.superclass.Tick
- 35. class Counter attr_writer :count def initialize @count = 0 end def Tick @count += 1 end end class DoubleCounter < Counter def Tick super @count += 1 end end n = new(DoubleCounter) puts n.Tick puts n.superclass.Tick
- 36. class Counter attr_writer :count def initialize @count = 0 end def Tick @count += 1 end end class DoubleCounter < Counter def Tick super @count += 1 end end n = new(DoubleCounter) puts n.Tick puts n.superclass.Tick
- 37. class Counter attr_writer :count def initialize @count = 0 end def Tick @count += 1 end end class DoubleCounter < Counter def Tick super @count += 1 end end n = new(DoubleCounter) puts n.Tick puts n.superclass.Tick
- 38. down a rabbithole instances are their own classes
- 39. down a rabbithole instances are their own classes and all classes are mutable at runtime
- 40. down a rabbithole instances are their own classes all classes are mutable at runtime so inheritance pathways can be altered
- 41. down a rabbithole instances are their own classes and all classes are mutable at runtime so inheritance pathways can be altered making Ruby very flexible
- 42. down a rabbithole instances are their own classes and all classes are mutable at runtime so inheritance pathways can be altered making Ruby very flexible at the cost of type uncertainty
- 43. down a rabbithole instances are their own classes and all classes are mutable at runtime so inheritance pathways can be altered making Ruby very flexible at the cost of type uncertainty which really bugs computer scientists
- 44. type in Gois safetm clearly defined areas of doubt and uncertainty
- 45. memory method layout set static type embedded types
- 46. memory method layout set static type embedded types
- 47. memory method layout set static type embedded types
- 48. memory method layout set static type embedded types
- 49. package Integer type Intint func (i *Int) Add(x int) { *i += Int(x) }
- 50. package Integer type Intint func (i *Int) Add(x int) { *i += Int(x) }
- 51. package Integer type Intint func (i *Int) Add(x int) { *i += Int(x) }
- 52. package Integer type Intint func (i *Int) Add(x int) { *i += Int(x) }
- 53. type Buffer []Int func(b Buffer) Swap(i, j int) { b[i], b[j] = b[j], b[i] } func (b Buffer) Clone() Buffer { s := make(Buffer, len(b)) copy(s, b) return s } func (b Buffer) Move(i, n int) { if n > len(b) - i { n = len(b) - i } segment_to_move := b[:i].Clone() copy(b, b[i:i + n]) copy(b[n:i + n], segment_to_move) }
- 54. type Buffer []Int func(b Buffer) Swap(i, j int) { b[i], b[j] = b[j], b[i] } func (b Buffer) Clone() Buffer { s := make(Buffer, len(b)) copy(s, b) return s } func (b Buffer) Move(i, n int) { if n > len(b) - i { n = len(b) - i } segment_to_move := b[:i].Clone() copy(b, b[i:i + n]) copy(b[n:i + n], segment_to_move) }
- 55. type Buffer []Int func(b Buffer) Swap(i, j int) { b[i], b[j] = b[j], b[i] } func (b Buffer) Clone() Buffer { s := make(Buffer, len(b)) copy(s, b) return s } func (b Buffer) Move(i, n int) { if n > len(b) - i { n = len(b) - i } segment_to_move := b[:i].Clone() copy(b, b[i:i + n]) copy(b[n:i + n], segment_to_move) }
- 56. package main import "fmt" import"Integer" func main() { i := Integer.Buffer{0, 1, 2, 3, 4, 5} b := i.Clone() b.Swap(1, 2) b.Move(3, 2) b[0].Add(3) produces: fmt.Printf("b[0:2] = %vn", b[:2]) b[0:2] = [6 4] }
- 57. package main import "fmt" import"Integer" func main() { i := Integer.Buffer{0, 1, 2, 3, 4, 5} b := i.Clone() b.Swap(1, 2) b.Move(3, 2) b[0].Add(3) produces: fmt.Printf(“b[0:2] = %vn”, b[:2]) b[0:2] = [6 4] }
- 58. package main import "fmt" import"Integer" func main() { i := Integer.Buffer{0, 1, 2, 3, 4, 5} b := i.Clone() b.Swap(1, 2) b.Move(3, 2) b[0].Add(3) produces: fmt.Printf("b[0:2] = %vn", b[:2]) b[0:2] = [6 4] }
- 59. package main import "fmt" import"Integer" func main() { i := Integer.Buffer{0, 1, 2, 3, 4, 5} b := i.Clone() b.Swap(1, 2) b.Move(3, 2) b[0].Add(3) produces: fmt.Printf("b[0:2] = %vn", b[:2]) b[0:2] = [6 4] }
- 60. package main import "fmt" import"Integer" func main() { i := Integer.Buffer{0, 1, 2, 3, 4, 5} b := i.Clone() b.Swap(1, 2) b.Move(3, 2) b[0].Add(3) produces: fmt.Printf("b[0:2] = %vn", b[:2]) b[0:2] = [6 4] }
- 61. package Vector import ."Integer" type Vector struct { Buffer } func (v *Vector) Clone() *Vector { return &Vector{v.Buffer.Clone()} } func (v *Vector) Slice(i, j int) Buffer { return v.Buffer[i:j] }
- 62. package Vector import ."Integer" type Vector struct { Buffer } func (v *Vector) Clone() *Vector { return &Vector{v.Buffer.Clone()} } func (v *Vector) Slice(i, j int) Buffer { return v.Buffer[i:j] }
- 63. package Vector import ."Integer" type Vector struct { Buffer } func (v *Vector) Clone() *Vector { return &Vector{v.Buffer.Clone()} } func (v *Vector) Slice(i, j int) Buffer { return v.Buffer[i:j] }
- 64. package Vector import ."Integer" type Vector struct { Buffer } func (v *Vector) Clone() *Vector { return &Vector{v.Buffer.Clone()} } func (v *Vector) Slice(i, j int) Buffer { return v.Buffer[i:j] }
- 65. package Vector import ."Integer" type Vector struct { Buffer } func (v *Vector) Clone() *Vector { return &Vector{v.Buffer.Clone()} } func (v *Vector) Slice(i, j int) Buffer { return v.Buffer[i:j] }
- 66. type Adder interface{ Add(j int) Subtract(j int) Result() interface{} Reset() }
- 67. type Adder interface{ Add(j int) Subtract(j int) Result() interface{} Reset() }
- 68. type Adder interface{ Add(j int) Subtract(j int) Result() interface{} Reset() }
- 69. type IAdder int func(i IAdder) Add(j int) { i[0] += i[j] } func (i IAdder) Subtract(j int) { i[0] -= i[j] } func (i IAdder) Result() interface{} { return i[0] } func (i IAdder) Reset() { i[0] = *new(int) } func (i IAdder) Increment() { i[0]++ }
- 70. type IAdder int func(i IAdder) Add(j int) { i[0] += i[j] } func (i IAdder) Subtract(j int) { i[0] -= i[j] } func (i IAdder) Result() interface{} { return i[0] } func (i IAdder) Reset() { i[0] = *new(int) } func (i IAdder) Increment() { i[0]++ }
- 71. type IAdder int func(i IAdder) Add(j int) { i[0] += i[j] } func (i IAdder) Subtract(j int) { i[0] -= i[j] } func (i IAdder) Result() interface{} { return i[0] } func (i IAdder) Reset() { i[0] = *new(int) } func (i IAdder) Increment() { i[0]++ }
- 72. type FAdder []float32 func(f FAdder) Add(j int) { f[0] += f[j] } func (f FAdder) Subtract(j int) { f[0] -= f[j] } func (f FAdder) Result() interface{} { return f[0] } func (f FAdder) Reset() { f[0] = 0 }
- 73. type FAdder []float32 func(f FAdder) Add(j int) { f[0] += f[j] } func (f FAdder) Subtract(j int) { f[0] -= f[j] } func (f FAdder) Result() interface{} { return f[0] } func (f FAdder) Reset() { f[0] = 0 }
- 74. type FAdder []float32 func(f FAdder) Add(j int) { f[0] += f[j] } func (f FAdder) Subtract(j int) { f[0] -= f[j] } func (f FAdder) Result() interface{} { return f[0] } func (f FAdder) Reset() { f[0] = 0 }
- 75. func TestAdder(t *testing.T){ var a Adder a = IAdder{0, 1, 2} a.Add(1) if i.Result().(int) != 1 { t.Fatalf("IAdder::Add(1) %v != %v", a.Result(), 1) } a.Subtract(2) if a.Result().(int) != -1 { t.Fatalf("IAdder::Subtract(2) %v != %v", a.Result(), -1) } a = FAdder{0.0, 1.0, 2.0} a.Add(1) if a.Result().(float32) != 1.0 { t.Fatalf("FAdder::Add(1) %v != %v", a.Result(), 1.0) } }
- 76. func TestAdder(t *testing.T){ var a Adder a = IAdder{0, 1, 2} a.Add(1) if i.Result().(int) != 1 { t.Fatalf("IAdder::Add(1) %v != %v", a.Result(), 1) } a.Subtract(2) if a.Result().(int) != -1 { t.Fatalf("IAdder::Subtract(2) %v != %v", a.Result(), -1) } a = FAdder{0.0, 1.0, 2.0} a.Add(1) if a.Result().(float32) != 1.0 { t.Fatalf("FAdder::Add(1) %v != %v", a.Result(), 1.0) } }
- 77. func TestAdder(t *testing.T){ var a Adder a = IAdder{0, 1, 2} a.Add(1) if i.Result().(int) != 1 { t.Fatalf("IAdder::Add(1) %v != %v", a.Result(), 1) } a.Subtract(2) if a.Result().(int) != -1 { t.Fatalf("IAdder::Subtract(2) %v != %v", a.Result(), -1) } a = FAdder{0.0, 1.0, 2.0} a.Add(1) if a.Result().(float32) != 1.0 { t.Fatalf("FAdder::Add(1) %v != %v", a.Result(), 1.0) } }
- 78. func TestAdder(t *testing.T){ var a Adder a = IAdder{0, 1, 2} a.Add(1) if i.Result().(int) != 1 { t.Fatalf("IAdder::Add(1) %v != %v", a.Result(), 1) } a.Subtract(2) if a.Result().(int) != -1 { t.Fatalf("IAdder::Subtract(2) %v != %v", a.Result(), -1) } a = FAdder{0.0, 1.0, 2.0} a.Add(1) if a.Result().(float32) != 1.0 { t.Fatalf("FAdder::Add(1) %v != %v", a.Result(), 1.0) } }
- 79. func TestAdder(t *testing.T){ var a Adder a = IAdder{0, 1, 2} a.Add(1) if i.Result().(int) != 1 { t.Fatalf("IAdder::Add(1) %v != %v", a.Result(), 1) } a.Subtract(2) if a.Result().(int) != -1 { t.Fatalf("IAdder::Subtract(2) %v != %v", a.Result(), -1) } a = FAdder{0.0, 1.0, 2.0} a.Add(1) if a.Result().(float32) != 1.0 { t.Fatalf("FAdder::Add(1) %v != %v", a.Result(), 1.0) } }
- 80. func TestAdder(t *testing.T){ var a Adder a = IAdder{0, 1, 2} a.Add(1) if i.Result().(int) != 1 { t.Fatalf("IAdder::Add(1) %v != %v", a.Result(), 1) } a.Subtract(2) if a.Result().(int) != -1 { t.Fatalf("IAdder::Subtract(2) %v != %v", a.Result(), -1) } a = FAdder{0.0, 1.0, 2.0} a.Add(1) if a.Result().(float32) != 1.0 { t.Fatalf("FAdder::Add(1) %v != %v", a.Result(), 1.0) } }
- 81. func TestAdder(t *testing.T){ var a Adder a = IAdder{0, 1, 2} a.Add(1) if i.Result().(int) != 1 { t.Fatalf("IAdder::Add(1) %v != %v", a.Result(), 1) } a.Subtract(2) if a.Result().(int) != -1 { t.Fatalf("IAdder::Subtract(2) %v != %v", a.Result(), -1) } a = FAdder{0.0, 1.0, 2.0} a.Add(1) if a.Result().(float32) != 1.0 { t.Fatalf("FAdder::Add(1) %v != %v", a.Result(), 1.0) } }
- 82. down a rabbithole an object has known static type
- 83. down a rabbithole an object has known static type this fixed type is determined at linking
- 84. down a rabbithole an object has known static type this fixed type is determined at linking no new types can be created at runtime
- 85. down a rabbithole an object has known static type this fixed type is determined at linking no new types can be created at runtime so dynamism is bounded to a fixed set
- 86. down a rabbithole an object has known static type this fixed type is determined at linking no new types can be created at runtime so dynamism is bounded to this fixed set and computer scientists are happier
- 87. unit tests asREPL testing that doesn’t suck
- 88. func (b Buffer)Eq(o Buffer) (r bool) { if len(b) == len(o) { for i := len(b) - 1; i > 0; i-- { if b[i] != o[i] { return } } r = true } return }
- 89. func (b Buffer)Eq(o Buffer) (r bool) { if len(b) == len(o) { for i := len(b) - 1; i > 0; i-- { if b[i] != o[i] { return } } r = true } return }
- 90. func (b Buffer)Eq(o Buffer) (r bool) { if len(b) == len(o) { for i := len(b) - 1; i > 0; i-- { if b[i] != o[i] { return } } r = true } return }
- 91. func (b Buffer)Eq(o Buffer) (r bool) { if len(b) == len(o) { for i := len(b) - 1; i > 0; i-- { if b[i] != o[i] { return } } r = true } return }
- 92. func (b Buffer)Eq(o Buffer) (r bool) { if len(b) == len(o) { for i := len(b) - 1; i > 0; i-- { if b[i] != o[i] { return } } r = true } return }
- 93. func (b Buffer)Eq(o Buffer) (r bool) { if len(b) == len(o) { for i := len(b) - 1; i > 0; i-- { if b[i] != o[i] { return } } r = true } return }
- 94. func (b Buffer)Eq(o Buffer) (r bool) { if len(b) == len(o) { for i := len(b) - 1; i > 0; i-- { if b[i] != o[i] { return } } r = true } return }
- 95. package Vector import "testing" funcTestVectorSwap(t *testing.T) { i := Vector{Buffer{0, 1, 2, 3, 4, 5}} v := i.Clone() v.Swap(1, 2) r := Vector{Buffer{0, 2, 1, 3, 4, 5}} switch { case !v.Eq(r.Buffer): fallthrough case !v.Buffer.Eq(r.Buffer): t.Fatalf("b[0:5] = %v", v) } }
- 96. package Vector import "testing" funcTestVectorSwap(t *testing.T) { i := Vector{Buffer{0, 1, 2, 3, 4, 5}} v := i.Clone() v.Swap(1, 2) r := Vector{Buffer{0, 2, 1, 3, 4, 5}} switch { case !v.Eq(r.Buffer): fallthrough case !v.Buffer.Eq(r.Buffer): t.Fatalf("b[0:5] = %v", v) } }
- 97. package Vector import "testing" funcTestVectorSwap(t *testing.T) { i := Vector{Buffer{0, 1, 2, 3, 4, 5}} v := i.Clone() v.Swap(1, 2) r := Vector{Buffer{0, 2, 1, 3, 4, 5}} switch { case !v.Eq(r.Buffer): fallthrough case !v.Buffer.Eq(r.Buffer): t.Fatalf("b[0:5] = %v", v) } }
- 98. package Vector import "testing" funcTestVectorSwap(t *testing.T) { i := Vector{Buffer{0, 1, 2, 3, 4, 5}} v := i.Clone() v.Swap(1, 2) r := Vector{Buffer{0, 2, 1, 3, 4, 5}} switch { case !v.Eq(r.Buffer): fallthrough case !v.Buffer.Eq(r.Buffer): t.Fatalf("b[0:5] = %v", v) } }
- 99. package Vector import "testing" funcTestVectorSwap(t *testing.T) { i := Vector{Buffer{0, 1, 2, 3, 4, 5}} v := i.Clone() v.Swap(1, 2) r := Vector{Buffer{0, 2, 1, 3, 4, 5}} switch { case !v.Eq(r.Buffer): fallthrough case !v.Buffer.Eq(r.Buffer): t.Fatalf("b[0:5] = %v", v) } }
- 100. package Vector import "testing" funcTestVectorSwap(t *testing.T) { i := Vector{Buffer{0, 1, 2, 3, 4, 5}} v := i.Clone() v.Swap(1, 2) r := Vector{Buffer{0, 2, 1, 3, 4, 5}} switch { case !v.Eq(r.Buffer): fallthrough case !v.Buffer.Eq(r.Buffer): t.Fatalf("b[0:5] = %v", v) } }
- 101. package Vector import "testing" funcTestVectorSwap(t *testing.T) { i := Vector{Buffer{0, 1, 2, 3, 4, 5}} v := i.Clone() v.Swap(1, 2) r := Vector{Buffer{0, 2, 1, 3, 4, 5}} switch { case !v.Eq(r.Buffer): fallthrough case !v.Buffer.Eq(r.Buffer): t.Fatalf("b[0:5] = %v", v) } }
- 102. package Vector import "testing" funcTestVectorSwap(t *testing.T) { i := Vector{Buffer{0, 1, 2, 3, 4, 5}} v := i.Clone() v.Swap(1, 2) r := Vector{Buffer{0, 2, 1, 3, 4, 5}} switch { case !v.Eq(r.Buffer): fallthrough case !v.Buffer.Eq(r.Buffer): t.Fatalf("b[0:5] = %v", v) } }
- 103. include $(GOROOT)/src/Make.inc TARG=integer GOFILES= integer.go vector.go include $(GOROOT)/src/Make.pkg
- 104. package Vector import "testing" import"vector" func BenchmarkVectorClone6(b *testing.B) { v := Vector{Buffer{0, 1, 2, 3, 4, 5}} for i := 0; i < b.N; i++ { _ = v.Clone() } } func BenchmarkVectorSwap(b *testing.B) { b.StopTimer() v := Vector{Buffer{0, 1, 2, 3, 4, 5}} b.StartTimer() for i := 0; i < b.N; i++ { v.Swap(1, 2) } }
- 105. package Vector import "testing" import"vector" func BenchmarkVectorClone6(b *testing.B) { v := Vector{Buffer{0, 1, 2, 3, 4, 5}} for i := 0; i < b.N; i++ { _ = v.Clone() } } func BenchmarkVectorSwap(b *testing.B) { b.StopTimer() v := Vector{Buffer{0, 1, 2, 3, 4, 5}} b.StartTimer() for i := 0; i < b.N; i++ { v.Swap(1, 2) } }
- 106. package Vector import "testing" import"vector" func BenchmarkVectorClone6(b *testing.B) { v := Vector{Buffer{0, 1, 2, 3, 4, 5}} for i := 0; i < b.N; i++ { _ = v.Clone() } } func BenchmarkVectorSwap(b *testing.B) { b.StopTimer() v := Vector{Buffer{0, 1, 2, 3, 4, 5}} b.StartTimer() for i := 0; i < b.N; i++ { v.Swap(1, 2) } }
- 107. package Vector import "testing" import"vector" func BenchmarkVectorClone6(b *testing.B) { v := Vector{Buffer{0, 1, 2, 3, 4, 5}} for i := 0; i < b.N; i++ { _ = v.Clone() } } func BenchmarkVectorSwap(b *testing.B) { b.StopTimer() v := Vector{Buffer{0, 1, 2, 3, 4, 5}} b.StartTimer() for i := 0; i < b.N; i++ { v.Swap(1, 2) } }
- 108. package Vector import "testing" import"vector" func BenchmarkVectorClone6(b *testing.B) { v := Vector{Buffer{0, 1, 2, 3, 4, 5}} for i := 0; i < b.N; i++ { _ = v.Clone() } } func BenchmarkVectorSwap(b *testing.B) { b.StopTimer() v := Vector{Buffer{0, 1, 2, 3, 4, 5}} b.StartTimer() for i := 0; i < b.N; i++ { v.Swap(1, 2) } }
- 109. package Vector import "testing" import"vector" func BenchmarkVectorClone6(b *testing.B) { v := Vector{Buffer{0, 1, 2, 3, 4, 5}} for i := 0; i < b.N; i++ { _ = v.Clone() } } func BenchmarkVectorSwap(b *testing.B) { b.StopTimer() v := Vector{Buffer{0, 1, 2, 3, 4, 5}} b.StartTimer() for i := 0; i < b.N; i++ { v.Swap(1, 2) } }
- 110. $ gotest -bench="Benchmark" rm-f _test/scripts.a 6g -o _gotest_.6 integer.go vector.go nominal_typing_test.go embedded_typing_benchmark_test.go embedded_typing_test.go rm -f _test/scripts.a gopack grc _test/scripts.a _gotest_.6 PASS integer.BenchmarkVectorSwap 200000000 8 ns/op integer.BenchmarkVectorClone6 10000000 300 ns/op
- 111. $ gotest -bench="Benchmark" rm-f _test/scripts.a 6g -o _gotest_.6 integer.go vector.go nominal_typing_test.go embedded_typing_benchmark_test.go embedded_typing_test.go rm -f _test/scripts.a gopack grc _test/scripts.a _gotest_.6 PASS integer.BenchmarkVectorSwap 200000000 8 ns/op integer.BenchmarkVectorClone6 10000000 300 ns/op
- 112. $ gotest -bench="Benchmark" rm-f _test/scripts.a 6g -o _gotest_.6 integer.go vector.go nominal_typing_test.go embedded_typing_benchmark_test.go embedded_typing_test.go rm -f _test/scripts.a gopack grc _test/scripts.a _gotest_.6 PASS integer.BenchmarkVectorSwap 200000000 8 ns/op integer.BenchmarkVectorClone6 10000000 300 ns/op
- 113. $ gotest -bench="Benchmark" rm-f _test/scripts.a 6g -o _gotest_.6 integer.go vector.go nominal_typing_test.go embedded_typing_benchmark_test.go embedded_typing_test.go rm -f _test/scripts.a gopack grc _test/scripts.a _gotest_.6 PASS integer.BenchmarkVectorSwap 200000000 8 ns/op integer.BenchmarkVectorClone6 10000000 300 ns/op
- 114. $ gotest -bench="Benchmark" rm-f _test/scripts.a 6g -o _gotest_.6 integer.go vector.go nominal_typing_test.go embedded_typing_benchmark_test.go embedded_typing_test.go rm -f _test/scripts.a gopack grc _test/scripts.a _gotest_.6 PASS integer.BenchmarkVectorSwap 200000000 8 ns/op integer.BenchmarkVectorClone6 10000000 300 ns/op
- 115. exceptional fun because Godoesn’t have exceptions - honest!
- 116. func Throw() { panic(nil) } func Catch(f func()) { defer func() { if x := recover(); x != nil { panic(x) } }() f() } func CatchAll(f func()) { defer func() { recover() }() f() }
- 117. func Throw() { panic(nil) } func Catch(f func()) { defer func() { if x := recover(); x != nil { panic(x) } }() f() } func CatchAll(f func()) { defer func() { recover() }() f() }
- 118. func Throw() { panic(nil) } func Catch(f func()) { defer func() { if x := recover(); x != nil { panic(x) } }() f() } func CatchAll(f func()) { defer func() { recover() }() f() }
- 119. func Throw() { panic(nil) } func Catch(f func()) { defer func() { if x := recover(); x != nil { panic(x) } }() f() } func CatchAll(f func()) { defer func() { recover() }() f() }
- 120. func Throw() { panic(nil) } func Catch(f func()) { defer func() { if x := recover(); x != nil { panic(x) } }() f() } func CatchAll(f func()) { defer func() { recover() }() f() }
- 121. func Throw() { panic(nil) } func Catch(f func()) { defer func() { if x := recover(); x != nil { panic(x) } }() f() } func CatchAll(f func()) { defer func() { recover() }() f() }
- 122. func Throw() { panic(nil) } func Catch(f func()) { defer func() { if x := recover(); x != nil { panic(x) } }() f() } func CatchAll(f func()) { defer func() { recover() }() f() }
- 123. func Throw() { panic(nil) } func Catch(f func()) { defer func() { if x := recover(); x != nil { panic(x) } }() f() } func CatchAll(f func()) { defer func() { recover() }() f() }
- 124. func Throw() { panic(nil) } func Catch(f func()) { defer func() { if x := recover(); x != nil { panic(x) } }() f() } func CatchAll(f func()) { defer func() { recover() }() f() }
- 125. func Throw() { panic(nil) } func Catch(f func()) { defer func() { if x := recover(); x != nil { panic(x) } }() f() } func CatchAll(f func()) { defer func() { recover() }() f() }
- 126. func throwsPanic(f func())(b bool) { defer func() { if x := recover(); x != nil { b = true } }() f() return }
- 127. func throwsPanic(f func())(b bool) { defer func() { if x := recover(); x != nil { b = true } }() f() return }
- 128. func throwsPanic(f func())(b bool) { defer func() { if x := recover(); x != nil { b = true } }() f() return }
- 129. func throwsPanic(f func())(b bool) { defer func() { if x := recover(); x != nil { b = true } }() f() return }
- 130. func throwsPanic(f func())(b bool) { defer func() { if x := recover(); x != nil { b = true } }() f() return }
- 131. func throwsPanic(f func())(b bool) { defer func() { if x := recover(); x != nil { b = true } }() f() return }
- 132. func throwsPanic(f func())(b bool) { defer func() { if x := recover(); x != nil { b = true } }() f() return }
- 133. func throwsPanic(f func())(b bool) { defer func() { if x := recover(); x != nil { b = true } }() f() return }
- 134. import "fmt" import "path" import"runtime" func StackTrace() { var stack_trace []uintptr var my_path string runtime.Callers(1, stack_trace) for i, u := range stack_trace { if f := runtime.FuncForPC(u); f != nil { file, line := f.FileLine(u) switch filepath, filename := path.Split(file); { case i == 0: my_path = filepath case my_path != filepath: fmt.Printf("%v:%v", filename, line) } } else { fmt.Println("(unknown)") } } }
- 135. import "fmt" import "path" import"runtime" func StackTrace() { var stack_trace []uintptr var my_path string runtime.Callers(1, stack_trace) for i, u := range stack_trace { if f := runtime.FuncForPC(u); f != nil { file, line := f.FileLine(u) switch filepath, filename := path.Split(file); { case i == 0: my_path = filepath case my_path != filepath: fmt.Printf("%v:%v", filename, line) } } else { fmt.Println("(unknown)") } } }
- 136. import "fmt" import "path" import"runtime" func StackTrace() { var stack_trace []uintptr var my_path string runtime.Callers(1, stack_trace) for i, u := range stack_trace { if f := runtime.FuncForPC(u); f != nil { file, line := f.FileLine(u) switch filepath, filename := path.Split(file); { case i == 0: my_path = filepath case my_path != filepath: fmt.Printf("%v:%v", filename, line) } } else { fmt.Println("(unknown)") } } }
- 137. import "fmt" import "path" import"runtime" func StackTrace() { var stack_trace []uintptr var my_path string runtime.Callers(1, stack_trace) for i, u := range stack_trace { if f := runtime.FuncForPC(u); f != nil { file, line := f.FileLine(u) switch filepath, filename := path.Split(file); { case i == 0: my_path = filepath case my_path != filepath: fmt.Printf("%v:%v", filename, line) } } else { fmt.Println("(unknown)") } } }
- 138. import "fmt" import "path" import"runtime" func StackTrace() { var stack_trace []uintptr var my_path string runtime.Callers(1, stack_trace) for i, u := range stack_trace { if f := runtime.FuncForPC(u); f != nil { file, line := f.FileLine(u) switch filepath, filename := path.Split(file); { case i == 0: my_path = filepath case my_path != filepath: fmt.Printf("%v:%v", filename, line) } } else { fmt.Println("(unknown)") } } }
- 139. import "fmt" import "path" import"runtime" func StackTrace() { var stack_trace []uintptr var my_path string runtime.Callers(1, stack_trace) for i, u := range stack_trace { if f := runtime.FuncForPC(u); f != nil { file, line := f.FileLine(u) switch filepath, filename := path.Split(file); { case i == 0: my_path = filepath case my_path != filepath: fmt.Printf("%v:%v", filename, line) } } else { fmt.Println("(unknown)") } } }
- 140. import "fmt" import "path" import"runtime" func StackTrace() { var stack_trace []uintptr var my_path string runtime.Callers(1, stack_trace) for i, u := range stack_trace { if f := runtime.FuncForPC(u); f != nil { file, line := f.FileLine(u) switch filepath, filename := path.Split(file); { case i == 0: my_path = filepath case my_path != filepath: fmt.Printf("%v:%v", filename, line) } } else { fmt.Println("(unknown)") } } }
- 141. import "fmt" import "path" import"runtime" func StackTrace() { var stack_trace []uintptr var my_path string runtime.Callers(1, stack_trace) for i, u := range stack_trace { if f := runtime.FuncForPC(u); f != nil { file, line := f.FileLine(u) switch filepath, filename := path.Split(file); { case i == 0: my_path = filepath case my_path != filepath: fmt.Printf("%v:%v", filename, line) } } else { fmt.Println("(unknown)") } } }
- 142. import "fmt" import "path" import"runtime" func StackTrace() { var stack_trace []uintptr var my_path string runtime.Callers(1, stack_trace) for i, u := range stack_trace { if f := runtime.FuncForPC(u); f != nil { file, line := f.FileLine(u) switch filepath, filename := path.Split(file); { case i == 0: my_path = filepath case my_path != filepath: fmt.Printf("%v:%v", filename, line) } } else { fmt.Println("(unknown)") } } }
- 143. import "fmt" import "path" import"runtime" func StackTrace() { var stack_trace []uintptr var my_path string runtime.Callers(1, stack_trace) for i, u := range stack_trace { if f := runtime.FuncForPC(u); f != nil { file, line := f.FileLine(u) switch filepath, filename := path.Split(file); { case i == 0: my_path = filepath case my_path != filepath: fmt.Printf("%v:%v", filename, line) } } else { fmt.Println("(unknown)") } } }
- 144. import "fmt" import "path" import"runtime" func StackTrace() { var stack_trace []uintptr var my_path string runtime.Callers(1, stack_trace) for i, u := range stack_trace { if f := runtime.FuncForPC(u); f != nil { file, line := f.FileLine(u) switch filepath, filename := path.Split(file); { case i == 0: my_path = filepath case my_path != filepath: fmt.Printf("%v:%v", filename, line) } } else { fmt.Println("(unknown)") } } }
- 145. reflections on Go dynamismthrough run-time type manipulation
- 146. package generalise import "reflect" funcAllocate(i interface{}, limit... int) (n interface{}) { switch v := reflect.ValueOf(i); v.Kind() { case reflect.Slice: l := v.Cap() if len(limit) > 0 { l = limit[0] } n = reflect.MakeSlice(v.Type(), l, l).Interface() case reflect.Map: n = reflect.MakeMap(v.Type()).Interface() } return }
- 147. package generalise import "reflect" funcAllocate(i interface{}, limit... int) (n interface{}) { switch v := reflect.ValueOf(i); v.Kind() { case reflect.Slice: l := v.Cap() if len(limit) > 0 { l = limit[0] } n = reflect.MakeSlice(v.Type(), l, l).Interface() case reflect.Map: n = reflect.MakeMap(v.Type()).Interface() } return }
- 148. package generalise import ."reflect" func Allocate(i interface{}, limit... int) (n interface{}) { switch v := ValueOf(i); v.Kind() { case Slice: l := v.Cap() if len(limit) > 0 { l = limit[0] } n = MakeSlice(v.Type(), l, l).Interface() case Map: n = MakeMap(v.Type()).Interface() } return }
- 149. package generalise import ."reflect" func Allocate(i interface{}, limit... int) (n interface{}) { switch v := ValueOf(i); v.Kind() { case Slice: l := v.Cap() if len(limit) > 0 { l = limit[0] } n = MakeSlice(v.Type(), l, l).Interface() case Map: n = MakeMap(v.Type()).Interface() } return }
- 150. package generalise import ."reflect" func Allocate(i interface{}, limit... int) (n interface{}) { switch v := ValueOf(i); v.Kind() { case Slice: l := v.Cap() if len(limit) > 0 { l = limit[0] } n = MakeSlice(v.Type(), l, l).Interface() case Map: n = MakeMap(v.Type()).Interface() } return }
- 151. package generalise import ."reflect" func Allocate(i interface{}, limit... int) (n interface{}) { switch v := ValueOf(i); v.Kind() { case Slice: l := v.Cap() if len(limit) > 0 { l = limit[0] } n = MakeSlice(v.Type(), l, l).Interface() case Map: n = MakeMap(v.Type()).Interface() } return }
- 152. package generalise import ."reflect" func Allocate(i interface{}, limit... int) (n interface{}) { switch v := ValueOf(i); v.Kind() { case Slice: l := v.Cap() if len(limit) > 0 { l = limit[0] } n = MakeSlice(v.Type(), l, l).Interface() case Map: n = MakeMap(v.Type()).Interface() } return }
- 153. package generalise import ."reflect" func Allocate(i interface{}, limit... int) (n interface{}) { switch v := ValueOf(i); v.Kind() { case Slice: l := v.Cap() if len(limit) > 0 { l = limit[0] } n = MakeSlice(v.Type(), l, l).Interface() case Map: n = MakeMap(v.Type()).Interface() } return }
- 154. package generalise import ."reflect" func Allocate(i interface{}, limit... int) (n interface{}) { switch v := ValueOf(i); v.Kind() { case Slice: l := v.Cap() if len(limit) > 0 { l = limit[0] } n = MakeSlice(v.Type(), l, l).Interface() case Map: n = MakeMap(v.Type()).Interface() } return }
- 155. package generalise import ."reflect" func Allocate(i interface{}, limit... int) (n interface{}) { switch v := ValueOf(i); v.Kind() { case Slice: l := v.Cap() if len(limit) > 0 { l = limit[0] } n = MakeSlice(v.Type(), l, l).Interface() case Map: n = MakeMap(v.Type()).Interface() } return }
- 156. package generalise import ."reflect" func Allocate(i interface{}, limit... int) (n interface{}) { switch v := ValueOf(i); v.Kind() { case Slice: l := v.Cap() if len(limit) > 0 { l = limit[0] } n = MakeSlice(v.Type(), l, l).Interface() case Map: n = MakeMap(v.Type()).Interface() } return }
- 157. package generalise import ."reflect" func Allocate(i interface{}, limit... int) (n interface{}) { switch v := ValueOf(i); v.Kind() { case Slice: l := v.Cap() if len(limit) > 0 { l = limit[0] } n = MakeSlice(v.Type(), l, l).Interface() case Map: n = MakeMap(v.Type()).Interface() } return }
- 158. package generalise import ."reflect" func Allocate(i interface{}, limit... int) (n interface{}) { switch v := ValueOf(i); v.Kind() { case Slice: l := v.Cap() if len(limit) > 0 { l = limit[0] } n = MakeSlice(v.Type(), l, l).Interface() case Map: n = MakeMap(v.Type()).Interface() } return }
- 159. package generalise import ."reflect" func Allocate(i interface{}, limit... int) (n interface{}) { switch v := ValueOf(i); v.Kind() { case Slice: l := v.Cap() if len(limit) > 0 { l = limit[0] } n = MakeSlice(v.Type(), l, l).Interface() case Map: n = MakeMap(v.Type()).Interface() } return }
- 160. package generalise import ."reflect" func Allocate(i interface{}, limit... int) (n interface{}) { switch v := ValueOf(i); v.Kind() { case Slice: l := v.Cap() if len(limit) > 0 { l = limit[0] } n = MakeSlice(v.Type(), l, l).Interface() case Map: n = MakeMap(v.Type()).Interface() } return }
- 161. func TestAllocate(t *testing.T){ var s2 []int s1 := []int{0, 1, 2} m := map[int] int{1: 1, 2: 2, 3: 3} switch { case throwsPanic(func() { s2 = Allocate(s1, 1).([]int) }): t.Fatal("Unable to allocate new slice") case len(s2) != 1 || cap(s2) != 1: t.Fatalf("New slice should be %v not %v", make([]int, 0, 1), s2) case throwsPanic(func() { Allocate(m) }): t.Fatal("Unable to allocate new map") } }
- 162. func TestAllocate(t *testing.T){ var s2 []int s1 := []int{0, 1, 2} m := map[int] int{1: 1, 2: 2, 3: 3} switch { case throwsPanic(func() { s2 = Allocate(s1, 1).([]int) }): t.Fatal("Unable to allocate new slice") case len(s2) != 1 || cap(s2) != 1: t.Fatalf("New slice should be %v not %v", make([]int, 0, 1), s2) case throwsPanic(func() { Allocate(m) }): t.Fatal("Unable to allocate new map") } }
- 163. func TestAllocate(t *testing.T){ var s2 []int s1 := []int{0, 1, 2} m := map[int] int{1: 1, 2: 2, 3: 3} switch { case throwsPanic(func() { s2 = Allocate(s1, 1).([]int) }): t.Fatal("Unable to allocate new slice") case len(s2) != 1 || cap(s2) != 1: t.Fatalf("New slice should be %v not %v", make([]int, 0, 1), s2) case throwsPanic(func() { Allocate(m) }): t.Fatal("Unable to allocate new map") } }
- 164. func TestAllocate(t *testing.T){ var s2 []int s1 := []int{0, 1, 2} m := map[int] int{1: 1, 2: 2, 3: 3} switch { case throwsPanic(func() { s2 = Allocate(s1, 1).([]int) }): t.Fatal("Unable to allocate new slice") case len(s2) != 1 || cap(s2) != 1: t.Fatalf("New slice should be %v not %v", make([]int, 0, 1), s2) case throwsPanic(func() { Allocate(m) }): t.Fatal("Unable to allocate new map") } }
- 165. func TestAllocate(t *testing.T){ var s2 []int s1 := []int{0, 1, 2} m := map[int] int{1: 1, 2: 2, 3: 3} switch { case throwsPanic(func() { s2 = Allocate(s1, 1).([]int) }): t.Fatal("Unable to allocate new slice") case len(s2) != 1 || cap(s2) != 1: t.Fatalf("New slice should be %v not %v", make([]int, 0, 1), s2) case throwsPanic(func() { Allocate(m) }): t.Fatal("Unable to allocate new map") } }
- 166. func TestAllocate(t *testing.T){ var s2 []int s1 := []int{0, 1, 2} m := map[int] int{1: 1, 2: 2, 3: 3} switch { case throwsPanic(func() { s2 = Allocate(s1, 1).([]int) }): t.Fatal("Unable to allocate new slice") case len(s2) != 1 || cap(s2) != 1: t.Fatalf("New slice should be %v not %v", make([]int, 0, 1), s2) case throwsPanic(func() { Allocate(m) }): t.Fatal("Unable to allocate new map") } }
- 167. func TestAllocate(t *testing.T){ var s2 []int s1 := []int{0, 1, 2} m := map[int] int{1: 1, 2: 2, 3: 3} switch { case throwsPanic(func() { s2 = Allocate(s1, 1).([]int) }): t.Fatal("Unable to allocate new slice") case len(s2) != 1 || cap(s2) != 1: t.Fatalf("New slice should be %v not %v", make([]int, 0, 1), s2) case throwsPanic(func() { Allocate(m) }): t.Fatal("Unable to allocate new map") } }
- 168. func TestAllocate(t *testing.T){ var s2 []int s1 := []int{0, 1, 2} m := map[int] int{1: 1, 2: 2, 3: 3} switch { case throwsPanic(func() { s2 = Allocate(s1, 1).([]int) }): t.Fatal("Unable to allocate new slice") case len(s2) != 1 || cap(s2) != 1: t.Fatalf("New slice should be %v not %v", make([]int, 0, 1), s2) case throwsPanic(func() { Allocate(m) }): t.Fatal("Unable to allocate new map") } }
- 169. func TestAllocate(t *testing.T){ var s2 []int s1 := []int{0, 1, 2} m := map[int] int{1: 1, 2: 2, 3: 3} switch { case throwsPanic(func() { s2 = Allocate(s1, 1).([]int) }): t.Fatal("Unable to allocate new slice") case len(s2) != 1 || cap(s2) != 1: t.Fatalf("New slice should be %v not %v", make([]int, 0, 1), s2) case throwsPanic(func() { Allocate(m) }): t.Fatal("Unable to allocate new map") } }
- 170. func Duplicate(i interface{})(clone interface{}) { if clone = Allocate(i); clone != nil { switch clone := ValueOf(clone); clone.Kind() { case Slice: Copy(clone, ValueOf(i)) case Map: m := ValueOf(i) for _, k := range m.Keys() { clone.SetMapIndex(k, m.MapIndex(k)) } } } return }
- 171. func Duplicate(i interface{})(clone interface{}) { if clone = Allocate(i); clone != nil { switch clone := ValueOf(clone); clone.Kind() { case Slice: Copy(clone, ValueOf(i)) case Map: m := ValueOf(i) for _, k := range m.Keys() { clone.SetMapIndex(k, m.MapIndex(k)) } } } return }
- 172. func Duplicate(i interface{})(clone interface{}) { if clone = Allocate(i); clone != nil { switch clone := ValueOf(clone); clone.Kind() { case Slice: Copy(clone, ValueOf(i)) case Map: m := ValueOf(i) for _, k := range m.Keys() { clone.SetMapIndex(k, m.MapIndex(k)) } } } return }
- 173. func Duplicate(i interface{})(clone interface{}) { if clone = Allocate(i); clone != nil { switch clone := ValueOf(clone); clone.Kind() { case Slice: Copy(clone, ValueOf(i)) case Map: m := ValueOf(i) for _, k := range m.Keys() { clone.SetMapIndex(k, m.MapIndex(k)) } } } return }
- 174. func Duplicate(i interface{})(clone interface{}) { if clone = Allocate(i); clone != nil { switch clone := ValueOf(clone); clone.Kind() { case Slice: Copy(clone, ValueOf(i)) case Map: m := ValueOf(i) for _, k := range m.Keys() { clone.SetMapIndex(k, m.MapIndex(k)) } } } return }
- 175. func Duplicate(i interface{})(clone interface{}) { if clone = Allocate(i); clone != nil { switch clone := ValueOf(clone); clone.Kind() { case Slice: Copy(clone, ValueOf(i)) case Map: m := ValueOf(i) for _, k := range m.Keys() { clone.SetMapIndex(k, m.MapIndex(k)) } } } return }
- 176. func Duplicate(i interface{})(clone interface{}) { if clone = Allocate(i); clone != nil { switch clone := ValueOf(clone); clone.Kind() { case Slice: Copy(clone, ValueOf(i)) case Map: m := ValueOf(i) for _, k := range m.Keys() { clone.SetMapIndex(k, m.MapIndex(k)) } } } return }
- 177. func Duplicate(i interface{})(clone interface{}) { if clone = Allocate(i); clone != nil { switch clone := ValueOf(clone); clone.Kind() { case Slice: Copy(clone, ValueOf(i)) case Map: m := ValueOf(i) for _, k := range m.Keys() { clone.SetMapIndex(k, m.MapIndex(k)) } } } return }
- 178. func Duplicate(i interface{})(clone interface{}) { if clone = Allocate(i); clone != nil { switch clone := ValueOf(clone); clone.Kind() { case Slice: Copy(clone, ValueOf(i)) case Map: m := ValueOf(i) for _, k := range m.Keys() { clone.SetMapIndex(k, m.MapIndex(k)) } } } return }
- 179. func Duplicate(i interface{})(clone interface{}) { if clone = Allocate(i); clone != nil { switch clone := ValueOf(clone); clone.Kind() { case Slice: Copy(clone, ValueOf(i)) case Map: m := ValueOf(i) for _, k := range m.Keys() { clone.SetMapIndex(k, m.MapIndex(k)) } } } return }
- 180. func Duplicate(i interface{})(clone interface{}) { if clone = Allocate(i); clone != nil { switch clone := ValueOf(clone); clone.Kind() { case Slice: Copy(clone, ValueOf(i)) case Map: m := ValueOf(i) for _, k := range m.Keys() { clone.SetMapIndex(k, m.MapIndex(k)) } } } return }
- 181. func Duplicate(i interface{})(clone interface{}) { if clone = Allocate(i); clone != nil { switch clone := ValueOf(clone); clone.Kind() { case Slice: Copy(clone, ValueOf(i)) case Map: m := ValueOf(i) for _, k := range m.Keys() { clone.SetMapIndex(k, m.MapIndex(k)) } } } return }
- 182. func Duplicate(i interface{})(clone interface{}) { if clone = Allocate(i); clone != nil { switch clone := ValueOf(clone); clone.Kind() { case Slice: Copy(clone, ValueOf(i)) case Map: m := ValueOf(i) for _, k := range m.Keys() { clone.SetMapIndex(k, m.MapIndex(k)) } } } return }
- 183. metallic k.o. sometimes abit-buffer is just a bit-buffer
- 184. package raw import ."reflect" import "unsafe" var _BYTE_SLICE Type = Typeof([]byte(nil)) type MemoryBlock interface { ByteSlice() []byte } func valueHeader(v Value) (header *SliceHeader) { if v.IsValid() { s := int(v.Type().Size()) header = &SliceHeader{ v.UnsafeAddr(), s, s } } return }
- 185. package raw import ."reflect" import "unsafe" var _BYTE_SLICE Type = Typeof([]byte(nil)) type MemoryBlock interface { ByteSlice() []byte } func valueHeader(v Value) (header *SliceHeader) { if v.IsValid() { s := int(v.Type().Size()) header = &SliceHeader{ v.UnsafeAddr(), s, s } } return }
- 186. package raw import ."reflect" import "unsafe" var _BYTE_SLICE Type = Typeof([]byte(nil)) type MemoryBlock interface { ByteSlice() []byte } func valueHeader(v Value) (header *SliceHeader) { if v.IsValid() { s := int(v.Type().Size()) header = &SliceHeader{ v.UnsafeAddr(), s, s } } return }
- 187. package raw import ."reflect" import "unsafe" var _BYTE_SLICE Type = Typeof([]byte(nil)) type MemoryBlock interface { ByteSlice() []byte } func valueHeader(v Value) (header *SliceHeader) { if v.IsValid() { s := int(v.Type().Size()) header = &SliceHeader{ v.UnsafeAddr(), s, s } } return }
- 188. package raw import ."reflect" import "unsafe" var _BYTE_SLICE Type = Typeof([]byte(nil)) type MemoryBlock interface { ByteSlice() []byte } func valueHeader(v Value) (header *SliceHeader) { if v.IsValid() { s := int(v.Type().Size()) header = &SliceHeader{ v.UnsafeAddr(), s, s } } return }
- 189. package raw import ."reflect" import "unsafe" var _BYTE_SLICE Type = Typeof([]byte(nil)) type MemoryBlock interface { ByteSlice() []byte } func valueHeader(v Value) (header *SliceHeader) { if v.IsValid() { s := int(v.Type().Size()) header = &SliceHeader{ v.UnsafeAddr(), s, s } } return }
- 190. package raw import ."reflect" import "unsafe" var _BYTE_SLICE Type = Typeof([]byte(nil)) type MemoryBlock interface { ByteSlice() []byte } func valueHeader(v Value) (header *SliceHeader) { if v.IsValid() { s := int(v.Type().Size()) header = &SliceHeader{ v.UnsafeAddr(), s, s } } return }
- 191. package raw import ."reflect" import "unsafe" var _BYTE_SLICE Type = Typeof([]byte(nil)) type MemoryBlock interface { ByteSlice() []byte } func valueHeader(v Value) (header *SliceHeader) { if v.IsValid() { s := int(v.Type().Size()) header = &SliceHeader{ v.UnsafeAddr(), s, s } } return }
- 192. package raw import ."reflect" import "unsafe" var _BYTE_SLICE Type = Typeof([]byte(nil)) type MemoryBlock interface { ByteSlice() []byte } func valueHeader(v Value) (header *SliceHeader) { if v.IsValid() { s := int(v.Type().Size()) header = &SliceHeader{ v.UnsafeAddr(), s, s } } return }
- 193. package raw import ."reflect" import "unsafe" var _BYTE_SLICE Type = Typeof([]byte(nil)) type MemoryBlock interface { ByteSlice() []byte } func valueHeader(v Value) (header *SliceHeader) { if v.IsValid() { s := int(v.Type().Size()) header = &SliceHeader{ v.UnsafeAddr(), s, s } } return }
- 194. package raw import ."reflect" import "unsafe" var _BYTE_SLICE Type = Typeof([]byte(nil)) type MemoryBlock interface { ByteSlice() []byte } func valueHeader(v Value) (header *SliceHeader) { if v.IsValid() { s := int(v.Type().Size()) header = &SliceHeader{ v.UnsafeAddr(), s, s } } return }
- 195. package raw import ."reflect" import "unsafe" var _BYTE_SLICE Type = Typeof([]byte(nil)) type MemoryBlock interface { ByteSlice() []byte } func valueHeader(v Value) (header *SliceHeader) { if v.IsValid() { s := int(v.Type().Size()) header = &SliceHeader{ v.UnsafeAddr(), s, s } } return }
- 196. package raw import ."reflect" import "unsafe" var _BYTE_SLICE Type = Typeof([]byte(nil)) type MemoryBlock interface { ByteSlice() []byte } func valueHeader(v Value) (header *SliceHeader) { if v.IsValid() { s := int(v.Type().Size()) header = &SliceHeader{ v.UnsafeAddr(), s, s } } return }
- 197. package raw import ."reflect" import "unsafe" var _BYTE_SLICE Type = Typeof([]byte(nil)) type MemoryBlock interface { ByteSlice() []byte } func valueHeader(v Value) (header *SliceHeader) { if v.IsValid() { s := int(v.Type().Size()) header = &SliceHeader{ v.UnsafeAddr(), s, s } } return }
- 198. package raw import ."reflect" import "unsafe" var _BYTE_SLICE Type = Typeof([]byte(nil)) type MemoryBlock interface { ByteSlice() []byte } func valueHeader(v Value) (header *SliceHeader) { if v.IsValid() { s := int(v.Type().Size()) header = &SliceHeader{ v.UnsafeAddr(), s, s } } return }
- 199. package raw import ."reflect" import "unsafe" var _BYTE_SLICE Type = Typeof([]byte(nil)) type MemoryBlock interface { ByteSlice() []byte } func valueHeader(v Value) (header *SliceHeader) { if v.IsValid() { s := int(v.Type().Size()) header = &SliceHeader{ v.UnsafeAddr(), s, s } } return }
- 200. package raw import ."reflect" import "unsafe" var _BYTE_SLICE Type = Typeof([]byte(nil)) type MemoryBlock interface { ByteSlice() []byte } func valueHeader(v Value) (header *SliceHeader) { if v.IsValid() { s := int(v.Type().Size()) header = &SliceHeader{ v.UnsafeAddr(), s, s } } return }
- 201. package raw import ."reflect" import "unsafe" var _BYTE_SLICE Type = Typeof([]byte(nil)) type MemoryBlock interface { ByteSlice() []byte } func valueHeader(v Value) (header *SliceHeader) { if v.IsValid() { s := int(v.Type().Size()) header = &SliceHeader{ v.UnsafeAddr(), s, s } } return }
- 202. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 203. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 204. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 205. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 206. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 207. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 208. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 209. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 210. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 211. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 212. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 213. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 214. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 215. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 216. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 217. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 218. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 219. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 220. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 221. func SliceHeader(i interface{})(Header *SliceHeader, Size, Align int) { switch value := Indirect(ValueOf(i)); value.Kind() { case Slice: Header = (*SliceHeader)(unsafe.Pointer(value.UnsafeAddr())) t := value.Type().Elem() Size = int(t.Size()) Align = t.Align() case Interface: Header, Size, Align = SliceHeader(value.Elem()) } return } func Scale(oldHeader *SliceHeader, oldESize, newESize int) (h *SliceHeader) { if oldHeader != nil { s := float64(oldESize) / float64(newESize) h = &SliceHeader{ Data: oldHeader.Data } h.Len = int(float64(oldHeader.Len) * s) h.Cap = int(float64(oldHeader.Cap) * s) } return }
- 222. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 223. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 224. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 225. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 226. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 227. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 228. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 229. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 230. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 231. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 232. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 233. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 234. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 235. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 236. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 237. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 238. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 239. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 240. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 241. func ByteSlice(i interface{})[]byte { switch i := i.(type) { case []byte: return i case MemoryBlock: return i.ByteSlice() } var header *SliceHeader switch v := ValueOf(i); value.Kind() { case Interface, Ptr: header = valueHeader(v.Elem()) case Slice: h, s, _ := SliceHeader(i) header = Scale(h, s, 1) case String: s := v.Get() h := *(*StringHeader)(unsafe.Pointer(&s)) header = &SliceHeader{ h.Data, h.Len, h.Len } default: header = valueHeader(v) } return unsafe.Unreflect(_BYTE_SLICE, unsafe.Pointer(header)).([]byte) }
- 242. go f(){}() /yourself / map/reduce for all the family
- 243. package main import "fmt" funcmain() { var c chan int c = make(chan int) limit := 16 go func() { for i := limit; i > 0; i-- { fmt.Print(<-c) produces: } 0110011101011010 }() for i := limit; i > 0; i-- { select { case c <- 0: case c <- 1: } } }
- 244. package main import "fmt" funcmain() { var c chan int c = make(chan int) limit := 16 go func() { for i := limit; i > 0; i-- { fmt.Print(<-c) produces: } 0110011101011010 }() for i := limit; i > 0; i-- { select { case c <- 0: case c <- 1: } } }
- 245. package main import "fmt" funcmain() { var c chan int c = make(chan int) limit := 16 go func() { for i := limit; i > 0; i-- { fmt.Print(<-c) produces: } 0110011101011010 }() for i := limit; i > 0; i-- { select { case c <- 0: case c <- 1: } } }
- 246. package main import "fmt" funcmain() { var c chan int c = make(chan int) limit := 16 go func() { for i := limit; i > 0; i-- { fmt.Print(<-c) produces: } 0110011101011010 }() for i := limit; i > 0; i-- { select { case c <- 0: case c <- 1: } } }
- 247. package main import "fmt" funcmain() { var c chan int c = make(chan int) limit := 16 go func() { for i := limit; i > 0; i-- { fmt.Print(<-c) produces: } 0110011101011010 }() for i := limit; i > 0; i-- { select { case c <- 0: case c <- 1: } } }
- 248. package main import "fmt" funcmain() { var c chan int c = make(chan int) limit := 16 go func() { for i := limit; i > 0; i-- { fmt.Print(<-c) produces: } 0110011101011010 }() for i := limit; i > 0; i-- { select { case c <- 0: case c <- 1: } } }
- 249. package main import "fmt" funcmain() { var c chan int c = make(chan int) limit := 16 go func() { for i := limit; i > 0; i-- { fmt.Print(<-c) produces: } 0110011101011010 }() for i := limit; i > 0; i-- { select { case c <- 0: case c <- 1: } } }
- 250. package main import "fmt" funcmain() { var c chan int c = make(chan int) limit := 16 go func(in chan int) { for i := limit; i > 0; i-- { fmt.Print(<-in) produces: } 0110011101011010 }(c) for i := limit; i > 0; i-- { select { case c <- 0: case c <- 1: } } }
- 251. package main import "fmt" funcmain() { var c chan int c = make(chan int) limit := 16 go func(in chan int) { for i := limit; i > 0; i-- { fmt.Print(<-in) produces: } 0110011101011010 }(c) for i := limit; i > 0; i-- { select { case c <- 0: case c <- 1: } } }
- 252. package main import "fmt" funcmain() { var c chan int c = make(chan int) limit := 16 go func(in chan int) { for i := limit; i > 0; i-- { fmt.Print(<-in) produces: } 0110011101011010 }(c) for i := limit; i > 0; i-- { select { case c <- 0: case c <- 1: } } }
- 253. package main import "fmt" funcmain() { var c chan int c = make(chan int) limit := 16 go func(in chan int) { for i := limit; i > 0; i-- { fmt.Print(<-in) produces: } 0110011101011010 }(c) for i := limit; i > 0; i-- { select { case c <- 0: case c <- 1: } } }
- 254. package main import "fmt" funcmain() { var c chan int c = make(chan int) limit := 16 go func(in chan int) { for i := limit; i > 0; i-- { fmt.Print(<-in) produces: } 0110011101011010 }(c) for i := limit; i > 0; i-- { select { case c <- 0: case c <- 1: } } }
- 255. package main import "fmt" funcmain() { var c chan int c = make(chan int) limit := 16 go func(in chan int) { for i := limit; i > 0; i-- { fmt.Print(<-in) produces: } 0110011101011010 }(c) for i := limit; i > 0; i-- { select { case c <- 0: case c <- 1: } } }
- 256. package main import "fmt" funcmain() { var c chan int c = make(chan int) limit := 16 go func(in chan int) { for i := limit; i > 0; i-- { fmt.Print(<-in) produces: } 0110011101011010 }(c) for i := limit; i > 0; i-- { select { case c <- 0: case c <- 1: } } }
- 257. package main import "fmt" funcmain() { var c chan int c = make(chan int) limit := 16 go func(in chan int) { for i := limit; i > 0; i-- { fmt.Print(<-in) produces: } 0110011101011010 }(c) for i := limit; i > 0; i-- { select { case c <- 0: case c <- 1: } } }
- 258. func main() { var c chan int c = make(chan int, 16) go func() { for i := 16; i > 0; i-- { fmt.Print(<-c) } }() go func() { select { produces: case c <- 0: 0110011101011010 case c <- 1: } }() for {} }
- 259. func main() { var c chan int c = make(chan int, 16) go func() { for i := 16; i > 0; i-- { fmt.Print(<-c) } }() go func() { select { produces: case c <- 0: 0110011101011010 case c <- 1: } }() for {} }
- 260. func main() { var c chan int c = make(chan int, 16) go func() { for i := 16; i > 0; i-- { fmt.Print(<-c) } }() go func() { select { produces: case c <- 0: 0110011101011010 case c <- 1: } }() for {} }
- 261. func main() { var c chan int c = make(chan int, 16) go func() { for i := 16; i > 0; i-- { fmt.Print(<-c) } }() go func() { select { produces: case c <- 0: 0110011101011010 case c <- 1: } }() for {} }
- 262. package generalise type SignalSourcefunc(status chan bool) func Wait(s SignalSource) { done := make(chan bool) defer close(done) go s(done) <-done } func WaitAll(count int, s SignalSource) { done := make(chan bool) defer close(done) go s(done) for i := 0; i < count; i++ { <- done } }
- 263. package generalise type SignalSourcefunc(status chan bool) func Wait(s SignalSource) { done := make(chan bool) defer close(done) go s(done) <-done } func WaitAll(count int, s SignalSource) { done := make(chan bool) defer close(done) go s(done) for i := 0; i < count; i++ { <- done } }
- 264. package generalise type SignalSourcefunc(status chan bool) func Wait(s SignalSource) { done := make(chan bool) defer close(done) go s(done) <-done } func WaitAll(count int, s SignalSource) { done := make(chan bool) defer close(done) go s(done) for i := 0; i < count; i++ { <- done } }
- 265. package generalise type SignalSourcefunc(status chan bool) func Wait(s SignalSource) { done := make(chan bool) defer close(done) go s(done) <-done } func WaitAll(count int, s SignalSource) { done := make(chan bool) defer close(done) go s(done) for i := 0; i < count; i++ { <- done } }
- 266. package generalise type SignalSourcefunc(status chan bool) func Wait(s SignalSource) { done := make(chan bool) defer close(done) go s(done) <-done } func WaitAll(count int, s SignalSource) { done := make(chan bool) defer close(done) go s(done) for i := 0; i < count; i++ { <- done } }
- 267. package generalise type SignalSourcefunc(status chan bool) func Wait(s SignalSource) { done := make(chan bool) defer close(done) go s(done) <-done } func WaitAll(count int, s SignalSource) { done := make(chan bool) defer close(done) go s(done) for i := 0; i < count; i++ { <- done } }
- 268. package generalise type SignalSourcefunc(status chan bool) func Wait(s SignalSource) { done := make(chan bool) defer close(done) go s(done) <-done } func WaitAll(count int, s SignalSource) { done := make(chan bool) defer close(done) go s(done) for i := 0; i < count; i++ { <- done } }
- 269. package generalise type SignalSourcefunc(status chan bool) func Wait(s SignalSource) { done := make(chan bool) defer close(done) go s(done) <-done } func WaitAll(count int, s SignalSource) { done := make(chan bool) defer close(done) go s(done) for i := 0; i < count; i++ { <- done } }
- 270. type Iteration func(k,x interface{}) bool func (i Iteration) apply(k, v interface{}, c chan bool) { go func() { c <-i(k, v) }() } func (f Iteration) Each(c interface{}) { switch c := ValueOf(c); c.Kind() { case Slice: WaitAll(c.Len(), SignalSource(func(done chan bool) { for i := 0; i < c.Len(); i++ { f.apply(i, c.Elem(i).Interface(), done) }})) case Map: WaitAll(c.Len(), SignalSource(func(done chan bool) { for _, k := range c.Keys() { f.apply(k, c.Elem(k).Interface(), done) }})) } }
- 271. type Iteration func(k,x interface{}) bool func (i Iteration) apply(k, v interface{}, c chan bool) { go func() { c <-i(k, v) }() } func (f Iteration) Each(c interface{}) { switch c := ValueOf(c); c.Kind() { case Slice: WaitAll(c.Len(), SignalSource(func(done chan bool) { for i := 0; i < c.Len(); i++ { f.apply(i, c.Elem(i).Interface(), done) }})) case Map: WaitAll(c.Len(), SignalSource(func(done chan bool) { for _, k := range c.Keys() { f.apply(k, c.Elem(k).Interface(), done) }})) } }
- 272. type Iteration func(k,x interface{}) bool func (i Iteration) apply(k, v interface{}, c chan bool) { go func() { c <-i(k, v) }() } func (f Iteration) Each(c interface{}) { switch c := ValueOf(c); c.Kind() { case Slice: WaitAll(c.Len(), SignalSource(func(done chan bool) { for i := 0; i < c.Len(); i++ { f.apply(i, c.Elem(i).Interface(), done) }})) case Map: WaitAll(c.Len(), SignalSource(func(done chan bool) { for _, k := range c.Keys() { f.apply(k, c.Elem(k).Interface(), done) }})) } }
- 273. type Iteration func(k,x interface{}) bool func (i Iteration) apply(k, v interface{}, c chan bool) { go func() { c <-i(k, v) }() } func (f Iteration) Each(c interface{}) { switch c := ValueOf(c); c.Kind() { case Slice: WaitAll(c.Len(), SignalSource(func(done chan bool) { for i := 0; i < c.Len(); i++ { f.apply(i, c.Elem(i).Interface(), done) }})) case Map: WaitAll(c.Len(), SignalSource(func(done chan bool) { for _, k := range c.Keys() { f.apply(k, c.Elem(k).Interface(), done) }})) } }
- 274. type Iteration func(k,x interface{}) bool func (i Iteration) apply(k, v interface{}, c chan bool) { go func() { c <-i(k, v) }() } func (f Iteration) Each(c interface{}) { switch c := ValueOf(c); c.Kind() { case Slice: WaitAll(c.Len(), SignalSource(func(done chan bool) { for i := 0; i < c.Len(); i++ { f.apply(i, c.Elem(i).Interface(), done) }})) case Map: WaitAll(c.Len(), SignalSource(func(done chan bool) { for _, k := range c.Keys() { f.apply(k, c.Elem(k).Interface(), done) }})) } }
- 275. type Iteration func(k,x interface{}) bool func (i Iteration) apply(k, v interface{}, c chan bool) { go func() { c <-i(k, v) }() } func (f Iteration) Each(c interface{}) { switch c := ValueOf(c); c.Kind() { case Slice: WaitAll(c.Len(), SignalSource(func(done chan bool) { for i := 0; i < c.Len(); i++ { f.apply(i, c.Elem(i).Interface(), done) }})) case Map: WaitAll(c.Len(), SignalSource(func(done chan bool) { for _, k := range c.Keys() { f.apply(k, c.Elem(k).Interface(), done) }})) } }
- 276. type Iteration func(k,x interface{}) bool func (i Iteration) apply(k, v interface{}, c chan bool) { go func() { c <-i(k, v) }() } func (f Iteration) Each(c interface{}) { switch c := ValueOf(c); c.Kind() { case Slice: WaitAll(c.Len(), SignalSource(func(done chan bool) { for i := 0; i < c.Len(); i++ { f.apply(i, c.Elem(i).Interface(), done) }})) case Map: WaitAll(c.Len(), SignalSource(func(done chan bool) { for _, k := range c.Keys() { f.apply(k, c.Elem(k).Interface(), done) }})) } }
- 277. type Iteration func(k,x interface{}) bool func (i Iteration) apply(k, v interface{}, c chan bool) { go func() { c <-i(k, v) }() } func (f Iteration) Each(c interface{}) { switch c := ValueOf(c); c.Kind() { case Slice: WaitAll(c.Len(), SignalSource(func(done chan bool) { for i := 0; i < c.Len(); i++ { f.apply(i, c.Elem(i).Interface(), done) }})) case Map: WaitAll(c.Len(), SignalSource(func(done chan bool) { for _, k := range c.Keys() { f.apply(k, c.Elem(k).Interface(), done) }})) } }
- 278. type Iteration func(k,x interface{}) bool func (i Iteration) apply(k, v interface{}, c chan bool) { go func() { c <-i(k, v) }() } func (f Iteration) Each(c interface{}) { switch c := ValueOf(c); c.Kind() { case Slice: WaitAll(c.Len(), SignalSource(func(done chan bool) { for i := 0; i < c.Len(); i++ { f.apply(i, c.Elem(i).Interface(), done) }})) case Map: WaitAll(c.Len(), SignalSource(func(done chan bool) { for _, k := range c.Keys() { f.apply(k, c.Elem(k).Interface(), done) }})) } }
- 279. type Results chaninterface{} type Combination func(x, y interface{}) interface{} func (f Combination) Reduce(c, s interface{}) (r Results) { r = make(Results) go func() { Iteration(func(k, x interface{}) bool { s = f(s, x) return true }).Each(c) r <- s }() return }
- 280. type Results chaninterface{} type Combination func(x, y interface{}) interface{} func (f Combination) Reduce(c, s interface{}) (r Results) { r = make(Results) go func() { Iteration(func(k, x interface{}) bool { s = f(s, x) return true }).Each(c) r <- s }() return }
- 281. type Results chaninterface{} type Combination func(x, y interface{}) interface{} func (f Combination) Reduce(c, s interface{}) (r Results) { r = make(Results) go func() { Iteration(func(k, x interface{}) bool { s = f(s, x) return true }).Each(c) r <- s }() return }
- 282. type Results chaninterface{} type Combination func(x, y interface{}) interface{} func (f Combination) Reduce(c, s interface{}) (r Results) { r = make(Results) go func() { Iteration(func(k, x interface{}) bool { s = f(s, x) return true }).Each(c) r <- s }() return }
- 283. type Results chaninterface{} type Combination func(x, y interface{}) interface{} func (f Combination) Reduce(c, s interface{}) (r Results) { r = make(Results) go func() { Iteration(func(k, x interface{}) bool { s = f(s, x) return true }).Each(c) r <- s }() return }
- 284. type Results chaninterface{} type Combination func(x, y interface{}) interface{} func (f Combination) Reduce(c, s interface{}) (r Results) { r = make(Results) go func() { Iteration(func(k, x interface{}) bool { s = f(s, x) return true }).Each(c) r <- s }() return }
- 285. type Results chaninterface{} type Combination func(x, y interface{}) interface{} func (f Combination) Reduce(c, s interface{}) (r Results) { r = make(Results) go func() { Iteration(func(k, x interface{}) bool { s = f(s, x) return true }).Each(c) r <- s }() return }
- 286. type Results chaninterface{} type Combination func(x, y interface{}) interface{} func (f Combination) Reduce(c, s interface{}) (r Results) { r = make(Results) go func() { Iteration(func(k, x interface{}) bool { s = f(s, x) return true }).Each(c) r <- s }() return }
- 287. type Results chaninterface{} type Combination func(x, y interface{}) interface{} func (f Combination) Reduce(c, s interface{}) (r Results) { r = make(Results) go func() { Iteration(func(k, x interface{}) bool { s = f(s, x) return true }).Each(c) r <- s }() return }
- 288. type Results chaninterface{} type Combination func(x, y interface{}) interface{} func (f Combination) Reduce(c, s interface{}) (r Results) { r = make(Results) go func() { Iteration(func(k, x interface{}) bool { s = f(s, x) return true }).Each(c) r <- s }() return }
- 289. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 290. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 291. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 292. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 293. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 294. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 295. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 296. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 297. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 298. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 299. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 300. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 301. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 302. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 303. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 304. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 305. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 306. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 307. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 308. type Transformation func(xinterface{}) interface{} func (t Transformation) Transform(x interface{}) Value { return ValueOf(t(x)) } func (t Transformation) Map(c interface{}) (r interface{}) { r = Allocate(c) if i := MapIterator(r); i != nil { i.Each(c) } return }
- 309. func MapIterator(c interface{})(i Iteration) { switch n := ValueOf(c); n.Kind() { case Slice: i = Iteration(func(k, x interface{}) bool { n.Elem(k.(int)).SetValue(t.GetValue(x)) return true }) case Map: i = Iteration(func(k, x interface{}) bool { n.SetMapIndex(ValueOf(k), t.GetValue(x)) return true }) } return }
- 310. func MapIterator(c interface{})(i Iteration) { switch n := ValueOf(c); n.Kind() { case Slice: i = Iteration(func(k, x interface{}) bool { n.Elem(k.(int)).SetValue(t.GetValue(x)) return true }) case Map: i = Iteration(func(k, x interface{}) bool { n.SetMapIndex(ValueOf(k), t.GetValue(x)) return true }) } return }
- 311. func MapIterator(c interface{})(i Iteration) { switch n := ValueOf(c); n.Kind() { case Slice: i = Iteration(func(k, x interface{}) bool { n.Elem(k.(int)).SetValue(t.GetValue(x)) return true }) case Map: i = Iteration(func(k, x interface{}) bool { n.SetMapIndex(ValueOf(k), t.GetValue(x)) return true }) } return }
- 312. func MapIterator(c interface{})(i Iteration) { switch n := ValueOf(c); n.Kind() { case Slice: i = Iteration(func(k, x interface{}) bool { n.Elem(k.(int)).SetValue(t.GetValue(x)) return true }) case Map: i = Iteration(func(k, x interface{}) bool { n.SetMapIndex(ValueOf(k), t.GetValue(x)) return true }) } return }
- 313. func MapIterator(c interface{})(i Iteration) { switch n := ValueOf(c); n.Kind() { case Slice: i = Iteration(func(k, x interface{}) bool { n.Elem(k.(int)).SetValue(t.GetValue(x)) return true }) case Map: i = Iteration(func(k, x interface{}) bool { n.SetMapIndex(ValueOf(k), t.GetValue(x)) return true }) } return }
- 314. func MapIterator(c interface{})(i Iteration) { switch n := ValueOf(c); n.Kind() { case Slice: i = Iteration(func(k, x interface{}) bool { n.Elem(k.(int)).SetValue(t.GetValue(x)) return true }) case Map: i = Iteration(func(k, x interface{}) bool { n.SetMapIndex(ValueOf(k), t.GetValue(x)) return true }) } return }
- 315. func MapIterator(c interface{})(i Iteration) { switch n := ValueOf(c); n.Kind() { case Slice: i = Iteration(func(k, x interface{}) bool { n.Elem(k.(int)).SetValue(t.GetValue(x)) return true }) case Map: i = Iteration(func(k, x interface{}) bool { n.SetMapIndex(ValueOf(k), t.GetValue(x)) return true }) } return }
- 316. func MapIterator(c interface{})(i Iteration) { switch n := ValueOf(c); n.Kind() { case Slice: i = Iteration(func(k, x interface{}) bool { n.Elem(k.(int)).SetValue(t.GetValue(x)) return true }) case Map: i = Iteration(func(k, x interface{}) bool { n.SetMapIndex(ValueOf(k), t.GetValue(x)) return true }) } return }
- 317. func MapIterator(c interface{})(i Iteration) { switch n := ValueOf(c); n.Kind() { case Slice: i = Iteration(func(k, x interface{}) bool { n.Elem(k.(int)).SetValue(t.GetValue(x)) return true }) case Map: i = Iteration(func(k, x interface{}) bool { n.SetMapIndex(ValueOf(k), t.GetValue(x)) return true }) } return }
- 318. func MapIterator(c interface{})(i Iteration) { switch n := ValueOf(c); n.Kind() { case Slice: i = Iteration(func(k, x interface{}) bool { n.Elem(k.(int)).SetValue(t.GetValue(x)) return true }) case Map: i = Iteration(func(k, x interface{}) bool { n.SetMapIndex(ValueOf(k), t.GetValue(x)) return true }) } return }
- 319. func MapIterator(c interface{})(i Iteration) { switch n := ValueOf(c); n.Kind() { case Slice: i = Iteration(func(k, x interface{}) bool { n.Elem(k.(int)).SetValue(t.GetValue(x)) return true }) case Map: i = Iteration(func(k, x interface{}) bool { n.SetMapIndex(ValueOf(k), t.GetValue(x)) return true }) } return }
- 320. func MapIterator(c interface{})(i Iteration) { switch n := ValueOf(c); n.Kind() { case Slice: i = Iteration(func(k, x interface{}) bool { n.Elem(k.(int)).SetValue(t.GetValue(x)) return true }) case Map: i = Iteration(func(k, x interface{}) bool { n.SetMapIndex(ValueOf(k), t.GetValue(x)) return true }) } return }
- 321. func MapIterator(c interface{})(i Iteration) { switch n := ValueOf(c); n.Kind() { case Slice: i = Iteration(func(k, x interface{}) bool { n.Elem(k.(int)).SetValue(t.GetValue(x)) return true }) case Map: i = Iteration(func(k, x interface{}) bool { n.SetMapIndex(ValueOf(k), t.GetValue(x)) return true }) } return }
- 322. func MapIterator(c interface{})(i Iteration) { switch n := ValueOf(c); n.Kind() { case Slice: i = Iteration(func(k, x interface{}) bool { n.Elem(k.(int)).SetValue(t.GetValue(x)) return true }) case Map: i = Iteration(func(k, x interface{}) bool { n.SetMapIndex(ValueOf(k), t.GetValue(x)) return true }) } return }
- 323. func MapIterator(c interface{})(i Iteration) { switch n := ValueOf(c); n.Kind() { case Slice: i = Iteration(func(k, x interface{}) bool { n.Elem(k.(int)).SetValue(t.GetValue(x)) return true }) case Map: i = Iteration(func(k, x interface{}) bool { n.SetMapIndex(ValueOf(k), t.GetValue(x)) return true }) } return }
- 324. func MapIterator(c interface{})(i Iteration) { switch n := ValueOf(c); n.Kind() { case Slice: i = Iteration(func(k, x interface{}) bool { n.Elem(k.(int)).SetValue(t.GetValue(x)) return true }) case Map: i = Iteration(func(k, x interface{}) bool { n.SetMapIndex(ValueOf(k), t.GetValue(x)) return true }) } return }
- 325. func MapIterator(c interface{})(i Iteration) { switch n := ValueOf(c); n.Kind() { case Slice: i = Iteration(func(k, x interface{}) bool { n.Elem(k.(int)).SetValue(t.GetValue(x)) return true }) case Map: i = Iteration(func(k, x interface{}) bool { n.SetMapIndex(ValueOf(k), t.GetValue(x)) return true }) } return }
- 326. func main() { s := []int{0, 1, 2, 3, 4, 5} d := Transformation(func(x interface{}) interface{} { return x.(int) * 2 }).Map(s) sum := Combination(func(x, y interface{}) interface{} { return x.(int) + y.(int) }) fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0)) fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0)) } produces: s = [0 1 2 3 4 5], sum = 15 d = [0 2 4 6 8 10], sum = 30
- 327. func main() { s := []int{0, 1, 2, 3, 4, 5} d := Transformation(func(x interface{}) interface{} { return x.(int) * 2 }).Map(s) sum := Combination(func(x, y interface{}) interface{} { return x.(int) + y.(int) }) fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0)) fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0)) } produces: s = [0 1 2 3 4 5], sum = 15 d = [0 2 4 6 8 10], sum = 30
- 328. func main() { s := []int{0, 1, 2, 3, 4, 5} d := Transformation(func(x interface{}) interface{} { return x.(int) * 2 }).Map(s) sum := Combination(func(x, y interface{}) interface{} { return x.(int) + y.(int) }) fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0)) fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0)) } produces: s = [0 1 2 3 4 5], sum = 15 d = [0 2 4 6 8 10], sum = 30
- 329. func main() { s := []int{0, 1, 2, 3, 4, 5} d := Transformation(func(x interface{}) interface{} { return x.(int) * 2 }).Map(s) sum := Combination(func(x, y interface{}) interface{} { return x.(int) + y.(int) }) fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0)) fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0)) } produces: s = [0 1 2 3 4 5], sum = 15 d = [0 2 4 6 8 10], sum = 30
- 330. func main() { s := []int{0, 1, 2, 3, 4, 5} d := Transformation(func(x interface{}) interface{} { return x.(int) * 2 }).Map(s) sum := Combination(func(x, y interface{}) interface{} { return x.(int) + y.(int) }) fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0)) fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0)) } produces: s = [0 1 2 3 4 5], sum = 15 d = [0 2 4 6 8 10], sum = 30
- 331. func main() { s := []int{0, 1, 2, 3, 4, 5} d := Transformation(func(x interface{}) interface{} { return x.(int) * 2 }).Map(s) sum := Combination(func(x, y interface{}) interface{} { return x.(int) + y.(int) }) fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0)) fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0)) } produces: s = [0 1 2 3 4 5], sum = 15 d = [0 2 4 6 8 10], sum = 30
- 332. func main() { s := []int{0, 1, 2, 3, 4, 5} d := Transformation(func(x interface{}) interface{} { return x.(int) * 2 }).Map(s) sum := Combination(func(x, y interface{}) interface{} { return x.(int) + y.(int) }) fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0)) fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0)) } produces: s = [0 1 2 3 4 5], sum = 15 d = [0 2 4 6 8 10], sum = 30
- 333. func main() { s := []int{0, 1, 2, 3, 4, 5} d := Transformation(func(x interface{}) interface{} { return x.(int) * 2 }).Map(s) sum := Combination(func(x, y interface{}) interface{} { return x.(int) + y.(int) }) fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0)) fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0)) } produces: s = [0 1 2 3 4 5], sum = 15 d = [0 2 4 6 8 10], sum = 30
- 334. func main() { s := []int{0, 1, 2, 3, 4, 5} d := Transformation(func(x interface{}) interface{} { return x.(int) * 2 }).Map(s) sum := Combination(func(x, y interface{}) interface{} { return x.(int) + y.(int) }) fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0)) fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0)) } produces: s = [0 1 2 3 4 5], sum = 15 d = [0 2 4 6 8 10], sum = 30
- 335. func main() { s := []int{0, 1, 2, 3, 4, 5} d := Transformation(func(x interface{}) interface{} { return x.(int) * 2 }).Map(s) sum := Combination(func(x, y interface{}) interface{} { return x.(int) + y.(int) }) fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0)) fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0)) } produces: s = [0 1 2 3 4 5], sum = 15 d = [0 2 4 6 8 10], sum = 30
- 336. func main() { s := []int{0, 1, 2, 3, 4, 5} d := Transformation(func(x interface{}) interface{} { return x.(int) * 2 }).Map(s) sum := Combination(func(x, y interface{}) interface{} { return x.(int) + y.(int) }) fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0)) fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0)) } produces: s = [0 1 2 3 4 5], sum = 15 d = [0 2 4 6 8 10], sum = 30
- 337. func main() { s := []int{0, 1, 2, 3, 4, 5} d := Transformation(func(x interface{}) interface{} { return x.(int) * 2 }).Map(s) sum := Combination(func(x, y interface{}) interface{} { return x.(int) + y.(int) }) fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0)) fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0)) } produces: s = [0 1 2 3 4 5], sum = 15 d = [0 2 4 6 8 10], sum = 30
- 338. func main() { s := []int{0, 1, 2, 3, 4, 5} d := Transformation(func(x interface{}) interface{} { return x.(int) * 2 }).Map(s) sum := Combination(func(x, y interface{}) interface{} { return x.(int) + y.(int) }) fmt.Printf("s = %v, sum = %vn", s, <- sum.Reduce(s, 0)) fmt.Printf("d = %v, sum = %vn", d, <- sum.Reduce(d, 0)) } produces: s = [0 1 2 3 4 5], sum = 15 d = [0 2 4 6 8 10], sum = 30
- 339. ruby can dothat! channels with atomic queues and thread variables
- 340. require 'socket' require 'thread' classThreadGroup def all_but_me &block list. delete_if { |t| t.name == Thread.current.name }.each { |t| yield t } end def select *names, &block list.delete_if { |t| !names.include? t.name }.each { |t| yield t } end end
- 341. class Thread def initialize self[:Q] = Queue.new end def send *messages messages.each { |m| self[:Q].enq m } end def bind_transmitter socket key? :XMIT ? raise ArgumentError : self[:XMIT] = Thread.new() { loop do (m = self[:Q].deq) == :EXIT ? Thread.current.exit : socket.puts m Thread.pass end socket.close exit } end def disconnect send "Goodbye #{name}", :EXIT end end
- 342. class ChatServer <TCPServer def initialize port @receivers = ThreadGroup.new @transmitters = ThreadGroup.new @deceased = ThreadGroup.new super end def register name, socket @receivers.add(t = Thread.current) t.name = name @transmitters.add t.bind_transmitter(socket) broadcast "#{name} has joined the conversation" t.send "Welcome #{name}" end def connect socket loop do begin socket.print "Please enter your name: " register socket.readline.chomp).downcase, socket break rescue ArgumentError socket.puts "That name is already in use" end end end
- 343. def send message,name = Thread.current.name @receivers.select(name) { |t| t.send message } end def broadcast message @receivers.all_but_me { |t| t.send message } end def listen socket t = Thread.current loop do message = socket.readline.chomp case message.downcase when "bye": raise EOFError when "known": list_known_users when "quit": raise SystemExit else broadcast "#{t.name}: #{message}" end end end
- 344. def run while socket = accept Thread.new(socket) do |socket| begin connect socket listen socket rescue SystemExit broadcast "#{Thread.current.name} terminated this conversation" broadcast :EXIT send :EXIT @receivers.all_but_me { |t| t.transmitter.join } Kernel.exit 0 rescue EOFError disconnect end end end end end ChatServer.new(3939).run
- 345. great artists steal theThompson-Pike approach to legacy C assimilation
- 346. include $(GOROOT)/src/Make.inc TARG=sqlite3 CGOFILES= sqlite3.go database.go ifeq ($(GOOS),darwin) CGO_LDFLAGS=/usr/lib/libsqlite3.0.dylib else CGO_LDFLAGS=-lsqlite3 endif include $(GOROOT)/src/Make.pkg
- 347. include $(GOROOT)/src/Make.inc TARG=sqlite3 CGOFILES= sqlite3.go database.go ifeq ($(GOOS),darwin) CGO_LDFLAGS=/usr/lib/libsqlite3.0.dylib else CGO_LDFLAGS=-lsqlite3 endif include $(GOROOT)/src/Make.pkg
- 348. include $(GOROOT)/src/Make.inc TARG=sqlite3 CGOFILES= sqlite3.go database.go ifeq ($(GOOS),darwin) CGO_LDFLAGS=/usr/lib/libsqlite3.0.dylib else CGO_LDFLAGS=-lsqlite3 endif include $(GOROOT)/src/Make.pkg
- 349. include $(GOROOT)/src/Make.inc TARG=sqlite3 CGOFILES= sqlite3.go database.go ifeq ($(GOOS),darwin) CGO_LDFLAGS=/usr/lib/libsqlite3.0.dylib else CGO_LDFLAGS=-lsqlite3 endif include $(GOROOT)/src/Make.pkg
- 350. include $(GOROOT)/src/Make.inc TARG=sqlite3 CGOFILES= sqlite3.go database.go ifeq ($(GOOS),darwin) CGO_LDFLAGS=/usr/lib/libsqlite3.0.dylib else CGO_LDFLAGS=-lsqlite3 endif include $(GOROOT)/src/Make.pkg
- 351. package sqlite3 // #include<sqlite3.h> import "C" import "fmt" import "os" type Database struct { handle *C.sqlite3 Filename string Flags C.int } func (db *Database) Error() os.Error { return Errno(C.sqlite3_errcode(db.handle)) }
- 352. package sqlite3 // #include<sqlite3.h> import "C" import "fmt" import "os" type Database struct { handle *C.sqlite3 Filename string Flags C.int } func (db *Database) Error() os.Error { return Errno(C.sqlite3_errcode(db.handle)) }
- 353. package sqlite3 // #include<sqlite3.h> import "C" import "fmt" import "os" type Database struct { handle *C.sqlite3 Filename string Flags C.int } func (db *Database) Error() os.Error { return Errno(C.sqlite3_errcode(db.handle)) }
- 354. package sqlite3 // #include<sqlite3.h> import "C" import "fmt" import "os" type Database struct { handle *C.sqlite3 Filename string Flags C.int } func (db *Database) Error() os.Error { return Errno(C.sqlite3_errcode(db.handle)) }
- 355. package sqlite3 // #include<sqlite3.h> import "C" import "fmt" import "os" type Database struct { handle *C.sqlite3 Filename string Flags C.int } func (db *Database) Error() os.Error { return Errno(C.sqlite3_errcode(db.handle)) }
- 356. package sqlite3 // #include<sqlite3.h> import "C" import "fmt" import "os" type Database struct { handle *C.sqlite3 Filename string Flags C.int } func (db *Database) Error() os.Error { return Errno(C.sqlite3_errcode(db.handle)) }
- 357. package sqlite3 // #include<sqlite3.h> import "C" import "fmt" import "os" type Database struct { handle *C.sqlite3 Filename string Flags C.int } func (db *Database) Error() os.Error { return Errno(C.sqlite3_errcode(db.handle)) }
- 358. const( OK = Errno(iota) ERROR CANTOPEN = Errno(14) ) var errText = map[Errno]string { ERROR: "SQL error or missing database", CANTOPEN: "Unable to open the database file", } type Errno int func (e Errno) String() (err string) { if err = errText[e]; err == "" { err = fmt.Sprintf("errno %v", int(e)) } return }
- 359. const( OK = Errno(iota) ERROR CANTOPEN = Errno(14) ) var errText = map[Errno]string { ERROR: "SQL error or missing database", CANTOPEN: "Unable to open the database file", } type Errno int func (e Errno) String() (err string) { if err = errText[e]; err == "" { err = fmt.Sprintf("errno %v", int(e)) } return }
- 360. const( OK = Errno(iota) ERROR CANTOPEN = Errno(14) ) var errText = map[Errno]string { ERROR: "SQL error or missing database", CANTOPEN: "Unable to open the database file", } type Errno int func (e Errno) String() (err string) { if err = errText[e]; err == "" { err = fmt.Sprintf("errno %v", int(e)) } return }
- 361. const( OK = Errno(iota) ERROR CANTOPEN = Errno(14) ) var errText = map[Errno]string { ERROR: "SQL error or missing database", CANTOPEN: "Unable to open the database file", } type Errno int func (e Errno) String() (err string) { if err = errText[e]; err == "" { err = fmt.Sprintf("errno %v", int(e)) } return }
- 362. const( OK = Errno(iota) ERROR CANTOPEN = Errno(14) ) var errText = map[Errno]string { ERROR: "SQL error or missing database", CANTOPEN: "Unable to open the database file", } type Errno int func (e Errno) String() (err string) { if err = errText[e]; err == "" { err = fmt.Sprintf("errno %v", int(e)) } return }
- 363. const( OK = Errno(iota) ERROR CANTOPEN = Errno(14) ) var errText = map[Errno]string { ERROR: "SQL error or missing database", CANTOPEN: "Unable to open the database file", } type Errno int func (e Errno) String() (err string) { if err = errText[e]; err == "" { err = fmt.Sprintf("errno %v", int(e)) } return }
- 364. const( OK = Errno(iota) ERROR CANTOPEN = Errno(14) ) var errText = map[Errno]string { ERROR: "SQL error or missing database", CANTOPEN: "Unable to open the database file", } type Errno int func (e Errno) String() (err string) { if err = errText[e]; err == "" { err = fmt.Sprintf("errno %v", int(e)) } return }
- 365. const( OK = Errno(iota) ERROR CANTOPEN = Errno(14) ) var errText = map[Errno]string { ERROR: "SQL error or missing database", CANTOPEN: "Unable to open the database file", } type Errno int func (e Errno) String() (err string) { if err = errText[e]; err == "" { err = fmt.Sprintf("errno %v", int(e)) } return }
- 366. const( OK = Errno(iota) ERROR CANTOPEN = Errno(14) ) var errText = map[Errno]string { ERROR: "SQL error or missing database", CANTOPEN: "Unable to open the database file", } type Errno int func (e Errno) String() (err string) { if err = errText[e]; err == "" { err = fmt.Sprintf("errno %v", int(e)) } return }
- 367. const( OK = Errno(iota) ERROR CANTOPEN = Errno(14) ) var errText = map[Errno]string { ERROR: "SQL error or missing database", CANTOPEN: "Unable to open the database file", } type Errno int func (e Errno) String() (err string) { if err = errText[e]; err == "" { err = fmt.Sprintf("errno %v", int(e)) } return }
- 368. func (db *Database)Open(flags... int) (e os.Error) { db.Flags = 0 for _, v := range flags { db.Flags = db.Flags | C.int(v) } f := C.CString(db.Filename) if err := Errno(C.sqlite3_open_v2(f, &db.handle, db.Flags, nil)); err != OK { e = err } else if db.handle == nil { e = CANTOPEN } return } func (db *Database) Close() { C.sqlite3_close(db.handle) db.handle = nil }
- 369. func (db *Database)Open(flags... int) (e os.Error) { db.Flags = 0 for _, v := range flags { db.Flags = db.Flags | C.int(v) } f := C.CString(db.Filename) if err := Errno(C.sqlite3_open_v2(f, &db.handle, db.Flags, nil)); err != OK { e = err } else if db.handle == nil { e = CANTOPEN } return } func (db *Database) Close() { C.sqlite3_close(db.handle) db.handle = nil }
- 370. func (db *Database)Open(flags... int) (e os.Error) { db.Flags = 0 for _, v := range flags { db.Flags = db.Flags | C.int(v) } f := C.CString(db.Filename) if err := Errno(C.sqlite3_open_v2(f, &db.handle, db.Flags, nil)); err != OK { e = err } else if db.handle == nil { e = CANTOPEN } return } func (db *Database) Close() { C.sqlite3_close(db.handle) db.handle = nil }
- 371. func (db *Database)Open(flags... int) (e os.Error) { db.Flags = 0 for _, v := range flags { db.Flags = db.Flags | C.int(v) } f := C.CString(db.Filename) if err := Errno(C.sqlite3_open_v2(f, &db.handle, db.Flags, nil)); err != OK { e = err } else if db.handle == nil { e = CANTOPEN } return } func (db *Database) Close() { C.sqlite3_close(db.handle) db.handle = nil }
- 372. func (db *Database)Open(flags... int) (e os.Error) { db.Flags = 0 for _, v := range flags { db.Flags = db.Flags | C.int(v) } f := C.CString(db.Filename) if err := Errno(C.sqlite3_open_v2(f, &db.handle, db.Flags, nil)); err != OK { e = err } else if db.handle == nil { e = CANTOPEN } return } func (db *Database) Close() { C.sqlite3_close(db.handle) db.handle = nil }
- 373. func (db *Database)Open(flags... int) (e os.Error) { db.Flags = 0 for _, v := range flags { db.Flags = db.Flags | C.int(v) } f := C.CString(db.Filename) if err := Errno(C.sqlite3_open_v2(f, &db.handle, db.Flags, nil)); err != OK { e = err } else if db.handle == nil { e = CANTOPEN } return } func (db *Database) Close() { C.sqlite3_close(db.handle) db.handle = nil }
- 374. func (db *Database)Open(flags... int) (e os.Error) { db.Flags = 0 for _, v := range flags { db.Flags = db.Flags | C.int(v) } f := C.CString(db.Filename) if err := Errno(C.sqlite3_open_v2(f, &db.handle, db.Flags, nil)); err != OK { e = err } else if db.handle == nil { e = CANTOPEN } return } func (db *Database) Close() { C.sqlite3_close(db.handle) db.handle = nil }
- 375. func (db *Database)Open(flags... int) (e os.Error) { db.Flags = 0 for _, v := range flags { db.Flags = db.Flags | C.int(v) } f := C.CString(db.Filename) if err := Errno(C.sqlite3_open_v2(f, &db.handle, db.Flags, nil)); err != OK { e = err } else if db.handle == nil { e = CANTOPEN } return } func (db *Database) Close() { C.sqlite3_close(db.handle) db.handle = nil }
- 376. func (db *Database)Open(flags... int) (e os.Error) { db.Flags = 0 for _, v := range flags { db.Flags = db.Flags | C.int(v) } f := C.CString(db.Filename) if err := Errno(C.sqlite3_open_v2(f, &db.handle, db.Flags, nil)); err != OK { e = err } else if db.handle == nil { e = CANTOPEN } return } func (db *Database) Close() { C.sqlite3_close(db.handle) db.handle = nil }
- 377. func (db *Database)Open(flags... int) (e os.Error) { db.Flags = 0 for _, v := range flags { db.Flags = db.Flags | C.int(v) } f := C.CString(db.Filename) if err := Errno(C.sqlite3_open_v2(f, &db.handle, db.Flags, nil)); err != OK { e = err } else if db.handle == nil { e = CANTOPEN } return } func (db *Database) Close() { C.sqlite3_close(db.handle) db.handle = nil }
- 378. func (db *Database)Open(flags... int) (e os.Error) { db.Flags = 0 for _, v := range flags { db.Flags = db.Flags | C.int(v) } f := C.CString(db.Filename) if err := Errno(C.sqlite3_open_v2(f, &db.handle, db.Flags, nil)); err != OK { e = err } else if db.handle == nil { e = CANTOPEN } return } func (db *Database) Close() { C.sqlite3_close(db.handle) db.handle = nil }
- 379. func (db *Database)Open(flags... int) (e os.Error) { db.Flags = 0 for _, v := range flags { db.Flags = db.Flags | C.int(v) } f := C.CString(db.Filename) if err := Errno(C.sqlite3_open_v2(f, &db.handle, db.Flags, nil)); err != OK { e = err } else if db.handle == nil { e = CANTOPEN } return } func (db *Database) Close() { C.sqlite3_close(db.handle) db.handle = nil }
- 380. func (db *Database)Open(flags... int) (e os.Error) { db.Flags = 0 for _, v := range flags { db.Flags = db.Flags | C.int(v) } f := C.CString(db.Filename) if err := Errno(C.sqlite3_open_v2(f, &db.handle, db.Flags, nil)); err != OK { e = err } else if db.handle == nil { e = CANTOPEN } return } func (db *Database) Close() { C.sqlite3_close(db.handle) db.handle = nil }
- 381. func Open(filename string,flags... int) (db *Database, e os.Error) { defer func() { if x := recover(); x != nil { db.Close() db = nil e = ERROR } }() db = &Database{ Filename: filename } if len(flags) == 0 { e = db.Open( C.SQLITE_OPEN_FULLMUTEX, C.SQLITE_OPEN_READWRITE, C.SQLITE_OPEN_CREATE ) } else { e = db.Open(flags...) } return }
- 382. func Open(filename string,flags... int) (db *Database, e os.Error) { defer func() { if x := recover(); x != nil { db.Close() db = nil e = ERROR } }() db = &Database{ Filename: filename } if len(flags) == 0 { e = db.Open( C.SQLITE_OPEN_FULLMUTEX, C.SQLITE_OPEN_READWRITE, C.SQLITE_OPEN_CREATE ) } else { e = db.Open(flags...) } return }
- 383. func Open(filename string,flags... int) (db *Database, e os.Error) { defer func() { if x := recover(); x != nil { db.Close() db = nil e = ERROR } }() db = &Database{ Filename: filename } if len(flags) == 0 { e = db.Open( C.SQLITE_OPEN_FULLMUTEX, C.SQLITE_OPEN_READWRITE, C.SQLITE_OPEN_CREATE ) } else { e = db.Open(flags...) } return }
- 384. func Open(filename string,flags... int) (db *Database, e os.Error) { defer func() { if x := recover(); x != nil { db.Close() db = nil e = ERROR } }() db = &Database{ Filename: filename } if len(flags) == 0 { e = db.Open( C.SQLITE_OPEN_FULLMUTEX, C.SQLITE_OPEN_READWRITE, C.SQLITE_OPEN_CREATE ) } else { e = db.Open(flags...) } return }
- 385. func Open(filename string,flags... int) (db *Database, e os.Error) { defer func() { if x := recover(); x != nil { db.Close() db = nil e = ERROR } }() db = &Database{ Filename: filename } if len(flags) == 0 { e = db.Open( C.SQLITE_OPEN_FULLMUTEX, C.SQLITE_OPEN_READWRITE, C.SQLITE_OPEN_CREATE ) } else { e = db.Open(flags...) } return }
- 386. func Open(filename string,flags... int) (db *Database, e os.Error) { defer func() { if x := recover(); x != nil { db.Close() db = nil e = ERROR } }() db = &Database{ Filename: filename } if len(flags) == 0 { e = db.Open( C.SQLITE_OPEN_FULLMUTEX, C.SQLITE_OPEN_READWRITE, C.SQLITE_OPEN_CREATE ) } else { e = db.Open(flags...) } return }
- 387. func Open(filename string,flags... int) (db *Database, e os.Error) { defer func() { if x := recover(); x != nil { db.Close() db = nil e = ERROR } }() db = &Database{ Filename: filename } if len(flags) == 0 { e = db.Open( C.SQLITE_OPEN_FULLMUTEX, C.SQLITE_OPEN_READWRITE, C.SQLITE_OPEN_CREATE ) } else { e = db.Open(flags...) } return }
- 388. func Open(filename string,flags... int) (db *Database, e os.Error) { defer func() { if x := recover(); x != nil { db.Close() db = nil e = ERROR } }() db = &Database{ Filename: filename } if len(flags) == 0 { e = db.Open( C.SQLITE_OPEN_FULLMUTEX, C.SQLITE_OPEN_READWRITE, C.SQLITE_OPEN_CREATE ) } else { e = db.Open(flags...) } return }
- 389. package main // #include"ruby.h" import "C" import "fmt" import "os" type VALUE struct { cptr *C.VALUE } func main() { var stack_frame VALUE defer func() { C.ruby_cleanup(0) }() C.ruby_sysinit(len(os.Args), &os.Args[0]) C.ruby_init_stack(stack_frame.cptr) C.ruby_init() C.ruby_init_loadpath() run_ruby() }
- 390. package main // #include"ruby.h" import "C" import "fmt" import "os" type VALUE struct { cptr *C.VALUE } func main() { var stack_frame VALUE defer func() { C.ruby_cleanup(0) }() C.ruby_sysinit(len(os.Args), &os.Args[0]) C.ruby_init_stack(stack_frame.cptr) C.ruby_init() C.ruby_init_loadpath() run_ruby() }
- 391. package main // #include"ruby.h" import "C" import "fmt" import "os" type VALUE struct { cptr *C.VALUE } func main() { var stack_frame VALUE defer func() { C.ruby_cleanup(0) }() C.ruby_sysinit(len(os.Args), &os.Args[0]) C.ruby_init_stack(stack_frame.cptr) C.ruby_init() C.ruby_init_loadpath() run_ruby() }
- 392. package main // #include"ruby.h" import "C" import "fmt" import "os" type VALUE struct { cptr *C.VALUE } func main() { var stack_frame VALUE defer func() { C.ruby_cleanup(0) }() C.ruby_sysinit(len(os.Args), &os.Args[0]) C.ruby_init_stack(stack_frame.cptr) C.ruby_init() C.ruby_init_loadpath() run_ruby() }
- 393. package main // #include"ruby.h" import "C" import "fmt" import "os" type VALUE struct { cptr *C.VALUE } func main() { var stack_frame VALUE defer func() { C.ruby_cleanup(0) }() C.ruby_sysinit(len(os.Args), &os.Args[0]) C.ruby_init_stack(stack_frame.cptr) C.ruby_init() C.ruby_init_loadpath() run_ruby() }
- 394. package main // #include"ruby.h" import "C" import "fmt" import "os" type VALUE struct { cptr *C.VALUE } func main() { var stack_frame VALUE defer func() { C.ruby_cleanup(0) }() C.ruby_sysinit(len(os.Args), &os.Args[0]) C.ruby_init_stack(stack_frame.cptr) C.ruby_init() C.ruby_init_loadpath() run_ruby() }
- 395. package main // #include"ruby.h" import "C" import "fmt" import "os" type VALUE struct { cptr *C.VALUE } func main() { var stack_frame VALUE defer func() { C.ruby_cleanup(0) }() C.ruby_sysinit(len(os.Args), &os.Args[0]) C.ruby_init_stack(stack_frame.cptr) C.ruby_init() C.ruby_init_loadpath() run_ruby() }
- 396. package main // #include"ruby.h" import "C" import "fmt" import "os" type VALUE struct { cptr *C.VALUE } func main() { var stack_frame VALUE defer func() { C.ruby_cleanup(0) }() C.ruby_sysinit(len(os.Args), &os.Args[0]) C.ruby_init_stack(stack_frame.cptr) C.ruby_init() C.ruby_init_loadpath() run_ruby() }
- 397. func run_ruby() { C.rb_require("sum.rb") C.rb_eval_string("$summer = Summer.new") C.rb_eval_string("$result = $summer.sum(10)") result := C.rb_gv_get("result") fmt.Printf("Result = %vn", C.NUM2INT(result)) }
- 398.
- 399. homework embedded your favouriteruby in go
- 400. homework embedded your favouriteruby in go you’ll need a dynamic shared library
- 401. homework embedded your favouriteruby in go you’ll need a dynamic shared library the Ruby header files
- 402. homework embedded your favouriteruby in go you’ll need a dynamic shared library and the Ruby header files the non-gcc go toolchain
- 403. homework embedded your favouriteruby in go you’ll need a dynamic shared library and the Ruby header files the non-gcc go toolchain and some code that looks a bit like this...
- 404.
- 405.
- 406.
- 407.
- 408.
Editor's Notes
- #2 \n
- #3 \n
- #4 \n
- #5 \n
- #6 \n
- #7 \n
- #8 \n
- #9 \n
- #10 \n
- #11 \n
- #12 \n
- #13 \n
- #14 \n
- #15 \n
- #16 \n
- #17 \n
- #18 \n
- #19 \n
- #20 \n
- #21 \n
- #22 \n
- #23 \n
- #24 \n
- #25 \n
- #26 \n
- #27 \n
- #28 \n
- #29 \n
- #30 \n
- #31 \n
- #32 \n
- #33 \n
- #34 \n
- #35 \n
- #36 \n
- #37 \n
- #38 \n
- #39 \n
- #40 \n
- #41 \n
- #42 \n
- #43 \n
- #44 \n
- #45 \n
- #46 \n
- #47 \n
- #48 \n
- #49 \n
- #50 \n
- #51 \n
- #52 \n
- #53 \n
- #54 \n
- #55 \n
- #56 \n
- #57 \n
- #58 \n
- #59 \n
- #60 \n
- #61 \n
- #62 \n
- #63 \n
- #64 \n
- #65 \n
- #66 \n
- #67 \n
- #68 \n
- #69 \n
- #70 \n
- #71 \n
- #72 \n
- #73 \n
- #74 \n
- #75 \n
- #76 \n
- #77 \n
- #78 \n
- #79 \n
- #80 \n
- #81 \n
- #82 \n
- #83 \n
- #84 \n
- #85 \n
- #86 \n
- #87 \n
- #88 \n
- #89 \n
- #90 \n
- #91 \n
- #92 \n
- #93 \n
- #94 \n
- #95 \n
- #96 \n
- #97 \n
- #98 \n
- #99 \n
- #100 \n
- #101 \n
- #102 \n
- #103 \n
- #104 \n
- #105 \n
- #106 \n
- #107 \n
- #108 \n
- #109 \n
- #110 \n
- #111 \n
- #112 \n
- #113 \n
- #114 \n
- #115 \n
- #116 \n
- #117 \n
- #118 \n
- #119 \n
- #120 \n
- #121 \n
- #122 \n
- #123 \n
- #124 \n
- #125 \n
- #126 \n
- #127 \n
- #128 \n
- #129 \n
- #130 \n
- #131 \n
- #132 \n
- #133 \n
- #134 \n
- #135 \n
- #136 \n
- #137 \n
- #138 \n
- #139 \n
- #140 \n
- #141 \n
- #142 \n
- #143 \n
- #144 \n
- #145 \n
- #146 \n
- #147 \n
- #148 \n
- #149 \n
- #150 \n
- #151 \n
- #152 \n
- #153 \n
- #154 \n
- #155 \n
- #156 \n
- #157 \n
- #158 \n
- #159 \n
- #160 \n
- #161 \n
- #162 \n
- #163 \n
- #164 \n
- #165 \n
- #166 \n
- #167 \n
- #168 \n
- #169 \n
- #170 \n
- #171 \n
- #172 \n
- #173 \n
- #174 \n
- #175 \n
- #176 \n
- #177 \n
- #178 \n
- #179 \n
- #180 \n
- #181 \n
- #182 \n
- #183 \n
- #184 \n
- #185 \n
- #186 \n
- #187 \n
- #188 \n
- #189 \n
- #190 \n
- #191 \n
- #192 \n
- #193 \n
- #194 \n
- #195 \n
- #196 \n
- #197 \n
- #198 \n
- #199 \n
- #200 \n
- #201 \n
- #202 \n
- #203 \n
- #204 \n
- #205 \n
- #206 \n
- #207 \n
- #208 \n
- #209 \n
- #210 \n
- #211 \n
- #212 \n
- #213 \n
- #214 \n
- #215 \n
- #216 \n
- #217 \n
- #218 \n
- #219 \n
- #220 \n
- #221 \n
- #222 \n
- #223 \n
- #224 \n
- #225 \n
- #226 \n
- #227 \n
- #228 \n
- #229 \n
- #230 \n
- #231 \n
- #232 \n
- #233 \n
- #234 \n
- #235 \n
- #236 \n
- #237 \n
- #238 \n
- #239 \n
- #240 \n
- #241 \n
- #242 \n
- #243 \n
- #244 \n
- #245 \n
- #246 \n
- #247 \n
- #248 \n
- #249 \n
- #250 \n
- #251 \n
- #252 \n
- #253 \n
- #254 \n
- #255 \n
- #256 \n
- #257 \n
- #258 \n
- #259 \n
- #260 \n
- #261 \n
- #262 \n
- #263 \n
- #264 \n
- #265 \n
- #266 \n
- #267 \n
- #268 \n
- #269 \n
- #270 \n
- #271 \n
- #272 \n
- #273 \n
- #274 \n
- #275 \n
- #276 \n
- #277 \n
- #278 \n
- #279 \n
- #280 \n
- #281 \n
- #282 \n
- #283 \n
- #284 \n
- #285 \n
- #286 \n
- #287 \n
- #288 \n
- #289 \n
- #290 \n
- #291 \n
- #292 \n
- #293 \n
- #294 \n
- #295 \n
- #296 \n
- #297 \n
- #298 \n
- #299 \n
- #300 \n
- #301 \n
- #302 \n
- #303 \n
- #304 \n
- #305 \n
- #306 \n
- #307 \n
- #308 \n
- #309 \n
- #310 \n
- #311 \n
- #312 \n
- #313 \n
- #314 \n
- #315 \n
- #316 \n
- #317 \n
- #318 \n
- #319 \n
- #320 \n
- #321 \n
- #322 \n
- #323 \n
- #324 \n
- #325 \n
- #326 \n
- #327 \n
- #328 \n
- #329 \n
- #330 \n
- #331 \n
- #332 \n
- #333 \n
- #334 \n
- #335 \n
- #336 \n
- #337 \n
- #338 \n
- #339 \n
- #340 \n
- #341 \n
- #342 \n
- #343 \n
- #344 \n
- #345 \n
- #346 \n
- #347 \n
- #348 \n
- #349 \n
- #350 \n
- #351 \n
- #352 \n
- #353 \n
- #354 \n
- #355 \n
- #356 \n
- #357 \n
- #358 \n
- #359 \n
- #360 \n
- #361 \n
- #362 \n
- #363 \n
- #364 \n
- #365 \n
- #366 \n
- #367 \n
- #368 \n
- #369 \n
- #370 \n
- #371 \n
- #372 \n
- #373 \n
- #374 \n
- #375 \n
- #376 \n
- #377 \n
- #378 \n
- #379 \n
- #380 \n
- #381 \n
- #382 \n
- #383 \n
- #384 \n
- #385 \n
- #386 \n
- #387 \n
- #388 \n
- #389 \n
- #390 \n
- #391 \n
- #392 \n
- #393 \n
- #394 \n
- #395 \n
- #396 \n
- #397 \n
- #398 \n
- #399 \n
- #400 \n
- #401 \n
- #402 \n
- #403 \n
- #404 \n
- #405 \n
- #406 \n
- #407 \n
- #408 \n
- #409 \n