blob: 31f4df0e98d748de1266b69e0d2fd163cfc2470b (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
/*
* Ricochet - A minimalist CLI web browser for fast, distraction-free navigation.
* Copyright (C) 2026 Richard Qin
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include "ricochet/core/browser.hh"
#include "ricochet/net/http_client.hh"
#include "ricochet/parser/html_lexer.hh"
#include "ricochet/parser/tree_builder.hh"
#include "ricochet/render/renderer.hh"
#include <iostream>
// namespace {
// void print_dom_tree( const ricochet::parser::DomNode& node, std::size_t depth = 0 ) // NOLINT(misc-no-recursion)
// {
// const std::string indent( depth * 2, ' ' );
// if ( node.tag_name.empty() ) {
// std::cout << indent << "\"" << node.text_content << "\"\n";
// } else {
// std::cout << indent << "<" << node.tag_name << ">\n";
// for ( const auto& child : node.children ) {
// print_dom_tree( child, depth + 1 );
// }
// }
// }
// } // namespace
namespace ricochet::core {
int Browser::run( std::string_view initial_url )
{
std::cout << "-> Fetching: " << initial_url << "...\n";
const net::HttpClient client;
auto response_result = client.fetch( initial_url );
if ( !response_result.has_value() ) {
std::cerr << "[!] Ricochet failed to load page: " << response_result.error() << "\n";
return 1;
}
const auto& response = response_result.value();
const parser::HtmlLexer lexer;
const auto tokens = lexer.tokenize( response.body );
const parser::TreeBuilder builder;
const auto dom_root = builder.build( tokens );
// std::cout << "\033[2J\033[1;1H";
const render::Renderer renderer;
renderer.render( dom_root );
return 0;
}
} // namespace ricochet::core
|
