Computing an inner product of tuples represented as maps : map « Map Multimap « C++






  1. C++
  2. Map Multimap
  3. map

Computing an inner product of tuples represented as maps

  
 

#include <map>
#include <iostream>
using namespace std;

int main()
{
  const long N = 600000; // Length of tuples x and y
  const long S = 10;     // Sparseness factor

  map<long, double> x, y;
  for (long k = 0; 3 * k * S < N; ++k)
    x[3 * k * S] = 1.0;
  for (long k = 0; 5 * k * S < N; ++k)
    y[5 * k * S] = 1.0;

  double sum;
  map<long, double>::iterator ix, iy;

  for (sum = 0.0, ix = x.begin(); ix != x.end(); ++ix) {
    long i = ix->first;
    iy = y.find(i);
    if (iy != y.end())
      sum += ix->second * iy->second;
  }
  cout << sum << endl;
  return 0;
}

 /* 
4000

 */








Related examples in the same category

1.Demonstrating an STL map
2.Use string as the key and value in a map
3.Define string-string map and loop through the value key-pair
4.Declare a char int map
5.Create string float map
6.Multiple map
7.Store objects in a map
8.Add user-defined object to map, loop through the map and output
9.Use a map to create a phone directory.
10.Get the size of a map
11.Put value to map with assignment