Modest — a pure C HTML renderer
Modest is a fast HTML renderer implemented as a pure C99 library with no outside dependencies.
Important announcement!
Please use the lexbor. It is stable, has more features, and — yes — it's very fast.
Now
The current version is 0.0.6 - devel
Features
- MyCORE — base module, it is used by all other modules
- MyHTML — HTML parser by specification
- MyCSS — CSS parser and modules by specification
- MyENCODING — work with character encodings, detecting encoding, convert encodings by specification
- MyFONT — work with font, metrics, calculating size and more by specification
- MyURL — URL parser by specification
- MyPORT — system depended code: threads (if build with threads, default), work with memory, io, timers
- Modest — calculating, compare, renderer
Introduction
Dependencies
None
Installation
See INSTALL.md
External Bindings and Wrappers
- Crystal wrapper for CSS Selectors (Modest Finder)
- Python binding for Modest engine (fast HTML5 parser and CSS selectors)
- Elixir/Erlang bindings
- Perl 5 HTML5::DOM module (fast HTML5 parser with DOM and CSS selectors)
- arrogant library for D programming language (fast HTML5 parser with DOM and CSS selectors)
Examples
See examples directory
AUTHOR
Alexander Borisov lex.borisov@gmail.com
COPYRIGHT AND LICENSE
Copyright (C) 2015-2017 Alexander Borisov
This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version.
This library 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
See the LICENSE file.
-
Modest describes the personality trait or behaviour of not flaunting oneself, talking oneself up or putting oneself on display. Modest behaviour can be a response to compliments, praise or follow a
-
You are given two integers l and r. Let’s call an integer x modest, if l≤x≤r. Find a string of length n, consisting of digits, which has the largest possible number of substrings, which make a modest
-
题面 题意 给出三个数 l , r , n l,r,n l,r,n，求出一个由数字组成的字符串，使其所有子串中，符合在 [ l , r ] [l,r] [l,r]内的数量最多，若有多组解，输出字典序最小的一个。 做法 首先考虑最朴素的做法，可以将[l,r]内的所有数字当作字符串加入一个AC自动机，直接在上面dp。 但是因为l和r极大，因此需要优化。发现当一个数的长度确定，并且某一个前缀也确定之后，
-
description CodeForces 定义一个正整数\(x\)是合适的当且仅当\(l\le x\le r\),其中\(l,r\le 10^{800}\)。 找到一个长度为\(n\)的数字串,使其包含合适的数作为子串的次数最多,\(n\le 2000\)。 如果有多解,输出字典序最小的那个。 solution 如果模式串的个数不多,那么直接套用AC自动机上数位dp的方法即可。 关于这一方法可
-
题目简述：给定$1 \leq l \leq r \leq 10^{800}$，求一个长度为$n \leq 2000$的数字串$s$，其含有最多的【好】子串。一个串$s$是【好】的，如果将其看做数字时无前导零且满足$l \leq s \leq r$。形式化的说，就是求 $$ \arg \max_{s \in \Sigma^n} \sum_{i=1}^n \sum_{j=i}^n [s[i] \neq
-
题意 给你一个范围 \([l,r]\) ，问长度为 \(n\) 的串最多有多少个子串满足大小在 \([l,r]\) 内。输出字典序最小的最优解。 \(1\le l \le r\le10^{800},1\le n\le 2000\) 分析 如果 \(r-l\) 较小可以将区间中所有的数字插入 AC 自动机然后 dp。 考虑数位 dp 一类做法，如果当前的前缀没有抵到上下界后面的每一位都可以随便选，
-
Some Modest Advice for Graduate Students Some Modest Advice for Graduate Students by Stephen C. Stearns Always Prepare for the Worst. Some of the greatest catastrophes in graduate education could hav
-
Modest Maps JS 是用 JavaScript 实现的显示和交互地图库。我们的目的是为那些想要在项目中是使用交互地图的设计师和开发人员们，提供一个小的、可扩展的、可定制的、免费的显示库。
-
ModestProposal 是 HTTP 工具，特性： URL 绑定 请求绑定 响应验证 JSON 格式化 JSON 解析 实体翻译 异步转换 URL 绑定 let baseURL = NSURL(string: "http://test.com")!let loginURL = baseURL.buildURL(path: "/login") // http://test.com/loginl