Definition template class pair { T m0; U m1; public: pair() { } pair(T v0, U v1) : m0(v0), m1(v1) { } T first() const { return m0; } U second() const { return m1; } }; https://godbolt Definition template class pair { T m0; U m1; public: pair() { } pair(T v0, U v1) : m0(v0), m1(v1) { } T first() const { return m0; } U second() const { return m1; } }; https://godbolt Definition template class pair { T m0; U m1; public: pair() { } pair(T v0, U v1) : m0(v0), m1(v1) { } T first() const { return m0; } U second() const { return m1; } }; https://godbolt

是变量 n，a3 指向 a[0]，v0 是变量 j，v1 是变量 i，t0 是变量 x 0: 24860004 addiu a2,a0,4 # a2 指向 a[i] 4: 24030001 li v1,1 # i = 1 Outer Loop: 8: 0065102b sltu v0,v1,a1 # i < n 时置 1 c: 14400003 bnez v0,1c # 若 iv0,v1 # j = i Inner Loop: 24: 8ce9fffc lw t1,-4(a3) # t1 = a[j-1] 28: 00000000 nop # 读数延迟槽未填充 2c: Inner Loop 34: 00000000 nop # 分支延迟槽未填充 38: 2442ffff addiu v0,v0,-1 # j- - 3c: ace90000 sw t1,0(a3) # a[j] = a[j-1] 40: 1440fff8 bnez v0,24 # 若 j != 0，跳到 Inner Loop 44: 24e7fffc addiu a3,a3,-4 # 递减

提案还包含一些其他的 备选语法： ○ generic(t) func .. ○ $t // 使用类型参数 ○ t // 实例化具体类型 评述 ● 确实是一个糟糕的设计 ● x := Vector(t)(v0) 这是两个函数调用吗？ ● 尝试借用使用 C++ 的 Concepts 对类型参数的约束 1 type Greater(t) interface { 2 IsGreaterThan(t) Comparable)(v0 T, vn ...T) T { 7 switch l := len(vn); { 8 case l == 0: 9 return v0 10 case l == 1: 11 if v0 > vn[0] { return v0 } 12 return vn[0] 13 default: 14 vv := Max(vn[0], vn[1:]...) 15 if v0 > vv vv { return v0 } 16 return vv 17 } 18 } 合约是一个描述了一 组类型且不会被执行的函数体。 关键设计 ● 在合约中写 Go 语句对类型进行保障 ● 甚至写出条件、循 环、赋值语句 评述 ● 复杂的合约写法（合约内的代码写法可以有多少种？） ● 「一个不会执行的函数体」太具迷惑性 ● 实现上估计是一个比较麻烦的问题 [Revised] 2020

pointer to a[0], v0 is j, v1 is i, t0 is x 0: 24860004 addiu a2,a0,4 # a2 is pointer to a[i] 4: 24030001 li v1,1 # i = 1 Outer Loop: 8: 0065102b sltu v0,v1,a1 # set on i < n c: 14400003 bnez v0,1c # if iv0,v1 # j = i Inner Loop: 24: 8ce9fffc lw t1,-4(a3) # t1 = a[j-1] 28: 00000000 nop # load delay slot unfilled 34: 00000000 nop # branch delay slot unfilled 38: 2442ffff addiu v0,v0,-1 # j-- 3c: ace90000 sw t1,0(a3) # a[j] = a[j-1] 40: 1440fff8 bnez v0,24 # if j != 0, jump to Inner Loop 44: 24e7fffc addiu a3,a3,-4

peer cluster. Normal replication - problem #1 Put K0, V0, t1 Put K0, V0, t2 t1 t2 Put K0, V0, t5 t4 t3 Region Move Put K0, V0, t1 Put K0, V0, t5 t6 t7 t8 Sequence of mutations in source cluster pub/sub, message system etc. Put K0, V0, t2 Normal replication - problem #2 Put K0, V0, t1 Delete K0, t < t4 t1 t2 Put K0, V0, t2 t4 t3 Region Move Put K0, V0, t1 t6 t7 t9 Mutation sequence in but the peer cluster has a cell (Put K0, V0, t2) in the end. ➢ Data inconsistent happen between source cluster and peer clusters. Delete K0, t < t4 Put K0, V0, t2 t8 Major Compact Redundant cell