Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
李少辉-开发者
git
提交
82f9d58a
G
git
项目概览
李少辉-开发者
/
git
与 Fork 源项目一致
从无法访问的项目Fork
通知
2
Star
1
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
G
git
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
82f9d58a
编写于
12月 29, 2005
作者:
J
Junio C Hamano
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
code comments: spell
Signed-off-by:
N
Junio C Hamano
<
junkio@cox.net
>
上级
89438677
变更
7
隐藏空白更改
内联
并排
Showing
7 changed file
with
7 addition
and
7 deletion
+7
-7
date.c
date.c
+1
-1
diff-index.c
diff-index.c
+1
-1
diff.c
diff.c
+1
-1
epoch.c
epoch.c
+1
-1
ident.c
ident.c
+1
-1
ls-files.c
ls-files.c
+1
-1
pack-objects.c
pack-objects.c
+1
-1
未找到文件。
date.c
浏览文件 @
82f9d58a
...
...
@@ -326,7 +326,7 @@ static int match_digit(const char *date, struct tm *tm, int *offset, int *tm_gmt
/*
* NOTE! We will give precedence to day-of-month over month or
* year num
e
bers in the 1-12 range. So 05 is always "mday 5",
* year numbers in the 1-12 range. So 05 is always "mday 5",
* unless we already have a mday..
*
* IOW, 01 Apr 05 parses as "April 1st, 2005".
...
...
diff-index.c
浏览文件 @
82f9d58a
...
...
@@ -116,7 +116,7 @@ static int diff_cache(struct cache_entry **ac, int entries, const char **pathspe
/* We come here with ce pointing at stage 1
* (original tree) and ac[1] pointing at stage
* 3 (unmerged). show-modified with
* report-mising set to false does not say the
* report-mis
s
ing set to false does not say the
* file is deleted but reports true if work
* tree does not have it, in which case we
* fall through to report the unmerged state.
...
...
diff.c
浏览文件 @
82f9d58a
...
...
@@ -787,7 +787,7 @@ int diff_setup_done(struct diff_options *options)
* so it is safe for us to do this here. Also
* it does not smudge active_cache or active_nr
* when it fails, so we do not have to worry about
* cleaning it up ou
f
selves either.
* cleaning it up ou
r
selves either.
*/
read_cache
();
}
...
...
epoch.c
浏览文件 @
82f9d58a
...
...
@@ -190,7 +190,7 @@ static void free_mass_counter(struct mass_counter *counter)
* enqueued, enqueuing the commit in a list of pending commits, in latest
* commit date first order.
*
* The algorithm then pr
e
ceeds to visit each commit in the pending queue.
* The algorithm then pr
o
ceeds to visit each commit in the pending queue.
* Upon each visit, the pending mass is added to the mass already seen for that
* commit and then divided into N equal portions, where N is the number of
* parents of the commit being visited. The divided portions are then injected
...
...
ident.c
浏览文件 @
82f9d58a
...
...
@@ -140,7 +140,7 @@ static int copy(char *buf, int size, int offset, const char *src)
/*
* Copy the rest to the buffer, but avoid the special
* characters '\n' '<' and '>' that act as delim
e
ters on
* characters '\n' '<' and '>' that act as delim
i
ters on
* a identification line
*/
for
(
i
=
0
;
i
<
len
;
i
++
)
{
...
...
ls-files.c
浏览文件 @
82f9d58a
...
...
@@ -169,7 +169,7 @@ static int excluded_1(const char *pathname,
}
else
{
/* match with FNM_PATHNAME:
* exclude has base (baselen long) i
n
plicitly
* exclude has base (baselen long) i
m
plicitly
* in front of it.
*/
int
baselen
=
x
->
baselen
;
...
...
pack-objects.c
浏览文件 @
82f9d58a
...
...
@@ -119,7 +119,7 @@ static unsigned long write_one(struct sha1file *f,
return
offset
;
e
->
offset
=
offset
;
offset
+=
write_object
(
f
,
e
);
/* if we are del
i
tified, write out its base object. */
/* if we are deltified, write out its base object. */
if
(
e
->
delta
)
offset
=
write_one
(
f
,
e
->
delta
,
offset
);
return
offset
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录