Back to index

texmacs  1.0.7.15
Public Member Functions | Friends
insertion Struct Reference

#include <skeleton.hpp>

List of all members.

Public Member Functions

 CONCRETE (insertion)
 insertion ()
 insertion (tree type, path begin, path end)
 insertion (tree type, array< pagelet > sk)

Friends

bool operator== (insertion ins1, insertion ins2)
bool operator!= (insertion ins1, insertion ins2)
tm_ostreamoperator<< (tm_ostream &out, insertion ins)

Detailed Description

Definition at line 25 of file skeleton.hpp.


Constructor & Destructor Documentation

insertion::insertion ( ) [inline]

Definition at line 77 of file skeleton.hpp.

                      {
  rep= tm_new<insertion_rep> ();
}
insertion::insertion ( tree  type,
path  begin,
path  end 
) [inline]

Definition at line 82 of file skeleton.hpp.

                                                     {
  rep= tm_new<insertion_rep> (type, begin, end);
}

Here is the call graph for this function:

insertion::insertion ( tree  type,
array< pagelet sk 
) [inline]

Definition at line 87 of file skeleton.hpp.

                                            {
  rep= tm_new<insertion_rep> (type, sk);
}

Member Function Documentation


Friends And Related Function Documentation

bool operator!= ( insertion  ins1,
insertion  ins2 
) [friend]

Definition at line 42 of file skeleton.cpp.

                                             {
  return
    (ins1->type  != ins2->type ) ||
    (ins1->begin != ins2->begin) ||
    (ins1->end   != ins2->end  ) ||
    (ins1->sk    != ins2->sk   );
}
tm_ostream& operator<< ( tm_ostream out,
insertion  ins 
) [friend]

Definition at line 64 of file skeleton.cpp.

                                             {
  if (ins->type != "") out << ins->type << " ";
  out << "insertion [ " << ins->begin << " -- " << ins->end;
  if (N(ins->sk)>0) out << "; " << ins->sk;
  return out << " ]";
}
bool operator== ( insertion  ins1,
insertion  ins2 
) [friend]

Definition at line 33 of file skeleton.cpp.

                                             {
  return
    (ins1->type  == ins2->type ) &&
    (ins1->begin == ins2->begin) &&
    (ins1->end   == ins2->end  ) &&
    (ins1->sk    == ins2->sk   );
}

The documentation for this struct was generated from the following file: