RGBCube/serenity
1
Fork 0
mirror of https://github.com/RGBCube/serenity synced 2025-05-31 17:58:12 +00:00
Code Issues Activity Actions

LibWeb: Make DOM::Range more suitable for JS.

Browse source
This commit is contained in:
asynts 2020-12-06 19:51:55 +01:00 • committed by Andreas Kling
parent 4df0eeaa3d
commit 10f9c85090
11 changed files with 186 additions and 69 deletions
Download patch file Download diff file Expand all files Collapse all files

18
Libraries/LibWeb/DOM/Position.cpp
View file

@ -39,24 +39,6 @@ Position::~Position()
{
}
Range Range::normalized() const
{
if (!is_valid())
return {};
if (m_start.node() == m_end.node()) {
if (m_start.offset() <= m_end.offset())
return *this;
return { m_end, m_start };
}
if (m_start.node()->is_before(*m_end.node()))
return *this;
return { m_end, m_start };
}
const LogStream& operator<<(const LogStream& stream, const Position& position)
{
if (!position.node())

32
Libraries/LibWeb/DOM/Position.h
View file

@ -62,38 +62,6 @@ private:
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&);
}

74
Libraries/LibWeb/DOM/Range.cpp Normal file
View file

@ -0,0 +1,74 @@
/*
* Copyright (c) 2020, the SerenityOS developers.
* 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.
*/
#include <LibWeb/DOM/Document.h>
#include <LibWeb/DOM/Node.h>
#include <LibWeb/DOM/Range.h>
namespace Web::DOM {
Range::Range(Document& document)
: m_start_container(document)
, m_start_offset(0)
, m_end_container(document)
, m_end_offset(0)
{
}
Range::Range(Node& start_container, size_t start_offset, Node& end_container, size_t end_offset)
: m_start_container(start_container)
, m_start_offset(start_offset)
, m_end_container(end_container)
, m_end_offset(end_offset)
{
}
NonnullRefPtr<Range> Range::clone_range() const
{
return adopt(*new Range(const_cast<Node&>(*m_start_container), m_start_offset, const_cast<Node&>(*m_end_container), m_end_offset));
}
NonnullRefPtr<Range> Range::inverted() const
{
return adopt(*new Range(const_cast<Node&>(*m_end_container), m_end_offset, const_cast<Node&>(*m_start_container), m_start_offset));
}
NonnullRefPtr<Range> Range::normalized() const
{
if (m_start_container.ptr() == m_end_container.ptr()) {
if (m_start_offset <= m_end_offset)
return clone_range();
return inverted();
}
if (m_start_container->is_before(m_end_container))
return clone_range();
return inverted();
}
}

87
Libraries/LibWeb/DOM/Range.h Normal file
View file

@ -0,0 +1,87 @@
/*
* Copyright (c) 2020, the SerenityOS developers.
* 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/RefCounted.h>
#include <LibWeb/Bindings/Wrappable.h>
namespace Web::DOM {
class Range final
: public RefCounted<Range>
, public Bindings::Wrappable {
public:
// using WrapperType = Bindings::RangeWrapper;
static NonnullRefPtr<Range> create(Document& document)
{
return adopt(*new Range(document));
}
static NonnullRefPtr<Range> create(Node& start_container, size_t start_offset, Node& end_container, size_t end_offset)
{
return adopt(*new Range(start_container, start_offset, end_container, end_offset));
}
Node* start_container() { return m_start_container; }
unsigned start_offset() { return m_start_offset; }
Node* end_container() { return m_end_container; }
unsigned end_offset() { return m_end_offset; }
bool collapsed()
{
return start_container() == end_container() && start_offset() == end_offset();
}
void set_start(Node& container, JS::Value& offset)
{
m_start_container = container;
m_start_offset = (unsigned)offset.as_i32();
}
void set_end(Node& container, JS::Value& offset)
{
m_end_container = container;
m_end_offset = (unsigned)offset.as_i32();
}
NonnullRefPtr<Range> inverted() const;
NonnullRefPtr<Range> normalized() const;
NonnullRefPtr<Range> clone_range() const;
private:
explicit Range(Document&);
Range(Node& start_container, size_t start_offset, Node& end_container, size_t end_offset);
NonnullRefPtr<Node> m_start_container;
unsigned m_start_offset;
NonnullRefPtr<Node> m_end_container;
unsigned m_end_offset;
};
}