Back to index

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

List of all members.

Public Member Functions

 bridge_mark_rep (typesetter ttt, tree st, path ip)
void initialize ()
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 ()
void my_exec_until (path p)
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 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

bridge body

Detailed Description

Definition at line 14 of file bridge_mark.cpp.


Constructor & Destructor Documentation

Definition at line 33 of file bridge_mark.cpp.

                                                                 :
  bridge_rep (ttt, st, ip)
{
  initialize ();
}

Here is the call graph for this function:


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:

Definition at line 40 of file bridge_mark.cpp.

                             {
  if (is_nil (body)) body= make_bridge (ttt, st[1], descend (ip, 1));
  else replace_bridge (body, st[1], descend (ip, 1));
}

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_mark_rep::my_exec_until ( path  p) [virtual]

Reimplemented from bridge_rep.

Definition at line 130 of file bridge_mark.cpp.

                                      {
  if (p->item == 1) body->exec_until (p->next);
  else env->exec_until (st, p);
}
void bridge_mark_rep::my_typeset ( int  desired_status) [virtual]

Reimplemented from bridge_rep.

Definition at line 142 of file bridge_mark.cpp.

                                               {
  // cout << "Argument " << t << ", " << ip << "\n";
  if (is_func (st[0], ARG) &&
      is_atomic (st[0][0]) &&
      (!is_nil (env->macro_arg)) &&
      env->macro_arg->item->contains (st[0][0]->label))
    {
      string name = st[0][0]->label;
      tree   value= env->macro_arg->item [name];
      path   valip= decorate_right (ip);
      if (!is_func (value, BACKUP)) {
       path new_valip= env->macro_src->item [name];
       if (is_accessible (new_valip)) valip= new_valip;
      }

      if (N(st[0]) > 1) {
       int i, n= N(st[0]);
       for (i=1; i<n; i++) {
         tree r= env->exec (st[0][i]);
         if (!is_int (r)) break;
         int nr= as_int (r);
         if ((!is_compound (value)) || (nr<0) || (nr>=N(value))) break;
         value= value[nr];
         valip= descend (valip, nr);
       }
      }
      if (is_compound (value))
       ttt->insert_marker (st, valip);
    }

  body->typeset (desired_status);
}

Here is the call graph for this function:

Reimplemented from bridge_rep.

Definition at line 136 of file bridge_mark.cpp.

                                              {
  if (status != CORRUPTED) return false;
  return body->my_typeset_will_be_complete ();
}
void bridge_mark_rep::notify_assign ( path  p,
tree  u 
) [virtual]

Implements bridge_rep.

Definition at line 55 of file bridge_mark.cpp.

                                              {
  // cout << "Assign " << p << ", " << u << " in " << st << "\n";
  ASSERT (!is_nil (p) || is_func (u, MARK), "nil path");
  if (is_nil (p) || (p->item != 1)) {
    st= substitute (st, p, u);
    initialize ();
  }
  else {
    // bool mp_flag= is_multi_paragraph (st);
    if (is_atom (p)) {
      body= make_bridge (ttt, u, descend (ip, 1));
      st= substitute (st, 1, body->st);
    }
    else {
      body->notify_assign (p->next, u);
      st= substitute (st, p->item, body->st);
    }
    // if (mp_flag != is_multi_paragraph (st)) initialize ();
  }
  status= CORRUPTED;
}

Here is the call graph for this function:

void bridge_mark_rep::notify_change ( ) [virtual]

Implements bridge_rep.

Definition at line 120 of file bridge_mark.cpp.

                                {
  status= CORRUPTED;
  body->notify_change ();
}
void bridge_mark_rep::notify_insert ( path  p,
tree  u 
) [virtual]

Reimplemented from bridge_rep.

Definition at line 78 of file bridge_mark.cpp.

                                              {
  // cout << "Insert " << p << ", " << u << " in " << st << "\n";
  ASSERT (!is_nil (p), "nil path");
  if (is_atom (p) || (p->item != 1)) bridge_rep::notify_insert (p, u);
  else {
    // bool mp_flag= is_multi_paragraph (st);
    body->notify_insert (p->next, u);
    st= substitute (st, 1, body->st);
    // if (mp_flag != is_multi_paragraph (st)) initialize ();
  }
  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_mark_rep::notify_macro ( int  type,
string  var,
int  level,
path  p,
tree  u 
) [virtual]

Implements bridge_rep.

Definition at line 106 of file bridge_mark.cpp.

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

  bool flag= env->depends (st[0], var, l) || env->depends (st[1], var, l);
  if (flag) initialize ();
  flag= body->notify_macro (tp, var, l, p, u) || flag;
  if (flag) status= CORRUPTED;
  return flag;
}

Here is the call graph for this function:

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

Reimplemented from bridge_rep.

Definition at line 92 of file bridge_mark.cpp.

                                              {
  // cout << "Remove " << p << ", " << nr << " in " << st << "\n";
  ASSERT (!is_nil (p), "nil path");
  if (is_atom (p) || (p->item != 1)) bridge_rep::notify_remove (p, nr);
  else {
    // bool mp_flag= is_multi_paragraph (st);
    body->notify_remove (p->next, nr);
    st= substitute (st, 1, body->st);
    // if (mp_flag != is_multi_paragraph (st)) initialize ();
  }
  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 16 of file bridge_mark.cpp.

Definition at line 42 of file bridge.hpp.

edit_env& bridge_rep::env [inherited]

Definition at line 38 of file bridge.hpp.

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.


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