Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
G
go-ipfs
概览
概览
详情
活动
周期分析
版本库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
统计图
问题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程表
图表
维基
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
jihao
go-ipfs
Commits
0d3a86e8
提交
0d3a86e8
authored
5月 12, 2017
作者:
Jeromy
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
address code review, add comments
License: MIT Signed-off-by:
Jeromy
<
jeromyj@gmail.com
>
上级
8f97786e
隐藏空白字符变更
内嵌
并排
正在显示
4 个修改的文件
包含
9 行增加
和
7 行删除
+9
-7
diff.go
merkledag/utils/diff.go
+1
-1
diffenum.go
merkledag/utils/diffenum.go
+6
-4
diffenum_test.go
merkledag/utils/diffenum_test.go
+1
-1
pin.go
pin/pin.go
+1
-1
没有找到文件。
merkledag/utils/diff.go
浏览文件 @
0d3a86e8
...
...
@@ -7,8 +7,8 @@ import (
dag
"github.com/ipfs/go-ipfs/merkledag"
node
"github.com/ipfs/go-ipld-node"
cid
"gx/ipfs/QmYhQaCYEcaPPjxJX7YcPcVKkQfRy6sJ7B3XmGFk82XYdQ/go-cid"
node
"gx/ipfs/Qmb3Hm9QDFmfYuET4pu7Kyg8JV78jFa1nvZx5vnCZsK4ck/go-ipld-format"
)
const
(
...
...
merkledag/utils/diffenum.go
浏览文件 @
0d3a86e8
...
...
@@ -6,8 +6,8 @@ import (
mdag
"github.com/ipfs/go-ipfs/merkledag"
node
"github.com/ipfs/go-ipld-node"
cid
"gx/ipfs/QmYhQaCYEcaPPjxJX7YcPcVKkQfRy6sJ7B3XmGFk82XYdQ/go-cid"
node
"gx/ipfs/Qmb3Hm9QDFmfYuET4pu7Kyg8JV78jFa1nvZx5vnCZsK4ck/go-ipld-format"
)
// DiffEnumerate fetches every object in the graph pointed to by 'to' that is
...
...
@@ -55,13 +55,15 @@ func DiffEnumerate(ctx context.Context, dserv node.NodeGetter, from, to *cid.Cid
return
nil
}
// if both bef and aft are not nil, then that signifies bef was replaces with aft.
// if bef is nil and aft is not, that means aft was newly added
// if aft is nil and bef is not, that means bef was deleted
type
diffpair
struct
{
bef
,
aft
*
cid
.
Cid
}
// getLinkDiff returns a changset (minimum edit distance style) between nodes
// 'a' and 'b'. Currently does not log deletions as our usecase doesnt call for
// this.
// getLinkDiff returns a changeset between nodes 'a' and 'b'. Currently does
// not log deletions as our usecase doesnt call for this.
func
getLinkDiff
(
a
,
b
node
.
Node
)
[]
diffpair
{
have
:=
make
(
map
[
string
]
*
node
.
Link
)
names
:=
make
(
map
[
string
]
*
node
.
Link
)
...
...
merkledag/utils/diffenum_test.go
浏览文件 @
0d3a86e8
...
...
@@ -8,8 +8,8 @@ import (
dag
"github.com/ipfs/go-ipfs/merkledag"
mdtest
"github.com/ipfs/go-ipfs/merkledag/test"
node
"github.com/ipfs/go-ipld-node"
cid
"gx/ipfs/QmYhQaCYEcaPPjxJX7YcPcVKkQfRy6sJ7B3XmGFk82XYdQ/go-cid"
node
"gx/ipfs/Qmb3Hm9QDFmfYuET4pu7Kyg8JV78jFa1nvZx5vnCZsK4ck/go-ipld-format"
)
func
buildNode
(
name
string
,
desc
map
[
string
]
ndesc
,
out
map
[
string
]
node
.
Node
)
node
.
Node
{
...
...
pin/pin.go
浏览文件 @
0d3a86e8
...
...
@@ -90,7 +90,7 @@ type Pinner interface {
// Update updates a recursive pin from one cid to another
// this is more efficient than simply pinning the new one and unpinning the
// old one
Update
(
c
ontext
.
Context
,
*
cid
.
Cid
,
*
cid
.
Cid
,
bool
)
error
Update
(
c
tx
context
.
Context
,
from
,
to
*
cid
.
Cid
,
unpin
bool
)
error
// Check if a set of keys are pinned, more efficient than
// calling IsPinned for each key
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论