/usr/include/Synopsis/PTree/Node.hh is in libsynopsis0.12-dev 0.12-10.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 | //
// Copyright (C) 1997-2000 Shigeru Chiba
// Copyright (C) 2000 Stefan Seefeld
// Copyright (C) 2000 Stephen Davies
// All rights reserved.
// Licensed to the public under the terms of the GNU LGPL (>= 2),
// see the file COPYING for details.
//
#ifndef Synopsis_PTree_Node_hh_
#define Synopsis_PTree_Node_hh_
#include <Synopsis/PTree/GC.hh>
#include <Synopsis/PTree/Encoding.hh>
#include <Synopsis/PTree/Visitor.hh>
#include <Synopsis/Token.hh>
#include <ostream>
#include <iterator>
namespace Synopsis
{
namespace PTree
{
class Node : public LightObject
{
public:
virtual ~Node() {}
virtual bool is_atom() const = 0;
virtual void accept(Visitor *visitor) = 0;
//. return the start address of this Ptree in the buffer
const char *begin() const;
//. return the one-past-the-end address of this Ptree in the buffer
const char *end() const;
const char *position() const { return my_data.leaf.position;}
size_t length() const { return my_data.leaf.length;}
const Node *car() const { return my_data.nonleaf.child;}
Node *car() { return my_data.nonleaf.child;}
const Node *cdr() const { return my_data.nonleaf.next;}
Node *cdr() { return my_data.nonleaf.next;}
void set_car(Node *p) { my_data.nonleaf.child = p;}
void set_cdr(Node *p) { my_data.nonleaf.next = p;}
virtual Encoding encoded_type() const { return Encoding();}
virtual Encoding encoded_name() const { return Encoding();}
protected:
//. used by Atom
Node(const char *ptr, size_t len);
//. used by List
Node(Node *p, Node *q);
private:
union
{
struct
{
Node *child;
Node *next;
} nonleaf;
struct
{
const char* position;
int length;
} leaf;
} my_data;
};
class Iterator : public LightObject
{
public:
Iterator(Node *p) { ptree = p;}
Node *operator () () { return pop();}
Node *pop();
bool next(Node *&);
void reset(Node *p) { ptree = p;}
Node *get() { return ptree ? ptree->car() : 0;}
Node *operator *() { return get();}
Node *operator ++() { pop(); return get();}
Node *operator ++(int) { return pop();}
bool empty() { return ptree == 0;}
private:
Node *ptree;
};
class Array : public LightObject
{
public:
Array(size_t = 8);
size_t number() { return num;}
Node *&operator [] (size_t index) { return ref(index);}
Node *&ref(size_t index);
void append(Node *);
void clear() { num = 0;}
Node *all();
private:
size_t num, size;
Node **array;
Node *default_buf[8];
};
class Atom : public Node
{
public:
Atom(const char *p, size_t l) : Node(p, l) {}
Atom(const Token &t) : Node(t.ptr, t.length) {}
bool is_atom() const { return true;}
virtual void accept(Visitor *visitor) { visitor->visit(this);}
};
class List : public Node
{
public:
List(Node *p, Node *q) : Node(p, q) {}
bool is_atom() const { return false;}
virtual void accept(Visitor *visitor) { visitor->visit(this);}
};
}
}
#endif
|