elioperdreau/libreoffice-translations-weblate
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

update translations for 6.3.0 beta2

Browse Source 
and force-fix errors using pocheck

Change-Id: I2f20dff5fd47ee5f99d612b22661d5248adaccc2
This commit is contained in:
Christian Lohmaier
2019-06-20 16:54:45 +02:00
parent ceca6b42c9
commit a56aea7a0e
306 changed files with 6365 additions and 6232 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
source/hsb/nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver.po
View File

@@ -4,16 +4,16 @@ msgstr ""
"Project-Id-Version: PACKAGE VERSION\n"
"Report-Msgid-Bugs-To: https://bugs.libreoffice.org/enter_bug.cgi?product=LibreOffice&bug_status=UNCONFIRMED&component=UI\n"
"POT-Creation-Date: 2016-11-09 14:10+0100\n"
"PO-Revision-Date: 2016-12-03 20:36+0000\n"
"Last-Translator: milupo <milupo@sorbzilla.de>\n"
"PO-Revision-Date: 2019-06-17 09:38+0000\n"
"Last-Translator: Michael Wolf <milupo@sorbzilla.de>\n"
"Language-Team: LANGUAGE <LL@li.org>\n"
"Language: hsb\n"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=UTF-8\n"
"Content-Transfer-Encoding: 8bit\n"
"X-Accelerator-Marker: ~\n"
"X-Generator: LibreOffice\n"
"X-POOTLE-MTIME: 1480797399.000000\n"
"X-Generator: Pootle 2.8\n"
"X-POOTLE-MTIME: 1560764297.000000\n"
#: Options.xhp
msgctxt ""
@@ -381,7 +381,7 @@ msgctxt ""
"par_id0603200910430821\n"
"help.text"
msgid "There is also a list of constraints you can use to restrict the possible range of solutions or to penalize certain conditions. However, in case of the evolutionary solvers DEPS and SCO, these constraints are also used to specify bounds on the variables of the problem. Due to the random nature of the algorithms, it is <emph>highly recommended</emph> to do so and give upper (and in case \"Assume Non-Negative Variables\" is turned off also lower) bounds for all variables. They don't have to be near the actual solution (which is probably unknown) but should give a rough indication of the expected size (0 ≤ var ≤ 1 or maybe -1000000 ≤ var ≤ 1000000)."
msgstr "Je tež lisćina wobmjezowanjow, kotruž móžeće wužiwać, zo byšće móžny rozsah rozrisanjow wobmjezował abo wěste wuměnjenja wosłabił. Ale w padźe ewolucionarneju solwerow DEPS a SCO so tež tute wobmjezowanja wužiwaja, zo bychu so hranicy za wariable problema podali. Ale připadneho rysa algoritmusow dla, so <emph>z dorazom doporuča</emph>, to činić a hornje (a jeli „Wot njenegatiwnych wariablow wuchadźeć“ je znjemóžnjene, tež delnje) hranicy za wšě wariable podać. Njetrjebaja blisko poprawneho rozrisanja być (kotrež najskerje je njeznate), ale měli hrube podaće wočakowaneje wulkosće być (0 ≤ var ≤ 1 or maybe -1000000 ≤ var ≤ 1000000)."
msgstr "Je tež lisćina wobmjezowanjow, kotruž móžeće wužiwać, zo byšće móžny rozsah rozrisanjow wobmjezował abo wěste wuměnjenja wosłabił. Ale w padźe ewolucionarneju solwerow DEPS a SCO so tež tute wobmjezowanja wužiwaja, zo bychu so hranicy za wariable problema podali. Ale připadneho rysa algoritmusow dla, so <emph>z dorazom doporuča</emph>, to činić a hornje (a jeli „Wot njenegatiwnych wariablow wuchadźeć“ je znjemóžnjene, tež delnje) hranicy za wšě wariable podać. Njetrjebaja blisko poprawneho rozrisanja być (kotrež najskerje je njeznate), ale měli hrube podaće wočakowaneje wulkosće być (0 ≤ var ≤ 1 abo tež -1000000 ≤ var ≤ 1000000)."
#: Usage.xhp
msgctxt ""