/usr/include/OpenSP/ElementType.h is in libosp-dev 1.5.2-13ubuntu2.
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 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 | // Copyright (c) 1994 James Clark
// See the file COPYING for copying permission.
#ifndef ElementType_INCLUDED
#define ElementType_INCLUDED 1
#ifdef __GNUG__
#pragma interface
#endif
#include <stddef.h>
#include "Boolean.h"
#include "Vector.h"
#include "Owner.h"
#include "Location.h"
#include "Ptr.h"
#include "Named.h"
#include "Vector.h"
#include "Attributed.h"
#include "Mode.h"
#include "ContentToken.h"
#ifdef SP_NAMESPACE
namespace SP_NAMESPACE {
#endif
class ElementType;
class ShortReferenceMap;
class RankStem;
class SP_API ElementDefinition : public Resource {
public:
enum DeclaredContent { modelGroup, any, cdata, rcdata, empty };
enum OmitFlags { omitStart = 01, omitEnd = 02, omitSpec = 04 };
enum { undefinedIndex = -1 };
ElementDefinition(const Location &location,
size_t index,
unsigned char omitFlags,
DeclaredContent declaredContent,
Boolean allowImmediateRecursion = 1);
ElementDefinition(const Location &location,
size_t index,
unsigned char omitFlags,
DeclaredContent declaredContent,
Owner<CompiledModelGroup> &modelGroup);
~ElementDefinition();
const CompiledModelGroup *compiledModelGroup() const;
DeclaredContent declaredContent() const;
// Was the omitted tag minimization specified?
Boolean omittedTagSpec() const;
Boolean canOmitStartTag() const;
Boolean canOmitEndTag() const;
size_t nRankStems() const;
const RankStem *rankStem(size_t i) const;
const StringC &rankSuffix() const;
size_t nInclusions() const;
const ElementType *inclusion(size_t) const;
size_t nExclusions() const;
const ElementType *exclusion(size_t) const;
Boolean undefined() const;
Boolean allowImmediateRecursion() const;
void setInclusions(Vector<const ElementType *> &inclusions);
void setExclusions(Vector<const ElementType *> &exclusions);
void setRank(StringC &suffix, Vector<const RankStem *> &rankStems);
Mode mode(Boolean netEnabled) const;
const Location &location() const;
private:
ElementDefinition(const ElementDefinition &); // undefined
void operator=(const ElementDefinition &); // undefined
void computeMode();
Location location_;
size_t index_;
unsigned char omitFlags_;
DeclaredContent declaredContent_;
Boolean allowImmediateRecursion_;
Owner<CompiledModelGroup> modelGroup_;
Vector<const ElementType *> inclusions_;
Vector<const ElementType *> exclusions_;
// rankStems_ contains all the rank stems in the ranked group in this
// definition.
Vector<const RankStem *> rankStems_;
StringC rankSuffix_;
Mode mode_;
Mode netMode_;
};
class SP_API RankStem : public Named {
public:
RankStem(const StringC &, size_t);
size_t index() const;
void addDefinition(const ConstPtr<ElementDefinition> &);
size_t nDefinitions() const;
const ElementDefinition *definition(size_t) const;
private:
RankStem(const RankStem &); // undefined
void operator=(const RankStem &); // undefined
size_t index_;
Vector<ConstPtr<ElementDefinition> > def_;
};
class SP_API ElementType : public Named, public Attributed {
public:
ElementType(const StringC &, size_t);
void setElementDefinition(const ConstPtr<ElementDefinition> &,
size_t defIndex);
void setMap(const ShortReferenceMap *);
void setRankStem(RankStem *);
Boolean undefined() const;
void setOrigName(StringC &origName);
const ElementDefinition *definition() const;
Boolean isRankedElement() const;
const RankStem *rankedElementRankStem() const;
size_t index() const;
const ShortReferenceMap *map() const;
void swap(ElementType &);
const StringC &origName() const;
private:
StringC origName_;
ElementType(const ElementType &); // undefined
void operator=(const ElementType &); // undefined
size_t index_;
size_t defIndex_; // index in the group having same definition
ConstPtr<ElementDefinition> def_;
const ShortReferenceMap *map_;
};
inline
const CompiledModelGroup *ElementDefinition::compiledModelGroup() const
{
return modelGroup_.pointer();
}
inline
ElementDefinition::DeclaredContent ElementDefinition::declaredContent() const
{
return declaredContent_;
}
inline
Boolean ElementDefinition::canOmitStartTag() const
{
return (omitFlags_ & omitStart) != 0;
}
inline
Boolean ElementDefinition::canOmitEndTag() const
{
return (omitFlags_ & omitEnd) != 0;
}
inline
Boolean ElementDefinition::omittedTagSpec() const
{
return (omitFlags_ & omitSpec) != 0;
}
inline
size_t ElementDefinition::nRankStems() const
{
return rankStems_.size();
}
inline
const StringC &ElementDefinition::rankSuffix() const
{
return rankSuffix_;
}
inline
const RankStem *ElementDefinition::rankStem(size_t i) const
{
return rankStems_[i];
}
inline
const ElementType *ElementDefinition::inclusion(size_t i) const
{
return inclusions_[i];
}
inline
size_t ElementDefinition::nInclusions() const
{
return inclusions_.size();
}
inline
const ElementType *ElementDefinition::exclusion(size_t i) const
{
return exclusions_[i];
}
inline
size_t ElementDefinition::nExclusions() const
{
return exclusions_.size();
}
inline
Boolean ElementDefinition::undefined() const
{
return index_ == size_t(undefinedIndex);
}
inline
Boolean ElementDefinition::allowImmediateRecursion() const
{
return allowImmediateRecursion_;
}
inline
const Location &ElementDefinition::location() const
{
return location_;
}
inline
void ElementDefinition::setInclusions(Vector<const ElementType *> &inclusions)
{
inclusions.swap(inclusions_);
}
inline
void ElementDefinition::setExclusions(Vector<const ElementType *> &exclusions)
{
exclusions.swap(exclusions_);
}
inline
void ElementDefinition::setRank(StringC &rankSuffix,
Vector<const RankStem *> &rankStems)
{
rankStems.swap(rankStems_);
rankSuffix.swap(rankSuffix_);
}
inline
void ElementType::setOrigName(StringC &origName)
{
origName.swap(origName_);
}
inline
Boolean ElementType::undefined() const
{
return def_->undefined();
}
inline
Boolean ElementType::isRankedElement() const
{
return def_->nRankStems() > 0;
}
inline
const ElementDefinition *ElementType::definition() const
{
return def_.pointer();
}
inline
void ElementType::setElementDefinition(const ConstPtr<ElementDefinition> &def,
size_t defIndex)
{
def_ = def;
defIndex_ = defIndex;
}
inline
size_t ElementType::index() const
{
return index_;
}
inline
const RankStem *ElementType::rankedElementRankStem() const
{
return def_->rankStem(defIndex_);
}
inline
void ElementType::setMap(const ShortReferenceMap *map)
{
map_ = map;
}
inline
const StringC &ElementType::origName() const
{
return origName_;
}
inline
const ShortReferenceMap *ElementType::map() const
{
return map_;
}
inline
size_t RankStem::index() const
{
return index_;
}
inline
size_t RankStem::nDefinitions() const
{
return def_.size();
}
inline
const ElementDefinition *RankStem::definition(size_t i) const
{
return def_[i].pointer();
}
inline
Mode ElementDefinition::mode(Boolean netEnabled) const
{
return netEnabled ? netMode_ : mode_;
}
#ifdef SP_NAMESPACE
}
#endif
#endif /* not ElementType_INCLUDED */
|