Fossil

  }
  pik_append_txt(p, pElem, 0);
}


/* Methods for the "text" class */
static void textInit(Pik *p, PElem *pElem){
  pElem->w = pik_value(p, "textwid",7,0);
  pElem->h = pik_value(p, "textht",6,0);
  pik_value(p, "textwid",7,0);
  pik_value(p, "textht",6,0);
  pElem->sw = 0.0;
}

/* Methods for the "sublist" class */
static void sublistInit(Pik *p, PElem *pElem){
  PEList *pList = pElem->pSublist;
  int i;

   {  /* name */          "text",
      /* isline */        0,
      /* eJust */         0,
      /* xInit */         textInit,
      /* xNumProp */      0,
      /* xChop */         boxChop,
      /* xOffset */       boxOffset,
      /* xFit */          0,
      /* xFit */          boxFit,
      /* xRender */       boxRender 
   },
};
static const PClass sublistClass = 
   {  /* name */          "[]",
      /* isline */        0,
      /* eJust */         0,

** If pBasis is not NULL then it should be a [] element.  Use the
** sublist of that [] element for the search.  If pBasis is not a []
** element, then throw an error.
**
** The pNth token describes the N-th search.  The pNth->eCode value
** is one more than the number of items to skip.  It is negative
** to search backwards.  If pNth->eType==T_ID, then it is the name
** of a primative time to search for.  If pNth->eType==T_LB, then
** of a class to search for.  If pNth->eType==T_LB, then
** search for a [] object.  If pNth->eType==T_LAST, then search for
** any type.
**
** Raise an error if the item is not found.
*/
static PElem *pik_find_nth(Pik *p, PElem *pBasis, PToken *pNth){
  PEList *pList;

        default:        p->aTPath[1].x += pElem->w; break;
        case DIR_DOWN:  p->aTPath[1].y -= pElem->h; break;
        case DIR_LEFT:  p->aTPath[1].x -= pElem->w; break;
        case DIR_UP:    p->aTPath[1].y += pElem->h; break;
      }
    }
  }

  /* Run "fit" on the text type automatically */
  if( pElem->type->xInit==textInit && pElem->nTxt ){
    pik_size_to_fit(p, &pElem->errTok);
  }

  /* Compute final bounding box, entry and exit points, center
  ** point (ptAt) and path for the element
  */
  pik_bbox_init(&pElem->bbox);
  if( pElem->type->isLine ){
    pElem->aPath = malloc( sizeof(PPoint)*p->nTPath );

/* Add all elements of the list pEList to the bounding box
*/
static void pik_bbox_add_elist(Pik *p, PEList *pEList, PNum wArrow){
  int i;
  for(i=0; i<pEList->n; i++){
    PElem *pElem = pEList->a[i];
    pik_bbox_addbox(&p->bbox, &pElem->bbox);
    if( pElem->sw>0.0 ) pik_bbox_addbox(&p->bbox, &pElem->bbox);
    pik_append_txt(p, pElem, &p->bbox);
    if( pElem->pSublist ) pik_bbox_add_elist(p, pElem->pSublist, wArrow);


    /* Expand the bounding box to account for arrowheads on lines */
    if( pElem->type->isLine && pElem->nPath>0 ){
      if( pElem->larrow ){

  { "max",        3,   T_FUNC2,     FN_MAX,    0       },
  { "min",        3,   T_FUNC2,     FN_MIN,    0       },
  { "n",          1,   T_EDGEPT,    0,         CP_N    },
  { "ne",         2,   T_EDGEPT,    0,         CP_NE   },
  { "north",      5,   T_EDGEPT,    0,         CP_N    },
  { "nw",         2,   T_EDGEPT,    0,         CP_NW   },
  { "of",         2,   T_OF,        0,         0       },
  { "previous",   8,   T_LAST,      0,         0,      },
  { "print",      5,   T_PRINT,     0,         0       },
  { "rad",        3,   T_RADIUS,    0,         0       },
  { "radius",     6,   T_RADIUS,    0,         0       },
  { "right",      5,   T_RIGHT,     DIR_RIGHT, CP_E    },
  { "rjust",      5,   T_RJUST,     0,         0       },
  { "s",          1,   T_EDGEPT,    0,         CP_S    },
  { "same",       4,   T_SAME,      0,         0       },

    }
  }
  printf("</body></html>\n");
  return 0; 
}
#endif /* PIKCHR_SHELL */

#line 6687 "pikchr.c"
#line 6693 "pikchr.c"