/* ========================================================================
 * 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-2020, 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 3cl38y4ai8c9r6d23izdf6jgn

public interface rank_t extends __ptr__ {
	public static List<String> DEFINITION = Arrays.asList(
"typedef struct rank_t",
"{",
"int n",
"node_t **v",
"int an",
"node_t **av",
"double ht1, ht2",
"double pht1, pht2",
"boolean candidate",
"boolean valid",
"int cache_nc",
"adjmatrix_t *flat",
"}",
"rank_t");
}

// typedef struct rank_t {
// 	int n;			/* number of nodes in this rank  */
// 	node_t **v;		/* ordered list of nodes in rank    */
// 	int an;			/* globally allocated number of nodes   */
// 	node_t **av;		/* allocated list of nodes in rank  */
// 	double ht1, ht2;	/* height below/above centerline    */
// 	double pht1, pht2;	/* as above, but only primitive nodes   */
// 	boolean candidate;	/* for transpose () */
// 	boolean valid;
// 	int cache_nc;		/* caches number of crossings */
// 	adjmatrix_t *flat;
//     } rank_t;