When you execute these lines: vector<string> wordSets(24); wordSets.push_back(“CHICKEN”); wordSets has 24 empty items an the item “CHICKEN”. I suspect, you didn’t mean that. Changing the first line to: vector<string> wordSets; should fix the wrong number of items problem. If you want to reduce the number of times memory is allocated by calls to push_back, you … Read more
You can do it like that for (int i = 0; i < present.size(); ++i) cout << present[i]->id << ” “; or in C++11 for (auto p : present) cout << p->id << ” “; I hope it helps solved Displaying the elements of a vector of structure [closed]
As others have said, the problem is that function doesn’t return anything. The way to fix this is to have it return its argument: const std::string& function(std::string& var) { var += “pre”; return var; } This way it modifies the string that’s passed to it, and it returns a reference to that string so that … Read more
I can only assume that a side effect of calculateSomeValue() is changing a which invalidates all iterators. Since the order of evaluation of arguments in a.insert(a.begin(), calculateSomeValue()); is unspecified it could be that a.begin() is evaluated before calculateSomeValue() invalidates all iterators to a. Which is undefined behaviour. solved discussion about the scenarios that the insertion … Read more
Below example demonstrates the usage of erase-remove_if. limit is captured by reference and can thus be modified outside the lambda: #include <vector> #include <algorithm> #include <iostream> int main() { std::vector<int> vec{0,1,2,3,4,5,6,7,8,9}; int size = vec.size(); for (int limit = 0; limit <= size; limit++) { vec.erase(std::remove_if(std::begin(vec), std::end(vec), [&limit](int i) { return i < limit; }), … Read more
Try read.csv() dat <- read.csv(text = “Control,3 Test,3 Control,3 Control,3 Test,1 Control,3 Control,1”, header = FALSE) > dat V1 V2 1 Control 3 2 Test 3 3 Control 3 4 Control 3 5 Test 1 6 Control 3 7 Control 1 However, you’ll need read.csv(file = “foo.csv”, header = FALSE) and replace foo.csv with the … Read more
You need to allocate the vector elements before assigning values to them, when you do vector<int> arr; // defines an empty vector. arr[y] = … // access element at position y. arr here is empty, pointing to a zero array, you are trying to write at memory 0x0000. Checkout vector documentation, to see the different … Read more
Doing a simple loop should work. Horribly in-efficient though. Target is the value you are looking for while arr is the array you are looking for it in. int x = -1; int y = -1; for(int i = 0 ; i < arr.size() ; i++){ for(int j = 0 ; j < arr.size() ; … Read more
One problem is how you are handling h_A, h_B, and h_C: h_A = (float *) wbImport(wbArg_getInputFile(args, 0), &inputLength); h_B = (float *) wbImport(wbArg_getInputFile(args, 1), &inputLength); The above lines of code are creating an allocation for h_A and h_B and importing some data (presumably). These lines of code: cudaHostAlloc((void **) &h_A, size, cudaHostAllocDefault); cudaHostAlloc((void **) &h_B, … Read more
Well I just had a quick look at that monstrosity, and I’m not going to look too far into it but right off the bat I see a problem. I don’t know if this is related to this particular problem you are asking about, but this type of thing isn’t going to work the way … Read more
You need to initialize the vector in A‘s constructor: #include <vector> class A { std::vector<double> a; public: A() : a(20) {} }; solved Why i cannot make vector in c++ class [duplicate]
You’re close. You already figured out your bounds problem, but consider what happens at the interface of clusters: ..2,2,3,3… ^ ^ i i+1 You are going to enter the else (else if is unnecessary if the condition is the exact opposite of the original if) and forget to add that last 2. If there are … Read more
#include <algorithm> //… bool isKeyword( const std::string &s ) { return ( std::find( keyword_list.begin(), keyword_list.end(), s ) != keyword_list.end() ); } If the vector would be sorted then you could use standard algorithm std::binary_search For example #include <algorithm> //… bool isKeyword( const std::string &s ) { return ( std::binary_search( keyword_list.begin(), keyword_list.end(), s ) ); } … Read more
The second example has a memory leak. If what you want is just a “fill” function then setOfVertices.insert(setOfVertices.end(), 10, Vertex()); is good enough. However, if what you want instead is insert different Vertex objects then // Make sure only a single memory allocation takes place. setOfVertices.reserve(setOfVertices.size() + 10); for (int i = 0; i < … Read more
After newVector.insert(iter, 5), iter is not valid. That’s why insert returns an iterator. Your code should be iter = newVector.insert(iter, 5); 1 solved “Vector erase iterator outside range” error