h.ST_Agraphinfo_t Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of plantuml-asl Show documentation
Show all versions of plantuml-asl Show documentation
PlantUML is a component that allows to quickly write diagrams from text.
The newest version!
// THIS FILE HAS BEEN GENERATED BY A PREPROCESSOR.
/* +=======================================================================
* |
* | PlantUML : a free UML diagram generator
* |
* +=======================================================================
*
* (C) Copyright 2009-2024, Arnaud Roques
*
* Project Info: https://plantuml.com
*
* If you like this project or if you find it useful, you can support us at:
*
* https://plantuml.com/patreon (only 1$ per month!)
* https://plantuml.com/liberapay (only 1€ per month!)
* https://plantuml.com/paypal
*
*
* PlantUML is free software; you can redistribute it and/or modify it
* under the terms of the Apache Software License.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
* PlantUML can occasionally display sponsored or advertising messages. Those
* messages are usually generated on welcome or error images and never on
* functional diagrams.
* See https://plantuml.com/professional if you want to remove them
*
* Images (whatever their format : PNG, SVG, EPS...) generated by running PlantUML
* are owned by the author of their corresponding sources code (that is, their
* textual description in PlantUML language). Those images are not covered by
* this APACHE license.
*
* The generated images can then be used without any reference to the APACHE license.
* It is not even necessary to stipulate that they have been generated with PlantUML,
* although this will be appreciated by the PlantUML team.
*
* There is an exception : if the textual description in PlantUML language is also covered
* by any license, then the generated images are logically covered
* by the very same license.
*
* This is the IGY distribution (Install GraphViz by Yourself).
* You have to install GraphViz and to setup the GRAPHVIZ_DOT environment variable
* (see https://plantuml.com/graphviz-dot )
*
* Icons provided by OpenIconic : https://useiconic.com/open
* Archimate sprites provided by Archi : http://www.archimatetool.com
* Stdlib AWS provided by https://github.com/milo-minderbinder/AWS-PlantUML
* Stdlib Icons provided https://github.com/tupadr3/plantuml-icon-font-sprites
* ASCIIMathML (c) Peter Jipsen http://www.chapman.edu/~jipsen
* ASCIIMathML (c) David Lippman http://www.pierce.ctc.edu/dlippman
* CafeUndZopfli ported by Eugene Klyuchnikov https://github.com/eustas/CafeUndZopfli
* Brotli (c) by the Brotli Authors https://github.com/google/brotli
* Themes (c) by Brett Schwarz https://github.com/bschwarz/puml-themes
* Twemoji (c) by Twitter at https://twemoji.twitter.com/
*
*/
package h;
import smetana.core.CArray;
import smetana.core.CArrayOfStar;
import smetana.core.CFunction;
//typedef struct Agraphinfo_t {
//Agrec_t hdr;
///* to generate code */
//layout_t *drawing;
//textlabel_t *label; /* if the cluster has a title */
//boxf bb; /* bounding box */
//pointf border[4]; /* sizes of margins for graph labels */
//unsigned char gui_state; /* Graph state for GUI ops */
//unsigned char has_labels;
//boolean has_images;
//unsigned char charset; /* input character set */
//int rankdir;
//double ht1, ht2; /* below and above extremal ranks */
//unsigned short flags;
//void *alg;
//GVC_t *gvc; /* context for "globals" over multiple graphs */
//void (*cleanup) (graph_t * g); /* function to deallocate layout-specific data */
//
//
///* to place nodes */
//node_t **neato_nlist;
//int move;
//double **dist, **spring, **sum_t, ***t;
//unsigned short ndim;
//unsigned short odim;
//
//
///* to have subgraphs */
//int n_cluster;
//graph_t **clust; /* clusters are in clust[1..n_cluster] !!! */
//graph_t *dotroot;
//node_t *nlist;
//rank_t *rank;
//graph_t *parent; /* containing cluster (not parent subgraph) */
//int level; /* cluster nesting level (not node level!) */
//node_t *minrep, *maxrep; /* set leaders for min and max rank */
//
///* fast graph node list */
//nlist_t comp;
///* connected components */
//node_t *minset, *maxset; /* set leaders */
//long n_nodes;
///* includes virtual */
//short minrank, maxrank;
//
///* various flags */
//boolean has_flat_edges;
//boolean has_sourcerank;
//boolean has_sinkrank;
//unsigned char showboxes;
//fontname_kind fontnames; /* to override mangling in SVG */
//
//int nodesep, ranksep;
//node_t *ln, *rn; /* left, right nodes of bounding box */
//
///* for clusters */
//node_t *leader, **rankleader;
//boolean expanded;
//char installed;
//char set_type;
//char label_pos;
//boolean exact_ranksep;
//
//
//} Agraphinfo_t;
final public class ST_Agraphinfo_t extends ST_Agrec_s {
// /* to generate code */
public ST_layout_t drawing;
public ST_textlabel_t label; /* if the cluster has a title */
public final ST_boxf bb = new ST_boxf(); /* bounding box */
// pointf border[4]; /* sizes of margins for graph labels */
public final ST_pointf border[] = new ST_pointf[] { new ST_pointf(), new ST_pointf(), new ST_pointf(),
new ST_pointf() };
// unsigned char gui_state; /* Graph state for GUI ops */
public int has_labels;
// boolean has_images;
public int charset; /* input character set */
public int rankdir;
public double ht1, ht2; /* below and above extremal ranks */
public int flags;
// void *alg;
public ST_GVC_s gvc; /* context for "globals" over multiple graphs */
public CFunction cleanup;
// void (*cleanup) (graph_t * g); /* function to deallocate layout-specific data */
//
//
// /* to place nodes */
// node_t **neato_nlist;
// int move;
// double **dist, **spring, **sum_t, ***t;
// unsigned short ndim;
// unsigned short odim;
//
//
// /* to have subgraphs */
public int n_cluster;
// graph_t **clust; /* clusters are in clust[1..n_cluster] !!! */
public CArrayOfStar clust;
public ST_Agraph_s dotroot;
public ST_Agnode_s nlist;
public CArray rank;
public ST_Agraph_s parent; /* containing cluster (not parent subgraph) */
// int level; /* cluster nesting level (not node level!) */
// node_t *minrep, *maxrep; /* set leaders for min and max rank */
//
// /* fast graph node list */
public final ST_nlist_t comp = new ST_nlist_t();
// /* connected components */
public ST_Agnode_s minset, maxset; /* set leaders */
public int n_nodes;
// /* includes virtual */
public int minrank, maxrank;
//
// /* various flags */
public int has_flat_edges;
// boolean has_sourcerank;
// boolean has_sinkrank;
public int showboxes;
public int fontnames; /* to override mangling in SVG */
//
public int nodesep, ranksep;
public ST_Agnode_s ln, rn; /* left, right nodes of bounding box */
//
// /* for clusters */
// node_t *leader, **rankleader;
public ST_Agnode_s leader;
public CArrayOfStar rankleader;
public boolean expanded;
public int installed;
public int set_type;
public int label_pos;
public int exact_ranksep;
}