Commit 418bb851 authored by Yuri Chornoivan's avatar Yuri Chornoivan
Browse files

Use URLs with transport encryption

parent a4907aac
......@@ -32,7 +32,7 @@ find_package(HUNSPELL)
set_package_properties(
HUNSPELL PROPERTIES
DESCRIPTION "Library used for stemming"
URL "http://hunspell.sourceforge.net/"
URL "https://hunspell.github.io/"
TYPE REQUIRED
PURPOSE "Required to build Lokalize.")
......
......@@ -29,7 +29,7 @@
#include "tmentry.h"
struct AltTrans {
///@see http://docs.oasis-open.org/xliff/v1.2/os/xliff-core.html#alttranstype
///@see https://docs.oasis-open.org/xliff/v1.2/os/xliff-core.html#alttranstype
enum Type {Proposal, PreviousVersion, Rejected, Reference, Accepted, Other};
Type type;
......
......@@ -45,7 +45,7 @@
struct InlineTag {
//sub = can contain <sub>-flow tag
//recursive = can contain other inline markup tags
///@see http://docs.oasis-open.org/xliff/v1.2/os/xliff-core.html
///@see https://docs.oasis-open.org/xliff/v1.2/os/xliff-core.html
enum InlineElement {
_unknown,
bpt, //sub
......
......@@ -25,7 +25,7 @@
#ifndef STATE_H
#define STATE_H
///@see http://docs.oasis-open.org/xliff/v1.2/os/xliff-core.html#state
///@see https://docs.oasis-open.org/xliff/v1.2/os/xliff-core.html#state
enum TargetState {
New,
NeedsTranslation,
......
......@@ -4,7 +4,7 @@
wordDiff algorithm adoption and further refinement:
Copyright (C) 2007 by Nick Shaforostoff <shafff@ukr.net>
2018-2019 by Simon Depiets <sdepiets@gmail.com>
(based on Markus Stengel's GPL implementation of LCS-Delta algorithm as it is described in "Introduction to Algorithms", MIT Press, 2001, Second Edition, written by Thomas H. Cormen et. al. It uses dynamic programming to solve the Longest Common Subsequence (LCS) problem. - http://www.markusstengel.de/text/en/i_4_1_5_3.html)
(based on Markus Stengel's GPL implementation of LCS-Delta algorithm as it is described in "Introduction to Algorithms", MIT Press, 2001, Second Edition, written by Thomas H. Cormen et. al. It uses dynamic programming to solve the Longest Common Subsequence (LCS) problem.)
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
......
......@@ -4,7 +4,7 @@
wordDiff algorithm adoption and further refinement:
Copyright (C) 2007 by Nick Shaforostoff <shafff@ukr.net>
2018-2019 by Simon Depiets <sdepiets@gmail.com>
(based on Markus Stengel's GPL implementation of LCS-Delta algorithm as it is described in "Introduction to Algorithms", MIT Press, 2001, Second Edition, written by Thomas H. Cormen et. al. It uses dynamic programming to solve the Longest Common Subsequence (LCS) problem. - http://www.markusstengel.de/text/en/i_4_1_5_3.html)
(based on Markus Stengel's GPL implementation of LCS-Delta algorithm as it is described in "Introduction to Algorithms", MIT Press, 2001, Second Edition, written by Thomas H. Cormen et. al. It uses dynamic programming to solve the Longest Common Subsequence (LCS) problem.)
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
......@@ -37,7 +37,6 @@
* Based on Markus Stengel's GPLv2+ implementation of LCS-Delta algorithm
* as it is described in "Introduction to Algorithms", MIT Press, 2001, Second Edition, written by Thomas H. Cormen et. al.
* It uses dynamic programming to solve the Longest Common Subsequence (LCS) problem.
* http://www.markusstengel.de/text/en/i_4_1_5_3.html)
*
* This is high-level wrapper
*
......
......@@ -91,7 +91,7 @@ bool Glossary::load(const QString& newPath)
}
QXmlSimpleReader reader;
//reader.setFeature("http://qtsoftware.com/xml/features/report-whitespace-only-CharData",true);
reader.setFeature("http://qt-project.org/xml/features/report-whitespace-only-CharData",true);
reader.setFeature("http://xml.org/sax/features/namespaces", false);
QXmlInputSource source(device);
......
......@@ -69,9 +69,9 @@ int main(int argc, char **argv)
KAboutData about(QStringLiteral("lokalize"), i18nc("@title", "Lokalize"), LOKALIZE_VERSION, i18n("Computer-aided translation system.\nDo not translate what had already been translated."),
KAboutLicense::GPL, i18nc("@info:credit", "(c) 2018-2019 Simon Depiets\n(c) 2007-2015 Nick Shaforostoff\n(c) 1999-2006 The KBabel developers") /*, KLocalizedString(), 0, "shafff@ukr.net"*/);
about.addAuthor(i18n("Nick Shaforostoff"), QString(), QStringLiteral("shaforostoff@gmail.com"));
about.addCredit(i18n("Google Inc."), i18n("sponsored development as part of Google Summer Of Code program"), QString(), QStringLiteral("http://google.com"));
about.addCredit(i18n("Google Inc."), i18n("sponsored development as part of Google Summer Of Code program"), QString(), QStringLiteral("https://google.com"));
about.addCredit(i18n("NLNet Foundation"), i18n("sponsored XLIFF-related work"), QString(), QStringLiteral("https://nlnet.nl/"));
about.addCredit(i18n("Translate-toolkit"), i18n("provided excellent cross-format converting scripts"), QString(), QStringLiteral("http://translate.sourceforge.net"));
about.addCredit(i18n("Translate-toolkit"), i18n("provided excellent cross-format converting scripts"), QString(), QStringLiteral("https://toolkit.translatehouse.org"));
about.addCredit(i18n("Viesturs Zarins"), i18n("project tree merging translation+templates"), QStringLiteral("viesturs.zarins@mii.lu.lv"), QString());
about.addCredit(i18n("Stephan Johach"), i18n("bug fixing patches"), QStringLiteral("hunsum@gmx.de"));
about.addCredit(i18n("Chusslove Illich"), i18n("bug fixing patches"), QStringLiteral("caslav.ilic@gmx.net"));
......
......@@ -78,8 +78,8 @@ ProjectTab::ProjectTab(QWidget *parent)
"If you need more information or documentation, then a visit to "
"<a href=\"%2\">%2</a> "
"will provide you with what you need.</html>",
QLatin1String("http://community.kde.org/Get_Involved"),
QLatin1String("http://techbase.kde.org/")), welcomeWidget);
QLatin1String("https://community.kde.org/Get_Involved"),
QLatin1String("https://techbase.kde.org/")), welcomeWidget);
about->setAlignment(Qt::AlignCenter);
about->setWordWrap(true);
about->setOpenExternalLinks(true);
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment