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

com.codbex.kronos.parser.hdbcalculationview.ndb.basemodelbase.RootNodeVisibility Maven / Gradle / Ivy

The newest version!
/*
 * Copyright (c) 2022 codbex or an codbex affiliate company and contributors
 *
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Public License v2.0
 * which accompanies this distribution, and is available at
 * http://www.eclipse.org/legal/epl-v20.html
 *
 * SPDX-FileCopyrightText: 2022 codbex or an codbex affiliate company and contributors
 * SPDX-License-Identifier: EPL-2.0
 */
//
// This file was generated by the JavaTM Architecture for XML Binding(JAXB) Reference Implementation, v2.3.0 
// See https://javaee.github.io/jaxb-v2/ 
// Any modifications to this file will be lost upon recompilation of the source schema. 
// Generated on: 2020.11.26 at 10:54:28 AM EET 
//


package com.codbex.kronos.parser.hdbcalculationview.ndb.basemodelbase;

import javax.xml.bind.annotation.XmlEnum;
import javax.xml.bind.annotation.XmlType;


/**
 * Java class for RootNodeVisibility.
 *
 * The following schema fragment specifies the expected content contained within this class.
 * 
 * 
 * <simpleType name="RootNodeVisibility">
 *   <restriction base="{http://www.w3.org/2001/XMLSchema}string">
 *     <enumeration value="ADD_ROOT_NODE_IF_DEFINED"/>
 *     <enumeration value="ADD_ROOT_NODE"/>
 *     <enumeration value="DO_NOT_ADD_ROOT_NODE"/>
 *   </restriction>
 * </simpleType>
 * 
*/ @XmlType(name = "RootNodeVisibility") @XmlEnum public enum RootNodeVisibility { /** * (default): The system will add the root node of the hierarchy if it is explicitly defined, but the system will * not add an extra artificial root node. */ ADD_ROOT_NODE_IF_DEFINED, /** * The system will always add an artificial single root node to the hierarchy. All other nodes are descendants of this node. */ ADD_ROOT_NODE, /** * The system will not add an artificial single root node to the hierarchy. * Example 1: Assume we have the following simple table with a parent child hierarchy defined on top: A to B and A to C * Then we have: ADD_ROOT_NODE_IF_DEFINED, ADD_ROOT_NODE: Results in a 2 level hierarchy with A at the root having B, * C as children DO_NOT_ADD_ROOT_NODE: Results in a 1 level hierarchy with B and C as independent root nodes * Example 2: Assume we have the following simple table with a parent child hierarchy defined on top. * null to A and A to B and A to C * Then we have: ADD_ROOT_NODE_IF_DEFINED, DO_NOT_ADD_ROOT_NODE: Results in a 2 level hierarchy with A at the root * having B,C as children ADD_ROOT_NODE: Results in a 3 level hierarchy with null as root node having A as * child and A having B,C as children. */ DO_NOT_ADD_ROOT_NODE; /** * From value. * * @param v the v * @return the root node visibility */ public static RootNodeVisibility fromValue(String v) { return valueOf(v); } /** * Value. * * @return the string */ public String value() { return name(); } }




© 2015 - 2025 Weber Informatics LLC | Privacy Policy