Cylon is a library for reading robots.txt files.
There is no universal standard for what rules a web crawler
is required to support in a robots.txt file. Cylon supports
the following directives (notably Site-map
is missing):
User-agent
Allow
Disallow
Crawl-Delay
In addition, Cylon supports *
as a wildcard character to
match any length substring of 0 or more characters, as well
as the $
character to match the end of a path.
Using Cylon is very simple. Simply create a new compiler for your user agent, then compile the robots.txt file.
// You can use something like hyper or reqwest to download
// the robots.txt file instead.
let example_robots = r#"
User-agent: googlebot
Allow: /
User-agent: *
Disallow: /
"#
.as_bytes();
// Create a new compiler that compiles a robots.txt file looking for
// rules that apply to the "googlebot" user agent.
let compiler = Compiler::new("googlebot");
let cylon = compiler.compile(example_robots).await.unwrap();
assert_eq!(true, cylon.allow("/index.html"));
assert_eq!(true, cylon.allow("/directory"));
// Create a new compiler that compiles a robots.txt file looking for
// rules that apply to the "bing" user agent.
let complier = Compiler::new("bing");
let cylon = compiler.compile(example_robots).await.unwrap();
assert_eq!(false, cylon.allow("/index.html"));
assert_eq!(false, cylon.allow("/directory"));
Contributions are welcome! Please make a pull request. Issues may not be addressed in a timely manner unless they expose fundamental issues or security concerns.
This library uses an async API by default. This library does not assume any async runtime so you can use it with any (tokio, async-std, etc.)
A synchronous API may be an optional feature in the future, but there are no current plans to add one. If you need a synchronous API consider adding one yourself (contributions are welcome).
Cylon compiles robots.txt files into very efficient DFAs. This means it is well-suited for web crawlers that need to use the same robots.txt file for multiple URLs.
The compiler avoids any random memory access when compiling the DFA (e.g. by not using hashmaps or tree structures.) so it has very good cache-locality.
The DFA can match input paths in roughly O(n) time, where n is the length of the input path. (Compare that to the alternative O(n * m) complexity of matching the input path against every rule in the robots.txt file.)
This library uses serde to allow serializing/deserializing the compiled Cylon DFA structs. This is useful e.g. if you need to cache the DFA in something like Memcached or Redis. (Use a format like bincode or msgpack to convert it to bytes first.)
Robots.txt files are more like guidelines than actual rules.
In general, Cylon tries not to cause errors for things that might be considered an invalid robots.txt file, which means there are very few failure cases.
MIT