----------------------------------------- BagA = [11, 12, 13] BagB = [11, 12, 13] A subtract B: [] A least_upper_bound B: [11, 12, 13] A union B: [11, 11, 12, 12, 13, 13] A intersect B: [11, 12, 13] A '=' B ----------------------------------------- ----------------------------------------- BagA = [11, 12, 13] BagB = [11, 11, 12, 13, 13] A subtract B: [] A least_upper_bound B: [11, 11, 12, 13, 13] A union B: [11, 11, 11, 12, 12, 13, 13, 13] A intersect B: [11, 12, 13] A '<' B ----------------------------------------- ----------------------------------------- BagA = [11, 12, 13] BagB = [11, 11, 12, 12, 13, 13] A subtract B: [] A least_upper_bound B: [11, 11, 12, 12, 13, 13] A union B: [11, 11, 11, 12, 12, 12, 13, 13, 13] A intersect B: [11, 12, 13] A '<' B ----------------------------------------- ----------------------------------------- BagA = [11, 12, 13] BagB = [5, 5, 6] A subtract B: [11, 12, 13] A least_upper_bound B: [5, 5, 6, 11, 12, 13] A union B: [5, 5, 6, 11, 12, 13] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [11, 12, 13] BagB = [25, 26, 26] A subtract B: [11, 12, 13] A least_upper_bound B: [11, 12, 13, 25, 26, 26] A union B: [11, 12, 13, 25, 26, 26] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [11, 12, 13] BagB = [5, 5, 6, 25, 26, 26] A subtract B: [11, 12, 13] A least_upper_bound B: [5, 5, 6, 11, 12, 13, 25, 26, 26] A union B: [5, 5, 6, 11, 12, 13, 25, 26, 26] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [11, 12, 13] BagB = [5, 5, 6, 12] A subtract B: [11, 13] A least_upper_bound B: [5, 5, 6, 11, 12, 13] A union B: [5, 5, 6, 11, 12, 12, 13] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [11, 12, 13] BagB = [12, 25, 26, 26] A subtract B: [11, 13] A least_upper_bound B: [11, 12, 13, 25, 26, 26] A union B: [11, 12, 12, 13, 25, 26, 26] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [11, 12, 13] BagB = [5, 5, 6, 12, 25, 26, 26] A subtract B: [11, 13] A least_upper_bound B: [5, 5, 6, 11, 12, 13, 25, 26, 26] A union B: [5, 5, 6, 11, 12, 12, 13, 25, 26, 26] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [11, 11, 12, 13, 13] BagB = [11, 12, 13] A subtract B: [11, 13] A least_upper_bound B: [11, 11, 12, 13, 13] A union B: [11, 11, 11, 12, 12, 13, 13, 13] A intersect B: [11, 12, 13] A '>' B ----------------------------------------- ----------------------------------------- BagA = [11, 11, 12, 13, 13] BagB = [11, 11, 12, 13, 13] A subtract B: [] A least_upper_bound B: [11, 11, 12, 13, 13] A union B: [11, 11, 11, 11, 12, 12, 13, 13, 13, 13] A intersect B: [11, 11, 12, 13, 13] A '=' B ----------------------------------------- ----------------------------------------- BagA = [11, 11, 12, 13, 13] BagB = [11, 11, 12, 12, 13, 13] A subtract B: [] A least_upper_bound B: [11, 11, 12, 12, 13, 13] A union B: [11, 11, 11, 11, 12, 12, 12, 13, 13, 13, 13] A intersect B: [11, 11, 12, 13, 13] A '<' B ----------------------------------------- ----------------------------------------- BagA = [11, 11, 12, 13, 13] BagB = [5, 5, 6] A subtract B: [11, 11, 12, 13, 13] A least_upper_bound B: [5, 5, 6, 11, 11, 12, 13, 13] A union B: [5, 5, 6, 11, 11, 12, 13, 13] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [11, 11, 12, 13, 13] BagB = [25, 26, 26] A subtract B: [11, 11, 12, 13, 13] A least_upper_bound B: [11, 11, 12, 13, 13, 25, 26, 26] A union B: [11, 11, 12, 13, 13, 25, 26, 26] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [11, 11, 12, 13, 13] BagB = [5, 5, 6, 25, 26, 26] A subtract B: [11, 11, 12, 13, 13] A least_upper_bound B: [5, 5, 6, 11, 11, 12, 13, 13, 25, 26, 26] A union B: [5, 5, 6, 11, 11, 12, 13, 13, 25, 26, 26] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [11, 11, 12, 13, 13] BagB = [5, 5, 6, 12] A subtract B: [11, 11, 13, 13] A least_upper_bound B: [5, 5, 6, 11, 11, 12, 13, 13] A union B: [5, 5, 6, 11, 11, 12, 12, 13, 13] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [11, 11, 12, 13, 13] BagB = [12, 25, 26, 26] A subtract B: [11, 11, 13, 13] A least_upper_bound B: [11, 11, 12, 13, 13, 25, 26, 26] A union B: [11, 11, 12, 12, 13, 13, 25, 26, 26] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [11, 11, 12, 13, 13] BagB = [5, 5, 6, 12, 25, 26, 26] A subtract B: [11, 11, 13, 13] A least_upper_bound B: [5, 5, 6, 11, 11, 12, 13, 13, 25, 26, 26] A union B: [5, 5, 6, 11, 11, 12, 12, 13, 13, 25, 26, 26] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [11, 11, 12, 12, 13, 13] BagB = [11, 12, 13] A subtract B: [11, 12, 13] A least_upper_bound B: [11, 11, 12, 12, 13, 13] A union B: [11, 11, 11, 12, 12, 12, 13, 13, 13] A intersect B: [11, 12, 13] A '>' B ----------------------------------------- ----------------------------------------- BagA = [11, 11, 12, 12, 13, 13] BagB = [11, 11, 12, 13, 13] A subtract B: [12] A least_upper_bound B: [11, 11, 12, 12, 13, 13] A union B: [11, 11, 11, 11, 12, 12, 12, 13, 13, 13, 13] A intersect B: [11, 11, 12, 13, 13] A '>' B ----------------------------------------- ----------------------------------------- BagA = [11, 11, 12, 12, 13, 13] BagB = [11, 11, 12, 12, 13, 13] A subtract B: [] A least_upper_bound B: [11, 11, 12, 12, 13, 13] A union B: [11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13] A intersect B: [11, 11, 12, 12, 13, 13] A '=' B ----------------------------------------- ----------------------------------------- BagA = [11, 11, 12, 12, 13, 13] BagB = [5, 5, 6] A subtract B: [11, 11, 12, 12, 13, 13] A least_upper_bound B: [5, 5, 6, 11, 11, 12, 12, 13, 13] A union B: [5, 5, 6, 11, 11, 12, 12, 13, 13] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [11, 11, 12, 12, 13, 13] BagB = [25, 26, 26] A subtract B: [11, 11, 12, 12, 13, 13] A least_upper_bound B: [11, 11, 12, 12, 13, 13, 25, 26, 26] A union B: [11, 11, 12, 12, 13, 13, 25, 26, 26] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [11, 11, 12, 12, 13, 13] BagB = [5, 5, 6, 25, 26, 26] A subtract B: [11, 11, 12, 12, 13, 13] A least_upper_bound B: [5, 5, 6, 11, 11, 12, 12, 13, 13, 25, 26, 26] A union B: [5, 5, 6, 11, 11, 12, 12, 13, 13, 25, 26, 26] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [11, 11, 12, 12, 13, 13] BagB = [5, 5, 6, 12] A subtract B: [11, 11, 12, 13, 13] A least_upper_bound B: [5, 5, 6, 11, 11, 12, 12, 13, 13] A union B: [5, 5, 6, 11, 11, 12, 12, 12, 13, 13] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [11, 11, 12, 12, 13, 13] BagB = [12, 25, 26, 26] A subtract B: [11, 11, 12, 13, 13] A least_upper_bound B: [11, 11, 12, 12, 13, 13, 25, 26, 26] A union B: [11, 11, 12, 12, 12, 13, 13, 25, 26, 26] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [11, 11, 12, 12, 13, 13] BagB = [5, 5, 6, 12, 25, 26, 26] A subtract B: [11, 11, 12, 13, 13] A least_upper_bound B: [5, 5, 6, 11, 11, 12, 12, 13, 13, 25, 26, 26] A union B: [5, 5, 6, 11, 11, 12, 12, 12, 13, 13, 25, 26, 26] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6] BagB = [11, 12, 13] A subtract B: [5, 5, 6] A least_upper_bound B: [5, 5, 6, 11, 12, 13] A union B: [5, 5, 6, 11, 12, 13] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6] BagB = [11, 11, 12, 13, 13] A subtract B: [5, 5, 6] A least_upper_bound B: [5, 5, 6, 11, 11, 12, 13, 13] A union B: [5, 5, 6, 11, 11, 12, 13, 13] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6] BagB = [11, 11, 12, 12, 13, 13] A subtract B: [5, 5, 6] A least_upper_bound B: [5, 5, 6, 11, 11, 12, 12, 13, 13] A union B: [5, 5, 6, 11, 11, 12, 12, 13, 13] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6] BagB = [5, 5, 6] A subtract B: [] A least_upper_bound B: [5, 5, 6] A union B: [5, 5, 5, 5, 6, 6] A intersect B: [5, 5, 6] A '=' B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6] BagB = [25, 26, 26] A subtract B: [5, 5, 6] A least_upper_bound B: [5, 5, 6, 25, 26, 26] A union B: [5, 5, 6, 25, 26, 26] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6] BagB = [5, 5, 6, 25, 26, 26] A subtract B: [] A least_upper_bound B: [5, 5, 6, 25, 26, 26] A union B: [5, 5, 5, 5, 6, 6, 25, 26, 26] A intersect B: [5, 5, 6] A '<' B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6] BagB = [5, 5, 6, 12] A subtract B: [] A least_upper_bound B: [5, 5, 6, 12] A union B: [5, 5, 5, 5, 6, 6, 12] A intersect B: [5, 5, 6] A '<' B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6] BagB = [12, 25, 26, 26] A subtract B: [5, 5, 6] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 6, 12, 25, 26, 26] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6] BagB = [5, 5, 6, 12, 25, 26, 26] A subtract B: [] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 5, 5, 6, 6, 12, 25, 26, 26] A intersect B: [5, 5, 6] A '<' B ----------------------------------------- ----------------------------------------- BagA = [25, 26, 26] BagB = [11, 12, 13] A subtract B: [25, 26, 26] A least_upper_bound B: [11, 12, 13, 25, 26, 26] A union B: [11, 12, 13, 25, 26, 26] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [25, 26, 26] BagB = [11, 11, 12, 13, 13] A subtract B: [25, 26, 26] A least_upper_bound B: [11, 11, 12, 13, 13, 25, 26, 26] A union B: [11, 11, 12, 13, 13, 25, 26, 26] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [25, 26, 26] BagB = [11, 11, 12, 12, 13, 13] A subtract B: [25, 26, 26] A least_upper_bound B: [11, 11, 12, 12, 13, 13, 25, 26, 26] A union B: [11, 11, 12, 12, 13, 13, 25, 26, 26] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [25, 26, 26] BagB = [5, 5, 6] A subtract B: [25, 26, 26] A least_upper_bound B: [5, 5, 6, 25, 26, 26] A union B: [5, 5, 6, 25, 26, 26] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [25, 26, 26] BagB = [25, 26, 26] A subtract B: [] A least_upper_bound B: [25, 26, 26] A union B: [25, 25, 26, 26, 26, 26] A intersect B: [25, 26, 26] A '=' B ----------------------------------------- ----------------------------------------- BagA = [25, 26, 26] BagB = [5, 5, 6, 25, 26, 26] A subtract B: [] A least_upper_bound B: [5, 5, 6, 25, 26, 26] A union B: [5, 5, 6, 25, 25, 26, 26, 26, 26] A intersect B: [25, 26, 26] A '<' B ----------------------------------------- ----------------------------------------- BagA = [25, 26, 26] BagB = [5, 5, 6, 12] A subtract B: [25, 26, 26] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 6, 12, 25, 26, 26] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [25, 26, 26] BagB = [12, 25, 26, 26] A subtract B: [] A least_upper_bound B: [12, 25, 26, 26] A union B: [12, 25, 25, 26, 26, 26, 26] A intersect B: [25, 26, 26] A '<' B ----------------------------------------- ----------------------------------------- BagA = [25, 26, 26] BagB = [5, 5, 6, 12, 25, 26, 26] A subtract B: [] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 6, 12, 25, 25, 26, 26, 26, 26] A intersect B: [25, 26, 26] A '<' B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 25, 26, 26] BagB = [11, 12, 13] A subtract B: [5, 5, 6, 25, 26, 26] A least_upper_bound B: [5, 5, 6, 11, 12, 13, 25, 26, 26] A union B: [5, 5, 6, 11, 12, 13, 25, 26, 26] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 25, 26, 26] BagB = [11, 11, 12, 13, 13] A subtract B: [5, 5, 6, 25, 26, 26] A least_upper_bound B: [5, 5, 6, 11, 11, 12, 13, 13, 25, 26, 26] A union B: [5, 5, 6, 11, 11, 12, 13, 13, 25, 26, 26] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 25, 26, 26] BagB = [11, 11, 12, 12, 13, 13] A subtract B: [5, 5, 6, 25, 26, 26] A least_upper_bound B: [5, 5, 6, 11, 11, 12, 12, 13, 13, 25, 26, 26] A union B: [5, 5, 6, 11, 11, 12, 12, 13, 13, 25, 26, 26] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 25, 26, 26] BagB = [5, 5, 6] A subtract B: [25, 26, 26] A least_upper_bound B: [5, 5, 6, 25, 26, 26] A union B: [5, 5, 5, 5, 6, 6, 25, 26, 26] A intersect B: [5, 5, 6] A '>' B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 25, 26, 26] BagB = [25, 26, 26] A subtract B: [5, 5, 6] A least_upper_bound B: [5, 5, 6, 25, 26, 26] A union B: [5, 5, 6, 25, 25, 26, 26, 26, 26] A intersect B: [25, 26, 26] A '>' B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 25, 26, 26] BagB = [5, 5, 6, 25, 26, 26] A subtract B: [] A least_upper_bound B: [5, 5, 6, 25, 26, 26] A union B: [5, 5, 5, 5, 6, 6, 25, 25, 26, 26, 26, 26] A intersect B: [5, 5, 6, 25, 26, 26] A '=' B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 25, 26, 26] BagB = [5, 5, 6, 12] A subtract B: [25, 26, 26] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 5, 5, 6, 6, 12, 25, 26, 26] A intersect B: [5, 5, 6] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 25, 26, 26] BagB = [12, 25, 26, 26] A subtract B: [5, 5, 6] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 6, 12, 25, 25, 26, 26, 26, 26] A intersect B: [25, 26, 26] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 25, 26, 26] BagB = [5, 5, 6, 12, 25, 26, 26] A subtract B: [] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 5, 5, 6, 6, 12, 25, 25, 26, 26, 26, 26] A intersect B: [5, 5, 6, 25, 26, 26] A '<' B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 12] BagB = [11, 12, 13] A subtract B: [5, 5, 6] A least_upper_bound B: [5, 5, 6, 11, 12, 13] A union B: [5, 5, 6, 11, 12, 12, 13] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 12] BagB = [11, 11, 12, 13, 13] A subtract B: [5, 5, 6] A least_upper_bound B: [5, 5, 6, 11, 11, 12, 13, 13] A union B: [5, 5, 6, 11, 11, 12, 12, 13, 13] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 12] BagB = [11, 11, 12, 12, 13, 13] A subtract B: [5, 5, 6] A least_upper_bound B: [5, 5, 6, 11, 11, 12, 12, 13, 13] A union B: [5, 5, 6, 11, 11, 12, 12, 12, 13, 13] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 12] BagB = [5, 5, 6] A subtract B: [12] A least_upper_bound B: [5, 5, 6, 12] A union B: [5, 5, 5, 5, 6, 6, 12] A intersect B: [5, 5, 6] A '>' B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 12] BagB = [25, 26, 26] A subtract B: [5, 5, 6, 12] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 6, 12, 25, 26, 26] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 12] BagB = [5, 5, 6, 25, 26, 26] A subtract B: [12] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 5, 5, 6, 6, 12, 25, 26, 26] A intersect B: [5, 5, 6] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 12] BagB = [5, 5, 6, 12] A subtract B: [] A least_upper_bound B: [5, 5, 6, 12] A union B: [5, 5, 5, 5, 6, 6, 12, 12] A intersect B: [5, 5, 6, 12] A '=' B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 12] BagB = [12, 25, 26, 26] A subtract B: [5, 5, 6] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 6, 12, 12, 25, 26, 26] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 12] BagB = [5, 5, 6, 12, 25, 26, 26] A subtract B: [] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 5, 5, 6, 6, 12, 12, 25, 26, 26] A intersect B: [5, 5, 6, 12] A '<' B ----------------------------------------- ----------------------------------------- BagA = [12, 25, 26, 26] BagB = [11, 12, 13] A subtract B: [25, 26, 26] A least_upper_bound B: [11, 12, 13, 25, 26, 26] A union B: [11, 12, 12, 13, 25, 26, 26] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [12, 25, 26, 26] BagB = [11, 11, 12, 13, 13] A subtract B: [25, 26, 26] A least_upper_bound B: [11, 11, 12, 13, 13, 25, 26, 26] A union B: [11, 11, 12, 12, 13, 13, 25, 26, 26] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [12, 25, 26, 26] BagB = [11, 11, 12, 12, 13, 13] A subtract B: [25, 26, 26] A least_upper_bound B: [11, 11, 12, 12, 13, 13, 25, 26, 26] A union B: [11, 11, 12, 12, 12, 13, 13, 25, 26, 26] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [12, 25, 26, 26] BagB = [5, 5, 6] A subtract B: [12, 25, 26, 26] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 6, 12, 25, 26, 26] A intersect B: [] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [12, 25, 26, 26] BagB = [25, 26, 26] A subtract B: [12] A least_upper_bound B: [12, 25, 26, 26] A union B: [12, 25, 25, 26, 26, 26, 26] A intersect B: [25, 26, 26] A '>' B ----------------------------------------- ----------------------------------------- BagA = [12, 25, 26, 26] BagB = [5, 5, 6, 25, 26, 26] A subtract B: [12] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 6, 12, 25, 25, 26, 26, 26, 26] A intersect B: [25, 26, 26] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [12, 25, 26, 26] BagB = [5, 5, 6, 12] A subtract B: [25, 26, 26] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 6, 12, 12, 25, 26, 26] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [12, 25, 26, 26] BagB = [12, 25, 26, 26] A subtract B: [] A least_upper_bound B: [12, 25, 26, 26] A union B: [12, 12, 25, 25, 26, 26, 26, 26] A intersect B: [12, 25, 26, 26] A '=' B ----------------------------------------- ----------------------------------------- BagA = [12, 25, 26, 26] BagB = [5, 5, 6, 12, 25, 26, 26] A subtract B: [] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 6, 12, 12, 25, 25, 26, 26, 26, 26] A intersect B: [12, 25, 26, 26] A '<' B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 12, 25, 26, 26] BagB = [11, 12, 13] A subtract B: [5, 5, 6, 25, 26, 26] A least_upper_bound B: [5, 5, 6, 11, 12, 13, 25, 26, 26] A union B: [5, 5, 6, 11, 12, 12, 13, 25, 26, 26] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 12, 25, 26, 26] BagB = [11, 11, 12, 13, 13] A subtract B: [5, 5, 6, 25, 26, 26] A least_upper_bound B: [5, 5, 6, 11, 11, 12, 13, 13, 25, 26, 26] A union B: [5, 5, 6, 11, 11, 12, 12, 13, 13, 25, 26, 26] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 12, 25, 26, 26] BagB = [11, 11, 12, 12, 13, 13] A subtract B: [5, 5, 6, 25, 26, 26] A least_upper_bound B: [5, 5, 6, 11, 11, 12, 12, 13, 13, 25, 26, 26] A union B: [5, 5, 6, 11, 11, 12, 12, 12, 13, 13, 25, 26, 26] A intersect B: [12] A incomparable B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 12, 25, 26, 26] BagB = [5, 5, 6] A subtract B: [12, 25, 26, 26] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 5, 5, 6, 6, 12, 25, 26, 26] A intersect B: [5, 5, 6] A '>' B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 12, 25, 26, 26] BagB = [25, 26, 26] A subtract B: [5, 5, 6, 12] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 6, 12, 25, 25, 26, 26, 26, 26] A intersect B: [25, 26, 26] A '>' B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 12, 25, 26, 26] BagB = [5, 5, 6, 25, 26, 26] A subtract B: [12] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 5, 5, 6, 6, 12, 25, 25, 26, 26, 26, 26] A intersect B: [5, 5, 6, 25, 26, 26] A '>' B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 12, 25, 26, 26] BagB = [5, 5, 6, 12] A subtract B: [25, 26, 26] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 5, 5, 6, 6, 12, 12, 25, 26, 26] A intersect B: [5, 5, 6, 12] A '>' B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 12, 25, 26, 26] BagB = [12, 25, 26, 26] A subtract B: [5, 5, 6] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 6, 12, 12, 25, 25, 26, 26, 26, 26] A intersect B: [12, 25, 26, 26] A '>' B ----------------------------------------- ----------------------------------------- BagA = [5, 5, 6, 12, 25, 26, 26] BagB = [5, 5, 6, 12, 25, 26, 26] A subtract B: [] A least_upper_bound B: [5, 5, 6, 12, 25, 26, 26] A union B: [5, 5, 5, 5, 6, 6, 12, 12, 25, 25, 26, 26, 26, 26] A intersect B: [5, 5, 6, 12, 25, 26, 26] A '=' B -----------------------------------------