amatus

--- llvm-3.2.src.orig/tools/llvm-ar/llvm-ar.cpp	2012-10-26 05:49:15.000000000 -0500
+++ llvm-3.2.src/tools/llvm-ar/llvm-ar.cpp	2013-07-13 21:17:35.047302973 -0500
@@ -461,11 +461,12 @@
         (std::find(Paths.begin(), Paths.end(), I->getPath()) != Paths.end())) {
 
       // Make sure the intervening directories are created
-      if (I->hasPath()) {
-        sys::Path dirs(I->getPath());
-        dirs.eraseComponent();
-        if (dirs.createDirectoryOnDisk(/*create_parents=*/true, ErrMsg))

amatus

IRLZ34N
HEXFET® Power MOSFET

       _____ D
    | |
    | |<-,
G___| |__|__ S

(reverse diode not shown)

amatus

[ problem 1 ]
Given an arbitrary linked list, can you figure out if a loop occurs.  Find
a solution that can be done with O(1) space restriction (constant extra
spaced used).  You have no knowledge about the length of the list.
Write an algorithm that solves the problem.

[ problem 2 ]
Given a string, find the first occurrence of a letter that does not repeat.
For example, in the string "abcdab", the answer is 'c' (not 'd').  Try to
find a solution with O(n) time.