I’ve solved the problem without XmlAdapter’s. I’ve written JAXB-annotated objects for Map, Map.Entry and Collection. The main idea is inside the method xmlizeNestedStructure(…): Take a look at the code: public final class Adapters { private Adapters() { } public static Class<?>[] getXmlClasses() { return new Class<?>[]{ XMap.class, XEntry.class, XCollection.class, XCount.class }; } public static Object … Read more
The dependency array format: define([“a”, “b”, “c”], function (a, b, c) { }); can indeed be annoying and error-prone. Matching up the array entries to function parameters is a real pain. I prefer the require format (“Simplified CommonJS Wrapper”): define(function (require) { var a = require(“a”); var b = require(“b”); var c = require(“c”); }); … Read more
You can use a discriminated union for this. This example uses Typescript, but the concept would be similar for Javascript just without the type safety. interface UPCA { kind: “UPCA”; numberSystem: number; manufacturer: number; item: number; checkDigit: number; } interface QRCode { kind: “QRCode”; data: string; } interface Other { kind: “Other”; } type Barcode … Read more
Here’s an example > length (undefined : 3 : 4 : undefined : []) 4 > length (2 : 3 : 4 : 5 : undefined) <<loop>> The first list contains bottoms as elements, but the “shape” of the list is fully defined. Roughly speaking, every list cell has a clearly defined “pointer” to its … Read more
If you relax the constraint that the Position column must contain integers from 1 to N and instead allow it to contain any numbers then you can do both searches and updates efficiently. You can insert an item between two other items with position A and B by calculating the average (A + B) DIV … Read more
Have two pointers iterating through the list; make one iterate through at twice the speed of the other, and compare their positions at each step. Off the top of my head, something like: node* tortoise(begin), * hare(begin); while(hare = hare->next) { if(hare == tortoise) { throw std::logic_error(“There’s a cycle”); } hare = hare->next; if(hare == … Read more
In C++ struct is (almost) synonymous to a class (except of different default access level), so yes, you can. struct A { // fields are public by default }; class B: public A { // fields are private by default }; I’m not familiar with MFC, but it looks like an attempt to maintain both … Read more
The key difference between structural and generative recursion is where a recursive procedure gets the data that it works on and how it processes that data. Specifically, for structural recursion, a recursive call is made on a subset of the original input data. Whereas for generative recursion, a recursive call is made on data that … Read more
The book: Data Structures and Algorithm Analysis in Java (2nd Edition), by Mark Allen Weiss Says that a D&C algorithm should have two disjoint recursive calls, just like QuickSort does. Binary Search does not have this, even though it can be implemented recursively.
I would expect: template<typename T> void pop_front(std::vector<T>& vec) { assert(!vec.empty()); vec.front() = std::move(vec.back()); vec.pop_back(); } to be the most efficient way of doing this, but it does not maintain the order of the elements in the vector. If you need to maintain the order of the remaining elements in vec, you can do: template<typename T> … Read more