/* -*- 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 .
*/
#include <sal/config.h>
#include <cassert>
#include "UriReference.hxx"
#include <rtl/ustrbuf.hxx>
#include <rtl/ustring.hxx>
#include <utility>
#include <sal/types.h>
using stoc::uriproc::UriReference;
UriReference::UriReference(
OUString scheme, bool bHasAuthority,
OUString const & authority, OUString path,
bool bHasQuery, OUString const & query):
m_path(std::move(path)),
m_scheme(std::move(scheme)),
m_authority(authority),
m_query(query),
m_hasAuthority(bHasAuthority),
m_hasQuery(bHasQuery),
m_hasFragment(false )
{
assert(authority.isEmpty() || bHasAuthority);
assert(query.isEmpty() || bHasQuery);
}
UriReference::~UriReference() {}
OUString UriReference::getUriReference()
{
std::lock_guard g(m_mutex);
OUStringBuffer buf(128 );
if (!m_scheme.isEmpty()) {
buf.append(m_scheme + ":" );
}
appendSchemeSpecificPart(buf);
if (m_hasFragment) {
buf.append("#" + m_fragment);
}
return buf.makeStringAndClear();
}
bool UriReference::isAbsolute() const {
return !m_scheme.isEmpty();
}
OUString UriReference::getSchemeSpecificPart()
{
std::lock_guard g(m_mutex);
OUStringBuffer buf;
appendSchemeSpecificPart(buf);
return buf.makeStringAndClear();
}
bool UriReference::isHierarchical() {
std::lock_guard g(m_mutex);
return m_scheme.isEmpty() || m_hasAuthority || m_path.startsWith("/" );
}
bool UriReference::hasAuthority() const {
return m_hasAuthority;
}
const OUString& UriReference::getAuthority() const {
return m_authority;
}
OUString UriReference::getPath() {
std::lock_guard g(m_mutex);
return m_path;
}
bool UriReference::hasRelativePath() {
std::lock_guard g(m_mutex);
return !m_hasAuthority
&& (m_path.isEmpty() || m_path[0 ] != '/' );
}
sal_Int32 UriReference::getPathSegmentCount()
{
std::lock_guard g(m_mutex);
if (m_path.isEmpty()) {
return 0 ;
} else {
sal_Int32 n = m_path[0 ] == '/' ? 0 : 1 ;
for (sal_Int32 i = 0 ;; ++i) {
i = m_path.indexOf('/' , i);
if (i < 0 ) {
break ;
}
++n;
}
return n;
}
}
OUString UriReference::getPathSegment(sal_Int32 index)
{
std::lock_guard g(m_mutex);
if (!m_path.isEmpty() && index >= 0 ) {
for (sal_Int32 i = m_path[0 ] == '/' ? 1 : 0 ;; ++i) {
if (index-- == 0 ) {
sal_Int32 j = m_path.indexOf('/' , i);
return j < 0 ? m_path.copy(i) : m_path.copy(i, j - i);
}
i = m_path.indexOf('/' , i);
if (i < 0 ) {
break ;
}
}
}
return OUString();
}
bool UriReference::hasQuery() const {
return m_hasQuery;
}
const OUString& UriReference::getQuery() const {
return m_query;
}
bool UriReference::hasFragment() {
std::lock_guard g(m_mutex);
return m_hasFragment;
}
OUString UriReference::getFragment() {
std::lock_guard g(m_mutex);
return m_fragment;
}
void UriReference::setFragment(OUString const & fragment)
{
std::lock_guard g(m_mutex);
m_hasFragment = true ;
m_fragment = fragment;
}
void UriReference::clearFragment() {
std::lock_guard g(m_mutex);
m_hasFragment = false ;
m_fragment.clear();
}
void UriReference::appendSchemeSpecificPart(OUStringBuffer & buffer) const
{
if (m_hasAuthority) {
buffer.append("//");
buffer.append(m_authority);
}
buffer.append(m_path);
if (m_hasQuery) {
buffer.append('?' );
buffer.append(m_query);
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
Messung V0.5 in Prozent C=96 H=92 G=93
¤ Dauer der Verarbeitung: 0.12 Sekunden
(vorverarbeitet am 2026-09-27)
¤
*© Formatika GbR, Deutschland