Back to index

texmacs  1.0.7.15
Public Member Functions | Public Attributes | Protected Attributes
bridge_compound_rep Class Reference
Inheritance diagram for bridge_compound_rep:
Inheritance graph
[legend]
Collaboration diagram for bridge_compound_rep:
Collaboration graph
[legend]

List of all members.

Public Member Functions

 bridge_compound_rep (typesetter ttt, tree st, path ip)
void initialize (tree body_t, int delta, tree fun)
void notify_assign (path p, tree u)
void notify_insert (path p, tree u)
void notify_remove (path p, int nr)
bool notify_macro (int type, string var, int level, path p, tree u)
void notify_change ()
bool my_typeset_will_be_complete ()
void my_typeset (int desired_status)
virtual void notify_split (path p)
virtual void notify_join (path p)
virtual void my_clean_links ()
virtual void my_exec_until (path p)
virtual void exec_until (path p, bool skip_flag=false)
void typeset (int desired_status)

Public Attributes

typesetter ttt
edit_envenv
tree st
path ip
int status
hashmap< string, treechanges
array< page_iteml
stack_border sb
link_repository link_env
int ref_count

Protected Attributes

bool valid
bridge body
int delta
tree fun

Detailed Description

Definition at line 18 of file bridge_compound.cpp.


Constructor & Destructor Documentation

Definition at line 39 of file bridge_compound.cpp.

                                                                         :
  bridge_rep (ttt, st, ip)
{
  valid= false;
}

Member Function Documentation

void bridge_rep::exec_until ( path  p,
bool  skip_flag = false 
) [virtual, inherited]

Reimplemented in bridge_auto_rep.

Definition at line 254 of file bridge.cpp.

                                              {
  // This virtual routine is redefined in bridge_auto in order to
  // treat cursor positions on the border in a special way depending
  // on skip_flag

  (void) skip_flag;
  // cout << "Exec until " << p << " in " << st << "\n";
  if ((status & VALID_MASK) != PROCESSED) {
    // cout << "  Re-execute until\n";
    env->exec_until (st, p);
  }
  else if (p == path (right_index (st))) {
    // cout << "  Patch env\n";
    env->patch_env (changes);
  }
  else if (p != path (0)) {
    // cout << "  My execute until\n";
    my_exec_until (p);
  }
  // cout << "  Done\n";
}

Here is the call graph for this function:

Here is the caller graph for this function:

void bridge_compound_rep::initialize ( tree  body_t,
int  delta,
tree  fun 
)

Definition at line 46 of file bridge_compound.cpp.

                                                                   {
  if ((!valid) || (body->st != body_t) || (delta != delta2) || (fun != fun2)) {
    valid= true;
    if (is_nil (body)) body= make_bridge (ttt, attach_right (body_t, ip));
    else replace_bridge (body, attach_right (body_t, ip));
    delta= delta2;
    fun  = fun2;
  }
}

Here is the call graph for this function:

Here is the caller graph for this function:

void bridge_rep::my_clean_links ( ) [virtual, inherited]

Reimplemented in bridge_surround_rep.

Definition at line 231 of file bridge.cpp.

                            {
  link_env= link_repository (true);
}

Here is the caller graph for this function:

void bridge_rep::my_exec_until ( path  p) [virtual, inherited]

Reimplemented in bridge_docrange_rep, bridge_ornamented_rep, bridge_auto_rep, bridge_surround_rep, bridge_document_rep, bridge_formatting_rep, bridge_locus_rep, bridge_with_rep, bridge_expand_as_rep, and bridge_mark_rep.

Definition at line 236 of file bridge.cpp.

                                 {
  env->exec_until (st, p);
}

Here is the caller graph for this function:

void bridge_compound_rep::my_typeset ( int  desired_status) [virtual]

IF_NON_CHILD_ENFORCING(st)/ ttt->insert_marker (st, ip);

Reimplemented from bridge_rep.

Definition at line 176 of file bridge_compound.cpp.

                                                   {
  int d; tree f;
  if (L(st) == COMPOUND) {
    d= 1;
    f= st[0];
    if (is_compound (f)) f= env->exec (f);
    if (is_atomic (f)) {
      string var= f->label;
      if (env->provides (var)) f= env->read (var);
      else f= tree (ERROR, st);
    }
  }
  else {
    string var= as_string (L(st));
    if (env->provides (var)) f= env->read (var);
    else f= tree (ERROR, st);
    d= 0;
  }

  if (is_applicable (f)) {
    int i, n=N(f)-1, m=N(st)-d;
    env->macro_arg= list<hashmap<string,tree> > (
      hashmap<string,tree> (UNINIT), env->macro_arg);
    env->macro_src= list<hashmap<string,path> > (
      hashmap<string,path> (path (DECORATION)), env->macro_src);
    if (L(f) == XMACRO) {
      if (is_atomic (f[0])) {
       string var= f[0]->label;
       env->macro_arg->item (var)= st;
       env->macro_src->item (var)= ip;
      }
    }
    else for (i=0; i<n; i++)
      if (is_atomic (f[i])) {
       string var= f[i]->label;
       env->macro_arg->item (var)=
         i<m? st[i+d]: attach_dip (tree (UNINIT), decorate_right (ip));
       env->macro_src->item (var)=
         i<m? descend (ip,i+d): decorate_right(ip);
      }
    initialize (f[n], d, f);
    // /*IF_NON_CHILD_ENFORCING(st)*/ ttt->insert_marker (st, ip);
    if (!the_drd->is_child_enforcing (st))
      ttt->insert_marker (st, ip);
    body->typeset (desired_status);
    env->macro_arg= env->macro_arg->next;
    env->macro_src= env->macro_src->next;
  }
  else {
    initialize (f, d, f);
    if (!the_drd->is_child_enforcing (st))
      ttt->insert_marker (st, ip);
    body->typeset (desired_status);
  }
}

Here is the call graph for this function:

Reimplemented from bridge_rep.

Definition at line 171 of file bridge_compound.cpp.

                                                  {
  return !valid;
}
void bridge_compound_rep::notify_assign ( path  p,
tree  u 
) [virtual]

Implements bridge_rep.

Definition at line 66 of file bridge_compound.cpp.

                                                  {
  // cout << "Assign " << p << ", " << u << " in " << st << "\n";
  ASSERT (!is_nil (p) || L(u) >= START_EXTENSIONS, "nil path");
  if (is_nil (p) || (p->item == 0) || is_nil (body)) {
    st= substitute (st, p, u);
    valid= false;
  }
  else {
    // bool mp_flag= is_multi_paragraph (st);
    if (is_func (fun, XMACRO, 2))
      notify_macro (MACRO_ASSIGN, fun[0]->label, -1, p, u);
    else if (is_applicable (fun) && (p->item < N(fun)))
      notify_macro (MACRO_ASSIGN, fun[p->item-delta]->label, -1, p->next, u);
    st= substitute (st, p, u);
    // if (mp_flag != is_multi_paragraph (st)) valid= false;
  }
  status= CORRUPTED;
}

Here is the call graph for this function:

Implements bridge_rep.

Definition at line 161 of file bridge_compound.cpp.

                                    {
  status= CORRUPTED;
  if (!is_nil (body)) body->notify_change ();
}

Here is the call graph for this function:

void bridge_compound_rep::notify_insert ( path  p,
tree  u 
) [virtual]

Reimplemented from bridge_rep.

Definition at line 86 of file bridge_compound.cpp.

                                                  {
  // cout << "Insert " << p << ", " << u << " in " << st << "\n";
  ASSERT (!is_nil (p), "nil path");
  if (is_atom (p) || is_nil (body)) bridge_rep::notify_insert (p, u);
  else {
    // bool mp_flag= is_multi_paragraph (st);
    if (is_func (fun, XMACRO, 2))
      notify_macro (MACRO_INSERT, fun[0]->label, -1, p, u);
    else if (is_applicable (fun) && (p->item < N(fun)))
      notify_macro (MACRO_INSERT, fun[p->item-delta]->label, -1, p->next, u);
    st= insert_at (st, p, u);
    // if (mp_flag != is_multi_paragraph (st)) valid= false;
  }
  status= CORRUPTED;
}

Here is the call graph for this function:

void bridge_rep::notify_join ( path  p) [virtual, inherited]

Definition at line 208 of file bridge.cpp.

                               {
  // cout << "Join " << p << " in " << st << "\n";
  path q  = path_up (p);
  int  pos= last_item (p);
  tree t  = subtree (st, q);

  if (is_atomic (t[pos]) && is_atomic (t[pos+1])) {
    string j= t[pos]->label * t[pos+1]->label;
    notify_remove (q * pos, 1);
    notify_assign (q * pos, j);
  }
  else {
    tree j= t[pos] * t[pos+1];
    notify_remove (q * pos, 1);
    notify_assign (q * pos, j);
  }
}

Here is the call graph for this function:

bool bridge_compound_rep::notify_macro ( int  type,
string  var,
int  level,
path  p,
tree  u 
) [virtual]

Implements bridge_rep.

Definition at line 121 of file bridge_compound.cpp.

{
  /*
  cout << "Macro argument " << var << " [action=" << type
       << ", level=" << l << "] " << p << ", " << u << " in " << st << "\n";
  */

  bool flag;
  if (valid) {
    int i, n=N(fun)-1, m=N(st);
    env->macro_arg= list<hashmap<string,tree> > (
      hashmap<string,tree> (UNINIT), env->macro_arg);
    env->macro_src= list<hashmap<string,path> > (
      hashmap<string,path> (path (DECORATION)), env->macro_src);
    if (L(fun) == XMACRO) {
      if (is_atomic (fun[0])) {
       string var= fun[0]->label;
       env->macro_arg->item (var)= st;
       env->macro_src->item (var)= ip;
      }
    }
    else for (i=0; i<n; i++)
      if (is_atomic (fun[i])) {
       string var= fun[i]->label;
       env->macro_arg->item (var)=
         i<m? st[i+delta]: attach_dip (tree (UNINIT), decorate_right (ip));
       env->macro_src->item (var)=
         i<m? descend (ip,i+delta): decorate_right(ip);
      }
    flag= body->notify_macro (type, var, l+1, p, u);
    env->macro_arg= env->macro_arg->next;
    env->macro_src= env->macro_src->next;
  }
  else flag= env->depends (st, var, l);
  if (flag) status= CORRUPTED;
  return flag;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void bridge_compound_rep::notify_remove ( path  p,
int  nr 
) [virtual]

Reimplemented from bridge_rep.

Definition at line 103 of file bridge_compound.cpp.

                                                  {
  // cout << "Remove " << p << ", " << nr << " in " << st << "\n";
  ASSERT (!is_nil (p), "nil path");
  if (is_atom (p) || is_nil (body)) bridge_rep::notify_remove (p, nr);
  else {
    // bool mp_flag= is_multi_paragraph (st);
    if (is_func (fun, XMACRO, 2))
      notify_macro (MACRO_REMOVE, fun[0]->label, -1, p, tree (as_string (nr)));
    else if (is_applicable (fun) && (p->item < N(fun)))
      notify_macro (MACRO_REMOVE, fun[p->item-delta]->label, -1, p->next,
                  tree (as_string (nr)));
    st= remove_at (st, p, nr);
    // if (mp_flag != is_multi_paragraph (st)) valid= false;
  }
  status= CORRUPTED;
}

Here is the call graph for this function:

void bridge_rep::notify_split ( path  p) [virtual, inherited]

Definition at line 188 of file bridge.cpp.

                                {
  // cout << "Split " << p << " in " << st << "\n";
  path q  = path_up (p, 2);
  int  pos= last_item (path_up (p));
  int  l  = last_item (p);
  tree t  = subtree (st, q);

  if (is_atomic (t[pos])) {
    string s1= t[pos]->label (0, l), s2= t[pos]->label (l, N (t[pos]->label));
    notify_insert (q * pos, tree (L(t), s1));
    notify_assign (q * (pos+1), s2);
  }
  else {
    tree t1= t[pos] (0, l), t2= t[pos] (l, N(t[pos]));
    notify_insert (q * pos, tree (L(t), t1));
    notify_assign (q * (pos+1), t2);
  }
}

Here is the call graph for this function:

void bridge_rep::typeset ( int  desired_status) [inherited]

Definition at line 279 of file bridge.cpp.

                                       {
  // FIXME: this dirty hack ensures a perfect coherence between
  // the bridge and the edit tree at the typesetting stage.
  // This should not be necessary, but we use because the ip_observers
  // may become wrong otherwise.
  if (is_accessible (ip))
    st= subtree (the_et, reverse (ip));
  if (!is_accessible (ip)) {
    path ip2= obtain_ip (st);
    if (ip2 != path (DETACHED))
      ip= ip2;
  }

  //cout << "Typesetting " << st << ", " << desired_status << LF << INDENT;
  if ((status==desired_status) && (N(ttt->old_patch)==0)) {
    //cout << "cached" << LF;
    env->monitored_patch_env (changes);
    // cout << "changes       = " << changes << LF;
  }
  else {
    // cout << "Typesetting " << st << ", " << desired_status << LF << INDENT;
    //cout << "recomputing" << LF;
    hashmap<string,tree> prev_back (UNINIT);
    my_clean_links ();
    link_repository old_link_env= env->link_env;
    env->link_env= link_env;
    ttt->local_start (l, sb);
    env->local_start (prev_back);
    if (env->hl_lan != 0) env->lan->highlight (st);
    my_typeset (desired_status);
    env->local_update (ttt->old_patch, changes);
    env->local_end (prev_back);
    ttt->local_end (l, sb);
    env->link_env= old_link_env;
    status= desired_status;
    // cout << "old_patch     = " << ttt->old_patch << LF;
    // cout << "changes       = " << changes << LF;
    // cout << UNINDENT << "Typesetted " << st << ", " << desired_status << LF;
  }
  //cout << UNINDENT << "Typesetted " << st << ", " << desired_status << LF;

  // ttt->insert_stack (l, sb);
  //if (N(l) == 0); else
  if (ttt->paper || (N(l) <= 1)) ttt->insert_stack (l, sb);
  else {
    bool flag= false;
    int i, n= N(l);
    for (i=0; i<n; i++)
      flag= flag || (N (l[i]->fl) != 0) || (l[i]->nr_cols > 1);
    if (flag) ttt->insert_stack (l, sb);
    else {
      int first=-1, last=-1;
      array<box> bs;
      array<SI>  spc;
      for (i=0; i<n; i++)
       if (l[i]->type != PAGE_CONTROL_ITEM) {
         if (first == -1 && l[i]->type == PAGE_LINE_ITEM) first= N(bs);
         bs  << l[i]->b;
         spc << l[i]->spc->def;
         last= i;
       }
      box lb= stack_box (path (ip), bs, spc);
      if (first != -1) lb= move_box (path (ip), lb, 0, bs[first]->y2);
      array<page_item> new_l (1);
      new_l[0]= page_item (lb);
      new_l[0]->spc= l[last]->spc;
      ttt->insert_stack (new_l, sb);
    }
  }

  //cout << "l   = " << l << LF;
  //cout << "sb  = " << sb << LF;
  //cout << "l   = " << ttt->l << LF;
  //cout << "a   = " << ttt->a << LF;
  //cout << "b   = " << ttt->b << LF;
}

Here is the call graph for this function:


Member Data Documentation

Definition at line 21 of file bridge_compound.cpp.

Definition at line 42 of file bridge.hpp.

int bridge_compound_rep::delta [protected]

Definition at line 22 of file bridge_compound.cpp.

edit_env& bridge_rep::env [inherited]

Definition at line 38 of file bridge.hpp.

Definition at line 23 of file bridge_compound.cpp.

path bridge_rep::ip [inherited]

Definition at line 40 of file bridge.hpp.

Definition at line 44 of file bridge.hpp.

Definition at line 46 of file bridge.hpp.

int abstract_struct::ref_count [inherited]

Definition at line 142 of file basic.hpp.

Definition at line 45 of file bridge.hpp.

tree bridge_rep::st [inherited]

Definition at line 39 of file bridge.hpp.

int bridge_rep::status [inherited]

Definition at line 41 of file bridge.hpp.

Definition at line 37 of file bridge.hpp.

bool bridge_compound_rep::valid [protected]

Definition at line 20 of file bridge_compound.cpp.


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