implementation

The problem is simple, There is some given 1D lines on a plane. We need to find the total size of space having at least one line. Let me discuss this with an example image- This may a case . Or This may be a case or anything like this. I know it is a basic problem of Sweep Line Algorithm . But there is no proper document in the internet for it to understand properly. The one best I have is a blog of Top Coder and that is here . But it is not clear how to implement it or how may be the simulation. If I want, we can do it in O(n^2) with 2 loops, but I can't realize how would be the procedure. Or

I am writing a template class and want to find out whether template argument is default constructible is there any way to do it ? The code is something like following template <class C> class A { createObj() { C* objPtr = NULL; // If default constructible then create object else let it remain NULL } }; Update: I have tried using code given in this question but it doesn't work, to be precise if return default constructible even for those classes which aren't, I have no idea why is that happening. Konrad Rudolph This is a classical case for SFINAE and enable_if . In another answer, Potatoswatter

I am implementing SVG Tiny 1.1 and I am having trouble understanding the "user unit" concept. SVG 1.1 specification defines every <length> with no specified unit (such as "mm", "cm", "pt", etc) to be in "user unit". While implementing interface "SVGLength", I encountered 4 attributes related to the value of the length; value , unityType , valueInSpecifiedUnit , valueAsString . The last 3 attributes are clear enough for me. valueInSpecifiedUnit is in unit type unitType . valueAsString equals valueInSpecifiedUnit + unitType 's string value. Eg: "10mm" However, the attribute value is said to be

The implementing-result-paging-in-hibernate-getting-total-number-of-rows question trigger another question for me, about some implementation concern : Now you know you have to reuse part of the HQL query to do the count, how to reuse efficiently? The differences between the two HQL queries are: the selection is count(?) , instead of the pojo or property (or list of) the fetches should not happen, so some tables should not be joined the order by should disappear Is there other differences? Do you have coding best-practices to achieve this reuse efficiently (concerns: effort, clarity,

I just discovered the following odd behavior with String#split : "a\tb c\nd".split => ["a", "b", "c", "d"] "a\tb c\nd".split(' ') => ["a", "b", "c", "d"] "a\tb c\nd".split(/ /) => ["a\tb", "c\nd"] The source (string.c from 2.0.0) is over 200 lines long and contains a passage like this: /* L 5909 */ else if (rb_enc_asciicompat(enc2) == 1) { if (RSTRING_LEN(spat) == 1 && RSTRING_PTR(spat)[0] == ' '){ split_type = awk; } } Later, in the code for the awk split type, the actual argument isn't even used any more and does the same as a plain split . Does anyone else feel that this is somehow broken?

When using list comprehension or the in keyword in a for loop context, i.e: for o in X: do_something_with(o) or l=[o for o in X] How does the mechanism behind in works? Which functions\methods within X does it call? If X can comply to more than one method, what's the precedence? How to write an efficient X , so that list comprehension will be quick? The, afaik, complete and correct answer. for , both in for loops and list comprehensions, calls iter() on X . iter() will return an iterable if X either has an __iter__ method or a __getitem__ method. If it implements both, __iter__ is used. If it

I'm currently trying my luck to integrate PayPal in ASP.NET (I'm just starting to know more about PayPal, okay?) PayPal Integration Wizard. Hmmm. Does this even work? What are your thoughts/comments/suggestions about it? Any good implementation (in ASP.NET) you could share? There are a lot of articles, tutorials and samples out there. Official Paypal resources PayPal SDKs PayPal Sample Code Blog posts and articles ASP.NET Implementation for Paypal Website Payments Standard Use of the PayPal payment system in ASP.NET Integrating PayPal Payments into E-Commerce Applications with ASP.NET Building

Iota is a ridiculously small "programming language" using only one combinator. I'm interested in understanding how it works, but it would be helpful to see the implementation in a language I'm familiar with. I found an implementation of the Iota programming language written in Scheme. I've been having a little trouble translating it to Haskell though. It's rather simple, but I'm relatively new to both Haskell and Scheme. How would you write an equivalent Iota implementation in Haskell? (let iota () (if (eq? #\* (read-char)) ((iota)(iota)) (lambda (c) ((c (lambda (x) (lambda (y) (lambda (z) ((x