mirror of
https://github.com/RGBCube/serenity
synced 2025-05-22 22:05:07 +00:00
99 lines
2.9 KiB
C++
99 lines
2.9 KiB
C++
/*
|
|
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/RefPtr.h>
|
|
#include <LibWeb/DOM/Node.h>
|
|
#include <LibWeb/Forward.h>
|
|
|
|
namespace Web::DOM {
|
|
|
|
class Position {
|
|
public:
|
|
Position() { }
|
|
Position(Node&, unsigned offset);
|
|
|
|
~Position();
|
|
|
|
bool is_valid() const { return m_node; }
|
|
|
|
Node* node() { return m_node; }
|
|
const Node* node() const { return m_node; }
|
|
|
|
unsigned offset() const { return m_offset; }
|
|
void set_offset(unsigned value) { m_offset = value; }
|
|
|
|
bool operator==(const Position& other) const
|
|
{
|
|
return m_node == other.m_node && m_offset == other.m_offset;
|
|
}
|
|
|
|
bool operator!=(const Position& other) const
|
|
{
|
|
return !(*this == other);
|
|
}
|
|
|
|
private:
|
|
RefPtr<Node> m_node;
|
|
unsigned m_offset { 0 };
|
|
};
|
|
|
|
class Range {
|
|
public:
|
|
Range() = default;
|
|
Range(const Position& start, const Position& end)
|
|
: m_start(start)
|
|
, m_end(end)
|
|
{
|
|
}
|
|
|
|
bool is_valid() const { return m_start.is_valid() && m_end.is_valid(); }
|
|
|
|
void set(const Position& start, const Position& end)
|
|
{
|
|
m_start = start;
|
|
m_end = end;
|
|
}
|
|
|
|
void set_start(const Position& start) { m_start = start; }
|
|
void set_end(const Position& end) { m_end = end; }
|
|
|
|
const Position& start() const { return m_start; }
|
|
Position& start() { return m_start; }
|
|
|
|
const Position& end() const { return m_end; }
|
|
Position& end() { return m_end; }
|
|
|
|
Range normalized() const;
|
|
|
|
private:
|
|
Position m_start, m_end;
|
|
};
|
|
|
|
const LogStream& operator<<(const LogStream&, const Position&);
|
|
|
|
}
|