Construct a map from two equal size arrays

mat = 

[4x5 double]
[4x5 double]
[5x5 double]
[4x5 double]
[5x5 double]
[6x5 double]
[5x5 double]

arr_sizes =  arrayfun(@(x) size(mat{x},1),1:size(mat,1))'

arr_sizes =

 4
 4
 5
 4
 5
 6
 5

[~, ~, idx] = unique(arr_sizes);

tot_arr = arrayfun(@(x) mat(idx == x), 1:max(idx),'UniformOutput',false)';

tot_arr =

{3x1 cell}
{3x1 cell}
{1x1 cell}

tot_arr{1}

ans = 

[4x5 double]
[4x5 double]
[4x5 double]

#include <iostream>
#include <unordered_set>

bool isEqual(int a1[], int a2[], int len) {
  using namespace std;
  unordered_set<int> s1(a1, a1 + len); //O(n)
  unordered_set<int> s2(a2, a2 + len); // O(n)
  return s1 == s2; // O(n)
}

int main() {
  using namespace std;
  int a1[5] = {5,2,3,4,1};
  int a2[5] = {1,3,2,5,4};
  std::cout << isEqual(a1, a2, sizeof(a1) / sizeof(int)) << std::endl;

  int a3[5] = {0,2,3,4,5};
  int a4[5] = {1,6,2,5,4};
  std::cout << isEqual(a3,a4, sizeof(a3) / sizeof(int)) << std::endl;
  return 0;
}

chars.map.with_index {|char, i| 
  prices[i].zip(names[i], numbers[i], pics[i], [char].cycle)
}.flatten(1)

 int size = ceil(size_1/2);

int size = ceil(size_1/2.0f);  // now we're dividing by a float, so the result will be non-integer

int size = (size_1+1)/2;