Personal tools
You are here: Home Projects C++ Cfront releases Release 3.0.3 source libSC G2++ g2++lib g2tree.c
Document Actions

g2tree.c

by Michael L Powell last modified 2007-01-26 03:23

Click here to get the file

Size 1.6 kB - File type text/plain

File contents

/*ident	"@(#)G2++:g2++lib/g2tree.c	3.1" */
/******************************************************************************
*
* C++ Standard Components, Release 3.0.
*
* Copyright (c) 1991, 1992 AT&T and Unix System Laboratories, Inc.
* Copyright (c) 1988, 1989, 1990 AT&T.  All Rights Reserved.
*
* THIS IS UNPUBLISHED PROPRIETARY SOURCE CODE OF AT&T and Unix System
* Laboratories, Inc.  The copyright notice above does not evidence
* any actual or intended publication of such source code.
*
******************************************************************************/

#include <g2io.h>
#include <g2tree.h>
#include <String.h>

#if defined(__edg_att_40)
#pragma instantiate Block<G2NODE>
#endif

G2NODE::G2NODE(){}
G2NODE::~G2NODE(){}

G2NODE* g2child_ATTLC(
    G2NODE* gp

//  Get normal (non-attribute) child node

){
    G2NODE* cp = gp->child;

    while( cp ){

	if( 
	    cp->name.char_at(0) != '.' 
	){
	    return cp;
	}
	cp = cp->next;
    }
    return NULL;
}
G2NODE* g2achild_ATTLC(
    G2NODE* gp

//  Get attribute child node 

){
    G2NODE* cp = gp->child;

    if( 
	cp && 
	cp->name.char_at(0) == '.' 
    ){
	return cp;
    }
    return NULL;
}
G2NODE* g2next_ATTLC(
    G2NODE* gp

//  Get next normal child node 

){
    G2NODE* cp = gp->next;

    while( cp ){

	if( 
	    cp->name.char_at(0) != '.' 
	){
	    return cp;
	}
	cp = cp->next;
    }
    return NULL;
}
G2NODE* g2anext_ATTLC(
    G2NODE* gp

//  Get next attribute child node 

){
    G2NODE* cp = gp->next;

    if( 
	cp && 
	cp->name.char_at(0) == '.' 
    ){
	return cp;
    }
    return NULL;
}
« November 2024 »
Su Mo Tu We Th Fr Sa
1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30
 

Powered by Plone CMS, the Open Source Content Management System

This site conforms to the following standards: