#include <stdlib.h>
#include <stdio.h>
#include <assert.h>
#include "x.h"
typedef struct{int L; int R;} pair;
#define P 0
#define sz (1<<20)
int fr[sz];
pair A[3*sz]; int Andx = 0;
static int bt(int fst, int lst){assert(Andx<3*sz && fst<=lst);
  if(fst==lst) return fr[fst];
  int y = arc4random_uniform(lst-fst);
  pair p = (pair){bt(fst, fst+y), bt(fst+y+1, lst)};
  A[Andx] = p; return Andx++;}

static void scan(int root, sp x){if(root<0) PutGet(root, x);
  else {pair p = A[root]; scan(p.L, x); scan(p.R, x);}}
void startR(int n, sp * s){PutGet(0, s); scan(n, s);
   PutGet(1, s); exit(printf("Should not be here yet.\n"));};

static int ef(int X, int Y){sp other1, other2;
    begin(X, &other1);
    begin(Y, &other2);
    if(1)
      for(int j = 0; j<sz; ++j)
        {if(PutGet(0, &other1) != PutGet(0, &other2))
          exit(printf("Different at %X\n", j));}
    else for(int j = 0; 1; ++j) {
        int p=PutGet(0, &other1), q=PutGet(0, &other2);
        if(p!=q) {printf("Different at %X\n", j);
            return 0;}
        if(p==1 || q==1) return p==q;}
    printf("Whee!\n"); return 1;}

int main(){
  for(int i=0; i<sz; ++i) fr[i] = (1<<31)|arc4random();
  if(P) for(int i=0; i<sz; ++i) printf("%08X\n", fr[i]);
  int X = bt(0, sz-1), Y = bt(0, sz-1);
  fr[(int)(sz*0.89)] += 1; // cause discrepancy.
  int Z = bt(0, sz-1);
  printf("Trees at %08X, %08X and %08X\n", X, Y, Z);
  if(P) for(int i=0; i<sz; ++i)
    printf("%08x %08X %08X\n", i, A[i].L, A[i].R);
  ef(X, Y); ef(X, Z);
  return 0;}
// u_int32_t x;