/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ /* * This file is part of the LibreOffice project. * * This Source Code Form is subject to the terms of the Mozilla Public * License, v. 2.0. If a copy of the MPL was not distributed with this * file, You can obtain one at http://mozilla.org/MPL/2.0/. * * This file incorporates work covered by the following license notice: * * Licensed to the Apache Software Foundation (ASF) under one or more * contributor license agreements. See the NOTICE file distributed * with this work for additional information regarding copyright * ownership. The ASF licenses this file to you under the Apache * License, Version 2.0 (the "License"); you may not use this file * except in compliance with the License. You may obtain a copy of * the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
// HTML has for that <br> and <p> also does new line
aResult = aResult.replaceAll("<ul>"_ostr, ""_ostr);
aResult = aResult.replaceAll("</ul>"_ostr, ""_ostr);
aResult = aResult.replaceAll("<ol>"_ostr, ""_ostr);
aResult = aResult.replaceAll("</ol>"_ostr, ""_ostr);
aResult = aResult.replaceAll("\n"_ostr, ""_ostr).trim(); return aResult;
} return {};
}
if (bHasSelection)
{ // iteration will start top to bottom if (m_pCurrentPam->GetPoint()->nNode > m_pCurrentPam->GetMark()->nNode)
m_pCurrentPam->Exchange();
}
for (SwNodeOffset n(startNode); n <= endNode; ++n)
{ if (pNodes[n] && pNodes[n]->IsTextNode())
{ if (pNodes[n]->GetTextNode()->GetText().isEmpty()) continue;
nCount++;
}
}
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.