Yes, it is possible, we can generate regexes from examples (text -> desired extractions). This is a working online tool which does the job: http://regex.inginf.units.it/ Regex Generator++ online tool generates a regex from provided examples using a GP search algorithm. The GP algorithm is driven by a multiobjective fitness which leads to higher performance and … Read more
I did not manage to find materials about truly RESTful streaming – it seems that results are mostly about delegating streaming to another service (which is not a bad solution). So I’ll do my best to tackle it myself – note that streaming is not my domain, but I’ll try to add my 2 cents. … Read more
The definition of an inline function doesn’t have to be in a header file but, because of the one definition rule (ODR) for inline functions, an identical definition for the function must exist in every translation unit that uses it. The easiest way to achieve this is by putting the definition in a header file. … Read more
If you’re good at reading code, studying SQLite will teach you a whole boatload about database design. It’s small, so it’s easier to wrap your head around. But it’s also professionally written. SQLite 2.5.0 for Code Reading http://sqlite.org/
A transaction is a unit of work that you want to treat as “a whole.” It has to either happen in full or not at all. A classical example is transferring money from one bank account to another. To do that you have first to withdraw the amount from the source account, and then deposit … Read more
Ok, they’re fundamentally a pretty simple idea. A DHT gives you a dictionary-like interface, but the nodes are distributed across the network. The trick with DHTs is that the node that gets to store a particular key is found by hashing that key, so in effect your hash-table buckets are now independent nodes in a … Read more
Schemas logically group tables, procedures, views together. All employee-related objects in the employee schema, etc. You can also give permissions to just one schema, so that users can only see the schema they have access to and nothing else.
The entire point of interfaces is to give you the flexibility to have your class be forced to implement multiple interfaces, but still not allow multiple inheritance. The issues with inheriting from multiple classes are many and varied and the wikipedia page on it sums them up pretty well. Interfaces are a compromise. Most of … Read more
P stands for polynomial time. NP stands for non-deterministic polynomial time. Definitions: Polynomial time means that the complexity of the algorithm is O(n^k), where n is the size of your data (e. g. number of elements in a list to be sorted), and k is a constant. Complexity is time measured in the number of … Read more
One way of thinking about it is this: O(N^2) means for every element, you’re doing something with every other element, such as comparing them. Bubble sort is an example of this. O(N log N) means for every element, you’re doing something that only needs to look at log N of the elements. This is usually … Read more