The appropriate base type for wrapping std::vector in Java is java.util.AbstractList. Using java.util.Vector as a base would be odd because you’d end up with two sets of storage, one in the std::vector, and one in the java.util.Vector. The reason SWIG doesn’t do this for you though is because you can’t have AbstractList<double> in Java, it … Read more
According to the C++03 ISO spec (§23.1.1, Table 67) (and as @AndyProwl has mentioned, in §23.2.3, table 11 of the C++11 ISO spec), as part of sequence requirements, the operation a.insert(p, i, j) in a sequence container has this precondition: i, j are not iterators into a. In other words, sequence containers are allowed to … Read more
It’s really odd that nobody know this!!! in C++11 you could use: buffer.data() it could get the address of the vector I have test it: vector<char>buffer; buffer.push_back(‘w’); buffer.push_back(‘h’); buffer.push_back(‘a’); buffer.push_back(‘t’); buffer.push_back(‘\0’); char buf2[10]; memcpy(buf2,buffer.data(),10); Specification here.
Effective Java 2nd Edition, Item 16: Favor composition over inheritance: Inheritance is appropriate only in circumstances where the subclass really is a subtype of the superclass. In other words, a class B should only extend a class A only if an “is-a” relationship exists between the two classes. If you are tempted to have a … Read more
When calculating the average time to insert into a vector, you need to allow for the non-growing inserts and the growing inserts. Call the total number of operations to insert n items ototal, and the average oaverage. If you insert n items, and you grow by a factor of A as required, then there are … Read more
I agree that the equal function on the vector prototype is the best solution. Note that you can also build other infix-like operators via chaining. function Vector(x, y, z) { this.x = x; this.y = y; this.z = z; } Vector.prototype.add = function (v2) { var v = new Vector(this.x + v2.x, this.y + v2.y, … Read more
I believe numpy.column_stack should do what you want. Example: >>> a = np.array((0, 1)) >>> b = np.array((2, 1)) >>> c = np.array((-1, -1)) >>> numpy.column_stack((a,b,c)) array([[ 0, 2, -1], [ 1, 1, -1]]) It is essentially equal to >>> numpy.vstack((a,b,c)).T though. As it says in the documentation.
My understanding is that the compiler/linker includes only the member functions present in the source code and those are the ones I can use in gdb. Your understanding is incorrect / incomplete. std::vector is a template class. Without explicit instantiation, the compiler is required to instantiate only the methods called (usually a subset of methods … Read more
I’ve added a few lines to your code. That’s sufficient to make it clear why this is disallowed: void f(vector<const T*>& p) { static const T ct; p.push_back(&ct); // adds a const T* to nonConstVec ! } int main() { vector<T*> nonConstVec; f(nonConstVec); nonConstVec.back()->nonConstFunction(); }