/*
 *  Bindle Binaries Tools
 *  Copyright (C) 2022 David M. Syzdek <david@syzdek.net>.
 *  All rights reserved.
 *
 *  Redistribution and use in source and binary forms, with or without
 *  modification, are permitted provided that the following conditions are
 *  met:
 *
 *     * Redistributions of source code must retain the above copyright
 *       notice, this list of conditions and the following disclaimer.
 *     * Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in the
 *       documentation and/or other materials provided with the distribution.
 *     * Neither the name of David M. Syzdek nor the
 *       names of its contributors may be used to endorse or promote products
 *       derived from this software without specific prior written permission.
 *
 *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
 *  IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
 *  THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 *  PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL DAVID M. SYZDEK BE LIABLE FOR
 *  ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 *  DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
 *  SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
 *  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 *  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 *  OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 *  SUCH DAMAGE.
 */
#define _TESTS_BINDLE_ARRAY_SORTED_C 1


///////////////
//           //
//  Headers  //
//           //
///////////////
// MARK: - Headers

#include "bindle-tests.h"

#include <stdio.h>
#include <stdarg.h>
#include <stdlib.h>
#include <string.h>
#include <strings.h>
#include <unistd.h>
#include <getopt.h>
#include <assert.h>
#include <inttypes.h>


///////////////////
//               //
//  Definitions  //
//               //
///////////////////
// MARK: - Definitions

#undef PROGRAM_NAME
#define PROGRAM_NAME "bindle-array-sorted"

#define MY_LIST_LEN  256

#define MY_OBJ_NAME     0x01000000UL
#define MY_OBJ_VALUE    0x02000000UL
#define MY_KEY_NAME     0x04000000UL
#define MY_KEY_VALUE    0x08000000UL
#define MY_MASK         0x0f000000UL


//////////////////
//              //
//  Data Types  //
//              //
//////////////////
// MARK: - Data Types

typedef struct _mydata MyData;

struct _mydata
{
   char *            name;
   int               value;
   int               opts;
};


/////////////////
//             //
//  Variables  //
//             //
/////////////////
// MARK: - Variables

static const char * test_strs[] =
{
   "cccccccc",
   "bbbbbbbb",
   "aaaaaaaa",
   NULL
};


//////////////////
//              //
//  Prototypes  //
//              //
//////////////////
// MARK: - Prototypes

int
main(
         int                           argc,
         char *                        argv[] );


int
my_compare_key_name(
         const void *                  a,
         const void *                  b );


int
my_compare_key_value(
         const void *                  a,
         const void *                  b );


int
my_compare_obj_name(
         const void *                  a,
         const void *                  b );


int
my_compare_obj_value(
         const void *                  a,
         const void *                  b );


void
my_compar_opts(
         unsigned                      opts,
         const char **                 compar_namep,
         int (**comparp)(const void *, const void *) );


static char *
my_strrand(
         size_t                        min,
         size_t                        max );


int
my_test_insert(
         unsigned                      opts,
         MyData ***                    listp,
         size_t *                      list_lenp,
         MyData **                     src,
         MyData **                     test,
         size_t                        dat_len,
         unsigned                      arrayopt );


int
my_test_remove(
         unsigned                      opts,
         MyData **                     list,
         size_t *                      list_lenp,
         MyData **                     src,
         MyData **                     test,
         size_t                        dat_len,
         unsigned                      arrayopt );


int
my_test_search(
         unsigned                      opts,
         MyData **                     list,
         size_t                        len );


/////////////////
//             //
//  Functions  //
//             //
/////////////////
// MARK: - Functions

int main( int argc, char * argv[] )
{
   int                  opt;
   int                  c;
   int                  opt_index;
   unsigned             opts;
   unsigned             merge;
   size_t               pos;
   size_t               len;
   size_t               list_len;
   MyData               data[MY_LIST_LEN];
   MyData *             src[MY_LIST_LEN];
   MyData *             test[MY_LIST_LEN];
   MyData **            list;

   // getopt options
   static char          short_opt[] = "dhVvq";
   static struct option long_opt[] =
   {
      {"debug",            no_argument,       NULL, 'd' },
      {"help",             no_argument,       NULL, 'h' },
      {"quiet",            no_argument,       NULL, 'q' },
      {"silent",           no_argument,       NULL, 'q' },
      {"version",          no_argument,       NULL, 'V' },
      {"verbose",          no_argument,       NULL, 'v' },
      { NULL, 0, NULL, 0 }
   };

   bindle_tests_initialize(PROGRAM_NAME);

   opts = 0;

   while((c = getopt_long(argc, argv, short_opt, long_opt, &opt_index)) != -1)
   {
      switch(c)
      {
         case -1:       /* no more arguments */
         case 0:        /* long options toggles */
         break;

         case 'd':
         opt = BNDL_DEBUG_ANY;
         bindle_set_option(NULL, BNDL_OPT_DEBUG_LEVEL,  &opt);
         break;

         case 'h':
         printf("Usage: %s [OPTIONS]\n", PROGRAM_NAME);
         printf("OPTIONS:\n");
         printf("  -d, --debug               print debug messages\n");
         printf("  -h, --help                print this help and exit\n");
         printf("  -q, --quiet, --silent     do not print messages\n");
         printf("  -V, --version             print version number and exit\n");
         printf("  -v, --verbose             print verbose messages\n");
         printf("\n");
         return(0);

         case 'q':
         opts |=  BNDLTEST_OPT_QUIET;
         opts &= ~BNDLTEST_OPT_VERBOSE;
         break;

         case 'V':
         bindle_tests_version();
         return(0);

         case 'v':
         opts |=  BNDLTEST_OPT_VERBOSE;
         opts &= ~BNDLTEST_OPT_QUIET;
         break;

         case '?':
         fprintf(stderr, "Try `%s --help' for more information.\n", PROGRAM_NAME);
         return(1);

         default:
         fprintf(stderr, "%s: unrecognized option `--%c'\n", PROGRAM_NAME, c);
         fprintf(stderr, "Try `%s --help' for more information.\n", PROGRAM_NAME);
         return(1);
      };
   };

   if (optind != argc)
   {
         fprintf(stderr, "%s: unknown argument `--%s'\n", PROGRAM_NAME, argv[optind]);
         fprintf(stderr, "Try `%s --help' for more information.\n", PROGRAM_NAME);
         return(1);
   };


   // initialize test data
   bindle_tests_verbose(opts, "initializing test data ...");
   memset(data, 0, sizeof(data));
   memset(test, 0, sizeof(test));
   for(len = 0; ((test_strs[len])); len++);
   for(pos = 0; (pos < MY_LIST_LEN); pos++)
   {
      data[pos].value = (int)(~pos);
      data[pos].opts  = (int)pos;
      data[pos].name  = (pos < len) ? bindle_strdup(test_strs[pos]) : my_strrand(8, 8);
      if (!(data[pos].name))
      {
         for(; (pos > 0); pos--)
            free(data[pos-1].name);
         return(bindle_tests_error(opts, NULL, "out of virtual memory"));
      };
   };


   // populate src and test arrays
   for(pos = 0; (pos < MY_LIST_LEN); pos++)
      test[pos] = src[pos] = &data[pos];


   // test searching by value
   bindle_tests_verbose(opts, "sorting test data by value ...");
   qsort(test, MY_LIST_LEN, sizeof(MyData *), &my_compare_obj_value);
   opts = opts & ~MY_MASK;
   if ((my_test_search(opts|MY_OBJ_VALUE, test, MY_LIST_LEN)))
      return(1);
   if ((my_test_search(opts|MY_KEY_VALUE, test, MY_LIST_LEN)))
      return(1);


   // test searching by name
   bindle_tests_verbose(opts, "sorting test data by name ...");
   qsort(test, MY_LIST_LEN, sizeof(MyData *), &my_compare_obj_name);
   opts = opts & ~MY_MASK;
   if ((my_test_search(opts|MY_OBJ_NAME, test, MY_LIST_LEN)))
      return(1);
   if ((my_test_search(opts|MY_KEY_NAME, test, MY_LIST_LEN)))
      return(1);


   // insert data as sorted list using BNDL_BREPLACE
   bindle_tests_verbose(opts, "resetting list ...");
   list     = NULL;
   list_len = 0;
   opts     = (opts & ~MY_MASK) | MY_OBJ_NAME;
   merge    = BNDL_BREPLACE;
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((list_len))
      return(bindle_tests_error(opts, NULL, "list still has elements"));
   free(list);


   // insert data as sorted list using BNDL_BINSERT
   bindle_tests_verbose(opts, "resetting list ...");
   list     = NULL;
   list_len = 0;
   opts     = (opts & ~MY_MASK) | MY_OBJ_NAME;
   merge    = BNDL_BINSERT;
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((list_len))
      return(bindle_tests_error(opts, NULL, "list still has elements"));
   free(list);


   // insert data as sorted list using BNDL_BMERGE and BNDL_ARRAY_UNORDERED
   bindle_tests_verbose(opts, "resetting list ...");
   list     = NULL;
   list_len = 0;
   opts     = (opts & ~MY_MASK) | MY_OBJ_NAME;
   merge    = BNDL_BMERGE | BNDL_BDUPANY;
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((list_len))
      return(bindle_tests_error(opts, NULL, "list still has elements"));
   free(list);


   // insert data as sorted list using BNDL_BMERGE and BNDL_ARRAY_APPEND
   bindle_tests_verbose(opts, "resetting list ...");
   list     = NULL;
   list_len = 0;
   opts     = (opts & ~MY_MASK) | MY_OBJ_NAME;
   merge    = BNDL_BMERGE | BNDL_BDUPLAST;
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((list_len))
      return(bindle_tests_error(opts, NULL, "list still has elements"));
   free(list);


  // insert data as sorted list using BNDL_BMERGE and BNDL_ARRAY_PREPEND
   bindle_tests_verbose(opts, "resetting list ...");
   list     = NULL;
   list_len = 0;
   opts     = (opts & ~MY_MASK) | MY_OBJ_NAME;
   merge    = BNDL_BMERGE | BNDL_BDUPFIRST;
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((list_len))
      return(bindle_tests_error(opts, NULL, "list still has elements"));
   free(list);


   // test searching by value
   bindle_tests_verbose(opts, "sorting test data by value ...");
   qsort(test, MY_LIST_LEN, sizeof(MyData *), &my_compare_obj_value);


   // insert data as sorted list using BNDL_BMERGE and BNDL_ARRAY_UNORDERED
   bindle_tests_verbose(opts, "resetting list ...");
   list     = NULL;
   list_len = 0;
   opts     = (opts & ~MY_MASK) | MY_OBJ_VALUE;
   merge    = BNDL_BMERGE | BNDL_BDUPANY;
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((list_len))
      return(bindle_tests_error(opts, NULL, "list still has elements"));
   free(list);


   // insert data as sorted list using BNDL_BMERGE and BNDL_ARRAY_APPEND
   bindle_tests_verbose(opts, "resetting list ...");
   list     = NULL;
   list_len = 0;
   opts     = (opts & ~MY_MASK) | MY_OBJ_VALUE;
   merge    = BNDL_BMERGE | BNDL_BDUPLAST;
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((list_len))
      return(bindle_tests_error(opts, NULL, "list still has elements"));
   free(list);


  // insert data as sorted list using BNDL_BMERGE and BNDL_ARRAY_PREPEND
   bindle_tests_verbose(opts, "resetting list ...");
   list     = NULL;
   list_len = 0;
   opts     = (opts & ~MY_MASK) | MY_OBJ_VALUE;
   merge    = BNDL_BMERGE | BNDL_BDUPFIRST;
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_insert(opts, &list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((my_test_remove(opts, list, &list_len, src, test, MY_LIST_LEN, merge)))
      return(1);
   if ((list_len))
      return(bindle_tests_error(opts, NULL, "list still has elements"));
   free(list);

   return(0);
}


int my_compare_key_name(const void * a, const void * b)
{
   MyData * const *  obj;
   const char *      key;
   key = a;
   obj = b;
   return(strcasecmp(key, (*obj)->name));
}


int my_compare_key_value(const void * a, const void *b)
{
   MyData * const *  obj;
   const int *       key;
   key = a;
   obj = b;
   return(*key - (*obj)->value);
}


int my_compare_obj_name(const void * a, const void *b)
{
   const MyData * const * x;
   const MyData * const * y;
   x = a;
   y = b;
   return(strcasecmp((*x)->name, (*y)->name));
}


int my_compare_obj_value(const void * a, const void *b)
{
   const MyData * const * x;
   const MyData * const * y;
   x = a;
   y = b;
   return((*x)->value - (*y)->value);
}


void
my_compar_opts(
         unsigned                      opts,
         const char **                 compar_namep,
          int (**comparp)(const void *, const void *) )
{
   switch(opts & MY_MASK)
   {
      case MY_KEY_NAME:
      *compar_namep = "my_compare_key_name";
      *comparp      = &my_compare_key_name;
      break;

      case MY_KEY_VALUE:
      *compar_namep = "my_compare_key_value";
      *comparp      = &my_compare_key_value;
      break;

      case MY_OBJ_NAME:
      *compar_namep = "my_compare_obj_name";
      *comparp      = &my_compare_obj_name;
      break;

      case MY_OBJ_VALUE:
      *compar_namep = "my_compare_obj_value";
      *comparp      = &my_compare_obj_value;
      break;

      default:
      *compar_namep = NULL;
      *comparp      = NULL;
      break;
   };
   assert(*compar_namep != NULL);
   return;
}


char *
my_strrand(
         size_t                        min,
         size_t                        max )
{
   char *      str;
   size_t      len;
   size_t      pos;
   static int  count = 0;

   assert(min <= max);

   len = ((max - min)) ? ((unsigned)random() % (max - min)) : 0;
   len += min;
   if (len < sizeof(int))
      len = sizeof(int);

   if ((str = malloc(len+1)) == NULL)
      return(NULL);
   str[len] = '\0';

   for(pos = 0; (pos < (len-sizeof(int))); pos++)
      str[pos] = (random() % 26) + 'a';

   // ensure unique value for test
   snprintf(&str[pos], (len-pos+1), "%04xu", (~count)&0xffff);
   count++;

   return(str);
}


int
my_test_insert(
         unsigned                      opts,
         MyData ***                    listp,
         size_t *                      list_lenp,
         MyData **                     src,
         MyData **                     test,
         size_t                        dat_len,
         unsigned                      arrayopt )
{
   size_t         x;
   size_t         pos;
   size_t         len;
   size_t         iteration;
   unsigned       mergeopt;
   const char *   compar_name;
   const char *   action_name;
   const char *   merge_type;
   MyData **      list;
   int (*compar)(const void *, const void *);

   assert(listp       != NULL);
   assert(list_lenp   != NULL);
   assert(src         != NULL);
   assert(test        != NULL);
   assert(dat_len      > 0);

   my_compar_opts(opts, &compar_name, &compar);

   mergeopt = (arrayopt & BNDL_BMASK_DUPS);
   iteration = *list_lenp / dat_len;
   switch(arrayopt & BNDL_BMASK_ADD)
   {
      case BNDL_BINSERT:   action_name = "INSERT"; break;
      case BNDL_BMERGE:    action_name = "MERGE"; break;
      case BNDL_BREPLACE:  action_name = "REPLACE"; break;
      case 0:             action_name = "DEFAULT"; break;
      default:
      return(bindle_tests_error(opts, NULL, "unknown insert action"));
   };
   switch(mergeopt)
   {
      case BNDL_BDUPFIRST:  merge_type = "FIRST"; break;
      case BNDL_BDUPLAST:   merge_type = "LAST"; break;
      case BNDL_BDUPANY:    merge_type = "ANY"; break;
      case 0:              merge_type = "DEFAULT"; break;
      default:
      return(bindle_tests_error(opts, NULL, "unknown dup action"));
   };

   bindle_tests_verbose(opts, "testing   bindle_badd( %10s, %9s, %s ) [%s] ...", action_name, merge_type, compar_name, (((iteration)) ? "duplicate" : "unique"));
   for(x = 0; (x < dat_len); x++)
   {
      if (bindle_badd(&src[x], (void **)listp, list_lenp, sizeof(MyData *), arrayopt, compar, NULL, &realloc) == -1)
         return(bindle_tests_error(opts, NULL, "bindle_badd(%s): returned error", action_name));
      len = (iteration*dat_len) + x + 1;
      if ( ((iteration)) && (!(arrayopt & BNDL_BMERGE)) )
         len = dat_len;
      if (*list_lenp != len)
         return(bindle_tests_error(opts, NULL, "bindle_badd(%s): did not increment length", action_name));
   };

   list = *listp;

   if (!(arrayopt & BNDL_BMERGE))
      iteration = 0;

   bindle_tests_verbose(opts, "verifying bindle_badd( %10s, %9s, %s ) [%s] ...", action_name, merge_type, compar_name, (((iteration)) ? "duplicate" : "unique"));
   iteration++;
   for(x = 0; (x < (dat_len*iteration)); x++)
   {
      pos = x/iteration;
      if ((strcasecmp(test[pos]->name, list[x]->name)))
         return(bindle_tests_error(opts, NULL, "bindle_badd(%s): misordered the list", action_name));
      switch(mergeopt)
      {
         case BNDL_BDUPLAST:
         if ( (x < ((dat_len*iteration)-1)) && ((x % iteration) == (iteration-1)) )
            if (!(strcasecmp(list[x]->name, list[x+1]->name)))
               return(bindle_tests_error(opts, NULL, "bindle_badd(%s): first match not returned", action_name));
         break;

         case BNDL_BDUPFIRST:
         if ( (x > 0) && (!(x % iteration)) )
            if (!(strcasecmp(list[x]->name, list[x-1]->name)))
               return(bindle_tests_error(opts, NULL, "bindle_badd(%s): first match not returned", action_name));
         break;

         case BNDL_BDUPANY:
         default:
         break;
      };
   };

   return(0);
}


int
my_test_remove(
         unsigned                      opts,
         MyData **                     list,
         size_t *                      list_lenp,
         MyData **                     src,
         MyData **                     test,
         size_t                        dat_len,
         unsigned                      arrayopt )
{
   size_t         x;
   size_t         pos;
   size_t         len;
   size_t         iteration;
   unsigned       mergeopt;
   const char *   compar_name;
   const char *   action_name;
   const char *   merge_type;
   int (*compar)(const void *, const void *);

   assert(list        != NULL);
   assert(list_lenp   != NULL);
   assert(test        != NULL);
   assert(dat_len      > 0);

   my_compar_opts(opts, &compar_name, &compar);

   mergeopt = (arrayopt & BNDL_BMASK_DUPS);
   iteration = (*list_lenp / dat_len) - 1;
   switch(arrayopt & BNDL_BMASK_ADD)
   {
      case BNDL_BINSERT:   action_name = "INSERT"; break;
      case BNDL_BMERGE:    action_name = "MERGE"; break;
      case BNDL_BREPLACE:  action_name = "REPLACE"; break;
      case 0:             action_name = "DEFAULT"; break;
      default:
      return(bindle_tests_error(opts, NULL, "unknown insert action"));
   };
   switch(mergeopt)
   {
      case BNDL_BDUPFIRST:  merge_type = "FIRST"; break;
      case BNDL_BDUPLAST:   merge_type = "LAST"; break;
      case BNDL_BDUPANY:    merge_type = "ANY"; break;
      case 0:              merge_type = "DEFAULT"; break;
      default:
      return(bindle_tests_error(opts, NULL, "unknown dup action"));
   };

   bindle_tests_verbose(opts, "testing   bindle_bremove( %7s, %9s, %s ) [%s] ...", action_name, merge_type, compar_name, (((iteration)) ? "duplicate" : "unique"));
   for(x = 0; (x < dat_len); x++)
   {
      if (bindle_bremove(&src[x], list, list_lenp, sizeof(MyData *), arrayopt, compar) == NULL)
         return(bindle_tests_error(opts, NULL, "bindle_bremove(%s): returned error", action_name));
      len = ((iteration+1)*dat_len) - x - 1;
      if ( ((iteration)) && (!(arrayopt & BNDL_BMERGE)) )
         len = dat_len;
      if (*list_lenp != len)
         return(bindle_tests_error(opts, NULL, "bindle_bremove(%s): did not decrement length", action_name));
   };

   if (!(arrayopt & BNDL_BMERGE))
      iteration = 0;

   bindle_tests_verbose(opts, "verifying bindle_bremove( %7s, %9s, %s ) [%s] ...", action_name, merge_type, compar_name, (((iteration)) ? "duplicate" : "unique"));
   for(x = 0; ((x < (*list_lenp)) && ((iteration))); x++)
   {
      pos = x/iteration;
      if ((strcasecmp(test[pos]->name, list[x]->name)))
         return(bindle_tests_error(opts, NULL, "bindle_bremove(%s): misordered the list", action_name));
      switch(mergeopt)
      {
         case BNDL_BDUPLAST:
         if ( (x < ((dat_len*iteration)-1)) && ((x % iteration) == (iteration-1)) )
            if (!(strcasecmp(list[x]->name, list[x+1]->name)))
               return(bindle_tests_error(opts, NULL, "bindle_bremove(%s): first match not returned", action_name));
         break;

         case BNDL_BDUPFIRST:
         if ( (x > 0) && (!(x % iteration)) )
            if (!(strcasecmp(list[x]->name, list[x-1]->name)))
               return(bindle_tests_error(opts, NULL, "bindle_bremove(%s): first match not returned", action_name));
         break;

         case BNDL_BDUPANY:
         default:
         break;
      };
   };

   return(0);
}


int
my_test_search(
         unsigned                      opts,
         MyData **                     list,
         size_t                        len )
{
   size_t         x;
   size_t         y;
   ssize_t        idx;
   void *         ptr;
   MyData **      res;
   const char *   compar_name;
   int (*compar)(const void *, const void *);

   assert(list != NULL);

   my_compar_opts(opts, &compar_name, &compar);

   bindle_tests_verbose(opts, "testing   bindle_bindex(  %s ) ...", compar_name);
   for(x = 1; (x < (len+1)); x++)
   {
      for(y = 0; (y < x); y++)
      {
         switch(opts & MY_MASK)
         {
            case MY_OBJ_NAME:  ptr = &list[y];        break;
            case MY_OBJ_VALUE: ptr = &list[y];        break;
            case MY_KEY_NAME:  ptr = list[y]->name;   break;
            case MY_KEY_VALUE: ptr = &list[y]->value; break;
            default:
            return(bindle_tests_error(opts, NULL, "unknown key"));
         };
         if ((idx = bindle_bindex(ptr, list, x, sizeof(MyData *), BNDL_BDUPFIRST, NULL, compar)) == -1)
            return(bindle_tests_error(opts, NULL, "bindle_bindex(); size: %zu; func: %s; idx: %zu; search error", x, compar_name, y));
         if ((size_t)idx != y)
            return(bindle_tests_error(opts, NULL, "bindle_bindex(); size: %zu; func: %s; idx: %zu; index mismatch", x, compar_name, y));
      };
   };

   bindle_tests_verbose(opts, "testing   bindle_bsearch( %s ) ...", compar_name);
   for(x = 1; (x < (len+1)); x++)
   {
      for(y = 0; (y < x); y++)
      {
         switch(opts & MY_MASK)
         {
            case MY_OBJ_NAME:  ptr = &list[y];        break;
            case MY_OBJ_VALUE: ptr = &list[y];        break;
            case MY_KEY_NAME:  ptr = list[y]->name;   break;
            case MY_KEY_VALUE: ptr = &list[y]->value; break;
            default:
            return(bindle_tests_error(opts, NULL, "unknown key"));
         };
         if ((res = bindle_bsearch(ptr, list, x, sizeof(MyData *), BNDL_BDUPFIRST, compar)) == NULL)
            return(bindle_tests_error(opts, NULL, "bindle_bsearch(); size: %zu; func: %s; idx: %zu; search error", x, compar_name, y));
         if ((strcasecmp((*res)->name, list[y]->name)))
            return(bindle_tests_error(opts, NULL, "bindle_bsearch(); size: %zu; func: %s; idx: %zu; result name does not match", x, compar_name, y));
         if ((*res)->value != list[y]->value)
            return(bindle_tests_error(opts, NULL, "bindle_bsearch(); size: %zu; func: %s; idx: %zu; result value does not match", x, compar_name, y));
      };
   };

   bindle_tests_verbose(opts, "testing   bsearch(        %s ) ...", compar_name);
   for(x = 1; (x < (len+1)); x++)
   {
      for(y = 0; (y < x); y++)
      {
         switch(opts & MY_MASK)
         {
            case MY_OBJ_NAME:  ptr = &list[y];        break;
            case MY_OBJ_VALUE: ptr = &list[y];        break;
            case MY_KEY_NAME:  ptr = list[y]->name;   break;
            case MY_KEY_VALUE: ptr = &list[y]->value; break;
            default:
            return(bindle_tests_error(opts, NULL, "unknown key"));
         };
         if ((res = bsearch(ptr, list, x, sizeof(MyData *), compar)) == NULL)
            return(bindle_tests_error(opts, NULL, "bsearch(); size: %zu; func: %s; idx: %zu; search error", x, compar_name, y));
         if ((strcasecmp((*res)->name, list[y]->name)))
            return(bindle_tests_error(opts, NULL, "bsearch(); size: %zu; func: %s; idx: %zu; result name does not match", x, compar_name, y));
         if ((*res)->value != list[y]->value)
            return(bindle_tests_error(opts, NULL, "bsearch(); size: %zu; func: %s; idx: %zu; result value does not match", x, compar_name, y));
      };
   };

   return(0);
}

/* end of source */