lemongraph 0.0.1

data/ext/lemongraph/lemongraph.hh

@@ -0,0 +1,295 @@
+/* Copyright (C) 2022 Théotime Bollengier <theotime.bollengier@ensta-bretagne.fr>
+ *
+ * This file is part of LemonGraph. <https://gitlab.ensta-bretagne.fr/bollenth/lemongraph>
+ *
+ * LemonGraph is free software: you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License as published
+ * by the Free Software Foundation, either version 3 of the License,
+ * or (at your option) any later version.
+ *
+ * LemonGraph is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ * See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with LemonGraph. If not, see <https://www.gnu.org/licenses/>. 
+ */
+
+#ifndef LEMONGRAPH_hh
+#define LEMONGRAPH_hh
+
+#include <ruby.h>
+#include <lemon/list_graph.h>
+#include "lemongraph_export.hh"
+
+namespace LemonGraph {
+	class RBValue {
+		public:
+			VALUE value;
+			RBValue() : value(Qundef) {}
+			RBValue(VALUE v) : value(v) {}
+			RBValue(const RBValue& o) : value(o.value) {}
+			bool is_valid() const { return (value != Qundef); }
+			RBValue& operator=(const RBValue& v) { value = v.value; return *this; }
+			RBValue& operator=(VALUE v) { value = v; return *this; }
+	};
+}
+
+
+LEMONGRAPH_LOCAL extern VALUE m_LemonGraph;
+LEMONGRAPH_LOCAL extern VALUE c_GraphItem;
+LEMONGRAPH_LOCAL extern VALUE c_Digraph;
+LEMONGRAPH_LOCAL extern VALUE c_DiNode;
+LEMONGRAPH_LOCAL extern VALUE c_DiArc;
+LEMONGRAPH_LOCAL extern VALUE c_Graph;
+LEMONGRAPH_LOCAL extern VALUE c_UnNode;
+LEMONGRAPH_LOCAL extern VALUE c_UnEdge;
+LEMONGRAPH_LOCAL extern VALUE c_UnArc;
+LEMONGRAPH_LOCAL extern VALUE c_NodeMap;
+LEMONGRAPH_LOCAL extern VALUE c_ArcMap;
+LEMONGRAPH_LOCAL extern VALUE c_EdgeMap;
+
+LEMONGRAPH_LOCAL extern ID id_comp;
+LEMONGRAPH_LOCAL extern ID id_eqeq;
+
+
+LEMONGRAPH_LOCAL VALUE lemongraph_graphitem_initialize(VALUE self, VALUE id, VALUE graph);
+LEMONGRAPH_LOCAL VALUE lemongraph_graphitem_is_equal(VALUE self, VALUE other);
+LEMONGRAPH_LOCAL VALUE lemongraph_graphitem_is_notequal(VALUE self, VALUE other);
+LEMONGRAPH_LOCAL VALUE lemongraph_graphitem_compare(VALUE self, VALUE other);
+
+
+/************************ Digraph *********************************************/
+
+
+LEMONGRAPH_LOCAL extern const rb_data_type_t lemongraph_digraph_type;
+
+inline lemon::ListDigraph& lemongraph_digraph_rb2ref(VALUE obj) {
+	lemon::ListDigraph *g;
+	TypedData_Get_Struct(obj, lemon::ListDigraph, &lemongraph_digraph_type, g);
+	return *g;
+}
+
+LEMONGRAPH_LOCAL void lemongraph_digraph_raise_if_not_valid_node(const lemon::ListDigraph& digraph, VALUE rbdigraph, VALUE node);
+LEMONGRAPH_LOCAL VALUE lemongraph_digraph_alloc(VALUE klass);
+LEMONGRAPH_LOCAL VALUE lemongraph_digraph_initialize_copy(VALUE self, VALUE orig);
+LEMONGRAPH_LOCAL VALUE lemongraph_digraph_add_node(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_digraph_add_arc(VALUE self, VALUE s, VALUE t);
+LEMONGRAPH_LOCAL VALUE lemongraph_digraph_item_is_valid(VALUE self, VALUE item);
+LEMONGRAPH_LOCAL VALUE lemongraph_digraph_erase_nodearc(VALUE self, VALUE item);
+LEMONGRAPH_LOCAL VALUE lemongraph_digraph_clear(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_digraph_nb_nodes(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_digraph_nodes(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_digraph_each_node(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_digraph_nb_arcs(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_digraph_arcs(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_digraph_each_arc(VALUE self);
+
+
+inline lemon::ListDigraph::Node lemongraph_rbdinode2dinode(VALUE rbnode) {
+	return lemon::ListDigraph::nodeFromId(NUM2INT(rb_iv_get(rbnode, "@id")));
+}
+
+LEMONGRAPH_LOCAL VALUE lemongraph_make_dinode(const lemon::ListDigraph::Node& node, VALUE graph);
+LEMONGRAPH_LOCAL VALUE lemongraph_dinode_initialize(VALUE self, VALUE id, VALUE graph);
+LEMONGRAPH_LOCAL VALUE lemongraph_dinode_is_valid(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_dinode_erase(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_dinode_split(int argc, VALUE *argv, VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_dinode_contract(int argc, VALUE *argv, VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_dinode_nb_inarcs(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_dinode_inarcs(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_dinode_each_inarc(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_dinode_nb_outarcs(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_dinode_outarcs(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_dinode_each_outarc(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_dinode_arc_to(VALUE self, VALUE target);
+LEMONGRAPH_LOCAL VALUE lemongraph_dinode_arc_from(VALUE self, VALUE source);
+LEMONGRAPH_LOCAL VALUE lemongraph_dinode_opposite(VALUE self, VALUE arc);
+
+
+inline lemon::ListDigraph::Arc lemongraph_rbdiarc2diarc(VALUE rbarc) {
+	return lemon::ListDigraph::arcFromId(NUM2INT(rb_iv_get(rbarc, "@id")));
+}
+
+LEMONGRAPH_LOCAL VALUE lemongraph_make_diarc(const lemon::ListDigraph::Arc& arc, VALUE graph);
+LEMONGRAPH_LOCAL VALUE lemongraph_diarc_initialize(VALUE self, VALUE id, VALUE graph);
+LEMONGRAPH_LOCAL VALUE lemongraph_diarc_is_valid(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_diarc_erase(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_diarc_change_target(VALUE self, VALUE node);
+LEMONGRAPH_LOCAL VALUE lemongraph_diarc_change_source(VALUE self, VALUE node);
+LEMONGRAPH_LOCAL VALUE lemongraph_diarc_source(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_diarc_target(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_diarc_reverse(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_diarc_split(VALUE self);
+
+
+/****************************** Graph *****************************************/
+
+
+LEMONGRAPH_LOCAL extern const rb_data_type_t lemongraph_graph_type;
+
+inline lemon::ListGraph& lemongraph_graph_rb2ref(VALUE obj) {
+	lemon::ListGraph *g;
+	TypedData_Get_Struct(obj, lemon::ListGraph, &lemongraph_graph_type, g);
+	return *g;
+}
+
+LEMONGRAPH_LOCAL void lemongraph_graph_raise_if_not_valid_node(const lemon::ListGraph& graph, VALUE rbgraph, VALUE node);
+LEMONGRAPH_LOCAL VALUE lemongraph_graph_alloc(VALUE klass);
+LEMONGRAPH_LOCAL VALUE lemongraph_graph_initialize_copy(VALUE self, VALUE orig);
+LEMONGRAPH_LOCAL VALUE lemongraph_graph_add_node(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_graph_add_edge(VALUE self, VALUE u, VALUE v);
+LEMONGRAPH_LOCAL VALUE lemongraph_graph_item_is_valid(VALUE self, VALUE item);
+LEMONGRAPH_LOCAL VALUE lemongraph_graph_erase_item(VALUE self, VALUE item);
+LEMONGRAPH_LOCAL VALUE lemongraph_graph_clear(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_graph_nb_nodes(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_graph_nodes(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_graph_each_node(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_graph_nb_edges(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_graph_edges(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_graph_each_edge(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_graph_nb_arcs(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_graph_arcs(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_graph_each_arc(VALUE self);
+
+
+inline lemon::ListGraph::Node lemongraph_rbunnode2unnode(VALUE rbnode) {
+	return lemon::ListGraph::nodeFromId(NUM2INT(rb_iv_get(rbnode, "@id")));
+}
+
+LEMONGRAPH_LOCAL VALUE lemongraph_make_unnode(const lemon::ListGraph::Node& node, VALUE graph);
+LEMONGRAPH_LOCAL VALUE lemongraph_unnode_initialize(VALUE self, VALUE id, VALUE graph);
+LEMONGRAPH_LOCAL VALUE lemongraph_unnode_is_valid(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unnode_erase(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unnode_contract(int argc, VALUE *argv, VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unnode_nb_edges(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unnode_edges(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unnode_each_edge(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unnode_nb_inarcs(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unnode_inarcs(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unnode_each_inarc(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unnode_nb_outarcs(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unnode_outarcs(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unnode_each_outarc(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unnode_edge_to(VALUE self, VALUE node);
+LEMONGRAPH_LOCAL VALUE lemongraph_unnode_edge_from(VALUE self, VALUE node);
+LEMONGRAPH_LOCAL VALUE lemongraph_unnode_opposite(VALUE self, VALUE edge);
+
+
+inline lemon::ListGraph::Edge lemongraph_rbunedge2unedge(VALUE rbedge) {
+	return lemon::ListGraph::edgeFromId(NUM2INT(rb_iv_get(rbedge, "@id")));
+}
+
+LEMONGRAPH_LOCAL VALUE lemongraph_make_unedge(const lemon::ListGraph::Edge& edge, VALUE graph);
+LEMONGRAPH_LOCAL VALUE lemongraph_unedge_initialize(VALUE self, VALUE id, VALUE graph);
+LEMONGRAPH_LOCAL VALUE lemongraph_unedge_is_valid(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unedge_erase(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unedge_u(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unedge_v(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unedge_change_u(VALUE self, VALUE node);
+LEMONGRAPH_LOCAL VALUE lemongraph_unedge_change_v(VALUE self, VALUE node);
+LEMONGRAPH_LOCAL VALUE lemongraph_unedge_arc1(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unedge_arc2(VALUE self);
+
+
+inline lemon::ListGraph::Arc lemongraph_rbunarc2unarc(VALUE rbarc) {
+	return lemon::ListGraph::arcFromId(NUM2INT(rb_iv_get(rbarc, "@id")));
+}
+
+LEMONGRAPH_LOCAL VALUE lemongraph_make_unarc(const lemon::ListGraph::Arc& arc, VALUE graph);
+LEMONGRAPH_LOCAL VALUE lemongraph_unarc_initialize(VALUE self, VALUE id, VALUE graph);
+LEMONGRAPH_LOCAL VALUE lemongraph_unarc_is_valid(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unarc_source(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unarc_target(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_unarc_opposite(VALUE self);
+
+
+/****************************** NodeMap ***************************************/
+
+
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_alloc(VALUE klass);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_initialize(int argc, VALUE *argv, VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_initialize_copy(VALUE self, VALUE orig);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_graph(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_get_dflt_val(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_set_dflt_val(VALUE self, VALUE dflt);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_get_dflt_proc(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_set_dflt_proc(VALUE self, VALUE proc);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_get(VALUE self, VALUE key);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_set(VALUE self, VALUE key, VALUE value);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_nodes(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_values(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_length(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_each_node(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_each_value(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_each_pair(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_clear(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_delete(VALUE self, VALUE key);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_delete_if(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_is_empty(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_has_node(VALUE self, VALUE node);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_has_value(VALUE self, VALUE value);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_is_equal(VALUE self, VALUE other);
+LEMONGRAPH_LOCAL VALUE lemongraph_nodemap_hash(VALUE self);
+
+
+/****************************** ArcMap ****************************************/
+
+
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_alloc(VALUE klass);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_initialize(int argc, VALUE *argv, VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_initialize_copy(VALUE self, VALUE orig);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_graph(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_get_dflt_val(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_set_dflt_val(VALUE self, VALUE dflt);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_get_dflt_proc(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_set_dflt_proc(VALUE self, VALUE proc);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_get(VALUE self, VALUE key);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_set(VALUE self, VALUE key, VALUE value);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_arcs(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_values(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_length(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_each_arc(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_each_value(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_each_pair(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_clear(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_delete(VALUE self, VALUE key);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_delete_if(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_is_empty(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_has_arc(VALUE self, VALUE arc);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_has_value(VALUE self, VALUE value);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_is_equal(VALUE self, VALUE other);
+LEMONGRAPH_LOCAL VALUE lemongraph_arcmap_hash(VALUE self);
+
+
+/****************************** EdgeMap ***************************************/
+
+
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_alloc(VALUE klass);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_initialize(int argc, VALUE *argv, VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_initialize_copy(VALUE self, VALUE orig);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_graph(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_get_dflt_val(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_set_dflt_val(VALUE self, VALUE dflt);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_get_dflt_proc(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_set_dflt_proc(VALUE self, VALUE proc);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_get(VALUE self, VALUE key);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_set(VALUE self, VALUE key, VALUE value);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_edges(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_values(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_length(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_each_edge(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_each_value(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_each_pair(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_clear(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_delete(VALUE self, VALUE key);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_delete_if(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_is_empty(VALUE self);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_has_edge(VALUE self, VALUE edge);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_has_value(VALUE self, VALUE value);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_is_equal(VALUE self, VALUE other);
+LEMONGRAPH_LOCAL VALUE lemongraph_edgemap_hash(VALUE self);
+
+
+#endif /* LEMONGRAPH_hh */

data/ext/lemongraph/lemongraph.map

@@ -0,0 +1,6 @@
+LEMONGRAPH {
+  global:
+    Init_lemongraph;
+  local:
+    *;
+};

data/ext/lemongraph/lemongraph_export.hh

@@ -0,0 +1,31 @@
+#ifndef LEMONGRAPH_EXPORT_HH
+#define LEMONGRAPH_EXPORT_HH
+
+
+#if defined _WIN32 || defined __CYGWIN__
+  #ifdef BUILDING_DLL
+    #ifdef __GNUC__
+      #define LEMONGRAPH_PUBLIC __attribute__ ((dllexport))
+    #else
+      #define LEMONGRAPH_PUBLIC __declspec(dllexport) // Note: actually gcc seems to also supports this syntax.
+    #endif
+  #else
+    #ifdef __GNUC__
+      #define LEMONGRAPH_PUBLIC __attribute__ ((dllimport))
+    #else
+      #define LEMONGRAPH_PUBLIC __declspec(dllimport) // Note: actually gcc seems to also supports this syntax.
+    #endif
+  #endif
+  #define LEMONGRAPH_LOCAL
+#else
+  #if __GNUC__ >= 4
+    #define LEMONGRAPH_PUBLIC __attribute__ ((visibility ("default")))
+    #define LEMONGRAPH_LOCAL  __attribute__ ((visibility ("hidden")))
+  #else
+    #define LEMONGRAPH_PUBLIC
+    #define LEMONGRAPH_LOCAL
+  #endif
+#endif
+
+
+#endif /* LEMONGRAPH_EXPORT_HH */