PageRenderTime 54ms CodeModel.GetById 12ms RepoModel.GetById 1ms app.codeStats 0ms

/source/src/Edit/Modify/edit_table.cpp

http://itexmacs.googlecode.com/
C++ | 1431 lines | 1260 code | 131 blank | 40 comment | 488 complexity | a611bb89633455af427a427657a1280c MD5 | raw file
Possible License(s): GPL-3.0, GPL-2.0, MPL-2.0-no-copyleft-exception, LGPL-2.0 
    

  1. 

  2. /******************************************************************************
    3. 

  3. * MODULE     : edit_table.cpp
    4. 

  4. * DESCRIPTION: modify tables
    5. 

  5. * COPYRIGHT  : (C) 1999  Joris van der Hoeven
    6. 

  6. *******************************************************************************
    7. 

  7. * This software falls under the GNU general public license version 3 or later.
    8. 

  8. * It comes WITHOUT ANY WARRANTY WHATSOEVER. For details, see the file LICENSE
    9. 

  9. * in the root directory or <http://www.gnu.org/licenses/gpl-3.0.html>.
    10. 

  10. ******************************************************************************/
    11. 

  11. 

  12. #include "edit_table.hpp"
    13. 

  13. 

  14. /******************************************************************************
    15. 

  15. * Constructors and destructors
    16. 

  16. ******************************************************************************/
    17. 

  17. 

  18. edit_table_rep::edit_table_rep (): cell_mode ("cell") {}
    19. 

  19. edit_table_rep::~edit_table_rep () {}
    20. 

  20. 

  21. /******************************************************************************
    22. 

  22. * Elementary subroutines for table manipulation
    23. 

  23. ******************************************************************************/
    24. 

  24. 

  25. static tree
    26. 

  26. empty_cell () {
    27. 

  27.   return "";
    28. 

  28. }
    29. 

  29. 

  30. static bool
    31. 

  31. is_empty_cell (tree t) {
    32. 

  32.   return t == "" || t == tree (DOCUMENT, "");
    33. 

  33. }
    34. 

  34. 

  35. static tree
    36. 

  36. empty_row (int nr_cols) {
    37. 

  37.   int i;
    38. 

  38.   tree R (ROW, nr_cols);
    39. 

  39.   for (i=0; i<nr_cols; i++)
    40. 

  40.     R[i]= tree (CELL, empty_cell ());
    41. 

  41.   return R;
    42. 

  42. }
    43. 

  43. 

  44. static tree
    45. 

  45. empty_table (int nr_rows, int nr_cols) {
    46. 

  46.   int i;
    47. 

  47.   tree T (TABLE, nr_rows);
    48. 

  48.   for (i=0; i<nr_rows; i++)
    49. 

  49.     T[i]= empty_row (nr_cols);
    50. 

  50.   return T;
    51. 

  51. }
    52. 

  52. 

  53. static void
    54. 

  54. table_get_extents (tree T, int& nr_rows, int& nr_cols) {
    55. 

  55.   while (is_func (T, TFORMAT)) T= T[N(T)-1];
    56. 

  56.   nr_rows= N(T);
    57. 

  57.   T= T[0];
    58. 

  58.   while (is_func (T, TFORMAT)) T= T[N(T)-1];
    59. 

  59.   nr_cols= N(T);
    60. 

  60. }
    61. 

  61. 

  62. static void
    63. 

  63. table_set (tree& T, int row, int col, tree t) {
    64. 

  64.   tree* ptr= &T;
    65. 

  65.   while (is_func (*ptr, TFORMAT)) ptr= & ((*ptr) [N(*ptr)-1]);
    66. 

  66.   ptr= & ((*ptr) [row]);
    67. 

  67.   while (is_func (*ptr, TFORMAT)) ptr= & ((*ptr) [N(*ptr)-1]);
    68. 

  68.   ptr= & ((*ptr) [col]);
    69. 

  69.   while (is_func (*ptr, TFORMAT)) ptr= & ((*ptr) [N(*ptr)-1]);
    70. 

  70.   if (is_func (*ptr, CELL, 1)) ptr= & ((*ptr) [0]);
    71. 

  71.   *ptr= t;
    72. 

  72. }
    73. 

  73. 

  74. static tree
    75. 

  75. table_get (tree T, int row, int col) {
    76. 

  76.   while (is_func (T, TFORMAT)) T= T [N(T)-1];
    77. 

  77.   T= T [row];
    78. 

  78.   while (is_func (T, TFORMAT)) T= T [N(T)-1];
    79. 

  79.   T= T [col];
    80. 

  80.   while (is_func (T, TFORMAT)) T= T [N(T)-1];
    81. 

  81.   if (is_func (T, CELL, 1)) T= T [0];
    82. 

  82.   return T;
    83. 

  83. }
    84. 

  84. 

  85. /******************************************************************************
    86. 

  86. * Searching the format, table, rows and cells
    87. 

  87. ******************************************************************************/
    88. 

  88. 

  89. path
    90. 

  90. edit_table_rep::search_format () {
    91. 

  91.   path p= search_table ();
    92. 

  92.   return search_format (p);
    93. 

  93. }
    94. 

  94. 

  95. path
    96. 

  96. edit_table_rep::search_format (path p) {
    97. 

  97.   if (!(rp < p)) return path ();
    98. 

  98.   if (is_func (subtree (et, p), TFORMAT)) return p;
    99. 

  99.   if (is_func (subtree (et, path_up (p)), TFORMAT)) return path_up (p);
    100. 

  100.   return p;
    101. 

  101. }
    102. 

  102. 

  103. path
    104. 

  104. edit_table_rep::search_format (int& row, int& col) {
    105. 

  105.   path p= search_table (row, col);
    106. 

  106.   if (is_nil (p)) return p;
    107. 

  107.   if (is_func (subtree (et, p), TFORMAT)) return p;
    108. 

  108.   if (is_func (subtree (et, path_up (p)), TFORMAT)) return path_up (p);
    109. 

  109.   insert_node (p * 0, TFORMAT);
    110. 

  110.   return p;
    111. 

  111. }
    112. 

  112. 

  113. path
    114. 

  114. edit_table_rep::search_table () {
    115. 

  115.   return search_upwards (TABLE);
    116. 

  116. }
    117. 

  117. 

  118. path
    119. 

  119. edit_table_rep::search_table (path fp) {
    120. 

  120.   tree st= subtree (et, fp);
    121. 

  121.   if (is_func (st, TABLE)) return fp;
    122. 

  122.   if (is_func (st, TFORMAT)) return search_table (fp * (N(st)-1));
    123. 

  123.   return path ();
    124. 

  124. }
    125. 

  125. 

  126. path
    127. 

  127. edit_table_rep::search_table (int& row, int& col) {
    128. 

  128.   row= col= 0;
    129. 

  129.   path p= search_table ();
    130. 

  130.   if (is_nil (p)) return p;
    131. 

  131.   path q= p, r= tail (tp, N(p));
    132. 

  132. 

  133.   if (N(r) <= 1) return path ();
    134. 

  134.   row= r->item;
    135. 

  135.   while (true) {
    136. 

  136.     if (is_nil (r)) return r;
    137. 

  137.     q= q * r->item;
    138. 

  138.     r= r->next;
    139. 

  139.     if (is_func (subtree (et, q), ROW)) break;
    140. 

  140.   }
    141. 

  141. 

  142.   if (N(r) <= 1) return path ();
    143. 

  143.   col= r->item;
    144. 

  144.   while (true) {
    145. 

  145.     if (is_nil (r)) return r;
    146. 

  146.     q= q * r->item;
    147. 

  147.     r= r->next;
    148. 

  148.     if (!is_func (subtree (et, q), TFORMAT)) break;
    149. 

  149.   }
    150. 

  150. 

  151.   return p;
    152. 

  152. }
    153. 

  153. 

  154. path
    155. 

  155. edit_table_rep::search_row (path fp, int row) {
    156. 

  156.   fp= search_table (fp) * row;
    157. 

  157.   tree st= subtree (et, fp);
    158. 

  158.   if (!is_func (st, ROW))
    159. 

  159.     return search_row (fp, N(st)-1);
    160. 

  160.   return fp;
    161. 

  161. }
    162. 

  162. 

  163. path
    164. 

  164. edit_table_rep::search_cell (path p, int col) {
    165. 

  165.   p= p * col;
    166. 

  166.   tree st= subtree (et, p);
    167. 

  167.   if (is_func (st, TFORMAT))
    168. 

  168.     return search_cell (p, N(st)-1);
    169. 

  169.   if (is_func (st, CELL, 1)) return p * 0;
    170. 

  170.   return p;
    171. 

  171. }
    172. 

  172. 

  173. path
    174. 

  174. edit_table_rep::search_cell (path fp, int row, int col) {
    175. 

  175.   return search_cell (search_row (fp, row), col);
    176. 

  176. }
    177. 

  177. 

  178. /******************************************************************************
    179. 

  179. * Analyzing with statements in format
    180. 

  180. ******************************************************************************/
    181. 

  181. 

  182. void
    183. 

  183. edit_table_rep::with_raw_read (tree with, int& i1, int& j1, int& i2, int& j2) {
    184. 

  184.   i1= as_int (with[0]);
    185. 

  185.   i2= as_int (with[1]);
    186. 

  186.   j1= as_int (with[2]);
    187. 

  187.   j2= as_int (with[3]);
    188. 

  188. }
    189. 

  189. 

  190. void
    191. 

  191. edit_table_rep::with_decode (int nr_rows, int nr_cols,
    192. 

  192. 			     int& i1, int& j1, int& i2, int& j2)
    193. 

  193. {
    194. 

  194.   i1= (i1>=0? i1-1: nr_rows+i1);
    195. 

  195.   i2= (i2> 0? i2-1: nr_rows+i2);
    196. 

  196.   j1= (j1>=0? j1-1: nr_cols+j1);
    197. 

  197.   j2= (j2> 0? j2-1: nr_cols+j2);
    198. 

  198. }
    199. 

  199. 

  200. void
    201. 

  201. edit_table_rep::with_decode (int nr_rows, int nr_cols,
    202. 

  202. 			     int& I1, int& J1, int& I2, int& J2,
    203. 

  203. 			     int& i1, int& j1, int& i2, int& j2)
    204. 

  204. {
    205. 

  205.   i1= I1; j1= J1; i2= I2; j2=J2;
    206. 

  206.   with_decode (nr_rows, nr_cols, i1, j1, i2, j2);
    207. 

  207. }
    208. 

  208. 

  209. void
    210. 

  210. edit_table_rep::with_read (tree with, int nr_rows, int nr_cols,
    211. 

  211. 			   int& i1, int& j1, int& i2, int& j2)
    212. 

  212. {
    213. 

  213.   with_raw_read (with, i1, j1, i2, j2);
    214. 

  214.   with_decode (nr_rows, nr_cols, i1, j1, i2, j2);
    215. 

  215. }
    216. 

  216. 

  217. void
    218. 

  218. edit_table_rep::with_read (tree with, int nr_rows, int nr_cols,
    219. 

  219. 			   int& I1, int& J1, int& I2, int& J2,
    220. 

  220. 			   int& i1, int& j1, int& i2, int& j2)
    221. 

  221. {
    222. 

  222.   with_raw_read (with, I1, J1, I2, J2);
    223. 

  223.   i1= I1; j1= J1; i2= I2; j2=J2;
    224. 

  224.   with_decode (nr_rows, nr_cols, i1, j1, i2, j2);
    225. 

  225. }
    226. 

  226. 

  227. /******************************************************************************
    228. 

  228. * Formatting primitives
    229. 

  229. ******************************************************************************/
    230. 

  230. 

  231. tree
    232. 

  232. edit_table_rep::table_get_format (path fp) {
    233. 

  233.   tree fm= get_env_value (CELL_FORMAT, fp * 0);
    234. 

  234.   tree st= subtree (et, fp);
    235. 

  235.   return fm * st (0, N(st)-1);
    236. 

  236. }
    237. 

  237. 

  238. void
    239. 

  239. edit_table_rep::table_set_format (path fp, string var, tree val) {
    240. 

  240.   table_del_format (fp, var);
    241. 

  241.   tree with (TWITH, var, val);
    242. 

  242.   tree st= subtree (et, fp);
    243. 

  243.   insert (fp * (N(st)-1), tree (TFORMAT, with));
    244. 

  244. }
    245. 

  245. 

  246. tree
    247. 

  247. edit_table_rep::table_get_format (path fp, string var) {
    248. 

  248.   tree st= table_get_format (fp);
    249. 

  249.   int k, n= N(st);
    250. 

  250.   tree val= get_env_value (var);
    251. 

  251.   for (k=0; k<n; k++)
    252. 

  252.     if (is_func (st[k], TWITH, 2) && (st[k][0] == var))
    253. 

  253.       val= st[k][1];
    254. 

  254.   return val;
    255. 

  255. }
    256. 

  256. 

  257. void
    258. 

  258. edit_table_rep::table_del_format (path fp, string var) {
    259. 

  259.   tree st= subtree (et, fp);
    260. 

  260.   int k, n= N(st);
    261. 

  261.   for (k=n-2; k>=0; k--)
    262. 

  262.     if (is_func (st[k], TWITH, 2))
    263. 

  263.       if ((var == "") || (var == st[k][0]))
    264. 

  264. 	remove (fp * k, 1);
    265. 

  265. }
    266. 

  266. 

  267. void
    268. 

  268. edit_table_rep::table_set_format (
    269. 

  269.   path fp, int I1, int J1, int I2, int J2, string var, tree val)
    270. 

  270. {
    271. 

  271.   table_del_format (fp, I1, J1, I2, J2, var);
    272. 

  272.   tree with (CWITH);
    273. 

  273.   with << as_string (I1) << as_string (I2)
    274. 

  274.        << as_string (J1) << as_string (J2)
    275. 

  275.        << var << val;
    276. 

  276.   tree st= subtree (et, fp);
    277. 

  277.   insert (fp * (N(st)-1), tree (TFORMAT, with));
    278. 

  278. }
    279. 

  279. 

  280. tree
    281. 

  281. edit_table_rep::table_get_format (
    282. 

  282.   path fp, int I1, int J1, int I2, int J2, string var)
    283. 

  283. {
    284. 

  284.   int i1, j1, i2, j2;
    285. 

  285.   int nr_rows, nr_cols;
    286. 

  286.   tree st= table_get_format (fp);
    287. 

  287.   table_get_extents (fp, nr_rows, nr_cols);
    288. 

  288.   with_decode (nr_rows, nr_cols, I1, J1, I2, J2, i1, j1, i2, j2);
    289. 

  289. 

  290.   int k, n= N(st);
    291. 

  291.   tree val= get_env_value (var);
    292. 

  292.   for (k=0; k<n; k++)
    293. 

  293.     if (is_func (st[k], CWITH, 6) && (st[k][4] == var)) {
    294. 

  294.       int row1, col1, row2, col2;
    295. 

  295.       with_read (st[k], nr_rows, nr_cols, row1, col1, row2, col2);
    296. 

  296.       if ((row1<=i1) && (col1<=j1) && (row2>=i2) && (col2>=j2))
    297. 

  297. 	val= st[k][5];
    298. 

  298.     }
    299. 

  299.   return val;
    300. 

  300. }
    301. 

  301. 

  302. void
    303. 

  303. edit_table_rep::table_del_format (
    304. 

  304.   path fp, int I1, int J1, int I2, int J2, string var)
    305. 

  305. {
    306. 

  306.   int i1, j1, i2, j2;
    307. 

  307.   int nr_rows, nr_cols;
    308. 

  308.   tree st= subtree (et, fp);
    309. 

  309.   table_get_extents (fp, nr_rows, nr_cols);
    310. 

  310.   with_decode (nr_rows, nr_cols, I1, J1, I2, J2, i1, j1, i2, j2);
    311. 

  311. 

  312.   int k, n= N(st);
    313. 

  313.   for (k=n-2; k>=0; k--)
    314. 

  314.     if (is_func (st[k], CWITH, 6))
    315. 

  315.       if ((var == "") || (var == st[k][4])) {
    316. 

  316. 	int row1, col1, row2, col2;
    317. 

  317. 	with_read (st[k], nr_rows, nr_cols, row1, col1, row2, col2);
    318. 

  318. 	if ((row1>=i1) && (col1>=j1) && (row2<=i2) && (col2<=j2))
    319. 

  319. 	  remove (fp * k, 1);
    320. 

  320.       }
    321. 

  321. }
    322. 

  322. 

  323. void
    324. 

  324. edit_table_rep::table_get_format (
    325. 

  325.   path fp, string var, tree** val, int nr_rows, int nr_cols)
    326. 

  326. {
    327. 

  327.   int i, j;
    328. 

  328.   tree def_val= get_env_value (var, fp);
    329. 

  329.   for (i=0; i<nr_rows; i++)
    330. 

  330.     for (j=0; j<nr_cols; j++)
    331. 

  331.       val[i][j]= def_val;
    332. 

  332. 

  333.   tree st= table_get_format (fp);
    334. 

  334.   int k, n= N(st);
    335. 

  335.   for (k=0; k<n; k++)
    336. 

  336.     if (is_func (st[k], CWITH, 6) && (st[k][4] == var)) {
    337. 

  337.       int row1, col1, row2, col2;
    338. 

  338.       with_read (st[k], nr_rows, nr_cols, row1, col1, row2, col2);
    339. 

  339.       for (i=row1; i<=row2; i++)
    340. 

  340. 	for (j=col1; j<=col2; j++)
    341. 

  341. 	  val[i][j]= st[k][5];
    342. 

  342.     }
    343. 

  343. }
    344. 

  344. 

  345. void
    346. 

  346. edit_table_rep::table_individualize (path fp, string var) {
    347. 

  347.   int nr_rows, nr_cols;
    348. 

  348.   tree st= subtree (et, fp);
    349. 

  349.   table_get_extents (fp, nr_rows, nr_cols);
    350. 

  350. 

  351.   int k, n= N(st);
    352. 

  352.   for (k=n-2; k>=0; k--)
    353. 

  353.     if (is_func (st[k], CWITH, 6))
    354. 

  354.       if ((var == "") || (var == st[k][4])) {
    355. 

  355. 	int i, j, row1, col1, row2, col2;
    356. 

  356. 	with_read (st[k], nr_rows, nr_cols, row1, col1, row2, col2);
    357. 

  357. 	if ((row1==row2) && (col1==col2)) continue;
    358. 

  358. 	row1= max (row1, 0); row2= min (row2, nr_rows-1);
    359. 

  359. 	col1= max (col1, 0); col2= min (col2, nr_cols-1);
    360. 

  360. 	tree ins_format (TFORMAT);
    361. 

  361. 	for (i=row1; i<=row2; i++)
    362. 

  362. 	  for (j=col1; j<=col2; j++) {
    363. 

  363. 	    tree with (CWITH);
    364. 

  364. 	    with << as_string (i+1) << as_string (i+1)
    365. 

  365. 		 << as_string (j+1) << as_string (j+1)
    366. 

  366. 		 << copy (st[k][4]) << copy (st[k][5]) << copy (st[k][6]);
    367. 

  367. 	    ins_format << with;
    368. 

  368. 	  }
    369. 

  369. 	remove (fp * k, 1);
    370. 

  370. 	insert (fp * k, ins_format);
    371. 

  371.       }
    372. 

  372. }
    373. 

  373. 

  374. void
    375. 

  375. edit_table_rep::table_format_center (path fp, int row, int col) {
    376. 

  376.   int nr_rows, nr_cols;
    377. 

  377.   tree st= subtree (et, fp);
    378. 

  378.   table_get_extents (fp, nr_rows, nr_cols);
    379. 

  379.   int Row1= row+1;
    380. 

  380.   int Col1= col+1;
    381. 

  381.   int Row2= row-nr_rows;
    382. 

  382.   int Col2= col-nr_cols;
    383. 

  383. 

  384.   int k, n= N(st);
    385. 

  385.   for (k=n-2; k>=0; k--)
    386. 

  386.     if (is_func (st[k], CWITH, 6)) {
    387. 

  387.       int I1, I2, J1, J2, i1, i2, j1, j2;
    388. 

  388.       with_read (st[k], nr_rows, nr_cols, I1, J1, I2, J2, i1, j1, i2, j2);
    389. 

  389. 

  390.       if (i1 == row) I1= Row1;
    391. 

  391.       else if (i1 < row) I1= i1+1;
    392. 

  392.       else I1= i1-nr_rows;
    393. 

  393.       if (i2 == row) I2= Row2;
    394. 

  394.       else if (i2 < row) I2= i2+1;
    395. 

  395.       else I2= i2-nr_rows;
    396. 

  396. 

  397.       if (j1 == col) J1= Col1;
    398. 

  398.       else if (j1 < col) J1= j1+1;
    399. 

  399.       else J1= j1-nr_cols;
    400. 

  400.       if (j2 == col) J2= Col2;
    401. 

  401.       else if (j2 < col) J2= j2+1;
    402. 

  402.       else J2= j2-nr_cols;
    403. 

  403. 

  404.       assign (fp * path (k, 0), as_string (I1));
    405. 

  405.       assign (fp * path (k, 1), as_string (I2));
    406. 

  406.       assign (fp * path (k, 2), as_string (J1));
    407. 

  407.       assign (fp * path (k, 3), as_string (J2));
    408. 

  408.     }
    409. 

  409. }
    410. 

  410. 

  411. /******************************************************************************
    412. 

  412. * Inserting and deleteing new rows and columns
    413. 

  413. ******************************************************************************/
    414. 

  414. 

  415. void
    416. 

  416. edit_table_rep::table_get_extents (path fp, int& nr_rows, int& nr_cols) {
    417. 

  417.   ::table_get_extents (subtree (et, fp), nr_rows, nr_cols);
    418. 

  418. }
    419. 

  419. 

  420. void
    421. 

  421. edit_table_rep::table_set_extents (path fp, int nr_rows, int nr_cols) {
    422. 

  422.   int old_rows, old_cols;
    423. 

  423.   table_get_extents (fp, old_rows, old_cols);
    424. 

  424.   if (nr_rows > old_rows || nr_cols > old_cols)
    425. 

  425.     table_insert (fp, old_rows, old_cols,
    426. 

  426.                   max (0, nr_rows - old_rows),
    427. 

  427.                   max (0, nr_cols - old_cols));
    428. 

  428.   if (nr_rows < old_rows || nr_cols < old_cols)
    429. 

  429.     table_remove (fp, nr_rows, nr_cols,
    430. 

  430.                   max (0, old_rows - nr_rows),
    431. 

  431.                   max (0, old_cols - nr_cols));
    432. 

  432. }
    433. 

  433. 

  434. void
    435. 

  435. edit_table_rep::table_get_limits (
    436. 

  436.   path fp, int& i1, int& j1, int& i2, int& j2) 
    437. 

  437. {
    438. 

  438.   i1= max (1, as_int (table_get_format (fp, TABLE_MIN_ROWS)));
    439. 

  439.   j1= max (1, as_int (table_get_format (fp, TABLE_MIN_COLS)));
    440. 

  440.   i2= as_int (table_get_format (fp, TABLE_MAX_ROWS));
    441. 

  441.   j2= as_int (table_get_format (fp, TABLE_MAX_COLS));
    442. 

  442.   if (i2<i1) i2= 0x7fffffff;
    443. 

  443.   if (j2<i1) j2= 0x7fffffff;
    444. 

  444. }
    445. 

  445. 

  446. void
    447. 

  447. edit_table_rep::table_remove (path fp, int row, int col, int delr, int delc) {
    448. 

  448.   path p= search_table (fp);
    449. 

  449.   int nr_rows, nr_cols;
    450. 

  450.   table_get_extents (p, nr_rows, nr_cols);
    451. 

  451.   tree T= subtree (et, p);
    452. 

  452.   if (delr>0)
    453. 

  453.     if (row+delr <= N(T)) {
    454. 

  454.       if (delr == N(T)) {
    455. 

  455. 	destroy_table ();
    456. 

  456. 	return;
    457. 

  457.       }
    458. 

  458.       remove (p * row, delr);
    459. 

  459.     }
    460. 

  460. 

  461.   T= subtree (et, p);
    462. 

  462.   if (delc>0)
    463. 

  463.     for (row=0; row<N(T); row++) {
    464. 

  464.       path q= search_row (p, row);
    465. 

  465.       tree R= subtree (et, q);
    466. 

  466.       if (col+delc <= N(R)) {
    467. 

  467. 	if (delc == N(R)) {
    468. 

  468. 	  destroy_table ();
    469. 

  469. 	  return;
    470. 

  470. 	}
    471. 

  471. 	remove (q * col, delc);
    472. 

  472.       }
    473. 

  473.     }
    474. 

  474. 

  475.   tree st= subtree (et, fp);
    476. 

  476.   if (!is_func (st, TFORMAT)) return;
    477. 

  477.   int k, n= N(st);
    478. 

  478.   for (k=n-2; k>=0; k--)
    479. 

  479.     if (is_func (st[k], CWITH, 6)) {
    480. 

  480.       int I1, I2, J1, J2, i1, i2, j1, j2;
    481. 

  481.       with_read (st[k], nr_rows, nr_cols, I1, J1, I2, J2, i1, j1, i2, j2);
    482. 

  482.       if (delr>0) {
    483. 

  483. 	if ((row<=i1) && (i2<row+delr)) { remove (fp * k, 1); continue; }
    484. 

  484. 	if ((I1>0) && (i1>=row))
    485. 

  485. 	  assign (fp * path (k, 0), as_string (I1- min (delr, i1- row)));
    486. 

  486. 	if ((I1<0) && (i1<row+delr))
    487. 

  487. 	  assign (fp * path (k, 0), as_string (I1+ delr+ min (0, row- 1- i1)));
    488. 

  488. 	if ((I2>0) && (i2>=row))
    489. 

  489. 	  assign (fp * path (k, 1), as_string (I2- min (delr, i2- row)));
    490. 

  490. 	if ((I2<0) && (i2<row+delr))
    491. 

  491. 	  assign (fp * path (k, 1), as_string (I2+ delr+ min (0, row- 1- i2)));
    492. 

  492.       }
    493. 

  493.       if (delc>0) {
    494. 

  494. 	if ((col<=j1) && (j2<col+delc)) { remove (fp * k, 1); continue; }
    495. 

  495. 	if ((J1>0) && (j1>=col))
    496. 

  496. 	  assign (fp * path (k, 2), as_string (J1- min (delc, j1- col)));
    497. 

  497. 	if ((J1<0) && (j1<col+delc))
    498. 

  498. 	  assign (fp * path (k, 2), as_string (J1+ delc+ min (0, col- 1- j1)));
    499. 

  499. 	if ((J2>0) && (j2>=col))
    500. 

  500. 	  assign (fp * path (k, 3), as_string (J2- min (delc, j2- col)));
    501. 

  501. 	if ((J2<0) && (j2<col+delc))
    502. 

  502. 	  assign (fp * path (k, 3), as_string (J2+ delc+ min (0, col- 1- j2)));
    503. 

  503.       }
    504. 

  504.     }
    505. 

  505. }
    506. 

  506. 

  507. void
    508. 

  508. edit_table_rep::table_insert (path fp, int row, int col, int insr, int insc) {
    509. 

  509.   path p= search_table (fp);
    510. 

  510.   int nr_rows, nr_cols;
    511. 

  511.   table_get_extents (p, nr_rows, nr_cols);
    512. 

  512.   tree T= subtree (et, p);
    513. 

  513.   if (insr>0)
    514. 

  514.     if (row <= N(T))
    515. 

  515.       insert (p * row, empty_table (insr, nr_cols));
    516. 

  516. 

  517.   T= subtree (et, p);
    518. 

  518.   if (insc>0)
    519. 

  519.     for (row=0; row<N(T); row++) {
    520. 

  520.       path q= search_row (p, row);
    521. 

  521.       tree R= subtree (et, q);
    522. 

  522.       if (col <= N(R))
    523. 

  523. 	insert (q * col, empty_row (insc));
    524. 

  524.     }
    525. 

  525. 

  526.   tree st= subtree (et, fp);
    527. 

  527.   if (!is_func (st, TFORMAT)) return;
    528. 

  528.   int k, n= N(st);
    529. 

  529.   for (k=n-2; k>=0; k--)
    530. 

  530.     if (is_func (st[k], CWITH, 6)) {
    531. 

  531.       int I1, I2, J1, J2, i1, i2, j1, j2;
    532. 

  532.       with_read (st[k], nr_rows, nr_cols, I1, J1, I2, J2, i1, j1, i2, j2);
    533. 

  533.       if (insr>0) {
    534. 

  534. 	bool flag= (I1<=0) || (I2>=0);
    535. 

  535. 	if ((I1>0) && ((i1>row) || (flag && (i1==row))))
    536. 

  536. 	  assign (fp* path (k,0), as_string (I1+insr));
    537. 

  537. 	if ((I1<0) && (i1<row))
    538. 

  538. 	  assign (fp* path (k,0), as_string (I1-insr));
    539. 

  539. 	if ((I2>0) && (i2>=row))
    540. 

  540. 	  assign (fp* path (k,1), as_string (I2+insr));
    541. 

  541. 	if ((I2<0) && ((i2<row-1) || (flag && (i2==row-1))))
    542. 

  542. 	  assign (fp* path (k,1), as_string (I2-insr));
    543. 

  543.       }
    544. 

  544.       if (insc>0) {
    545. 

  545. 	bool flag= (J1<=0) || (J2>=0);
    546. 

  546. 	if ((J1>0) && ((j1>col) || (flag && (j1==col))))
    547. 

  547. 	  assign (fp * path (k,2), as_string (J1+insc));
    548. 

  548. 	if ((J1<0) && (j1<col))
    549. 

  549. 	  assign (fp * path (k,2), as_string (J1-insc));
    550. 

  550. 	if ((J2>0) && (j2>=col))
    551. 

  551. 	  assign (fp * path (k,3), as_string (J2+insc));
    552. 

  552. 	if ((J2<0) && ((j2<col-1) || (flag && (j2==col-1))))
    553. 

  553. 	  assign (fp * path (k,3), as_string (J2-insc));
    554. 

  554.       }
    555. 

  555.     }
    556. 

  556. }
    557. 

  557. 

  558. /******************************************************************************
    559. 

  559. * Cursor positioning
    560. 

  560. ******************************************************************************/
    561. 

  561. 

  562. void
    563. 

  563. edit_table_rep::table_bound (
    564. 

  564.   path fp, int& row1, int& col1, int& row2, int& col2)
    565. 

  565. {
    566. 

  566.   fp= search_format (fp);
    567. 

  567.   if (!is_func (subtree (et, fp), TFORMAT)) return;
    568. 

  568. 

  569.   int i, j, ii, jj, nr_rows, nr_cols;
    570. 

  570.   table_get_extents (fp, nr_rows, nr_cols);
    571. 

  571.   tree** rs= tm_new_array<tree*> (nr_rows);
    572. 

  572.   tree** cs= tm_new_array<tree*> (nr_rows);
    573. 

  573.   for (i=0; i<nr_rows; i++) {
    574. 

  574.     rs[i]= tm_new_array<tree> (nr_cols);
    575. 

  575.     cs[i]= tm_new_array<tree> (nr_cols);
    576. 

  576.   }
    577. 

  577.   table_get_format (fp, CELL_ROW_SPAN, rs, nr_rows, nr_cols);
    578. 

  578.   table_get_format (fp, CELL_COL_SPAN, cs, nr_rows, nr_cols);
    579. 

  579. 

  580.   for (i=0; i<nr_rows; i++)
    581. 

  581.     for (j=0; j<nr_cols; j++) {
    582. 

  582.       int m= min (as_int (rs[i][j]), nr_rows-i);
    583. 

  583.       int n= min (as_int (rs[i][j]), nr_cols-j);
    584. 

  584.       if ((m>1) || (n>1)) {
    585. 

  585. 	if ((row1 < i+m) && (col1 < j+n) && (row2 >= i) && (col2 >= j)) {
    586. 

  586. 	  row1= min (row1, i);
    587. 

  587. 	  col1= min (col1, j);
    588. 

  588. 	  row2= max (row2, i+m-1);
    589. 

  589. 	  col2= max (col2, j+n-1);
    590. 

  590. 	}
    591. 

  591. 	for (ii=0; ii<m; ii++)
    592. 

  592. 	  for (jj=0; jj<n; jj++) {
    593. 

  593. 	    rs[i+ii][j+jj]= "0";
    594. 

  594. 	    cs[i+ii][j+jj]= "0";
    595. 

  595. 	  }
    596. 

  596.       }
    597. 

  597.     }
    598. 

  598.   
    599. 

  599.   for (i=0; i<nr_rows; i++) {
    600. 

  600.     tm_delete_array (rs[i]);
    601. 

  601.     tm_delete_array (cs[i]);
    602. 

  602.   }
    603. 

  603.   tm_delete_array (rs);
    604. 

  604.   tm_delete_array (cs);
    605. 

  605. }
    606. 

  606. 

  607. void
    608. 

  608. edit_table_rep::table_go_to (path fp, int row, int col, bool at_start) {
    609. 

  609.   int nr_rows, nr_cols;
    610. 

  610.   fp= search_format (fp);
    611. 

  611.   table_get_extents (fp, nr_rows, nr_cols);
    612. 

  612.   if (row<0) row= 0;
    613. 

  613.   if (col<0) col= 0;
    614. 

  614.   if (row>=nr_rows) row= nr_rows-1;
    615. 

  615.   if (col>=nr_cols) col= nr_cols-1;
    616. 

  616.   if (is_func (subtree (et, fp), TFORMAT)) {
    617. 

  617.     int row2= row, col2= col;
    618. 

  618.     table_bound (fp, row, col, row2, col2);
    619. 

  619.   }
    620. 

  620.   path q= search_cell (fp, row, col);
    621. 

  621.   go_to_border (q, at_start);
    622. 

  622. }
    623. 

  623. 

  624. void
    625. 

  625. edit_table_rep::table_go_to_border (path fp, bool right) {
    626. 

  626.   while ((rp < fp) && (is_func (subtree (et, path_up (fp)), TFORMAT)))
    627. 

  627.     fp= path_up (fp);
    628. 

  628.   if ((rp < fp) &&
    629. 

  629.       is_document (subtree (et, path_up (fp))) &&
    630. 

  630.       (rp < path_up (fp)) &&
    631. 

  631.       is_extension (subtree (et, path_up (fp, 2)), 1))
    632. 

  632.     fp= path_up (fp);
    633. 

  633.   if ((rp < fp) && is_extension (subtree (et, path_up (fp)), 1))
    634. 

  634.     fp= path_up (fp);
    635. 

  635.   if ((rp < fp) && is_func (subtree (et, path_up (fp)), SUBTABLE, 1))
    636. 

  636.     fp= path_up (fp);
    637. 

  637.   go_to_border (fp, right);
    638. 

  638. }
    639. 

  639. 

  640. void
    641. 

  641. edit_table_rep::back_table (path p, bool forward) {
    642. 

  642.   while (true) {
    643. 

  643.     tree st= subtree (et, p);
    644. 

  644.     if (!is_func (st, TFORMAT)) break;
    645. 

  645.     if (!is_func (st [N(st)-1], TABLE)) {
    646. 

  646.       back_general (p, forward);
    647. 

  647.       return;
    648. 

  648.     }
    649. 

  649.     p= p * (N(st)-1);
    650. 

  650.   }
    651. 

  651.   while (rp < p) {
    652. 

  652.     tree st= subtree (et, p);
    653. 

  653.     if (is_func (st, TABLE)) break;
    654. 

  654.     p= path_up (p);
    655. 

  655.   }
    656. 

  656.   if (!(rp < p)) return;
    657. 

  657. 

  658.   if (forward) table_go_to (p, 0, 0, true);
    659. 

  659.   else {
    660. 

  660.     int nr_rows, nr_cols;
    661. 

  661.     table_get_extents (p, nr_rows, nr_cols);
    662. 

  662.     table_go_to (p, nr_rows-1, nr_cols-1, false);
    663. 

  663.   }
    664. 

  664. }
    665. 

  665. 

  666. void
    667. 

  667. edit_table_rep::back_in_table (tree t, path p, bool forward) {
    668. 

  668.   if (is_func (t, TFORMAT) &&
    669. 

  669.       (is_func (subtree (et, path_up (p, 2)), INACTIVE) || in_source ()))
    670. 

  670.     {
    671. 

  671.       remove_empty_argument (p, forward);
    672. 

  672.       return;
    673. 

  673.     }
    674. 

  674. 

  675.   int i, j, row, col, nr_rows, nr_cols;
    676. 

  676.   p= search_table (row, col);
    677. 

  677.   if (is_nil (p)) return;
    678. 

  678.   table_get_extents (p, nr_rows, nr_cols);
    679. 

  679. 

  680.   bool flag=true;
    681. 

  681.   for (j=0; j<nr_cols; j++) {
    682. 

  682.     path q= search_cell (p, row, j);
    683. 

  683.     flag= flag && is_empty_cell (subtree (et, q));
    684. 

  684.   }
    685. 

  685.   if (flag) {
    686. 

  686.     int i1, j1, i2, j2;
    687. 

  687.     path fp= search_format ();
    688. 

  688.     if (is_nil (fp)) return;
    689. 

  689.     table_get_limits (fp, i1, j1, i2, j2);
    690. 

  690.     if (nr_rows-1 >= i1) {
    691. 

  691.       table_remove_row (forward, true);
    692. 

  692.       return;
    693. 

  693.     }
    694. 

  694.   }
    695. 

  695. 

  696.   flag= true;
    697. 

  697.   for (i=0; i<nr_rows; i++) {
    698. 

  698.     path q= search_cell (p, i, col);
    699. 

  699.     flag= flag && is_empty_cell (subtree (et, q));
    700. 

  700.   }
    701. 

  701.   if (flag) {
    702. 

  702.     int i1, j1, i2, j2;
    703. 

  703.     path fp= search_format ();
    704. 

  704.     if (is_nil (fp)) return;
    705. 

  705.     table_get_limits (fp, i1, j1, i2, j2);
    706. 

  706.     if (nr_cols-1 >= j1) {
    707. 

  707.       table_remove_column (forward, true);
    708. 

  708.       return;
    709. 

  709.     }
    710. 

  710.   }
    711. 

  711. 

  712.   flag=true;
    713. 

  713.   for (i=0; i<nr_rows; i++)
    714. 

  714.     for (j=0; j<nr_cols; j++) {
    715. 

  715.       path q= search_cell (p, i, j);
    716. 

  716.       flag= flag && is_empty_cell (subtree (et, q));
    717. 

  717.     }
    718. 

  718.   if (flag) {
    719. 

  719.     destroy_table ();
    720. 

  720.     return;
    721. 

  721.   }
    722. 

  722. 

  723.   if (forward) {
    724. 

  724.     if (col<(nr_cols-1)) { table_go_to (p, row, col+1, true); return; }
    725. 

  725.     if (row<(nr_rows-1)) { table_go_to (p, row+1, 0, true); return; }
    726. 

  726.   }
    727. 

  727.   else {
    728. 

  728.     if (col>0) { table_go_to (p, row, col-1, false); return; }
    729. 

  729.     if (row>0) { table_go_to (p, row-1, nr_cols-1, false); return; }
    730. 

  730.   }
    731. 

  731.   table_go_to_border (p, !forward);
    732. 

  732. }
    733. 

  733. 

  734. /******************************************************************************
    735. 

  735. * Routines for subtables
    736. 

  736. ******************************************************************************/
    737. 

  737. 

  738. tree
    739. 

  739. edit_table_rep::table_get_subtable (
    740. 

  740.   path fp, int row1, int col1, int row2, int col2)
    741. 

  741. {
    742. 

  742.   return table_get_subtable (fp, row1, col1, row2, col2, false);
    743. 

  743. }
    744. 

  744. 

  745. tree
    746. 

  746. edit_table_rep::table_get_subtable (
    747. 

  747.   path fp, int row1, int col1, int row2, int col2, bool recurse)
    748. 

  748. {
    749. 

  749.   path p= search_table (fp);
    750. 

  750.   int i, j, nr_rows, nr_cols;
    751. 

  751.   table_get_extents (p, nr_rows, nr_cols);
    752. 

  752.   tree st= subtree (et, p);
    753. 

  753.   tree subtable (TABLE, row2+1-row1);
    754. 

  754.   for (i=row1; i<=row2; i++) {
    755. 

  755.     tree sr= st[i];
    756. 

  756.     tree sub_row (ROW, col2+1-col1);
    757. 

  757.     while (is_func (sr, TFORMAT)) sr= sr[N(sr)-1];
    758. 

  758.     for (j=col1; j<=col2; j++)
    759. 

  759.       sub_row[j-col1]= copy (sr[j]);
    760. 

  760.     subtable[i-row1]= sub_row;
    761. 

  761.   }
    762. 

  762. 

  763.   st= subtree (et, fp);
    764. 

  764.   if ((!recurse) && (!is_func (st, TFORMAT))) return subtable;
    765. 

  765.   if (recurse) st= table_get_format (fp);
    766. 

  766.   else st= st (0, N(st)-1);
    767. 

  767.   int k, n= N(st);
    768. 

  768.   tree sub_format (TFORMAT);
    769. 

  769.   for (k=0; k<n; k++)
    770. 

  770.     if (is_func (st[k], CWITH, 6)) {
    771. 

  771.       int I1, I2, J1, J2, i1, i2, j1, j2;
    772. 

  772.       with_read (st[k], nr_rows, nr_cols, I1, J1, I2, J2, i1, j1, i2, j2);
    773. 

  773.       if ((i1<=row2) && (i2>=row1) && (j1<=col2) && (j2>=col1)) {
    774. 

  774. 	I1= min (max (0, i1- row1), row2- row1) + 1;
    775. 

  775. 	I2= min (max (0, i2- row1), row2- row1) + 1;
    776. 

  776. 	J1= min (max (0, j1- col1), col2- col1) + 1;
    777. 

  777. 	J2= min (max (0, j2- col1), col2- col1) + 1;
    778. 

  778. 	tree with (CWITH);
    779. 

  779. 	with << as_string (I1) << as_string (I2)
    780. 

  780. 	     << as_string (J1) << as_string (J2)
    781. 

  781. 	     << copy (st[k][4]) << copy (st[k][5]);
    782. 

  782. 	sub_format << with;
    783. 

  783.       }
    784. 

  784.     }
    785. 

  785.   sub_format << subtable;
    786. 

  786.   return sub_format;
    787. 

  787. }
    788. 

  788. 

  789. static tree
    790. 

  790. shift_subtable (tree st, int sh_row, int sh_col) {
    791. 

  791.   st= copy (st);
    792. 

  792.   int k, n= N(st);
    793. 

  793.   for (k=0; k<n-1; k++)
    794. 

  794.     if (is_func (st[k], CWITH, 6)) {
    795. 

  795.       st[k][0]= as_string (as_int (st[k][0]) + sh_row);
    796. 

  796.       st[k][1]= as_string (as_int (st[k][1]) + sh_row);
    797. 

  797.       st[k][2]= as_string (as_int (st[k][2]) + sh_col);
    798. 

  798.       st[k][3]= as_string (as_int (st[k][3]) + sh_col);
    799. 

  799.     }
    800. 

  800.   return st;
    801. 

  801. }
    802. 

  802. 

  803. void
    804. 

  804. edit_table_rep::table_write_subtable (
    805. 

  805.   path fp, int row, int col, tree subt)
    806. 

  806. {
    807. 

  807.   int nr_rows, nr_cols, sub_rows, sub_cols;
    808. 

  808.   table_get_extents (fp, nr_rows, nr_cols);
    809. 

  809.   ::table_get_extents (subt, sub_rows, sub_cols);
    810. 

  810.   if ((nr_rows < row+sub_rows) || (nr_cols < col+sub_cols)) return;
    811. 

  811. 

  812.   if (is_func (subtree (et, fp), TFORMAT) &&
    813. 

  813.       is_func (subt, TFORMAT))
    814. 

  814.     {
    815. 

  815.       tree sh_subt= shift_subtable (subt, row, col);
    816. 

  816.       sh_subt= sh_subt (0, N(sh_subt)-1);
    817. 

  817.       tree st= subtree (et, fp);
    818. 

  818.       insert (fp * (N(st)-1), sh_subt);
    819. 

  819.       subt= subt [N(subt)-1];
    820. 

  820.     }
    821. 

  821. 

  822.   int i, j;
    823. 

  823.   for (i=0; i<sub_rows; i++) {
    824. 

  824.     path rp  = search_row (fp, i+row);
    825. 

  825.     tree subr= subt[i];
    826. 

  826.     while (is_func (subr, TFORMAT)) subr= subr [N(subr)-1];
    827. 

  827.     for (j=0; j<sub_cols; j++) {
    828. 

  828.       path cp  = search_cell (rp, j+col);
    829. 

  829.       tree subc= subr[j];
    830. 

  830.       while (is_func (subc, TFORMAT)) subc= subc [N(subr)-1];
    831. 

  831.       if (is_func (subc, CELL, 1)) subc= subc[0];
    832. 

  832.       assign (cp, copy (subc));
    833. 

  833.     }
    834. 

  834.   }
    835. 

  835. }
    836. 

  836. 

  837. void
    838. 

  838. edit_table_rep::table_hor_insert_subtable (path fp, int col, tree subt) {
    839. 

  839.   int nr_rows, nr_cols, sub_rows, sub_cols;
    840. 

  840.   table_get_extents (fp, nr_rows, nr_cols);
    841. 

  841.   ::table_get_extents (subt, sub_rows, sub_cols);
    842. 

  842.   if (sub_rows != nr_rows) return;
    843. 

  843.   table_insert (fp, 0, col, 0, sub_cols);
    844. 

  844.   table_write_subtable (fp, 0, col, subt);
    845. 

  845. }
    846. 

  846. 

  847. void
    848. 

  848. edit_table_rep::table_ver_insert_subtable (path fp, int row, tree subt) {
    849. 

  849.   int nr_rows, nr_cols, sub_rows, sub_cols;
    850. 

  850.   table_get_extents (fp, nr_rows, nr_cols);
    851. 

  851.   ::table_get_extents (subt, sub_rows, sub_cols);
    852. 

  852.   if (sub_cols != nr_cols) return;
    853. 

  853.   table_insert (fp, row, 0, sub_rows, 0);
    854. 

  854.   table_write_subtable (fp, row, 0, subt);
    855. 

  855. }
    856. 

  856. 

  857. /******************************************************************************
    858. 

  858. * Decorations
    859. 

  859. ******************************************************************************/
    860. 

  860. 

  861. void
    862. 

  862. edit_table_rep::table_force_decoration (path fp, int row, int col) {
    863. 

  863.   row++; col++;
    864. 

  864.   tree old= table_get_format (fp, row, col, row, col, CELL_DECORATION);
    865. 

  865.   if (old == "") {
    866. 

  866.     tree f (TFORMAT, tree (TABLE, tree (ROW, tree (TMARKER))));
    867. 

  867.     table_set_format (fp, row, col, row, col, CELL_DECORATION, f);
    868. 

  868.   }
    869. 

  869. }
    870. 

  870. 

  871. static void
    872. 

  872. search_decoration (tree T, int& row, int& col) {
    873. 

  873.   while (is_func (T, TFORMAT)) T= T [N(T)-1];
    874. 

  874.   for (row=0; row<N(T); row++) {
    875. 

  875.     tree R= T[row];
    876. 

  876.     while (is_func (R, TFORMAT)) R= R [N(R)-1];
    877. 

  877.     for (col=0; col<N(R); col++) {
    878. 

  878.       tree C= R[col];
    879. 

  879.       while (is_func (C, TFORMAT)) C= C [N(C)-1];
    880. 

  880.       if (C == tree (TMARKER)) return;
    881. 

  881.     }
    882. 

  882.   }
    883. 

  883.   FAILED ("decoration not found");
    884. 

  884. }
    885. 

  885. 

  886. static tree
    887. 

  887. table_format_undecorate (tree st, int row, int col, int dec_row, int dec_col) {
    888. 

  888.   tree fm (TFORMAT);
    889. 

  889.   int k, n= N(st);
    890. 

  890.   for (k=0; k<n-1; k++)
    891. 

  891.     if ((as_int (st[k][0]) <= (row+1)) && (as_int (st[k][1]) >= (row+1)) &&
    892. 

  892. 	(as_int (st[k][2]) <= (col+1)) && (as_int (st[k][3]) >= (col+1)))
    893. 

  893.       if (is_func (st[k], CWITH, 6) && (st[k][4] != CELL_DECORATION)) {
    894. 

  894. 	tree with= copy (st[k]);
    895. 

  895. 	with[0]= as_string (dec_row+1);
    896. 

  896. 	with[1]= as_string (dec_row+1);
    897. 

  897. 	with[2]= as_string (dec_col+1);
    898. 

  898. 	with[3]= as_string (dec_col+1);
    899. 

  899. 	fm << with;
    900. 

  900.       }
    901. 

  901.   return fm;
    902. 

  902. }
    903. 

  903. 

  904. static tree
    905. 

  905. table_undecorate (tree st, int row, int col) {
    906. 

  906.   int k, n= N(st);
    907. 

  907.   for (k=0; k<n-1; k++)
    908. 

  908.     if ((as_int (st[k][0]) == (row+1)) && (as_int (st[k][2]) == (col+1)))
    909. 

  909.       if (is_func (st[k], CWITH, 6) && (st[k][4] == CELL_DECORATION)) {
    910. 

  910. 	int dec_row= 0, dec_col= 0;
    911. 

  911. 	tree T= copy (st[k][5]);
    912. 

  912. 	search_decoration (T, dec_row, dec_col);
    913. 

  913. 	table_set (T, dec_row, dec_col, table_get (st[n-1], row, col));
    914. 

  914. 	tree F= table_format_undecorate (st, row, col, dec_row, dec_col);
    915. 

  915. 	return F * T;
    916. 

  916.       }
    917. 

  917.   FAILED ("decoration not found");
    918. 

  918.   return "";
    919. 

  919. }
    920. 

  920. 

  921. void
    922. 

  922. edit_table_rep::table_hor_decorate (path fp, int col, int cbef, int caft) {
    923. 

  923.   tree st= subtree (et, fp);
    924. 

  924.   if (!is_func (st, TFORMAT)) return;
    925. 

  925.   if (cbef+caft == 0) return;
    926. 

  926.   int i, j, k, nr_rows, nr_cols;
    927. 

  927.   path p= search_table (fp);
    928. 

  928.   table_get_extents (p, nr_rows, nr_cols);
    929. 

  929.   table_individualize (fp, CELL_DECORATION);
    930. 

  930. 

  931.   for (i=0; i<nr_rows; i++)
    932. 

  932.     for (j=col-cbef; j<=col+caft; j++)
    933. 

  933.       table_force_decoration (fp, i, j);
    934. 

  934. 

  935.   tree t1, t2;
    936. 

  936.   if (caft>0)
    937. 

  937.     t2= table_get_subtable (fp, 0, col+1   , nr_rows-1, col+caft, true);
    938. 

  938.   if (cbef>0)
    939. 

  939.     t1= table_get_subtable (fp, 0, col-cbef, nr_rows-1, col-1   , true);
    940. 

  940.   if (caft>0) table_remove (fp, 0, col+1   , 0, caft);
    941. 

  941.   if (cbef>0) table_remove (fp, 0, col-cbef, 0, cbef);
    942. 

  942.   col -= cbef;
    943. 

  943. 

  944.   st= subtree (et, fp);
    945. 

  945.   int n= N(st);
    946. 

  946.   for (k=0; k<n-1; k++)
    947. 

  947.     if (is_func (st[k], CWITH, 6) && (st[k][4] == CELL_DECORATION)) {
    948. 

  948.       int i1, j1, i2, j2;
    949. 

  949.       with_read (st[k], nr_rows, nr_cols, i1, j1, i2, j2);
    950. 

  950.       if (j1 != col) continue;
    951. 

  951.       for (j=0; j<caft; j++) {
    952. 

  952. 	tree inst= table_undecorate (t2, i1, j);
    953. 

  953. 	int sub_rows, sub_cols;
    954. 

  954. 	::table_get_extents (st[k][5], sub_rows, sub_cols);
    955. 

  955. 	table_hor_insert_subtable (fp * path (k, 5), sub_cols, inst);
    956. 

  956.       }
    957. 

  957.       for (j=cbef-1; j>=0; j--) {
    958. 

  958. 	tree inst= table_undecorate (t1, i1, j);
    959. 

  959. 	table_hor_insert_subtable (fp * path (k, 5), 0, inst);
    960. 

  960.       }
    961. 

  961.     }
    962. 

  962. }
    963. 

  963. 

  964. void
    965. 

  965. edit_table_rep::table_ver_decorate (path fp, int row, int rbef, int raft) {
    966. 

  966.   tree st= subtree (et, fp);
    967. 

  967.   if (!is_func (st, TFORMAT)) return;
    968. 

  968.   if (rbef+raft == 0) return;
    969. 

  969.   int i, j, k, nr_rows, nr_cols;
    970. 

  970.   path p= search_table (fp);
    971. 

  971.   table_get_extents (p, nr_rows, nr_cols);
    972. 

  972.   table_individualize (fp, CELL_DECORATION);
    973. 

  973. 

  974.   for (i=row-rbef; i<=row+raft; i++)
    975. 

  975.     for (j=0; j<nr_cols; j++)
    976. 

  976.       table_force_decoration (fp, i, j);
    977. 

  977. 

  978.   tree t1, t2;
    979. 

  979.   if (raft>0)
    980. 

  980.     t2= table_get_subtable (fp, row+1   , 0, row+raft, nr_cols-1, true);
    981. 

  981.   if (rbef>0)
    982. 

  982.     t1= table_get_subtable (fp, row-rbef, 0, row-1   , nr_cols-1, true);
    983. 

  983.   if (raft>0) table_remove (fp, row+1   , 0, raft, 0);
    984. 

  984.   if (rbef>0) table_remove (fp, row-rbef, 0, rbef, 0);
    985. 

  985.   row -= rbef;
    986. 

  986. 

  987.   st= subtree (et, fp);
    988. 

  988.   int n= N(st);
    989. 

  989.   for (k=0; k<n-1; k++)
    990. 

  990.     if (is_func (st[k], CWITH, 6) && (st[k][4] == CELL_DECORATION)) {
    991. 

  991.       int i1, j1, i2, j2;
    992. 

  992.       with_read (st[k], nr_rows, nr_cols, i1, j1, i2, j2);
    993. 

  993.       if (i1 != row) continue;
    994. 

  994.       for (i=0; i<raft; i++) {
    995. 

  995. 	tree inst= table_undecorate (t2, i, j1);
    996. 

  996. 	int sub_rows, sub_cols;
    997. 

  997. 	::table_get_extents (st[k][5], sub_rows, sub_cols);
    998. 

  998. 	table_ver_insert_subtable (fp * path (k, 5), sub_rows, inst);
    999. 

  999.       }
    1000. 

  1000.       for (i=rbef-1; i>=0; i--) {
    1001. 

  1001. 	tree inst= table_undecorate (t1, i, j1);
    1002. 

  1002. 	table_ver_insert_subtable (fp * path (k, 5), 0, inst);
    1003. 

  1003.       }
    1004. 

  1004.     }
    1005. 

  1005. }
    1006. 

  1006. 

  1007. /******************************************************************************
    1008. 

  1008. * User interface
    1009. 

  1009. ******************************************************************************/
    1010. 

  1010. 

  1011. void
    1012. 

  1012. edit_table_rep::make_table (int nr_rows, int nr_cols) {
    1013. 

  1013.   //cout << "make_table " << nr_rows << ", " << nr_cols << "\n";
    1014. 

  1014.   tree T= empty_table (nr_rows, nr_cols);
    1015. 

  1015.   path p (0, 0, 0, 0);
    1016. 

  1016.   tree format_T (TFORMAT, T);
    1017. 

  1017.   insert_tree (format_T, path (N(format_T)-1, p));
    1018. 

  1018. 

  1019.   int i1, j1, i2, j2;
    1020. 

  1020.   path fp= search_format ();
    1021. 

  1021.   if (is_nil (fp)) return;
    1022. 

  1022.   table_get_limits (fp, i1, j1, i2, j2);
    1023. 

  1023.   if ((nr_rows<i1) || (nr_cols<j1)) {
    1024. 

  1024.     T= empty_table (max (nr_rows, i1), max (nr_cols, j1));
    1025. 

  1025.     format_T= tree (TFORMAT, T);
    1026. 

  1026.     assign (fp, format_T);
    1027. 

  1027.     go_to (fp * path (N(format_T)-1, p));
    1028. 

  1028.   }
    1029. 

  1029. 

  1030.   string hyphen= as_string (table_get_format (fp, TABLE_HYPHEN));
    1031. 

  1031.   if (hyphen == "y") {
    1032. 

  1032.     path q= fp;
    1033. 

  1033.     if (is_extension (subtree (et, path_up (q)), 1)) q= path_up (q);
    1034. 

  1034.     tree st= subtree (et, path_up (q));
    1035. 

  1035.     if (is_document (st)) insert_node (fp * 0, DOCUMENT);
    1036. 

  1036.     else if (is_concat (st) && is_document (subtree (et, path_up (q, 2)))) {
    1037. 

  1037.       int n= N(st), l= last_item (q);
    1038. 

  1038.       insert_node (fp * 0, DOCUMENT);
    1039. 

  1039.       if (l != (n-1)) {
    1040. 

  1040. 	split (path_inc (q));
    1041. 

  1041. 	correct_concat (path_inc (path_up (q)));
    1042. 

  1042.       }
    1043. 

  1043.       if (l != 0) {
    1044. 

  1044. 	split (q);
    1045. 

  1045. 	correct_concat (path_inc (path_up (q)));
    1046. 

  1046.       }
    1047. 

  1047.       correct_concat (path_up (q));
    1048. 

  1048.     }
    1049. 

  1049.   }
    1050. 

  1050. 

  1051.   table_correct_block_content ();
    1052. 

  1052.   set_message (concat (kbd_shortcut ("(structured-insert-down)"),
    1053. 

  1053. 		       ": new row",
    1054. 

  1054. 		       kbd_shortcut ("(structured-insert-right)"),
    1055. 

  1055. 		       ": new column"),
    1056. 

  1056. 	       "table");
    1057. 

  1057. }
    1058. 

  1058. 

  1059. void
    1060. 

  1060. edit_table_rep::make_subtable (int nr_rows, int nr_cols) {
    1061. 

  1061.   path cp= search_upwards (CELL);
    1062. 

  1062.   if (is_nil (cp)) return;
    1063. 

  1063.   tree T= empty_table (nr_rows, nr_cols);
    1064. 

  1064.   path p (0, 0, 0, 0);
    1065. 

  1065.   T= tree (TFORMAT, T);
    1066. 

  1066.   p= path (N(T)-1, p);
    1067. 

  1067.   T= tree (SUBTABLE, T);
    1068. 

  1068.   p= path (0, p);
    1069. 

  1069.   assign (cp * 0, T);
    1070. 

  1070.   go_to (cp * path (0, p));
    1071. 

  1071.   table_correct_block_content ();
    1072. 

  1072.   set_message (concat (kbd_shortcut ("(structured-insert-down)"),
    1073. 

  1073. 		       ": new row",
    1074. 

  1074. 		       kbd_shortcut ("(structured-insert-right)"),
    1075. 

  1075. 		       ": new column"),
    1076. 

  1076. 	       "table");
    1077. 

  1077. }
    1078. 

  1078. 

  1079. void
    1080. 

  1080. edit_table_rep::destroy_table () {
    1081. 

  1081.   path fp= search_format ();
    1082. 

  1082.   if (is_nil (fp)) return;
    1083. 

  1083.   while (rp < fp) {
    1084. 

  1084.     tree st= subtree (et, path_up (fp));
    1085. 

  1085.     if (!is_func (st, TFORMAT)) break;
    1086. 

  1086.     fp= path_up (fp);
    1087. 

  1087.   }
    1088. 

  1088.   if ((rp < fp) &&
    1089. 

  1089.       is_document (subtree (et, path_up (fp))) &&
    1090. 

  1090.       (rp < path_up (fp)) &&
    1091. 

  1091.       is_extension (subtree (et, path_up (fp, 2)), 1))
    1092. 

  1092.     fp= path_up (fp);
    1093. 

  1093.   if ((rp < fp) && is_extension (subtree (et, path_up (fp)), 1))
    1094. 

  1094.     fp= path_up (fp);
    1095. 

  1095.   if ((rp < fp) && is_func (subtree (et, path_up (fp)), SUBTABLE, 1))
    1096. 

  1096.     fp= path_up (fp);
    1097. 

  1097.   assign (fp, "");
    1098. 

  1098.   correct (path_up (fp));
    1099. 

  1099. }
    1100. 

  1100. 

  1101. void
    1102. 

  1102. edit_table_rep::table_disactivate () {
    1103. 

  1103.   path fp= search_format ();
    1104. 

  1104.   if (is_nil (fp)) return;
    1105. 

  1105.   tree st= subtree (et, fp);
    1106. 

  1106.   if (!is_func (st, TFORMAT)) return;
    1107. 

  1107.   insert_node (fp * 0, INACTIVE);
    1108. 

  1108.   set_message ("return: reactivate", "deactivate table");
    1109. 

  1109. }
    1110. 

  1110. 

  1111. void
    1112. 

  1112. edit_table_rep::table_extract_format () {
    1113. 

  1113.   path fp= search_format ();
    1114. 

  1114.   if (is_nil (fp)) return;
    1115. 

  1115.   tree fm= table_get_format (fp);
    1116. 

  1116.   fm << "";
    1117. 

  1117.   if (is_extension (subtree (et, path_up (fp)), 1)) fp= path_up (fp);
    1118. 

  1118.   assign (fp, fm);
    1119. 

  1119.   go_to (fp * path (N(fm)-1, 0));
    1120. 

  1120. }
    1121. 

  1121. 

  1122. void
    1123. 

  1123. edit_table_rep::table_insert_row (bool forward) {
    1124. 

  1124.   int row, col;
    1125. 

  1125.   path fp= search_format (row, col);
    1126. 

  1126.   if (is_nil (fp)) return;
    1127. 

  1127.   int nr_rows, nr_cols, i1, j1, i2, j2;
    1128. 

  1128.   table_get_extents (fp, nr_rows, nr_cols);
    1129. 

  1129.   table_get_limits (fp, i1, j1, i2, j2);
    1130. 

  1130.   if (nr_rows+1 > i2) return;
    1131. 

  1131.   table_insert (fp, row + (forward? 1: 0), col, 1, 0);
    1132. 

  1132.   table_go_to (fp, row + (forward? 1: 0), col);
    1133. 

  1133.   table_correct_block_content ();
    1134. 

  1134. }
    1135. 

  1135. 

  1136. void
    1137. 

  1137. edit_table_rep::table_insert_column (bool forward) {
    1138. 

  1138.   int row, col;
    1139. 

  1139.   path fp= search_format (row, col);
    1140. 

  1140.   if (is_nil (fp)) return;
    1141. 

  1141.   int nr_rows, nr_cols, i1, j1, i2, j2;
    1142. 

  1142.   table_get_extents (fp, nr_rows, nr_cols);
    1143. 

  1143.   table_get_limits (fp, i1, j1, i2, j2);
    1144. 

  1144.   if (nr_cols+1 > j2) return;
    1145. 

  1145.   table_insert (fp, row, col + (forward? 1: 0), 0, 1);
    1146. 

  1146.   table_go_to (fp, row, col + (forward? 1: 0));
    1147. 

  1147.   table_correct_block_content ();
    1148. 

  1148. }
    1149. 

  1149. 

  1150. void
    1151. 

  1151. edit_table_rep::table_remove_row (bool forward, bool flag) {
    1152. 

  1152.   int row, col;
    1153. 

  1153.   path fp= search_format (row, col);
    1154. 

  1154.   if (is_nil (fp)) return;
    1155. 

  1155.   int nr_rows, nr_cols, i1, j1, i2, j2;
    1156. 

  1156.   table_get_extents (fp, nr_rows, nr_cols);
    1157. 

  1157.   table_get_limits (fp, i1, j1, i2, j2);
    1158. 

  1158.   if (nr_rows-1 < i1) destroy_table ();
    1159. 

  1159.   else if (flag) {
    1160. 

  1160.     table_remove (fp, row, col, 1, 0);
    1161. 

  1161.     int ncol= col;
    1162. 

  1162.     if ((!forward) && (col == 0)) ncol= nr_cols-1;
    1163. 

  1163.     if (forward && (col == nr_cols-1)) ncol= 0;
    1164. 

  1164.     table_go_to (fp, max (0, row + (forward? 0: -1)), ncol, forward);
    1165. 

  1165.   }
    1166. 

  1166.   else {
    1167. 

  1167.     if (!forward) row--;
    1168. 

  1168.     if (row >= 0) table_remove (fp, row, col, 1, 0);
    1169. 

  1169.     if (row < nr_rows-1 && forward) table_go_to (fp, row, col, forward);
    1170. 

  1170.     else if (forward || row < 0) table_go_to_border (fp, !forward);
    1171. 

  1171.   }
    1172. 

  1172.   table_correct_block_content ();
    1173. 

  1173. }
    1174. 

  1174. 

  1175. void
    1176. 

  1176. edit_table_rep::table_remove_column (bool forward, bool flag) {
    1177. 

  1177.   int row, col;
    1178. 

  1178.   path fp= search_format (row, col);
    1179. 

  1179.   if (is_nil (fp)) return;
    1180. 

  1180.   int nr_rows, nr_cols, i1, j1, i2, j2;
    1181. 

  1181.   table_get_extents (fp, nr_rows, nr_cols);
    1182. 

  1182.   table_get_limits (fp, i1, j1, i2, j2);
    1183. 

  1183.   if (nr_cols-1 < j1) destroy_table ();
    1184. 

  1184.   else if (flag) {
    1185. 

  1185.     table_remove (fp, row, col, 0, 1);
    1186. 

  1186.     int ncol= max (0, col + (forward? 0: -1));
    1187. 

  1187.     if ((!forward) && (col == 0)) ncol= nr_cols-1;
    1188. 

  1188.     if (forward && (col == nr_cols-1)) ncol= 0;
    1189. 

  1189.     table_go_to (fp, row, ncol, forward);
    1190. 

  1190.   }
    1191. 

  1191.   else {
    1192. 

  1192.     if (!forward) col--;
    1193. 

  1193.     if (col >= 0) table_remove (fp, row, col, 0, 1);
    1194. 

  1194.     if (col < nr_cols-1 && forward) table_go_to (fp, row, col, forward);
    1195. 

  1195.     else if (forward || col < 0) table_go_to_border (fp, !forward);
    1196. 

  1196.   }
    1197. 

  1197.   table_correct_block_content ();
    1198. 

  1198. }
    1199. 

  1199. 

  1200. int
    1201. 

  1201. edit_table_rep::table_nr_rows () {
    1202. 

  1202.   int nr_rows, nr_cols;
    1203. 

  1203.   path fp= search_format ();
    1204. 

  1204.   if (is_nil (fp)) return -1;
    1205. 

  1205.   table_get_extents (fp, nr_rows, nr_cols);
    1206. 

  1206.   return nr_rows;
    1207. 

  1207. }
    1208. 

  1208. 

  1209. int
    1210. 

  1210. edit_table_rep::table_nr_columns () {
    1211. 

  1211.   int nr_rows, nr_cols;
    1212. 

  1212.   path fp= search_format ();
    1213. 

  1213.   if (is_nil (fp)) return -1;
    1214. 

  1214.   table_get_extents (fp, nr_rows, nr_cols);
    1215. 

  1215.   return nr_cols;
    1216. 

  1216. }
    1217. 

  1217. 

  1218. void
    1219. 

  1219. edit_table_rep::table_set_extents (int rows, int cols) {
    1220. 

  1220.   path fp= search_format ();
    1221. 

  1221.   if (is_nil (fp)) return;
    1222. 

  1222.   int min_rows, min_cols, max_rows, max_cols;
    1223. 

  1223.   table_get_limits (fp, min_rows, min_cols, max_rows, max_cols);
    1224. 

  1224.   rows= min (max_rows, max (min_rows, rows));
    1225. 

  1225.   cols= min (max_cols, max (min_cols, cols));
    1226. 

  1226.   table_set_extents (fp, rows, cols);
    1227. 

  1227. }
    1228. 

  1228. 

  1229. int
    1230. 

  1230. edit_table_rep::table_which_row () {
    1231. 

  1231.   int row, col;
    1232. 

  1232.   path fp= search_format (row, col);
    1233. 

  1233.   if (is_nil (fp)) return 0;
    1234. 

  1234.   return row+1;
    1235. 

  1235. }
    1236. 

  1236. 

  1237. int
    1238. 

  1238. edit_table_rep::table_which_column () {
    1239. 

  1239.   int row, col;
    1240. 

  1240.   path fp= search_format (row, col);
    1241. 

  1241.   if (is_nil (fp)) return 0;
    1242. 

  1242.   return col+1;
    1243. 

  1243. }
    1244. 

  1244. 

  1245. path
    1246. 

  1246. edit_table_rep::table_search_cell (int row, int col) {
    1247. 

  1247.   int nr_rows, nr_cols;
    1248. 

  1248.   path fp= search_format ();
    1249. 

  1249.   if (is_nil (fp)) return path ();
    1250. 

  1250.   table_get_extents (fp, nr_rows, nr_cols);
    1251. 

  1251.   if (row>0) row--; else row+=nr_rows;
    1252. 

  1252.   if (col>0) col--; else col+=nr_cols;
    1253. 

  1253.   if ((row<0) || (row>=nr_rows) || (col<0) || (col>=nr_cols)) return path ();
    1254. 

  1254.   return search_cell (fp, row, col);
    1255. 

  1255. }
    1256. 

  1256. 

  1257. void
    1258. 

  1258. edit_table_rep::table_go_to (int row, int col) {
    1259. 

  1259.   int nr_rows, nr_cols;
    1260. 

  1260.   path fp= search_format ();
    1261. 

  1261.   if (is_nil (fp)) return;
    1262. 

  1262.   table_get_extents (fp, nr_rows, nr_cols);
    1263. 

  1263.   if (row>0) row--; else row+=nr_rows;
    1264. 

  1264.   if (col>0) col--; else col+=nr_cols;
    1265. 

  1265.   if ((row<0) || (row>=nr_rows) || (col<0) || (col>=nr_cols)) return;
    1266. 

  1266.   table_go_to (fp, row, col);
    1267. 

  1267. }
    1268. 

  1268. 

  1269. void
    1270. 

  1270. edit_table_rep::table_set_format (string var, tree val) {
    1271. 

  1271.   if (val == "") table_del_format (var);
    1272. 

  1272.   else if (selection_active_table (false)) {
    1273. 

  1273.     int row1, col1, row2, col2;
    1274. 

  1274.     path fp= selection_get_subtable (row1, col1, row2, col2);
    1275. 

  1275.     if (is_nil (fp)) return;
    1276. 

  1276.     table_set_format (fp, var, val);
    1277. 

  1277.   }
    1278. 

  1278.   else {
    1279. 

  1279.     path fp= search_format ();
    1280. 

  1280.     if (is_nil (fp)) return;
    1281. 

  1281.     table_set_format (fp, var, val);
    1282. 

  1282.   }
    1283. 

  1283. }
    1284. 

  1284. 

  1285. string
    1286. 

  1286. edit_table_rep::table_get_format (string var) {
    1287. 

  1287.   path fp= search_format ();
    1288. 

  1288.   if (is_nil (fp)) return "";
    1289. 

  1289.   return as_string (table_get_format (fp, var));
    1290. 

  1290. }
    1291. 

  1291. 

  1292. void
    1293. 

  1293. edit_table_rep::table_del_format (string var) {
    1294. 

  1294.   if (selection_active_table (false)) {
    1295. 

  1295.     int row1, col1, row2, col2;
    1296. 

  1296.     path fp= selection_get_subtable (row1, col1, row2, col2);
    1297. 

  1297.     if (is_nil (fp)) return;
    1298. 

  1298.     table_del_format (fp, var);
    1299. 

  1299.   }
    1300. 

  1300.   else {
    1301. 

  1301.     path fp= search_format ();
    1302. 

  1302.     if (is_nil (fp)) return;
    1303. 

  1303.     table_del_format (fp, var);
    1304. 

  1304.   }
    1305. 

  1305. }
    1306. 

  1306. 

  1307. void
    1308. 

  1308. edit_table_rep::table_format_center () {
    1309. 

  1309.   int row, col;
    1310. 

  1310.   path fp= search_format (row, col);
    1311. 

  1311.   if (is_nil (fp)) return;
    1312. 

  1312.   table_format_center (fp, row, col);
    1313. 

  1313. }
    1314. 

  1314. 

  1315. void
    1316. 

  1316. edit_table_rep::table_row_decoration (bool forward) {
    1317. 

  1317.   int row, col, nr_rows, nr_cols;
    1318. 

  1318.   path fp= search_format (row, col);
    1319. 

  1319.   if (is_nil (fp)) return;
    1320. 

  1320.   table_get_extents (fp, nr_rows, nr_cols);
    1321. 

  1321.   if ((!forward) && (row > 0)) table_ver_decorate (fp, row, 1, 0);
    1322. 

  1322.   if (forward && (row < (nr_rows-1))) table_ver_decorate (fp, row, 0, 1);
    1323. 

  1323. }
    1324. 

  1324. 

  1325. void
    1326. 

  1326. edit_table_rep::table_column_decoration (bool forward) {
    1327. 

  1327.   int row, col, nr_rows, nr_cols;
    1328. 

  1328.   path fp= search_format (row, col);
    1329. 

  1329.   if (is_nil (fp)) return;
    1330. 

  1330.   table_get_extents (fp, nr_rows, nr_cols);
    1331. 

  1331.   if ((!forward) && (col > 0)) table_hor_decorate (fp, col, 1, 0);
    1332. 

  1332.   if (forward && (col < (nr_cols-1))) table_hor_decorate (fp, col, 0, 1);
    1333. 

  1333. }
    1334. 

  1334. 

  1335. void
    1336. 

  1336. edit_table_rep::table_correct_block_content () {
    1337. 

  1337.   int nr_rows, nr_cols;
    1338. 

  1338.   path fp= search_format ();
    1339. 

  1339.   if (is_nil (fp)) return;
    1340. 

  1340.   table_get_extents (fp, nr_rows, nr_cols);
    1341. 

  1341.   int row, col;
    1342. 

  1342.   for (row= 0; row < nr_rows; row++)
    1343. 

  1343.     for (col= 0; col < nr_cols; col++) {
    1344. 

  1344.       path cp= search_cell (fp, row, col);
    1345. 

  1345.       tree st= subtree (et, cp);
    1346. 

  1346.       tree t1= table_get_format (fp, row+1, col+1, row+1, col+1, CELL_BLOCK);
    1347. 

  1347.       tree t2= table_get_format (fp, row+1, col+1, row+1, col+1, CELL_HYPHEN);
    1348. 

  1348.       bool f1= (t1 == "no" || (t1 == "auto" && t2 == "n"));
    1349. 

  1349.       bool f2= (t1 == "yes" || (t1 == "auto" && is_atomic (t2) && t2 != "n"));
    1350. 

  1350.       if (f1 && is_document (st) && N(st) == 1)
    1351. 

  1351. 	remove_node (cp * 0);
    1352. 

  1352.       else if (f2 && !is_document (st))
    1353. 

  1353. 	insert_node (cp * 0, DOCUMENT);
    1354. 

  1354.     }
    1355. 

  1355. }
    1356. 

  1356. 

  1357. void
    1358. 

  1358. edit_table_rep::set_cell_mode (string mode) {
    1359. 

  1359.   cell_mode= mode;
    1360. 

  1360. }
    1361. 

  1361. 

  1362. string
    1363. 

  1363. edit_table_rep::get_cell_mode () {
    1364. 

  1364.   return cell_mode;
    1365. 

  1365. }
    1366. 

  1366. 

  1367. void
    1368. 

  1368. edit_table_rep::cell_set_format (string var, tree val) {
    1369. 

  1369.   if (selection_active_table (false)) {
    1370. 

  1370.     int row1, col1, row2, col2, rows, cols;
    1371. 

  1371.     path fp= selection_get_subtable (row1, col1, row2, col2);
    1372. 

  1372.     row1++; col1++; row2++; col2++;
    1373. 

  1373.     table_get_extents (fp, rows, cols);
    1374. 

  1374.     if (rows > row1 && row1 <= 2 && row2 == rows) row2= -1;
    1375. 

  1375.     if (cols > col1 && col1 <= 2 && col2 == cols) col2= -1;
    1376. 

  1376.     table_set_format (fp, row1, col1, row2, col2, var, val);
    1377. 

  1377.   }
    1378. 

  1378.   else {
    1379. 

  1379.     int row, col;
    1380. 

  1380.     path fp= search_format (row, col); row++; col++;
    1381. 

  1381.     if (is_nil (fp)) return;
    1382. 

  1382.     if (cell_mode=="row")
    1383. 

  1383.       table_set_format (fp, row, 1, row, -1, var, val);
    1384. 

  1384.     else if (cell_mode=="column")
    1385. 

  1385.       table_set_format (fp, 1, col, -1, col, var, val);
    1386. 

  1386.     else if (cell_mode=="table")
    1387. 

  1387.       table_set_format (fp, 1, 1, -1, -1, var, val);
    1388. 

  1388.     else table_set_format (fp, row, col, row, col, var, val);
    1389. 

  1389.   }
    1390. 

  1390.   table_correct_block_content ();
    1391. 

  1391. }
    1392. 

  1392. 

  1393. string
    1394. 

  1394. edit_table_rep::cell_get_format (string var) {
    1395. 

  1395.   int row, col;
    1396. 

  1396.   path fp= search_format (row, col); row++; col++;
    1397. 

  1397.   if (is_nil (fp)) return "";
    1398. 

  1398.   if (cell_mode=="row")
    1399. 

  1399.     return as_string (table_get_format (fp, row, 1, row, -1, var));
    1400. 

  1400.   else if (cell_mode=="column")
    1401. 

  1401.     return as_string (table_get_format (fp, 1, col, -1, col, var));
    1402. 

  1402.   else if (cell_mode=="table")
    1403. 

  1403.     return as_string (table_get_format (fp, 1, 1, -1, -1, var));
    1404. 

  1404.   else return as_string (table_get_format (fp, row, col, row, col, var));
    1405. 

  1405. }
    1406. 

  1406. 

  1407. void
    1408. 

  1408. edit_table_rep::cell_del_format (string var) {
    1409. 

  1409.   if (selection_active_table (false)) {
    1410. 

  1410.     int row1, col1, row2, col2;
    1411. 

  1411.     path fp= selection_get_subtable (row1, col1, row2, col2);
    1412. 

  1412.     table_del_format (fp, row1+1, col1+1, row2+1, col2+1, var);
    1413. 

  1413.   }
    1414. 

  1414.   else {
    1415. 

  1415.     int row, col;
    1416. 

  1416.     path fp= search_format (row, col); row++; col++;
    1417. 

  1417.     if (is_nil (fp)) return;
    1418. 

  1418.     if (cell_mode=="row") table_del_format (fp, row, 1, row, -1, var);
    1419. 

  1419.     else if (cell_mode=="column") table_del_format (fp, 1, col, -1, col, var);
    1420. 

  1420.     else if (cell_mode=="table") table_del_format (fp, 1, 1, -1, -1, var);
    1421. 

  1421.     else table_del_format (fp, row, col, row, col, var);
    1422. 

  1422.   }
    1423. 

  1423.   table_correct_block_content ();
    1424. 

  1424. }
    1425. 

  1425. 

  1426. void
    1427. 

  1427. edit_table_rep::table_test () {
    1428. 

  1428.   path fp= search_format ();
    1429. 

  1429.   if (is_nil (fp)) return;
    1430. 

  1430.   cout << table_get_format (fp) << "\n";
    1431. 

  1431. }
    1432. 

  1432.