what is the best modern c++ approach to construct and manipulate a 2d array [closed]

by

Some points to get you started.

First, std::array vs std::vector. This is easy. If you know at compile time the size of your 2d array then definitely std::array else std::vector.

std::vector<std::vector<T>> is ok for something that you need to cook up quickly and you use seldom in pieces of code that are not performance critical(1).

The big downside to std::vector<std::vector<T>> is the memory layout. You have double indirection and each line is allocated separately, wreaking havoc on your cache so it’s a definitely a no no in performance critical code (1). For performance critical code you need to use a mature math library. Experts can write performance oriented code order of magnitude better than you or me and another important advantage of such library is that it passed the test of time.

If for whatever reason you want to write this yourself then the solution is to flatten the matrix. I.e. use std::vector<T>(numRows * numColumns) and then access the elements with the formula: (i, j) -> v[i * numColumns + j]. And wrap that in a nice interface. How complex the interface is and what kind of operations you allow on it it’s totally up to you.

(1) I would like to point out that most often especially novice programmers completely misunderstand performance concerns (it’s completely understandable due to lack of experience). First there are some few generally acceptable practices that apply to any situation. Then comes the analysis of the algorithm and the data types used. But other than that you first write code for readability and then, if performance is a concern, you profile your code and start optimizing where the profiler tells you.

More Related Contents:

  1. Invalid operands to binary expression while implementing vector [closed]
  2. How do I take values from text file and input into a 2D array? c++
  3. push_back vs emplace_back
  4. Is std::unique_ptr required to know the full definition of T?
  5. Why can I not push_back a unique_ptr into a vector?
  6. Does “int size = 10;” yield a constant expression?
  7. Why do I get the same sequence for every run with std::random_device with mingw gcc4.8.1?
  8. Nice way to append a vector to itself
  9. char* vs std::string in c++ [closed]
  10. Why is template argument deduction disabled with std::forward?
  11. Why use non-member begin and end functions in C++11?
  12. C++11: Correct std::array initialization?
  13. Convert std::tuple to std::array C++11
  14. Now that we have std::array what uses are left for C-style arrays?
  15. How to construct std::array object with initializer list? [duplicate]
  16. Is it possible to initialize std::vector over already allocated memory?
  17. Can std::begin work with array parameters and if so, how?
  18. Non-copyable elements in vector
  19. Is int arr[ ] valid C++?
  20. C++11 STL containers and thread safety
  21. How can I use Standard Library (STL) classes in my dll interface or ABI?
  22. too many initializers for ‘int [0]’ c++
  23. Comparing 3 modern c++ ways to convert integral values to strings
  24. Can std::vector emplace_back copy construct from an element of the vector itself?
  25. stl random distributions and portability
  26. Are lambdas inlined like functions in C++?
  27. Why vector access operators are not specified as noexcept?
  28. error for hash function of pair of ints
  29. STL algorithms: Why no additional interface for containers (additional to iterator pairs)?
  30. Is there a way to statically-initialize a dynamically-allocated array in C++?

Leave a Comment