Hi, Here is my XML file : <?xml version="1.0" encoding="utf-8"?> <root> <category> <name>Category</name> <desc>Category</desc> <category> <name>Subcategory</name> <desc>Sub-category</desc> <category> <name>Subcategory</name> <des...
Hi, I have a 4-core processor and have a recursive Matlab function which makes four recursive calls: function J = do_stuff(I) if some_condition(I) J = blah_blah(I); else [I1,I2,I3,I4] = split4(I); J1 = do_stuff(I1); J2 = do_stuff(I2); J3 = do_stuff(I3); J4 = do_stuff(I4); J = join4(J1,J2,J3,J4); end Is t...
var = 8 itr 1: var == 8 (8 * 1) itr 2: var == 24 (8 * 3) itr 3: var == 48 (8 * 6) itr 4: var == 80 (8 * 10) itr 5: var == 120 (8 * 15) Pattern: (var * (last multiplier + current iteration)) Basically I want to get the result of formula(itr) without having to iterate up to itr. ...
There's a similar post @ http://stackoverflow.com/questions/5071/how-to-add-cvs-directories-recursively However, trying out some of the answers such as: find . -type f -print0| xargs -0 cvs add Gave: cvs add: cannot open CVS/Entries for reading: No such file or directory cvs [add aborted]: no repository And find . \! -name...
I believe the word is "recurse" instead of 'start over.' I've created this program to hone my multiplication skills in the morning. I can get it to give me a multiplication problem, but how do I get it to ask me another one? from random import randint print 'Good Morning Pete!' X = randint(0, 10) Y = randint(0, 10) A = X * Y Z = ...
I would like to know if there is anyway I can do this without having to do the same If loop in each of the Switch cases since it's a bit repetitive. switch ($val) { case 1: if(!$object->doSomething1()==$goodValue) row .= $object->doSomething(); break; case 2: if(!$object->doSomething2()==$goodValue) row ...
Hi, I saw the following post order traversal algorithm in some website... it seems to be correct. I just want to verify that this algorithm works correctly — is this algorithm correct for post order traversal without recursion? void postOrderTraversal(Tree *root) { node * previous = null; node * s = null; push(root); w...
I have the following recursive table-valued function in MS SQL, in order to retrieve a hierarchy of objects from the database: WITH tmpField (ParentNum, ChildNum, FieldNum, FieldDescr, Iteration) AS ( SELECT Field.ParentNum, Field.ChildNum, Field.FieldNum, Field.FieldDescr, 1 FROM Field WHERE Field.ParentNum = @ParentNum UNION...
I know I can loop through each level of the object, but I would like a more simple approach to this. QueryResult Object ( [queryLocator] => [done] => 1 [records] => Array ( [0] => SObject Object ( [type] => type_1 [fields] => [s...
What is the fastest way in R to compute a recursive sequence defined as x[1] <- x1 x[n] <- f(x[n-1]) I am assuming that the vector x of proper length is preallocated. Is there a smarter way than just looping? Variant: extend this to vectors: x[,1] <- x1 x[,n] <- f(x[,n-1]) ...
I'm trying to create a recursive method that moves throw a NSMutableArray, something is happening that the code stays inside the loop or makes it only once. Here is my code: - (NSMutableArray* )solve:(NSMutableArray* )temp{ //just a counter int count =0; int index =0; if (count==0) { //Calculates the diffe...
Hi, Just to get it straight in my head. Consider this example bit of Erlang code: test() -> receive {From, whatever} -> %% do something test(); {From, somethingelse} -> %% do something else test(); end. Isn't the test() call, just a goto? I ask ...
Hi, I've a Perl subroutine which asks input from User. I perform a check inside that subroutine itself whether the input entered is a valid input. If it's not, I want to call the subroutine again to let the user enter a valid input this time. My subroutine is as follows: sub some_routine { print "Enter a number to select (1...
Hi I'm trying to unittest several MVP implementations and can't quite figure out the best way to mock the view. I'll try to boil it down. The view IView consists e.g. of a property of type IControl. interface IView { IControl Control1 { get; } IControl Control2 { get; } } interface IControl { bool Enabled { get; set; } ...
I have the following homework assignment: I need to create a program that recursively tests in a word or phrase is a palindrome. Here is the prompt: A palindrome is "a word, line, verse, number, sentence, etc., reading the same backward as forward, as Madam, I'm Adam or Poor Dan is in a droop." (dictionary.com) When evaluating palin...
I have a recursive method that is return me categories, and checking for its sub categories. So it looks like: public List<Category> GetAllChildCats(int categoryid) { List<Category> list = new List>Category>(); Category c = Get(categoryid); foreach(Category cat in c.ChildCategories) { list.Add( G...
Lets assume the following function: private void ParseFolder(string strFolder) { foreach (string currentFolder in Directory.GetDirectories(strFolder)) ParseFolder(strFolder); } Now we start our recursive loop with: ParseFolder("C:\"); Is there a way to be notified when this recusrive loop ends (= all directories have been p...
Here is a template I call to generate a menu, and it kinda breaks. Using Xalan, I get heap size error, so my guess would be that something in it is horribly broken and unholy. I preset the template for the current portion of the website tree, feeding it the path from the root of the site, the language, the current depht (p-i), and a fil...
In the chapter about function in the Oz tutorial, it says that: similar to lazy functional languages Oz allows certain forms of tail-recursion optimizations that are not found in certain strict functional languages including Standard ML, Scheme, and the concurrent functional language Erlang. However, standard function d...
Learning about recursion and having trouble with the code posted below, in line 6, int result=fact(n-1)*n; When I delete "fact" the program acts like I think it would, printing out: Factor of 3 6 Factor of 4 12 Factor of 5 20 but with the "fact" in it gives the output below? What is this line doing, and what is "fact" ? thanks ev...