legacy/oldhypermap/ch_hypermap/hypermap_summary.hl

   1 (* summary of hypermap.ml file *)
   2
   3 permutes;;
   4
   5 (* `orbit_map f x` set of iterates of x under f. *)
   6 exist_hypermap;;  (* existence theorem for hypermap type *)
   7 hypermap_tybij;;  (* type construction of hypermap *)
   8 dart;; (* extracts darts *)
   9 edge_map;; (* extracts edge_map *)
  10 node_map;; (* extracts node_map *)
  11 face_map;; (* extracts face_map *)
  12
  13 edge;; (* orbit under edge map *)
  14 node;;  (* orbit under node map *)
  15 face ;; (* orbit under face map *)
  16
  17 (* paths done by a new recursive definition *)
  18 comb_component;; (* combinatorial component *)
  19 set_of_orbits;;  (* of a permutation f *)
  20 number_of_orbits;; (* cardinality *)
  21
  22 edge_set;; (* set of all edges *)
  23 node_set;;
  24 face_set;;
  25 set_of_components;; (* set of all combinatorial components *)
  26
  27 number_of_edges;;
  28 number_of_nodes;;
  29 number_of_faces;;
  30 number_of_components;;
  31
  32 plain_hypermap;;
  33 planar_hypermap;;
  34 simple_hypermap;;
  35
  36 dart_degenerate;;
  37 dart_nondegenerate;;
  38
  39 connected_hypermap;;
  40
  41 edge_path;; (* `edge_path  H x i = e^i x` *)
  42 node_path;;
  43 face_path;;
  44
  45 (* contour path stuff.... *)
  46
  47 shift;;  (* rotates e,n,f by triality *)
  48
  49 (* walkup transformations *)
  50
  51
  52 iso;; (* isomorphism of hypermap *)