mirror of
https://github.com/lightpanda-io/browser.git
synced 2025-12-18 18:08:10 +00:00
103 lines
2.9 KiB
Zig
103 lines
2.9 KiB
Zig
// Copyright (C) 2023-2024 Lightpanda (Selecy SAS)
|
|
//
|
|
// Francis Bouvier <francis@lightpanda.io>
|
|
// Pierre Tachoire <pierre@lightpanda.io>
|
|
//
|
|
// This program is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU Affero General Public License as
|
|
// published by the Free Software Foundation, either version 3 of the
|
|
// License, or (at your option) any later version.
|
|
//
|
|
// This program is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU Affero General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Affero General Public License
|
|
// along with this program. If not, see <https://www.gnu.org/licenses/>.
|
|
|
|
const std = @import("std");
|
|
|
|
const parser = @import("netsurf");
|
|
|
|
// Node implementation with Netsurf Libdom C lib.
|
|
pub const Node = struct {
|
|
node: *parser.Node,
|
|
|
|
pub fn firstChild(n: Node) !?Node {
|
|
const c = try parser.nodeFirstChild(n.node);
|
|
if (c) |cc| return .{ .node = cc };
|
|
|
|
return null;
|
|
}
|
|
|
|
pub fn lastChild(n: Node) !?Node {
|
|
const c = try parser.nodeLastChild(n.node);
|
|
if (c) |cc| return .{ .node = cc };
|
|
|
|
return null;
|
|
}
|
|
|
|
pub fn nextSibling(n: Node) !?Node {
|
|
const c = try parser.nodeNextSibling(n.node);
|
|
if (c) |cc| return .{ .node = cc };
|
|
|
|
return null;
|
|
}
|
|
|
|
pub fn prevSibling(n: Node) !?Node {
|
|
const c = try parser.nodePreviousSibling(n.node);
|
|
if (c) |cc| return .{ .node = cc };
|
|
|
|
return null;
|
|
}
|
|
|
|
pub fn parent(n: Node) !?Node {
|
|
const c = try parser.nodeParentNode(n.node);
|
|
if (c) |cc| return .{ .node = cc };
|
|
|
|
return null;
|
|
}
|
|
|
|
pub fn isElement(n: Node) bool {
|
|
const t = parser.nodeType(n.node) catch return false;
|
|
return t == .element;
|
|
}
|
|
|
|
pub fn isDocument(n: Node) bool {
|
|
const t = parser.nodeType(n.node) catch return false;
|
|
return t == .document;
|
|
}
|
|
|
|
pub fn isComment(n: Node) bool {
|
|
const t = parser.nodeType(n.node) catch return false;
|
|
return t == .comment;
|
|
}
|
|
|
|
pub fn isText(n: Node) bool {
|
|
const t = parser.nodeType(n.node) catch return false;
|
|
return t == .text;
|
|
}
|
|
|
|
pub fn isEmptyText(n: Node) !bool {
|
|
const data = try parser.nodeTextContent(n.node);
|
|
if (data == null) return true;
|
|
if (data.?.len == 0) return true;
|
|
|
|
return std.mem.trim(u8, data.?, &std.ascii.whitespace).len == 0;
|
|
}
|
|
|
|
pub fn tag(n: Node) ![]const u8 {
|
|
return try parser.nodeName(n.node);
|
|
}
|
|
|
|
pub fn attr(n: Node, key: []const u8) !?[]const u8 {
|
|
if (!n.isElement()) return null;
|
|
return try parser.elementGetAttribute(parser.nodeToElement(n.node), key);
|
|
}
|
|
|
|
pub fn eql(a: Node, b: Node) bool {
|
|
return a.node == b.node;
|
|
}
|
|
};
|