From aec324ae262ba52771ba835079bff86a9836fe1a Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E7=A7=83=E5=A4=B4=E7=81=AF=E7=AC=BC=E9=B1=BC?= <ttdlyu@163.com> Date: Tue, 18 Jul 2023 14:23:48 +0000 Subject: [PATCH] Translated using Weblate (Chinese (Simplified)) MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Currently translated at 56.2% (6215 of 11052 strings) Translation: Git Manpages/Translations Translate-URL: https://hosted.weblate.org/projects/git-manpages/translations/zh_Hans/ Signed-off-by: 燁껃ㅄ��Ъ浴� <ttdlyu@163.com> --- po/documentation.zh_HANS-CN.po | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-) diff --git a/po/documentation.zh_HANS-CN.po b/po/documentation.zh_HANS-CN.po index 27ffef0..90cc91d 100644 --- a/po/documentation.zh_HANS-CN.po +++ b/po/documentation.zh_HANS-CN.po @@ -3,7 +3,7 @@ # This file is distributed under the same license as the Git package. # Matthias A횩hauer <mha1993@live.de>, 2019. msgid "" -msgstr "Project-Id-Version: git documentation\nReport-Msgid-Bugs-To: jn.avila@free.fr\nPOT-Creation-Date: 2023-02-26 14:06+0100\nPO-Revision-Date: 2023-07-17 15:06+0000\nLast-Translator: 燁껃ㅄ��Ъ浴� <ttdlyu@163.com>\nLanguage-Team: LANGUAGE <LL@li.org>\nLanguage: zh_HANS-CN\nMIME-Version: 1.0\nContent-Type: text/plain; charset=UTF-8\nContent-Transfer-Encoding: 8bit\nPlural-Forms: nplurals=1; plural=0;\nX-Generator: Weblate 5.0-dev\n" +msgstr "Project-Id-Version: git documentation\nReport-Msgid-Bugs-To: jn.avila@free.fr\nPOT-Creation-Date: 2023-02-26 14:06+0100\nPO-Revision-Date: 2023-07-19 15:02+0000\nLast-Translator: 燁껃ㅄ��Ъ浴� <ttdlyu@163.com>\nLanguage-Team: LANGUAGE <LL@li.org>\nLanguage: zh_HANS-CN\nMIME-Version: 1.0\nContent-Type: text/plain; charset=UTF-8\nContent-Transfer-Encoding: 8bit\nPlural-Forms: nplurals=1; plural=0;\nX-Generator: Weblate 5.0-dev\n" #. type: Labeled list #: en/blame-options.txt:1 en/diff-options.txt:769 en/git-instaweb.txt:45 en/git-mailinfo.txt:49 en/git-mailsplit.txt:35 en/git-repack.txt:146 en/git-status.txt:31 @@ -41805,7 +41805,7 @@ msgstr " 1 ----. A\n\t | /\n 2 ----+---' B\n\t |\n\t `----- C\ #: en/git-range-diff.txt:249 #, priority:100 msgid "In mathematical terms, what we are looking for is some sort of a minimum cost bipartite matching; `1` is matched to `C` at some cost, etc. The underlying graph is in fact a complete bipartite graph; the cost we associate with every edge is the size of the diff between the two commits' patches. To explain also new commits, we introduce dummy nodes on both sides:" -msgstr "" +msgstr "�ⓩ빊耶�쑐瑥�씎瑥댐펽�묇뺄誤곩��양쉪��윇燁띷�弱뤶빰餓루쉪�뚧쟿�쇔뙶�랃폑`1` 餓ζ윇燁띴빰餓룟뙶�띶댆 `C`竊뚨춬嶺됥�귛틫掠귛쎗若욇솀訝딀삸訝�訝ゅ츑�당쉪�뚦릲�억폑�묇뺄訝롦캀�↑씁�멨뀽�붺쉪餓ｄ뻔��륵訝ゆ룓雅ㅸ‥訝곦퉳�당쉪藥��쇔ㄷ弱뤵�귚맏雅녻㎗�딀뼭�먧벡竊뚧닊餓у쑉訝ㅸ씁�썲폊�δ틙�싪뒄�뱄폏" #. type: delimited block - #: en/git-range-diff.txt:258 @@ -41831,19 +41831,19 @@ msgstr "" #: en/git-range-diff.txt:260 #, no-wrap, priority:100 msgid " o o\n" -msgstr "" +msgstr " o o\n" #. type: Plain text #: en/git-range-diff.txt:270 #, priority:100 msgid "The cost of an edge `o--C` is the size of `C`'s diff, modified by a fudge factor that should be smaller than 100%. The cost of an edge `o--o` is free. The fudge factor is necessary because even if `1` and `C` have nothing in common, they may still share a few empty lines and such, possibly making the assignment `1--C`, `o--o` slightly cheaper than `1--o`, `o--C` even if `1` and `C` have nothing in common. With the fudge factor we require a much larger common part to consider patches as corresponding." -msgstr "" +msgstr "渦� `o--C` �꾡빰餓룡삸 `C` �꾢량�쇔ㄷ弱륅펽�띶뒥訝듾�訝ゅ틪弱뤶틢 100% �꾡엶閭ｇ내�겹�귟씁 `o--o` �꾡빰餓룡삸�띹뉩�꾠�귚엶閭ｇ내�경삸恙낁쫨�꾬펽�졽맏�념슴 `1` �� `C` 亦→쐣�긷릪�뱄펽若껂뺄餓띶룾�썲뀻雅ヤ�雅쏁㈉烏뚨춬竊뚩퓳��꺗鴉싦슴壅뗥�� `1--C`, `o--o` 驪� `1--o`, `o--C` 葉띶쒜堊욕츦訝�雅쏉펽�념슴 `1` �� `C` 亦→쐣�긷릪�밤�귝쐣雅녷Æ楹듿썱耶먲펽�묇뺄��誤곫쎍鸚㎫쉪�у뀻�ⓨ늽�띹꺗弱녻‥訝곮쭍訝뷰�野밭쉪��" #. type: Plain text #: en/git-range-diff.txt:277 #, priority:100 msgid "The overall time needed to compute this algorithm is the time needed to compute n+m commit diffs and then n*m diffs of patches, plus the time needed to compute the least-cost assignment between n and m diffs. Git uses an implementation of the Jonker-Volgenant algorithm to solve the assignment problem, which has cubic runtime complexity. The matching found in this case will look like this:" -msgstr "" +msgstr "溫←츞瑥η츞力뺞����꾣�삥뿶�닸삸溫←츞 n+m 訝ゆ룓雅ㅵ량凉귛뭽 n*m 訝よ‥訝곩량凉귝����꾣뿶�댐펽�띶뒥訝딂�嶸� n �� m 訝ゅ량凉귚퉳�당쉪��弱뤸닇�ц탩�쇗����꾣뿶�담�괛it 鵝욜뵪 Jonker-Volgenant 嶸쀦퀡�θ㎗�녑늽�띺뿮窯섓펽瑥η츞力뺟쉪瓦먫죱鸚띷쓡佯╊맏塋뗦뼶�귛쑉瓦숂쭕�끻넻訝뗦돻�곁쉪�백뀓瀯볠옖��퓳�루쉪 :" #. type: delimited block - #: en/git-range-diff.txt:286 @@ -42504,7 +42504,7 @@ msgstr "git-rebase(1)" #: en/git-rebase.txt:7 #, priority:100 msgid "git-rebase - Reapply commits on top of another base tip" -msgstr "" +msgstr "git-rebase - �ⓨ룱訝�訝ゅ읃簾��먪ㅊ阿뗤툓�띷뼭佯붺뵪�먧벡�끻�" #. type: Plain text #: en/git-rebase.txt:16 @@ -42515,13 +42515,13 @@ msgid "" "'git rebase' [-i | --interactive] [<options>] [--exec <cmd>] [--onto <newbase>]\n" "\t--root [<branch>]\n" "'git rebase' (--continue | --skip | --abort | --quit | --edit-todo | --show-current-patch)\n" -msgstr "" +msgstr "'git rebase' [-i | --interactive] [<options>] [--exec <cmd>]\n\t[--onto <newbase> | --keep-base] [<upstream> [<branch>]]\n'git rebase' [-i | --interactive] [<options>] [--exec <cmd>] [--onto <newbase>]\n\t--root [<branch>]\n'git rebase' (--continue | --skip | --abort | --quit | --edit-todo | --show-current-patch)\n" #. type: Plain text #: en/git-rebase.txt:22 #, priority:100 msgid "If `<branch>` is specified, `git rebase` will perform an automatic `git switch <branch>` before doing anything else. Otherwise it remains on the current branch." -msgstr "" +msgstr "倻귝옖�뉐츣雅� `<branch>`竊�`git rebase` 鴉싪눎�ⓩ돢烏� `git switch <branch>`竊뚨꽫�롥냽�싧끀餓뽨틟�끹�� ��닕竊뚦츆鴉싦퓷�쇿쑉壤볟뎺�녷뵱訝듽��" #. type: Plain text #: en/git-rebase.txt:28 -- GitLab