@@ -201,7 +201,7 @@ AT##_BufferSize(size_t numElems) \
201201} \
202202 \
203203__TK_ARRAY_UNUSED \
204- static int \
204+ static bool \
205205AT##_IsEmpty(const AT *arr) \
206206{ \
207207 assert(!arr || arr->size != 0xdeadbeef); \
@@ -365,7 +365,7 @@ AT##_Free(AT **arrp) \
365365} \
366366 \
367367__TK_ARRAY_UNUSED \
368- static int \
368+ static Tcl_Size \
369369AT##_Find(const AT *arr, const ElemType *elem) \
370370{ \
371371 assert(!arr || arr->size != 0xdeadbeef); \
@@ -374,15 +374,15 @@ AT##_Find(const AT *arr, const ElemType *elem) \
374374 size_t i; \
375375 for (i = 0; i < arr->size; ++i) { \
376376 if (memcmp(&buf[i], elem, sizeof(ElemType)) == 0) { \
377- return (int ) i; \
377+ return (Tcl_Size ) i; \
378378 } \
379379 } \
380380 } \
381381 return -1; \
382382} \
383383 \
384384__TK_ARRAY_UNUSED \
385- static int \
385+ static bool \
386386AT##_Contains(const AT *arr, const ElemType *elem) \
387387{ \
388388 return AT##_Find(arr, elem) != -1; \
@@ -412,7 +412,7 @@ AT##_BufferSize(size_t numElems) \
412412} \
413413 \
414414__TK_ARRAY_UNUSED \
415- static int \
415+ static bool \
416416AT##_IsEmpty(const AT *arr) \
417417{ \
418418 assert(!arr || arr->size != 0xdeadbeef); \
@@ -574,7 +574,7 @@ AT##_Free(AT **arrp) \
574574} \
575575 \
576576__TK_ARRAY_UNUSED \
577- static int \
577+ static Tcl_Size \
578578AT##_Find(const AT *arr, const ElemType *elem) \
579579{ \
580580 assert(!arr || arr->size != 0xdeadbeef); \
@@ -583,15 +583,15 @@ AT##_Find(const AT *arr, const ElemType *elem) \
583583 size_t i; \
584584 for (i = 0; i < arr->size; ++i) { \
585585 if (buf[i] == elem) { \
586- return (int ) i; \
586+ return (Tcl_Size ) i; \
587587 } \
588588 } \
589589 } \
590590 return -1; \
591591} \
592592 \
593593__TK_ARRAY_UNUSED \
594- static int \
594+ static bool \
595595AT##_Contains(const AT *arr, const ElemType *elem) \
596596{ \
597597 return AT##_Find(arr, elem) != -1; \
0 commit comments