<commit_before>#![crate_id="fibonacci#1.1"]
#![crate_type = "lib"]
#![license = "MIT"]
#![desc = "Fibonacci library" ]
#![comment = "Example of library: compute Fibonacci"]
#![deny(missing_doc)]
//! Compute fibonacci.
//!
//! @license MIT license <http://www.opensource.org/licenses/mit-license.php>
//!
//! @author Eliovir <http://github.com/~eliovir>

extern crate test;

#[cfg(test)]
use test::BenchHarness;

/**
* Calcule les elements de la suite de Fibonnaci.<commit_msg>fibonacci.rs : add description.<commit_after>#![crate_id="fibonacci#1.1"]
#![crate_type = "lib"]
#![license = "MIT"]
#![desc = "Fibonacci library" ]
#![comment = "Example of library: compute Fibonacci"]
#![deny(missing_doc)]
//! Compute fibonacci.
//!
//! The Fibonacci sequence is a sequence of numbers starting with 0 and 1 where every subsequent number is the sum of the previous two numbers.
//!
//! @license MIT license <http://www.opensource.org/licenses/mit-license.php>
//!
//! @author Eliovir <http://github.com/~eliovir>

extern crate test;

#[cfg(test)]
use test::BenchHarness;

/**
* Calcule les elements de la suite de Fibonnaci.
{'fraction_non_alphanumeric': 0.18425760286225404, 'fraction_numerical': 0.005366726296958855, 'mean_word_length': 4.768041237113402, 'pattern_counts': {'":': 0, '<': 7, '<?xml version=': 0, '>': 7, 'https://': 0, 'lorem ipsum': 0, 'www.': 2, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '2913608', 'n_tokens_mistral': 409, 'n_tokens_neox': 382, 'n_words': 102}