pike.git / src / array.c

version» Context lines:

pike.git/src/array.c:15:   #include "error.h"   #include "pike_types.h"   #include "fsort.h"   #include "builtin_functions.h"   #include "pike_memory.h"   #include "gc.h"   #include "main.h"   #include "security.h"   #include "stuff.h"    - RCSID("$Id: array.c,v 1.55 1999/09/24 13:03:01 noring Exp $"); + RCSID("$Id: array.c,v 1.56 1999/10/03 21:44:17 hubbe Exp $");      struct array empty_array=   {    1, /* Never free */   #ifdef PIKE_SECURITY    0,   #endif    &empty_array, /* Next */    &empty_array, /* previous (circular) */    0, /* Size = 0 */
pike.git/src/array.c:1127:    * as it was before (check merge_array_with_order below)    */   static int array_merge_fun(INT32 *a, INT32 *b)   {    if(*a<0)    {    if(*b<0)    {    return orderb[~*a] - orderb[~*b];    }else{ -  return -1; +  return 1;    }    }else{    if(*b<0)    { -  return 1; +  return -1;    }else{    return ordera[*a] - ordera[*b];    }    }   }            /*    * merge two arrays and retain their order, this is done by arranging them
pike.git/src/array.c:1333: Inside #if defined(PIKE_DEBUG)
  #ifdef PIKE_DEBUG    if(d_flag > 1)    {    array_check_type_field(b);    }   #endif    check_array_for_destruct(a);       if(a->type_field & b->type_field)    { -  return merge_array_without_order(a, b, PIKE_ARRAY_OP_AND); +  return merge_array_with_order(a, b, PIKE_ARRAY_OP_AND_LEFT);    }else{    return allocate_array_no_init(0,0);    }   }      int check_that_array_is_constant(struct array *a)   {    array_fix_type_field(a);    if(a->type_field & (BIT_FUNCTION | BIT_OBJECT))    {