<commit_before>/**
 * Provides the classes for a half-edge data structure. 
 * 
 * <h3>Cell decompositions of surfaces</h3>
 * 
 * Half-edge data structures are used primarily to represent cell decompositions of oriented surfaces.
 * <p>
 * <small>We say "primarily" because half-edge data structures can be used to represent somewhat more 
 * general combinatorial structures, such as, for example, a checker board surface with white squares removed.
 * </small>
 * <p>
 * Here, <i>surface</i> means <i>two-dimensional manifold, possibly with boundary</i>; 
 * and a <i>cell decomposition of a surface</i> is a graph embedded in the surface such that the 
 * complement of the graph is (topologically) a disjoint union of open disks.
 * The term <i>map on a surface</i> means the same. 
 * Thus, a cell decomposition decomposes a surface into <i>vertices</i>, <i>edges</i>, and <i>faces</i>.
 * 
 * <h3>Regular and strongly regular</h3>
 * 
 * A cell decomposition of a surface is called <i>regular</i>, if it has no loops (edges with the same vertex <commit_msg>teaser html-comment for jtem website generation<commit_after>/**
 * <!-- teaser start -->
 * Provides the classes for a half-edge data structure. 
 * <!-- teaser end -->
 * 
 * <h3>Cell decompositions of surfaces</h3>
 * 
 * Half-edge data structures are used primarily to represent cell decompositions of oriented surfaces.
 * <p>
 * <small>We say "primarily" because half-edge data structures can be used to represent somewhat more 
 * general combinatorial structures, such as, for example, a checker board surface with white squares removed.
 * </small>
 * <p>
 * Here, <i>surface</i> means <i>two-dimensional manifold, possibly with boundary</i>; 
 * and a <i>cell decomposition of a surface</i> is a graph embedded in the surface such that the 
 * complement of the graph is (topologically) a disjoint union of open disks.
 * The term <i>map on a surface</i> means the same. 
 * Thus, a cell decomposition decomposes a surface into <i>vertices</i>, <i>edges</i>, and <i>faces</i>.
 * 
 * <h3>Regular and strongly regular</h3>
 * 
 * A cell decomposition of a surface is called <i>regular</i>, if it has no loops (edges with the same vertex 
{'fraction_non_alphanumeric': 0.10633484162895927, 'fraction_numerical': 0.0036199095022624436, 'mean_word_length': 3.9909706546275396, 'pattern_counts': {'":': 0, '<': 53, '<?xml version=': 0, '>': 53, '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': '3817327', 'n_tokens_mistral': 641, 'n_tokens_neox': 604, 'n_words': 287}