Lines Matching refs:dst
540 int dst;
542 dst = cxi->used-1; /* complex being grown */
544 prevbase = TR_baseline(tri, dst, NULL, &ymin);
547 trec = cxi->cx[dst].kids.members[0]; /* complex whose first text record holds vadvance for this complex */
940 \param dst pointer to the CHILD_SPECS structure.
944 int csp_insert(CHILD_SPECS *dst, int src){
946 if(!dst)return(2);
947 if(!(status=csp_make_insertable(dst))){
948 dst->members[dst->used]=src;
949 dst->used++;
958 \param dst pointer to the recipient CHILD_SPECS structure.
962 int csp_merge(CHILD_SPECS *dst, CHILD_SPECS *src){
965 if(!dst)return(2);
968 status = csp_insert(dst, src->members[i]);
1074 \brief Merge a complex dst with N members (N>=1) by adding a second complex src, and change the type.
1076 \param dst index of the complex to expand.
1081 int cxinfo_merge(CX_INFO *cxi, int dst, int src, enum tr_classes type){
1085 if(dst < 0 || dst >= (int) cxi->used)return(4);
1087 cxi->cx[dst].type = type;
1088 status = csp_merge(&(cxi->cx[dst].kids), &(cxi->cx[src].kids));
1298 \brief Merge BRECT_SPEC element src into/with BRECT_SPEC element dst. src is unchanged. (Merge two bounding rectangles.)
1301 \param dst index of the destination bounding rectangle.
1304 int brinfo_merge(BR_INFO *bri, int dst, int src){
1307 if(dst<0 || dst >= (int) bri->used)return(3);
1309 bri->rects[dst].xll = TEREMIN(bri->rects[dst].xll, bri->rects[src].xll);
1310 bri->rects[dst].yll = TEREMAX(bri->rects[dst].yll, bri->rects[src].yll); /* MAX because Y is positive DOWN */
1311 bri->rects[dst].xur = TEREMAX(bri->rects[dst].xur, bri->rects[src].xur);
1312 bri->rects[dst].yur = TEREMIN(bri->rects[dst].yur, bri->rects[src].yur); /* MIN because Y is positive DOWN */
1314 printf("bri_Merge into rect:%d (LL,UR) dst:(%f,%f),(%f,%f) src:(%f,%f),(%f,%f)\n",dst,
1315 (bri->rects[dst].xll),
1316 (bri->rects[dst].yll),
1317 (bri->rects[dst].xur),
1318 (bri->rects[dst].yur),
1329 Allowable overlap is any area overlap of src and dst bounding rectangles, after
1337 \param dst index of the destination bounding rectangle.
1339 \param rp_dst Pointer to edge padding values for dst.
1342 int brinfo_overlap(const BR_INFO *bri, int dst, int src, RT_PAD *rp_dst, RT_PAD *rp_src){
1348 if(dst<0 || dst>= (int) bri->used)return(4);
1350 br_dst=&bri->rects[dst];
1353 ((br_dst->xur + rp_dst->right) < (br_src->xll - rp_src->left) ) || /* dst fully to the left */
1354 ((br_dst->xll - rp_dst->left) > (br_src->xur + rp_src->right) ) || /* dst fully to the right */
1355 ((br_dst->yur - rp_dst->up) > (br_src->yll + rp_src->down) ) || /* dst fully below (Y is positive DOWN) */
1356 ((br_dst->yll + rp_dst->down) < (br_src->yur - rp_src->up) ) /* dst fully above (Y is positive DOWN) */
1377 printf("Overlap status:%d\nOverlap trects (LL,UR) dst:(%f,%f),(%f,%f) src:(%f,%f),(%f,%f)\n",
1387 printf("Overlap brects (LL,UR) dst:(%f,%f),(%f,%f) src:(%f,%f),(%f,%f)\n",
1396 printf("Overlap rprect (LL,UR) dst:(%f,%f),(%f,%f) src:(%f,%f),(%f,%f)\n",
1413 \param dst index of the destination bounding rectangle.
1415 \param ddir direction of dst
1419 int brinfo_upstream(BR_INFO *bri, int dst, int src, int ddir, int sdir){
1425 if(dst<0 || dst>= (int) bri->used)return(4);
1427 br_dst=&bri->rects[dst];
1449 \param dst index of the destination bounding rectangle.
1452 \param type Preexisting justification for dst, if any. Justification of dst and src must match this or
1453 TR_PARA_UJ is returned even if dst and src have some (other) alignment.
1455 enum tr_classes brinfo_pp_alignment(const BR_INFO *bri, int dst, int src, double slop, enum tr_classes type){
1457 BRECT_SPECS *br_dst = & bri->rects[dst];
1484 printf("pp_align newtype:%d brects (LL,UR) dst:(%f,%f),(%f,%f) src:(%f,%f),(%f,%f)\n",
2345 dst_rt, /* index into bri for dst */
2350 dst_rt, /* index into bri for dst */
2389 cxi->cx[cxidx-1].rt_cidx, /* index into rt for dst cx */