util/X86LINUX64/include/bltDecls.h

   1 #include "tcl.h"
   2 #include "bltTree.h"
   3 #include "bltVector.h"
   4
   5 #ifndef _BLTDECLS
   6 #define _BLTDECLS
   7
   8 #ifdef BUILD_blt
   9 #undef TCL_STORAGE_CLASS
  10 #define TCL_STORAGE_CLASS DLLEXPORT
  11 #endif
  12
  13 /*
  14 * WARNING: This file is automatically generated by the tools/genStubs.tcl
  15 * script.  Any modifications to the function declarations below should be made
  16 * in the generic/blt.decls script.
  17 */
  18
  19 /* !BEGIN!: Do not edit below this line. */
  20
  21 /*
  22  * Exported function declarations:
  23  */
  24
  25 #ifndef Blt_TreeGetKey_TCL_DECLARED
  26 #define Blt_TreeGetKey_TCL_DECLARED
  27 /* 0 */
  28 EXTERN Blt_TreeKey      Blt_TreeGetKey _ANSI_ARGS_((CONST char * string));
  29 #endif
  30 #ifndef Blt_TreeCreateNode_TCL_DECLARED
  31 #define Blt_TreeCreateNode_TCL_DECLARED
  32 /* 1 */
  33 EXTERN Blt_TreeNode     Blt_TreeCreateNode _ANSI_ARGS_((Blt_Tree tree,
  34                                 Blt_TreeNode parent, CONST char * name,
  35                                 int position));
  36 #endif
  37 #ifndef Blt_TreeCreateNodeWithId_TCL_DECLARED
  38 #define Blt_TreeCreateNodeWithId_TCL_DECLARED
  39 /* 2 */
  40 EXTERN Blt_TreeNode     Blt_TreeCreateNodeWithId _ANSI_ARGS_((Blt_Tree tree,
  41                                 Blt_TreeNode parent, CONST char * name,
  42                                 unsigned int inode, int position));
  43 #endif
  44 #ifndef Blt_TreeDeleteNode_TCL_DECLARED
  45 #define Blt_TreeDeleteNode_TCL_DECLARED
  46 /* 3 */
  47 EXTERN int              Blt_TreeDeleteNode _ANSI_ARGS_((Blt_Tree tree,
  48                                 Blt_TreeNode node));
  49 #endif
  50 #ifndef Blt_TreeMoveNode_TCL_DECLARED
  51 #define Blt_TreeMoveNode_TCL_DECLARED
  52 /* 4 */
  53 EXTERN int              Blt_TreeMoveNode _ANSI_ARGS_((Blt_Tree tree,
  54                                 Blt_TreeNode node, Blt_TreeNode parent,
  55                                 Blt_TreeNode before));
  56 #endif
  57 #ifndef Blt_TreeGetNode_TCL_DECLARED
  58 #define Blt_TreeGetNode_TCL_DECLARED
  59 /* 5 */
  60 EXTERN Blt_TreeNode     Blt_TreeGetNode _ANSI_ARGS_((Blt_Tree tree,
  61                                 unsigned int inode));
  62 #endif
  63 #ifndef Blt_TreeFindChild_TCL_DECLARED
  64 #define Blt_TreeFindChild_TCL_DECLARED
  65 /* 6 */
  66 EXTERN Blt_TreeNode     Blt_TreeFindChild _ANSI_ARGS_((Blt_TreeNode parent,
  67                                 CONST char * name));
  68 #endif
  69 #ifndef Blt_TreeFindChildRev_TCL_DECLARED
  70 #define Blt_TreeFindChildRev_TCL_DECLARED
  71 /* 7 */
  72 EXTERN Blt_TreeNode     Blt_TreeFindChildRev _ANSI_ARGS_((
  73                                 Blt_TreeNode parent, CONST char * name,
  74                                 int firstN));
  75 #endif
  76 #ifndef Blt_TreeFirstChild_TCL_DECLARED
  77 #define Blt_TreeFirstChild_TCL_DECLARED
  78 /* 8 */
  79 EXTERN Blt_TreeNode     Blt_TreeFirstChild _ANSI_ARGS_((Blt_TreeNode parent));
  80 #endif
  81 #ifndef Blt_TreeNextSibling_TCL_DECLARED
  82 #define Blt_TreeNextSibling_TCL_DECLARED
  83 /* 9 */
  84 EXTERN Blt_TreeNode     Blt_TreeNextSibling _ANSI_ARGS_((Blt_TreeNode node));
  85 #endif
  86 #ifndef Blt_TreeLastChild_TCL_DECLARED
  87 #define Blt_TreeLastChild_TCL_DECLARED
  88 /* 10 */
  89 EXTERN Blt_TreeNode     Blt_TreeLastChild _ANSI_ARGS_((Blt_TreeNode parent));
  90 #endif
  91 #ifndef Blt_TreePrevSibling_TCL_DECLARED
  92 #define Blt_TreePrevSibling_TCL_DECLARED
  93 /* 11 */
  94 EXTERN Blt_TreeNode     Blt_TreePrevSibling _ANSI_ARGS_((Blt_TreeNode node));
  95 #endif
  96 #ifndef Blt_TreeNextNode_TCL_DECLARED
  97 #define Blt_TreeNextNode_TCL_DECLARED
  98 /* 12 */
  99 EXTERN Blt_TreeNode     Blt_TreeNextNode _ANSI_ARGS_((Blt_TreeNode root,
 100                                 Blt_TreeNode node));
 101 #endif
 102 #ifndef Blt_TreePrevNode_TCL_DECLARED
 103 #define Blt_TreePrevNode_TCL_DECLARED
 104 /* 13 */
 105 EXTERN Blt_TreeNode     Blt_TreePrevNode _ANSI_ARGS_((Blt_TreeNode root,
 106                                 Blt_TreeNode node));
 107 #endif
 108 #ifndef Blt_TreeChangeRoot_TCL_DECLARED
 109 #define Blt_TreeChangeRoot_TCL_DECLARED
 110 /* 14 */
 111 EXTERN Blt_TreeNode     Blt_TreeChangeRoot _ANSI_ARGS_((Blt_Tree tree,
 112                                 Blt_TreeNode node));
 113 #endif
 114 #ifndef Blt_TreeEndNode_TCL_DECLARED
 115 #define Blt_TreeEndNode_TCL_DECLARED
 116 /* 15 */
 117 EXTERN Blt_TreeNode     Blt_TreeEndNode _ANSI_ARGS_((Blt_TreeNode node,
 118                                 unsigned int nodeFlags));
 119 #endif
 120 #ifndef Blt_TreeIsBefore_TCL_DECLARED
 121 #define Blt_TreeIsBefore_TCL_DECLARED
 122 /* 16 */
 123 EXTERN int              Blt_TreeIsBefore _ANSI_ARGS_((Blt_TreeNode node1,
 124                                 Blt_TreeNode node2));
 125 #endif
 126 #ifndef Blt_TreeIsAncestor_TCL_DECLARED
 127 #define Blt_TreeIsAncestor_TCL_DECLARED
 128 /* 17 */
 129 EXTERN int              Blt_TreeIsAncestor _ANSI_ARGS_((Blt_TreeNode node1,
 130                                 Blt_TreeNode node2));
 131 #endif
 132 #ifndef Blt_TreePrivateValue_TCL_DECLARED
 133 #define Blt_TreePrivateValue_TCL_DECLARED
 134 /* 18 */
 135 EXTERN int              Blt_TreePrivateValue _ANSI_ARGS_((
 136                                 Tcl_Interp * interp, Blt_Tree tree,
 137                                 Blt_TreeNode node, Blt_TreeKey key));
 138 #endif
 139 #ifndef Blt_TreePublicValue_TCL_DECLARED
 140 #define Blt_TreePublicValue_TCL_DECLARED
 141 /* 19 */
 142 EXTERN int              Blt_TreePublicValue _ANSI_ARGS_((Tcl_Interp * interp,
 143                                 Blt_Tree tree, Blt_TreeNode node,
 144                                 Blt_TreeKey key));
 145 #endif
 146 #ifndef Blt_TreeGetValue_TCL_DECLARED
 147 #define Blt_TreeGetValue_TCL_DECLARED
 148 /* 20 */
 149 EXTERN int              Blt_TreeGetValue _ANSI_ARGS_((Tcl_Interp * interp,
 150                                 Blt_Tree tree, Blt_TreeNode node,
 151                                 CONST char * string, Tcl_Obj ** valuePtr));
 152 #endif
 153 #ifndef Blt_TreeValueExists_TCL_DECLARED
 154 #define Blt_TreeValueExists_TCL_DECLARED
 155 /* 21 */
 156 EXTERN int              Blt_TreeValueExists _ANSI_ARGS_((Blt_Tree tree,
 157                                 Blt_TreeNode node, CONST char * string));
 158 #endif
 159 #ifndef Blt_TreeSetValue_TCL_DECLARED
 160 #define Blt_TreeSetValue_TCL_DECLARED
 161 /* 22 */
 162 EXTERN int              Blt_TreeSetValue _ANSI_ARGS_((Tcl_Interp * interp,
 163                                 Blt_Tree tree, Blt_TreeNode node,
 164                                 CONST char * string, Tcl_Obj * valuePtr));
 165 #endif
 166 #ifndef Blt_TreeUnsetValue_TCL_DECLARED
 167 #define Blt_TreeUnsetValue_TCL_DECLARED
 168 /* 23 */
 169 EXTERN int              Blt_TreeUnsetValue _ANSI_ARGS_((Tcl_Interp * interp,
 170                                 Blt_Tree tree, Blt_TreeNode node,
 171                                 CONST char * string));
 172 #endif
 173 #ifndef Blt_TreeGetArrayValue_TCL_DECLARED
 174 #define Blt_TreeGetArrayValue_TCL_DECLARED
 175 /* 24 */
 176 EXTERN int              Blt_TreeGetArrayValue _ANSI_ARGS_((
 177                                 Tcl_Interp * interp, Blt_Tree tree,
 178                                 Blt_TreeNode node, CONST char * arrayName,
 179                                 CONST char * elemName,
 180                                 Tcl_Obj ** valueObjPtrPtr));
 181 #endif
 182 #ifndef Blt_TreeSetArrayValue_TCL_DECLARED
 183 #define Blt_TreeSetArrayValue_TCL_DECLARED
 184 /* 25 */
 185 EXTERN int              Blt_TreeSetArrayValue _ANSI_ARGS_((
 186                                 Tcl_Interp * interp, Blt_Tree tree,
 187                                 Blt_TreeNode node, CONST char * arrayName,
 188                                 CONST char * elemName, Tcl_Obj * valueObjPtr));
 189 #endif
 190 #ifndef Blt_TreeUnsetArrayValue_TCL_DECLARED
 191 #define Blt_TreeUnsetArrayValue_TCL_DECLARED
 192 /* 26 */
 193 EXTERN int              Blt_TreeUnsetArrayValue _ANSI_ARGS_((
 194                                 Tcl_Interp * interp, Blt_Tree tree,
 195                                 Blt_TreeNode node, CONST char * arrayName,
 196                                 CONST char * elemName));
 197 #endif
 198 #ifndef Blt_TreeArrayValueExists_TCL_DECLARED
 199 #define Blt_TreeArrayValueExists_TCL_DECLARED
 200 /* 27 */
 201 EXTERN int              Blt_TreeArrayValueExists _ANSI_ARGS_((Blt_Tree tree,
 202                                 Blt_TreeNode node, CONST char * arrayName,
 203                                 CONST char * elemName));
 204 #endif
 205 #ifndef Blt_TreeArrayNames_TCL_DECLARED
 206 #define Blt_TreeArrayNames_TCL_DECLARED
 207 /* 28 */
 208 EXTERN int              Blt_TreeArrayNames _ANSI_ARGS_((Tcl_Interp * interp,
 209                                 Blt_Tree tree, Blt_TreeNode node,
 210                                 CONST char * arrayName, Tcl_Obj * listObjPtr,
 211                                 CONST char * pattern));
 212 #endif
 213 #ifndef Blt_TreeGetValueByKey_TCL_DECLARED
 214 #define Blt_TreeGetValueByKey_TCL_DECLARED
 215 /* 29 */
 216 EXTERN int              Blt_TreeGetValueByKey _ANSI_ARGS_((
 217                                 Tcl_Interp * interp, Blt_Tree tree,
 218                                 Blt_TreeNode node, Blt_TreeKey key,
 219                                 Tcl_Obj ** valuePtr));
 220 #endif
 221 #ifndef Blt_TreeSetValueByKey_TCL_DECLARED
 222 #define Blt_TreeSetValueByKey_TCL_DECLARED
 223 /* 30 */
 224 EXTERN int              Blt_TreeSetValueByKey _ANSI_ARGS_((
 225                                 Tcl_Interp * interp, Blt_Tree tree,
 226                                 Blt_TreeNode node, Blt_TreeKey key,
 227                                 Tcl_Obj * valuePtr));
 228 #endif
 229 #ifndef Blt_TreeUnsetValueByKey_TCL_DECLARED
 230 #define Blt_TreeUnsetValueByKey_TCL_DECLARED
 231 /* 31 */
 232 EXTERN int              Blt_TreeUnsetValueByKey _ANSI_ARGS_((
 233                                 Tcl_Interp * interp, Blt_Tree tree,
 234                                 Blt_TreeNode node, Blt_TreeKey key));
 235 #endif
 236 #ifndef Blt_TreeValueExistsByKey_TCL_DECLARED
 237 #define Blt_TreeValueExistsByKey_TCL_DECLARED
 238 /* 32 */
 239 EXTERN int              Blt_TreeValueExistsByKey _ANSI_ARGS_((Blt_Tree tree,
 240                                 Blt_TreeNode node, Blt_TreeKey key));
 241 #endif
 242 #ifndef Blt_TreeFirstKey_TCL_DECLARED
 243 #define Blt_TreeFirstKey_TCL_DECLARED
 244 /* 33 */
 245 EXTERN Blt_TreeKey      Blt_TreeFirstKey _ANSI_ARGS_((Blt_Tree tree,
 246                                 Blt_TreeNode node,
 247                                 Blt_TreeKeySearch * cursorPtr));
 248 #endif
 249 #ifndef Blt_TreeNextKey_TCL_DECLARED
 250 #define Blt_TreeNextKey_TCL_DECLARED
 251 /* 34 */
 252 EXTERN Blt_TreeKey      Blt_TreeNextKey _ANSI_ARGS_((Blt_Tree tree,
 253                                 Blt_TreeKeySearch * cursorPtr));
 254 #endif
 255 #ifndef Blt_TreeApply_TCL_DECLARED
 256 #define Blt_TreeApply_TCL_DECLARED
 257 /* 35 */
 258 EXTERN int              Blt_TreeApply _ANSI_ARGS_((Blt_TreeNode root,
 259                                 Blt_TreeApplyProc * proc,
 260                                 ClientData clientData));
 261 #endif
 262 #ifndef Blt_TreeApplyDFS_TCL_DECLARED
 263 #define Blt_TreeApplyDFS_TCL_DECLARED
 264 /* 36 */
 265 EXTERN int              Blt_TreeApplyDFS _ANSI_ARGS_((Blt_TreeNode root,
 266                                 Blt_TreeApplyProc * proc,
 267                                 ClientData clientData, int order));
 268 #endif
 269 #ifndef Blt_TreeApplyBFS_TCL_DECLARED
 270 #define Blt_TreeApplyBFS_TCL_DECLARED
 271 /* 37 */
 272 EXTERN int              Blt_TreeApplyBFS _ANSI_ARGS_((Blt_TreeNode root,
 273                                 Blt_TreeApplyProc * proc,
 274                                 ClientData clientData));
 275 #endif
 276 #ifndef Blt_TreeSortNode_TCL_DECLARED
 277 #define Blt_TreeSortNode_TCL_DECLARED
 278 /* 38 */
 279 EXTERN int              Blt_TreeSortNode _ANSI_ARGS_((Blt_Tree tree,
 280                                 Blt_TreeNode node,
 281                                 Blt_TreeCompareNodesProc * proc));
 282 #endif
 283 #ifndef Blt_TreeCreate_TCL_DECLARED
 284 #define Blt_TreeCreate_TCL_DECLARED
 285 /* 39 */
 286 EXTERN int              Blt_TreeCreate _ANSI_ARGS_((Tcl_Interp * interp,
 287                                 CONST char * name, Blt_Tree * treePtr));
 288 #endif
 289 #ifndef Blt_TreeExists_TCL_DECLARED
 290 #define Blt_TreeExists_TCL_DECLARED
 291 /* 40 */
 292 EXTERN int              Blt_TreeExists _ANSI_ARGS_((Tcl_Interp * interp,
 293                                 CONST char * name));
 294 #endif
 295 #ifndef Blt_TreeGetToken_TCL_DECLARED
 296 #define Blt_TreeGetToken_TCL_DECLARED
 297 /* 41 */
 298 EXTERN int              Blt_TreeGetToken _ANSI_ARGS_((Tcl_Interp * interp,
 299                                 CONST char * name, Blt_Tree * treePtr));
 300 #endif
 301 #ifndef Blt_TreeReleaseToken_TCL_DECLARED
 302 #define Blt_TreeReleaseToken_TCL_DECLARED
 303 /* 42 */
 304 EXTERN void             Blt_TreeReleaseToken _ANSI_ARGS_((Blt_Tree tree));
 305 #endif
 306 #ifndef Blt_TreeSize_TCL_DECLARED
 307 #define Blt_TreeSize_TCL_DECLARED
 308 /* 43 */
 309 EXTERN int              Blt_TreeSize _ANSI_ARGS_((Blt_TreeNode node));
 310 #endif
 311 #ifndef Blt_TreeCreateTrace_TCL_DECLARED
 312 #define Blt_TreeCreateTrace_TCL_DECLARED
 313 /* 44 */
 314 EXTERN Blt_TreeTrace    Blt_TreeCreateTrace _ANSI_ARGS_((Blt_Tree tree,
 315                                 Blt_TreeNode node, CONST char * keyPattern,
 316                                 CONST char * tagName, unsigned int mask,
 317                                 Blt_TreeTraceProc * proc,
 318                                 ClientData clientData));
 319 #endif
 320 #ifndef Blt_TreeDeleteTrace_TCL_DECLARED
 321 #define Blt_TreeDeleteTrace_TCL_DECLARED
 322 /* 45 */
 323 EXTERN void             Blt_TreeDeleteTrace _ANSI_ARGS_((Blt_TreeTrace token));
 324 #endif
 325 #ifndef Blt_TreeCreateEventHandler_TCL_DECLARED
 326 #define Blt_TreeCreateEventHandler_TCL_DECLARED
 327 /* 46 */
 328 EXTERN void             Blt_TreeCreateEventHandler _ANSI_ARGS_((
 329                                 Blt_Tree tree, unsigned int mask,
 330                                 Blt_TreeNotifyEventProc * proc,
 331                                 ClientData clientData));
 332 #endif
 333 #ifndef Blt_TreeDeleteEventHandler_TCL_DECLARED
 334 #define Blt_TreeDeleteEventHandler_TCL_DECLARED
 335 /* 47 */
 336 EXTERN void             Blt_TreeDeleteEventHandler _ANSI_ARGS_((
 337                                 Blt_Tree tree, unsigned int mask,
 338                                 Blt_TreeNotifyEventProc * proc,
 339                                 ClientData clientData));
 340 #endif
 341 #ifndef Blt_TreeRelabelNode_TCL_DECLARED
 342 #define Blt_TreeRelabelNode_TCL_DECLARED
 343 /* 48 */
 344 EXTERN int              Blt_TreeRelabelNode _ANSI_ARGS_((Blt_Tree tree,
 345                                 Blt_TreeNode node, CONST char * string));
 346 #endif
 347 #ifndef Blt_TreeRelabelNode2_TCL_DECLARED
 348 #define Blt_TreeRelabelNode2_TCL_DECLARED
 349 /* 49 */
 350 EXTERN int              Blt_TreeRelabelNode2 _ANSI_ARGS_((Blt_TreeNode node,
 351                                 CONST char * string));
 352 #endif
 353 #ifndef Blt_TreeNodePath_TCL_DECLARED
 354 #define Blt_TreeNodePath_TCL_DECLARED
 355 /* 50 */
 356 EXTERN char *           Blt_TreeNodePath _ANSI_ARGS_((Blt_TreeNode node,
 357                                 Tcl_DString * resultPtr));
 358 #endif
 359 #ifndef Blt_TreeNodePosition_TCL_DECLARED
 360 #define Blt_TreeNodePosition_TCL_DECLARED
 361 /* 51 */
 362 EXTERN int              Blt_TreeNodePosition _ANSI_ARGS_((Blt_TreeNode node));
 363 #endif
 364 #ifndef Blt_TreeClearTags_TCL_DECLARED
 365 #define Blt_TreeClearTags_TCL_DECLARED
 366 /* 52 */
 367 EXTERN void             Blt_TreeClearTags _ANSI_ARGS_((Blt_Tree tree,
 368                                 Blt_TreeNode node));
 369 #endif
 370 #ifndef Blt_TreeAddTag_TCL_DECLARED
 371 #define Blt_TreeAddTag_TCL_DECLARED
 372 /* 53 */
 373 EXTERN int              Blt_TreeAddTag _ANSI_ARGS_((Blt_Tree tree,
 374                                 Blt_TreeNode node, CONST char * tagName));
 375 #endif
 376 #ifndef Blt_TreeForgetTag_TCL_DECLARED
 377 #define Blt_TreeForgetTag_TCL_DECLARED
 378 /* 54 */
 379 EXTERN int              Blt_TreeForgetTag _ANSI_ARGS_((Blt_Tree tree,
 380                                 CONST char * tagName));
 381 #endif
 382 #ifndef Blt_TreeTagTableIsShared_TCL_DECLARED
 383 #define Blt_TreeTagTableIsShared_TCL_DECLARED
 384 /* 55 */
 385 EXTERN int              Blt_TreeTagTableIsShared _ANSI_ARGS_((Blt_Tree tree));
 386 #endif
 387 #ifndef Blt_TreeShareTagTable_TCL_DECLARED
 388 #define Blt_TreeShareTagTable_TCL_DECLARED
 389 /* 56 */
 390 EXTERN int              Blt_TreeShareTagTable _ANSI_ARGS_((Blt_Tree src,
 391                                 Blt_Tree target));
 392 #endif
 393 #ifndef Blt_TreeFirstTag_TCL_DECLARED
 394 #define Blt_TreeFirstTag_TCL_DECLARED
 395 /* 57 */
 396 EXTERN Blt_HashEntry *  Blt_TreeFirstTag _ANSI_ARGS_((Blt_Tree tree,
 397                                 Blt_HashSearch * searchPtr));
 398 #endif
 399 #ifndef Blt_TreeHasTag_TCL_DECLARED
 400 #define Blt_TreeHasTag_TCL_DECLARED
 401 /* 58 */
 402 EXTERN int              Blt_TreeHasTag _ANSI_ARGS_((Blt_Tree tree,
 403                                 Blt_TreeNode node, CONST char * tagName));
 404 #endif
 405 #ifndef Blt_TreeTagHashTable_TCL_DECLARED
 406 #define Blt_TreeTagHashTable_TCL_DECLARED
 407 /* 59 */
 408 EXTERN Blt_HashTable *  Blt_TreeTagHashTable _ANSI_ARGS_((Blt_Tree tree,
 409                                 CONST char * tagName));
 410 #endif
 411 #ifndef Blt_VecMin_TCL_DECLARED
 412 #define Blt_VecMin_TCL_DECLARED
 413 /* 60 */
 414 EXTERN double           Blt_VecMin _ANSI_ARGS_((Blt_Vector * vPtr));
 415 #endif
 416 #ifndef Blt_VecMax_TCL_DECLARED
 417 #define Blt_VecMax_TCL_DECLARED
 418 /* 61 */
 419 EXTERN double           Blt_VecMax _ANSI_ARGS_((Blt_Vector * vPtr));
 420 #endif
 421 #ifndef Blt_AllocVectorId_TCL_DECLARED
 422 #define Blt_AllocVectorId_TCL_DECLARED
 423 /* 62 */
 424 EXTERN Blt_VectorId     Blt_AllocVectorId _ANSI_ARGS_((Tcl_Interp * interp,
 425                                 char * vecName));
 426 #endif
 427 #ifndef Blt_SetVectorChangedProc_TCL_DECLARED
 428 #define Blt_SetVectorChangedProc_TCL_DECLARED
 429 /* 63 */
 430 EXTERN void             Blt_SetVectorChangedProc _ANSI_ARGS_((
 431                                 Blt_VectorId clientId,
 432                                 Blt_VectorChangedProc * proc,
 433                                 ClientData clientData));
 434 #endif
 435 #ifndef Blt_FreeVectorId_TCL_DECLARED
 436 #define Blt_FreeVectorId_TCL_DECLARED
 437 /* 64 */
 438 EXTERN void             Blt_FreeVectorId _ANSI_ARGS_((Blt_VectorId clientId));
 439 #endif
 440 #ifndef Blt_GetVectorById_TCL_DECLARED
 441 #define Blt_GetVectorById_TCL_DECLARED
 442 /* 65 */
 443 EXTERN int              Blt_GetVectorById _ANSI_ARGS_((Tcl_Interp * interp,
 444                                 Blt_VectorId clientId,
 445                                 Blt_Vector ** vecPtrPtr));
 446 #endif
 447 #ifndef Blt_NameOfVectorId_TCL_DECLARED
 448 #define Blt_NameOfVectorId_TCL_DECLARED
 449 /* 66 */
 450 EXTERN char *           Blt_NameOfVectorId _ANSI_ARGS_((
 451                                 Blt_VectorId clientId));
 452 #endif
 453 #ifndef Blt_NameOfVector_TCL_DECLARED
 454 #define Blt_NameOfVector_TCL_DECLARED
 455 /* 67 */
 456 EXTERN char *           Blt_NameOfVector _ANSI_ARGS_((Blt_Vector * vecPtr));
 457 #endif
 458 #ifndef Blt_VectorNotifyPending_TCL_DECLARED
 459 #define Blt_VectorNotifyPending_TCL_DECLARED
 460 /* 68 */
 461 EXTERN int              Blt_VectorNotifyPending _ANSI_ARGS_((
 462                                 Blt_VectorId clientId));
 463 #endif
 464 #ifndef Blt_CreateVector_TCL_DECLARED
 465 #define Blt_CreateVector_TCL_DECLARED
 466 /* 69 */
 467 EXTERN int              Blt_CreateVector _ANSI_ARGS_((Tcl_Interp * interp,
 468                                 char * vecName, int size,
 469                                 Blt_Vector ** vecPtrPtr));
 470 #endif
 471 #ifndef Blt_GetVector_TCL_DECLARED
 472 #define Blt_GetVector_TCL_DECLARED
 473 /* 70 */
 474 EXTERN int              Blt_GetVector _ANSI_ARGS_((Tcl_Interp * interp,
 475                                 char * vecName, Blt_Vector ** vecPtrPtr));
 476 #endif
 477 #ifndef Blt_VectorExists_TCL_DECLARED
 478 #define Blt_VectorExists_TCL_DECLARED
 479 /* 71 */
 480 EXTERN int              Blt_VectorExists _ANSI_ARGS_((Tcl_Interp * interp,
 481                                 char * vecName));
 482 #endif
 483 #ifndef Blt_ResetVector_TCL_DECLARED
 484 #define Blt_ResetVector_TCL_DECLARED
 485 /* 72 */
 486 EXTERN int              Blt_ResetVector _ANSI_ARGS_((Blt_Vector * vecPtr,
 487                                 double * dataArr, int nValues, int arraySize,
 488                                 Tcl_FreeProc * freeProc));
 489 #endif
 490 #ifndef Blt_ResizeVector_TCL_DECLARED
 491 #define Blt_ResizeVector_TCL_DECLARED
 492 /* 73 */
 493 EXTERN int              Blt_ResizeVector _ANSI_ARGS_((Blt_Vector * vecPtr,
 494                                 int nValues));
 495 #endif
 496 #ifndef Blt_DeleteVectorByName_TCL_DECLARED
 497 #define Blt_DeleteVectorByName_TCL_DECLARED
 498 /* 74 */
 499 EXTERN int              Blt_DeleteVectorByName _ANSI_ARGS_((
 500                                 Tcl_Interp * interp, char * vecName));
 501 #endif
 502 #ifndef Blt_DeleteVector_TCL_DECLARED
 503 #define Blt_DeleteVector_TCL_DECLARED
 504 /* 75 */
 505 EXTERN int              Blt_DeleteVector _ANSI_ARGS_((Blt_Vector * vecPtr));
 506 #endif
 507 #ifndef Blt_ExprVector_TCL_DECLARED
 508 #define Blt_ExprVector_TCL_DECLARED
 509 /* 76 */
 510 EXTERN int              Blt_ExprVector _ANSI_ARGS_((Tcl_Interp * interp,
 511                                 char * expression, Blt_Vector * vecPtr));
 512 #endif
 513 #ifndef Blt_InstallIndexProc_TCL_DECLARED
 514 #define Blt_InstallIndexProc_TCL_DECLARED
 515 /* 77 */
 516 EXTERN void             Blt_InstallIndexProc _ANSI_ARGS_((
 517                                 Tcl_Interp * interp, char * indexName,
 518                                 Blt_VectorIndexProc * procPtr));
 519 #endif
 520 #ifndef Blt_CreateVector2_TCL_DECLARED
 521 #define Blt_CreateVector2_TCL_DECLARED
 522 /* 78 */
 523 EXTERN int              Blt_CreateVector2 _ANSI_ARGS_((Tcl_Interp * interp,
 524                                 char * vecName, char * cmdName,
 525                                 char * varName, int size,
 526                                 Blt_Vector ** vecPtrPtr));
 527 #endif
 528
 529 typedef struct BltStubs {
 530     int magic;
 531     struct BltStubHooks *hooks;
 532
 533     Blt_TreeKey (*blt_TreeGetKey) _ANSI_ARGS_((CONST char * string)); /* 0 */
 534     Blt_TreeNode (*blt_TreeCreateNode) _ANSI_ARGS_((Blt_Tree tree, Blt_TreeNode parent, CONST char * name, int position)); /* 1 */
 535     Blt_TreeNode (*blt_TreeCreateNodeWithId) _ANSI_ARGS_((Blt_Tree tree, Blt_TreeNode parent, CONST char * name, int position, int inode)); /* 2 */
 536     int (*blt_TreeDeleteNode) _ANSI_ARGS_((Blt_Tree tree, Blt_TreeNode node)); /* 3 */
 537     int (*blt_TreeMoveNode) _ANSI_ARGS_((Blt_Tree tree, Blt_TreeNode node, Blt_TreeNode parent, Blt_TreeNode before)); /* 4 */
 538     Blt_TreeNode (*blt_TreeGetNode) _ANSI_ARGS_((Blt_Tree tree, unsigned int inode)); /* 5 */
 539     Blt_TreeNode (*blt_TreeFindChild) _ANSI_ARGS_((Blt_TreeNode parent, CONST char * name)); /* 6 */
 540     Blt_TreeNode (*blt_TreeFindChildRev) _ANSI_ARGS_((Blt_TreeNode parent, CONST char * name, int firstN)); /* 7 */
 541     Blt_TreeNode (*blt_TreeFirstChild) _ANSI_ARGS_((Blt_TreeNode parent)); /* 8 */
 542     Blt_TreeNode (*blt_TreeNextSibling) _ANSI_ARGS_((Blt_TreeNode node)); /* 9 */
 543     Blt_TreeNode (*blt_TreeLastChild) _ANSI_ARGS_((Blt_TreeNode parent)); /* 10 */
 544     Blt_TreeNode (*blt_TreePrevSibling) _ANSI_ARGS_((Blt_TreeNode node)); /* 11 */
 545     Blt_TreeNode (*blt_TreeNextNode) _ANSI_ARGS_((Blt_TreeNode root, Blt_TreeNode node)); /* 12 */
 546     Blt_TreeNode (*blt_TreePrevNode) _ANSI_ARGS_((Blt_TreeNode root, Blt_TreeNode node)); /* 13 */
 547     Blt_TreeNode (*blt_TreeChangeRoot) _ANSI_ARGS_((Blt_Tree tree, Blt_TreeNode node)); /* 14 */
 548     Blt_TreeNode (*blt_TreeEndNode) _ANSI_ARGS_((Blt_TreeNode node, unsigned int nodeFlags)); /* 15 */
 549     int (*blt_TreeIsBefore) _ANSI_ARGS_((Blt_TreeNode node1, Blt_TreeNode node2)); /* 16 */
 550     int (*blt_TreeIsAncestor) _ANSI_ARGS_((Blt_TreeNode node1, Blt_TreeNode node2)); /* 17 */
 551     int (*blt_TreePrivateValue) _ANSI_ARGS_((Tcl_Interp * interp, Blt_Tree tree, Blt_TreeNode node, Blt_TreeKey key)); /* 18 */
 552     int (*blt_TreePublicValue) _ANSI_ARGS_((Tcl_Interp * interp, Blt_Tree tree, Blt_TreeNode node, Blt_TreeKey key)); /* 19 */
 553     int (*blt_TreeGetValue) _ANSI_ARGS_((Tcl_Interp * interp, Blt_Tree tree, Blt_TreeNode node, CONST char * string, Tcl_Obj ** valuePtr)); /* 20 */
 554     int (*blt_TreeValueExists) _ANSI_ARGS_((Blt_Tree tree, Blt_TreeNode node, CONST char * string)); /* 21 */
 555     int (*blt_TreeSetValue) _ANSI_ARGS_((Tcl_Interp * interp, Blt_Tree tree, Blt_TreeNode node, CONST char * string, Tcl_Obj * valuePtr)); /* 22 */
 556     int (*blt_TreeUnsetValue) _ANSI_ARGS_((Tcl_Interp * interp, Blt_Tree tree, Blt_TreeNode node, CONST char * string)); /* 23 */
 557     int (*blt_TreeGetArrayValue) _ANSI_ARGS_((Tcl_Interp * interp, Blt_Tree tree, Blt_TreeNode node, CONST char * arrayName, CONST char * elemName, Tcl_Obj ** valueObjPtrPtr)); /* 24 */
 558     int (*blt_TreeSetArrayValue) _ANSI_ARGS_((Tcl_Interp * interp, Blt_Tree tree, Blt_TreeNode node, CONST char * arrayName, CONST char * elemName, Tcl_Obj * valueObjPtr)); /* 25 */
 559     int (*blt_TreeUnsetArrayValue) _ANSI_ARGS_((Tcl_Interp * interp, Blt_Tree tree, Blt_TreeNode node, CONST char * arrayName, CONST char * elemName)); /* 26 */
 560     int (*blt_TreeArrayValueExists) _ANSI_ARGS_((Blt_Tree tree, Blt_TreeNode node, CONST char * arrayName, CONST char * elemName)); /* 27 */
 561     int (*blt_TreeArrayNames) _ANSI_ARGS_((Tcl_Interp * interp, Blt_Tree tree, Blt_TreeNode node, CONST char * arrayName, Tcl_Obj * listObjPtr)); /* 28 */
 562     int (*blt_TreeGetValueByKey) _ANSI_ARGS_((Tcl_Interp * interp, Blt_Tree tree, Blt_TreeNode node, Blt_TreeKey key, Tcl_Obj ** valuePtr)); /* 29 */
 563     int (*blt_TreeSetValueByKey) _ANSI_ARGS_((Tcl_Interp * interp, Blt_Tree tree, Blt_TreeNode node, Blt_TreeKey key, Tcl_Obj * valuePtr)); /* 30 */
 564     int (*blt_TreeUnsetValueByKey) _ANSI_ARGS_((Tcl_Interp * interp, Blt_Tree tree, Blt_TreeNode node, Blt_TreeKey key)); /* 31 */
 565     int (*blt_TreeValueExistsByKey) _ANSI_ARGS_((Blt_Tree tree, Blt_TreeNode node, Blt_TreeKey key)); /* 32 */
 566     Blt_TreeKey (*blt_TreeFirstKey) _ANSI_ARGS_((Blt_Tree tree, Blt_TreeNode node, Blt_TreeKeySearch * cursorPtr)); /* 33 */
 567     Blt_TreeKey (*blt_TreeNextKey) _ANSI_ARGS_((Blt_Tree tree, Blt_TreeKeySearch * cursorPtr)); /* 34 */
 568     int (*blt_TreeApply) _ANSI_ARGS_((Blt_TreeNode root, Blt_TreeApplyProc * proc, ClientData clientData)); /* 35 */
 569     int (*blt_TreeApplyDFS) _ANSI_ARGS_((Blt_TreeNode root, Blt_TreeApplyProc * proc, ClientData clientData, int order)); /* 36 */
 570     int (*blt_TreeApplyBFS) _ANSI_ARGS_((Blt_TreeNode root, Blt_TreeApplyProc * proc, ClientData clientData)); /* 37 */
 571     int (*blt_TreeSortNode) _ANSI_ARGS_((Blt_Tree tree, Blt_TreeNode node, Blt_TreeCompareNodesProc * proc)); /* 38 */
 572     int (*blt_TreeCreate) _ANSI_ARGS_((Tcl_Interp * interp, CONST char * name, Blt_Tree * treePtr)); /* 39 */
 573     int (*blt_TreeExists) _ANSI_ARGS_((Tcl_Interp * interp, CONST char * name)); /* 40 */
 574     int (*blt_TreeGetToken) _ANSI_ARGS_((Tcl_Interp * interp, CONST char * name, Blt_Tree * treePtr)); /* 41 */
 575     void (*blt_TreeReleaseToken) _ANSI_ARGS_((Blt_Tree tree)); /* 42 */
 576     int (*blt_TreeSize) _ANSI_ARGS_((Blt_TreeNode node)); /* 43 */
 577     Blt_TreeTrace (*blt_TreeCreateTrace) _ANSI_ARGS_((Blt_Tree tree, Blt_TreeNode node, CONST char * keyPattern, CONST char * tagName, unsigned int mask, Blt_TreeTraceProc * proc, ClientData clientData)); /* 44 */
 578     void (*blt_TreeDeleteTrace) _ANSI_ARGS_((Blt_TreeTrace token)); /* 45 */
 579     void (*blt_TreeCreateEventHandler) _ANSI_ARGS_((Blt_Tree tree, unsigned int mask, Blt_TreeNotifyEventProc * proc, ClientData clientData)); /* 46 */
 580     void (*blt_TreeDeleteEventHandler) _ANSI_ARGS_((Blt_Tree tree, unsigned int mask, Blt_TreeNotifyEventProc * proc, ClientData clientData)); /* 47 */
 581     void (*blt_TreeRelabelNode) _ANSI_ARGS_((Blt_Tree tree, Blt_TreeNode node, CONST char * string)); /* 48 */
 582     void (*blt_TreeRelabelNode2) _ANSI_ARGS_((Blt_TreeNode node, CONST char * string)); /* 49 */
 583     char * (*blt_TreeNodePath) _ANSI_ARGS_((Blt_TreeNode node, Tcl_DString * resultPtr)); /* 50 */
 584     int (*blt_TreeNodePosition) _ANSI_ARGS_((Blt_TreeNode node)); /* 51 */
 585     void (*blt_TreeClearTags) _ANSI_ARGS_((Blt_Tree tree, Blt_TreeNode node)); /* 52 */
 586     void (*blt_TreeAddTag) _ANSI_ARGS_((Blt_Tree tree, Blt_TreeNode node, CONST char * tagName)); /* 53 */
 587     void (*blt_TreeForgetTag) _ANSI_ARGS_((Blt_Tree tree, CONST char * tagName)); /* 54 */
 588     int (*blt_TreeTagTableIsShared) _ANSI_ARGS_((Blt_Tree tree)); /* 55 */
 589     int (*blt_TreeShareTagTable) _ANSI_ARGS_((Blt_Tree src, Blt_Tree target)); /* 56 */
 590     Blt_HashEntry * (*blt_TreeFirstTag) _ANSI_ARGS_((Blt_Tree tree, Blt_HashSearch * searchPtr)); /* 57 */
 591     int (*blt_TreeHasTag) _ANSI_ARGS_((Blt_Tree tree, Blt_TreeNode node, CONST char * tagName)); /* 58 */
 592     Blt_HashTable * (*blt_TreeTagHashTable) _ANSI_ARGS_((Blt_Tree tree, CONST char * tagName)); /* 59 */
 593     double (*blt_VecMin) _ANSI_ARGS_((Blt_Vector * vPtr)); /* 60 */
 594     double (*blt_VecMax) _ANSI_ARGS_((Blt_Vector * vPtr)); /* 61 */
 595     Blt_VectorId (*blt_AllocVectorId) _ANSI_ARGS_((Tcl_Interp * interp, char * vecName)); /* 62 */
 596     void (*blt_SetVectorChangedProc) _ANSI_ARGS_((Blt_VectorId clientId, Blt_VectorChangedProc * proc, ClientData clientData)); /* 63 */
 597     void (*blt_FreeVectorId) _ANSI_ARGS_((Blt_VectorId clientId)); /* 64 */
 598     int (*blt_GetVectorById) _ANSI_ARGS_((Tcl_Interp * interp, Blt_VectorId clientId, Blt_Vector ** vecPtrPtr)); /* 65 */
 599     char * (*blt_NameOfVectorId) _ANSI_ARGS_((Blt_VectorId clientId)); /* 66 */
 600     char * (*blt_NameOfVector) _ANSI_ARGS_((Blt_Vector * vecPtr)); /* 67 */
 601     int (*blt_VectorNotifyPending) _ANSI_ARGS_((Blt_VectorId clientId)); /* 68 */
 602     int (*blt_CreateVector) _ANSI_ARGS_((Tcl_Interp * interp, char * vecName, int size, Blt_Vector ** vecPtrPtr)); /* 69 */
 603     int (*blt_GetVector) _ANSI_ARGS_((Tcl_Interp * interp, char * vecName, Blt_Vector ** vecPtrPtr)); /* 70 */
 604     int (*blt_VectorExists) _ANSI_ARGS_((Tcl_Interp * interp, char * vecName)); /* 71 */
 605     int (*blt_ResetVector) _ANSI_ARGS_((Blt_Vector * vecPtr, double * dataArr, int nValues, int arraySize, Tcl_FreeProc * freeProc)); /* 72 */
 606     int (*blt_ResizeVector) _ANSI_ARGS_((Blt_Vector * vecPtr, int nValues)); /* 73 */
 607     int (*blt_DeleteVectorByName) _ANSI_ARGS_((Tcl_Interp * interp, char * vecName)); /* 74 */
 608     int (*blt_DeleteVector) _ANSI_ARGS_((Blt_Vector * vecPtr)); /* 75 */
 609     int (*blt_ExprVector) _ANSI_ARGS_((Tcl_Interp * interp, char * expression, Blt_Vector * vecPtr)); /* 76 */
 610     void (*blt_InstallIndexProc) _ANSI_ARGS_((Tcl_Interp * interp, char * indexName, Blt_VectorIndexProc * procPtr)); /* 77 */
 611     int (*blt_CreateVector2) _ANSI_ARGS_((Tcl_Interp * interp, char * vecName, char * cmdName, char * varName, int size, Blt_Vector ** vecPtrPtr)); /* 78 */
 612 } BltStubs;
 613
 614 #ifdef __cplusplus
 615 extern "C" {
 616 #endif
 617 extern BltStubs *bltStubsPtr;
 618 #ifdef __cplusplus
 619 }
 620 #endif
 621
 622 #if defined(USE_BLT_STUBS) && !defined(USE_BLT_STUB_PROCS)
 623
 624 /*
 625  * Inline function declarations:
 626  */
 627
 628 #ifndef Blt_TreeGetKey
 629 #define Blt_TreeGetKey \
 630         (bltStubsPtr->blt_TreeGetKey) /* 0 */
 631 #endif
 632 #ifndef Blt_TreeCreateNode
 633 #define Blt_TreeCreateNode \
 634         (bltStubsPtr->blt_TreeCreateNode) /* 1 */
 635 #endif
 636 #ifndef Blt_TreeCreateNodeWithId
 637 #define Blt_TreeCreateNodeWithId \
 638         (bltStubsPtr->blt_TreeCreateNodeWithId) /* 2 */
 639 #endif
 640 #ifndef Blt_TreeDeleteNode
 641 #define Blt_TreeDeleteNode \
 642         (bltStubsPtr->blt_TreeDeleteNode) /* 3 */
 643 #endif
 644 #ifndef Blt_TreeMoveNode
 645 #define Blt_TreeMoveNode \
 646         (bltStubsPtr->blt_TreeMoveNode) /* 4 */
 647 #endif
 648 #ifndef Blt_TreeGetNode
 649 #define Blt_TreeGetNode \
 650         (bltStubsPtr->blt_TreeGetNode) /* 5 */
 651 #endif
 652 #ifndef Blt_TreeFindChild
 653 #define Blt_TreeFindChild \
 654         (bltStubsPtr->blt_TreeFindChild) /* 6 */
 655 #endif
 656 #ifndef Blt_TreeFindChildRev
 657 #define Blt_TreeFindChildRev \
 658         (bltStubsPtr->blt_TreeFindChildRev) /* 7 */
 659 #endif
 660 #ifndef Blt_TreeFirstChild
 661 #define Blt_TreeFirstChild \
 662         (bltStubsPtr->blt_TreeFirstChild) /* 8 */
 663 #endif
 664 #ifndef Blt_TreeNextSibling
 665 #define Blt_TreeNextSibling \
 666         (bltStubsPtr->blt_TreeNextSibling) /* 9 */
 667 #endif
 668 #ifndef Blt_TreeLastChild
 669 #define Blt_TreeLastChild \
 670         (bltStubsPtr->blt_TreeLastChild) /* 10 */
 671 #endif
 672 #ifndef Blt_TreePrevSibling
 673 #define Blt_TreePrevSibling \
 674         (bltStubsPtr->blt_TreePrevSibling) /* 11 */
 675 #endif
 676 #ifndef Blt_TreeNextNode
 677 #define Blt_TreeNextNode \
 678         (bltStubsPtr->blt_TreeNextNode) /* 12 */
 679 #endif
 680 #ifndef Blt_TreePrevNode
 681 #define Blt_TreePrevNode \
 682         (bltStubsPtr->blt_TreePrevNode) /* 13 */
 683 #endif
 684 #ifndef Blt_TreeChangeRoot
 685 #define Blt_TreeChangeRoot \
 686         (bltStubsPtr->blt_TreeChangeRoot) /* 14 */
 687 #endif
 688 #ifndef Blt_TreeEndNode
 689 #define Blt_TreeEndNode \
 690         (bltStubsPtr->blt_TreeEndNode) /* 15 */
 691 #endif
 692 #ifndef Blt_TreeIsBefore
 693 #define Blt_TreeIsBefore \
 694         (bltStubsPtr->blt_TreeIsBefore) /* 16 */
 695 #endif
 696 #ifndef Blt_TreeIsAncestor
 697 #define Blt_TreeIsAncestor \
 698         (bltStubsPtr->blt_TreeIsAncestor) /* 17 */
 699 #endif
 700 #ifndef Blt_TreePrivateValue
 701 #define Blt_TreePrivateValue \
 702         (bltStubsPtr->blt_TreePrivateValue) /* 18 */
 703 #endif
 704 #ifndef Blt_TreePublicValue
 705 #define Blt_TreePublicValue \
 706         (bltStubsPtr->blt_TreePublicValue) /* 19 */
 707 #endif
 708 #ifndef Blt_TreeGetValue
 709 #define Blt_TreeGetValue \
 710         (bltStubsPtr->blt_TreeGetValue) /* 20 */
 711 #endif
 712 #ifndef Blt_TreeValueExists
 713 #define Blt_TreeValueExists \
 714         (bltStubsPtr->blt_TreeValueExists) /* 21 */
 715 #endif
 716 #ifndef Blt_TreeSetValue
 717 #define Blt_TreeSetValue \
 718         (bltStubsPtr->blt_TreeSetValue) /* 22 */
 719 #endif
 720 #ifndef Blt_TreeUnsetValue
 721 #define Blt_TreeUnsetValue \
 722         (bltStubsPtr->blt_TreeUnsetValue) /* 23 */
 723 #endif
 724 #ifndef Blt_TreeGetArrayValue
 725 #define Blt_TreeGetArrayValue \
 726         (bltStubsPtr->blt_TreeGetArrayValue) /* 24 */
 727 #endif
 728 #ifndef Blt_TreeSetArrayValue
 729 #define Blt_TreeSetArrayValue \
 730         (bltStubsPtr->blt_TreeSetArrayValue) /* 25 */
 731 #endif
 732 #ifndef Blt_TreeUnsetArrayValue
 733 #define Blt_TreeUnsetArrayValue \
 734         (bltStubsPtr->blt_TreeUnsetArrayValue) /* 26 */
 735 #endif
 736 #ifndef Blt_TreeArrayValueExists
 737 #define Blt_TreeArrayValueExists \
 738         (bltStubsPtr->blt_TreeArrayValueExists) /* 27 */
 739 #endif
 740 #ifndef Blt_TreeArrayNames
 741 #define Blt_TreeArrayNames \
 742         (bltStubsPtr->blt_TreeArrayNames) /* 28 */
 743 #endif
 744 #ifndef Blt_TreeGetValueByKey
 745 #define Blt_TreeGetValueByKey \
 746         (bltStubsPtr->blt_TreeGetValueByKey) /* 29 */
 747 #endif
 748 #ifndef Blt_TreeSetValueByKey
 749 #define Blt_TreeSetValueByKey \
 750         (bltStubsPtr->blt_TreeSetValueByKey) /* 30 */
 751 #endif
 752 #ifndef Blt_TreeUnsetValueByKey
 753 #define Blt_TreeUnsetValueByKey \
 754         (bltStubsPtr->blt_TreeUnsetValueByKey) /* 31 */
 755 #endif
 756 #ifndef Blt_TreeValueExistsByKey
 757 #define Blt_TreeValueExistsByKey \
 758         (bltStubsPtr->blt_TreeValueExistsByKey) /* 32 */
 759 #endif
 760 #ifndef Blt_TreeFirstKey
 761 #define Blt_TreeFirstKey \
 762         (bltStubsPtr->blt_TreeFirstKey) /* 33 */
 763 #endif
 764 #ifndef Blt_TreeNextKey
 765 #define Blt_TreeNextKey \
 766         (bltStubsPtr->blt_TreeNextKey) /* 34 */
 767 #endif
 768 #ifndef Blt_TreeApply
 769 #define Blt_TreeApply \
 770         (bltStubsPtr->blt_TreeApply) /* 35 */
 771 #endif
 772 #ifndef Blt_TreeApplyDFS
 773 #define Blt_TreeApplyDFS \
 774         (bltStubsPtr->blt_TreeApplyDFS) /* 36 */
 775 #endif
 776 #ifndef Blt_TreeApplyBFS
 777 #define Blt_TreeApplyBFS \
 778         (bltStubsPtr->blt_TreeApplyBFS) /* 37 */
 779 #endif
 780 #ifndef Blt_TreeSortNode
 781 #define Blt_TreeSortNode \
 782         (bltStubsPtr->blt_TreeSortNode) /* 38 */
 783 #endif
 784 #ifndef Blt_TreeCreate
 785 #define Blt_TreeCreate \
 786         (bltStubsPtr->blt_TreeCreate) /* 39 */
 787 #endif
 788 #ifndef Blt_TreeExists
 789 #define Blt_TreeExists \
 790         (bltStubsPtr->blt_TreeExists) /* 40 */
 791 #endif
 792 #ifndef Blt_TreeGetToken
 793 #define Blt_TreeGetToken \
 794         (bltStubsPtr->blt_TreeGetToken) /* 41 */
 795 #endif
 796 #ifndef Blt_TreeReleaseToken
 797 #define Blt_TreeReleaseToken \
 798         (bltStubsPtr->blt_TreeReleaseToken) /* 42 */
 799 #endif
 800 #ifndef Blt_TreeSize
 801 #define Blt_TreeSize \
 802         (bltStubsPtr->blt_TreeSize) /* 43 */
 803 #endif
 804 #ifndef Blt_TreeCreateTrace
 805 #define Blt_TreeCreateTrace \
 806         (bltStubsPtr->blt_TreeCreateTrace) /* 44 */
 807 #endif
 808 #ifndef Blt_TreeDeleteTrace
 809 #define Blt_TreeDeleteTrace \
 810         (bltStubsPtr->blt_TreeDeleteTrace) /* 45 */
 811 #endif
 812 #ifndef Blt_TreeCreateEventHandler
 813 #define Blt_TreeCreateEventHandler \
 814         (bltStubsPtr->blt_TreeCreateEventHandler) /* 46 */
 815 #endif
 816 #ifndef Blt_TreeDeleteEventHandler
 817 #define Blt_TreeDeleteEventHandler \
 818         (bltStubsPtr->blt_TreeDeleteEventHandler) /* 47 */
 819 #endif
 820 #ifndef Blt_TreeRelabelNode
 821 #define Blt_TreeRelabelNode \
 822         (bltStubsPtr->blt_TreeRelabelNode) /* 48 */
 823 #endif
 824 #ifndef Blt_TreeRelabelNode2
 825 #define Blt_TreeRelabelNode2 \
 826         (bltStubsPtr->blt_TreeRelabelNode2) /* 49 */
 827 #endif
 828 #ifndef Blt_TreeNodePath
 829 #define Blt_TreeNodePath \
 830         (bltStubsPtr->blt_TreeNodePath) /* 50 */
 831 #endif
 832 #ifndef Blt_TreeNodePosition
 833 #define Blt_TreeNodePosition \
 834         (bltStubsPtr->blt_TreeNodePosition) /* 51 */
 835 #endif
 836 #ifndef Blt_TreeClearTags
 837 #define Blt_TreeClearTags \
 838         (bltStubsPtr->blt_TreeClearTags) /* 52 */
 839 #endif
 840 #ifndef Blt_TreeAddTag
 841 #define Blt_TreeAddTag \
 842         (bltStubsPtr->blt_TreeAddTag) /* 53 */
 843 #endif
 844 #ifndef Blt_TreeForgetTag
 845 #define Blt_TreeForgetTag \
 846         (bltStubsPtr->blt_TreeForgetTag) /* 54 */
 847 #endif
 848 #ifndef Blt_TreeTagTableIsShared
 849 #define Blt_TreeTagTableIsShared \
 850         (bltStubsPtr->blt_TreeTagTableIsShared) /* 55 */
 851 #endif
 852 #ifndef Blt_TreeShareTagTable
 853 #define Blt_TreeShareTagTable \
 854         (bltStubsPtr->blt_TreeShareTagTable) /* 56 */
 855 #endif
 856 #ifndef Blt_TreeFirstTag
 857 #define Blt_TreeFirstTag \
 858         (bltStubsPtr->blt_TreeFirstTag) /* 57 */
 859 #endif
 860 #ifndef Blt_TreeHasTag
 861 #define Blt_TreeHasTag \
 862         (bltStubsPtr->blt_TreeHasTag) /* 58 */
 863 #endif
 864 #ifndef Blt_TreeTagHashTable
 865 #define Blt_TreeTagHashTable \
 866         (bltStubsPtr->blt_TreeTagHashTable) /* 59 */
 867 #endif
 868 #ifndef Blt_VecMin
 869 #define Blt_VecMin \
 870         (bltStubsPtr->blt_VecMin) /* 60 */
 871 #endif
 872 #ifndef Blt_VecMax
 873 #define Blt_VecMax \
 874         (bltStubsPtr->blt_VecMax) /* 61 */
 875 #endif
 876 #ifndef Blt_AllocVectorId
 877 #define Blt_AllocVectorId \
 878         (bltStubsPtr->blt_AllocVectorId) /* 62 */
 879 #endif
 880 #ifndef Blt_SetVectorChangedProc
 881 #define Blt_SetVectorChangedProc \
 882         (bltStubsPtr->blt_SetVectorChangedProc) /* 63 */
 883 #endif
 884 #ifndef Blt_FreeVectorId
 885 #define Blt_FreeVectorId \
 886         (bltStubsPtr->blt_FreeVectorId) /* 64 */
 887 #endif
 888 #ifndef Blt_GetVectorById
 889 #define Blt_GetVectorById \
 890         (bltStubsPtr->blt_GetVectorById) /* 65 */
 891 #endif
 892 #ifndef Blt_NameOfVectorId
 893 #define Blt_NameOfVectorId \
 894         (bltStubsPtr->blt_NameOfVectorId) /* 66 */
 895 #endif
 896 #ifndef Blt_NameOfVector
 897 #define Blt_NameOfVector \
 898         (bltStubsPtr->blt_NameOfVector) /* 67 */
 899 #endif
 900 #ifndef Blt_VectorNotifyPending
 901 #define Blt_VectorNotifyPending \
 902         (bltStubsPtr->blt_VectorNotifyPending) /* 68 */
 903 #endif
 904 #ifndef Blt_CreateVector
 905 #define Blt_CreateVector \
 906         (bltStubsPtr->blt_CreateVector) /* 69 */
 907 #endif
 908 #ifndef Blt_GetVector
 909 #define Blt_GetVector \
 910         (bltStubsPtr->blt_GetVector) /* 70 */
 911 #endif
 912 #ifndef Blt_VectorExists
 913 #define Blt_VectorExists \
 914         (bltStubsPtr->blt_VectorExists) /* 71 */
 915 #endif
 916 #ifndef Blt_ResetVector
 917 #define Blt_ResetVector \
 918         (bltStubsPtr->blt_ResetVector) /* 72 */
 919 #endif
 920 #ifndef Blt_ResizeVector
 921 #define Blt_ResizeVector \
 922         (bltStubsPtr->blt_ResizeVector) /* 73 */
 923 #endif
 924 #ifndef Blt_DeleteVectorByName
 925 #define Blt_DeleteVectorByName \
 926         (bltStubsPtr->blt_DeleteVectorByName) /* 74 */
 927 #endif
 928 #ifndef Blt_DeleteVector
 929 #define Blt_DeleteVector \
 930         (bltStubsPtr->blt_DeleteVector) /* 75 */
 931 #endif
 932 #ifndef Blt_ExprVector
 933 #define Blt_ExprVector \
 934         (bltStubsPtr->blt_ExprVector) /* 76 */
 935 #endif
 936 #ifndef Blt_InstallIndexProc
 937 #define Blt_InstallIndexProc \
 938         (bltStubsPtr->blt_InstallIndexProc) /* 77 */
 939 #endif
 940 #ifndef Blt_CreateVector2
 941 #define Blt_CreateVector2 \
 942         (bltStubsPtr->blt_CreateVector2) /* 78 */
 943 #endif
 944
 945 #endif /* defined(USE_BLT_STUBS) && !defined(USE_BLT_STUB_PROCS) */
 946
 947 /* !END!: Do not edit above this line. */
 948
 949 #undef TCL_STORAGE_CLASS
 950 #define TCL_STORAGE_CLASS DLLIMPORT
 951
 952 #endif /* _BLTDECLS */
 953