QSDL-TL/TLFormulaUnary.cpp at master · Diefenbruch/QSDL-TL · GitHub

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
/*
 * File:    TLFormulaUnary.cc
 * Project: QUEST
 * Author:  Marc Diefenbruch, Axel M. Hirche
 * Date:    (C) 1997, 1998 University of Essen, Germany
 */

#include "TLFormulaUnary.h"

#if _TL_INLINING_ == 0
#include "TLFormulaUnary.inl.h"
#endif

#if _SC_DMALLOC
  #include <dmalloc.h>
#endif

TLFormulaUnary::~TLFormulaUnary (void)
{
  if (rightOperand)
    delete rightOperand;
  rightOperand = NULL;
}


TLArity TLFormulaUnary::Arity (void) const
{
  return TLUnary;
}


SCNatural TLFormulaUnary::NumOfSymbols (void) const
{
  return rightOperand->NumOfSymbols() + 1;
}


SCStream& TLFormulaUnary::Display (SCStream& out) const
{
  assert (rightOperand);

  if (rightOperand->Arity() == TLBinary)          // It is a binary which always has
                                                  // lower precedence.
  {
    TLFormula::Display(out);
    out << " (" << rightOperand << ")";
  }
  else
  {
    TLFormula::Display(out);
    out << " " << rightOperand;
  }

  return out;
}


SCBoolean TLFormulaUnary::operator== (const TLFormula& phi) const
{
  TLFormulaUnary* tmpPhi = (TLFormulaUnary*) &phi;

  if (op != tmpPhi->op)
    return false;

  assert (rightOperand);
  assert (tmpPhi->rightOperand);

  return (*rightOperand == *(tmpPhi->rightOperand));
}


SCBoolean TLFormulaUnary::operator== (const TLFormula* phi) const
{
  return *this == *phi;
}


SCBoolean TLFormulaUnary::operator!= (const TLFormula& pPhi) const
{
  return !(*this == pPhi);
}


SCBoolean TLFormulaUnary::operator!= (const TLFormula* pPhi) const
{
  return !(*this == *pPhi);
}