09981cd638
instead of employing ad hoc linked list and its iterator. Change-Id: Ibc4709a2e67aa805cf54117303c47d9a8a5eede9 Reviewed-on: https://gerrit.libreoffice.org/25699 Tested-by: Jenkins <ci@libreoffice.org> Reviewed-by: Michael Stahl <mstahl@redhat.com>
31 lines
1.1 KiB
C++
31 lines
1.1 KiB
C++
/* -*- 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/.
|
|
*/
|
|
#include "caret.hxx"
|
|
|
|
#include <o3tl/make_unique.hxx>
|
|
|
|
SmCaretPosGraph::SmCaretPosGraph() = default;
|
|
|
|
SmCaretPosGraph::~SmCaretPosGraph() = default;
|
|
|
|
SmCaretPosGraphEntry* SmCaretPosGraph::Add(SmCaretPos pos,
|
|
SmCaretPosGraphEntry* left,
|
|
SmCaretPosGraphEntry* right)
|
|
{
|
|
SAL_WARN_IF( pos.Index < 0, "starmath", "Index shouldn't be -1!" );
|
|
auto entry = o3tl::make_unique<SmCaretPosGraphEntry>(pos, left, right);
|
|
SmCaretPosGraphEntry* e = entry.get();
|
|
//Set Left and Right to point to the entry itself if they are NULL
|
|
entry->Left = entry->Left ? entry->Left : e;
|
|
entry->Right = entry->Right ? entry->Right : e;
|
|
mvEntries.push_back(std::move(entry));
|
|
return e;
|
|
}
|
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|