All Downloads are FREE. Search and download functionalities are using the official Maven repository.

h.gvrender_engine_s Maven / Gradle / Ivy

Go to download

PlantUML is a component that allows to quickly write : * sequence diagram, * use case diagram, * class diagram, * activity diagram, * component diagram, * state diagram * object diagram

The newest version!
/* ========================================================================
 * PlantUML : a free UML diagram generator
 * ========================================================================
 *
 * Project Info:  http://plantuml.com
 * 
 * If you like this project or if you find it useful, you can support us at:
 * 
 * http://plantuml.com/patreon (only 1$ per month!)
 * http://plantuml.com/paypal
 * 
 * This file is part of Smetana.
 * Smetana is a partial translation of Graphviz/Dot sources from C to Java.
 *
 * (C) Copyright 2009-2017, Arnaud Roques
 *
 * This translation is distributed under the same Licence as the original C program:
 * 
 *************************************************************************
 * Copyright (c) 2011 AT&T Intellectual Property 
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Public License v1.0
 * which accompanies this distribution, and is available at
 * http://www.eclipse.org/legal/epl-v10.html
 *
 * Contributors: See CVS logs. Details at http://www.graphviz.org/
 *************************************************************************
 *
 * THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC
 * LICENSE ("AGREEMENT"). [Eclipse Public License - v 1.0]
 * 
 * ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES
 * RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT.
 * 
 * You may obtain a copy of the License at
 * 
 * http://www.eclipse.org/legal/epl-v10.html
 * 
 * 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.
 *
 */
package h;
import java.util.Arrays;
import java.util.List;

import smetana.core.__ptr__;

//2 c9lcfmvndhmluehnjakiea1ei

public interface gvrender_engine_s extends __ptr__ {
	public static List DEFINITION = Arrays.asList(
"struct gvrender_engine_s",
"{",
"void (*begin_job) (GVJ_t * job)",
"void (*end_job) (GVJ_t * job)",
"void (*begin_graph) (GVJ_t * job)",
"void (*end_graph) (GVJ_t * job)",
"void (*begin_layer) (GVJ_t * job, char *layername,         int layerNum, int numLayers)",
"void (*end_layer) (GVJ_t * job)",
"void (*begin_page) (GVJ_t * job)",
"void (*end_page) (GVJ_t * job)",
"void (*begin_cluster) (GVJ_t * job)",
"void (*end_cluster) (GVJ_t * job)",
"void (*begin_nodes) (GVJ_t * job)",
"void (*end_nodes) (GVJ_t * job)",
"void (*begin_edges) (GVJ_t * job)",
"void (*end_edges) (GVJ_t * job)",
"void (*begin_node) (GVJ_t * job)",
"void (*end_node) (GVJ_t * job)",
"void (*begin_edge) (GVJ_t * job)",
"void (*end_edge) (GVJ_t * job)",
"void (*begin_anchor) (GVJ_t * job,   char *href, char *tooltip, char *target, char *id)",
"void (*end_anchor) (GVJ_t * job)",
"void (*begin_label) (GVJ_t * job, label_type type)",
"void (*end_label) (GVJ_t * job)",
"void (*textspan) (GVJ_t * job, pointf p, textspan_t * span)",
"void (*resolve_color) (GVJ_t * job, gvcolor_t * color)",
"void (*ellipse) (GVJ_t * job, pointf * A, int filled)",
"void (*polygon) (GVJ_t * job, pointf * A, int n, int filled)",
"void (*beziercurve) (GVJ_t * job, pointf * A, int n,         int arrow_at_start, int arrow_at_end, int)",
"void (*polyline) (GVJ_t * job, pointf * A, int n)",
"void (*comment) (GVJ_t * job, char *comment)",
"void (*library_shape) (GVJ_t * job, char *name, pointf * A, int n, int filled)",
"}");
}

// struct gvrender_engine_s {
// 	void (*begin_job) (GVJ_t * job);
// 	void (*end_job) (GVJ_t * job);
// 	void (*begin_graph) (GVJ_t * job);
// 	void (*end_graph) (GVJ_t * job);
// 	void (*begin_layer) (GVJ_t * job, char *layername,
// 			     int layerNum, int numLayers);
// 	void (*end_layer) (GVJ_t * job);
// 	void (*begin_page) (GVJ_t * job);
// 	void (*end_page) (GVJ_t * job);
// 	void (*begin_cluster) (GVJ_t * job);
// 	void (*end_cluster) (GVJ_t * job);
// 	void (*begin_nodes) (GVJ_t * job);
// 	void (*end_nodes) (GVJ_t * job);
// 	void (*begin_edges) (GVJ_t * job);
// 	void (*end_edges) (GVJ_t * job);
// 	void (*begin_node) (GVJ_t * job);
// 	void (*end_node) (GVJ_t * job);
// 	void (*begin_edge) (GVJ_t * job);
// 	void (*end_edge) (GVJ_t * job);
// 	void (*begin_anchor) (GVJ_t * job,
// 		char *href, char *tooltip, char *target, char *id);
// 	void (*end_anchor) (GVJ_t * job);
// 	void (*begin_label) (GVJ_t * job, label_type type);
// 	void (*end_label) (GVJ_t * job);
// 	void (*textspan) (GVJ_t * job, pointf p, textspan_t * span);
// 	void (*resolve_color) (GVJ_t * job, gvcolor_t * color);
// 	void (*ellipse) (GVJ_t * job, pointf * A, int filled);
// 	void (*polygon) (GVJ_t * job, pointf * A, int n, int filled);
// 	void (*beziercurve) (GVJ_t * job, pointf * A, int n,
// 			     int arrow_at_start, int arrow_at_end, int);
// 	void (*polyline) (GVJ_t * job, pointf * A, int n);
// 	void (*comment) (GVJ_t * job, char *comment);
// 	void (*library_shape) (GVJ_t * job, char *name, pointf * A, int n, int filled);
//     };




© 2015 - 2024 Weber Informatics LLC | Privacy Policy