<commit_before>/**
 * hopcroftkarp.h
 * Implementation of Hopcroft-Karp algorithm for maximum
 * matching in a bipartite graph.
 *
 * Copyright (c) 2014 <NAME>
 * license http://opensource.org/licenses/gpl-license.php GNU Public License
 *
 * Author <NAME>
 * Since 2014-05-29
 */

#ifndef MAXMATCH_H
#define MAXMATCH_H

#include "index.h"<commit_msg>Change comment.<commit_after>/**
 * maxmatch.h
 * Maximum matching of a bipartite graph.
 *
 * Copyright (c) 2014 <NAME>
 * license http://opensource.org/licenses/gpl-license.php GNU Public License
 *
 * Author <NAME>
 * Since 2014-05-29
 */

#ifndef MAXMATCH_H
#define MAXMATCH_H

#include "index.h"
{'fraction_non_alphanumeric': 0.12749615975422426, 'fraction_numerical': 0.03686635944700461, 'mean_word_length': 3.9770992366412212, 'pattern_counts': {'":': 0, '<': 7, '<?xml version=': 0, '>': 7, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, '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': '342981', 'n_tokens_mistral': 245, 'n_tokens_neox': 212, 'n_words': 59}