You won't be stepping on my toes, but looks like Derek has bigger feet.. ;-P
> What I'd like to do for a final design is write Parallel:: > specializations for data types T* (and containers and possibly > iterator ranges of same). Parallel:: would assume methods > T::packed_size() for deciding how much freed memory to preallocate, > T::pack() (which currently takes a vector<int>, but would be modified > to take an output iterator-to-int) to extend a container with that > object's serialized representation, and T::unpack() (signature TBD - I > definitely don't want to require a Mesh argument for something that > ought to be otherwise pretty libMesh-independent, but Elem::unpack > really needs to be able to query mesh.node_ptr()) to rebuild on the > other side. I'm a little confused by the ouput-iterator-to int bit. I'm guessing you're looking for more abstraction in Parallel::? But are you requiring that everything be packable into an integer array?? -Ben ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ _______________________________________________ Libmesh-devel mailing list Libmesh-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/libmesh-devel