I want to refine the raw text by using regular expression, given a list of (patten,replacement) tuple.
I need a ruby hash H with keys :a, :b, :c so that H[:b] = H[:a] + 1; H[:c] = H[:b] + 2 etc. How can I define such a hash in a one line declaration, like H = {:a=>1, :b => H[:a] + 1, :c => H[:b] +2, .
I have a List of objects of type IGroup. These can be nested to an umlimited level, and I\'m trying to group them after retrieving them from a database. I can\'t get my head around how to recursively
How to compute the output for the recursive functions ? I know recursion invokes a stack, but am confusing while so开发者_StackOverflow社区lving some aptitude question.
I have a binary tree that I need to search through. I\'m not searching for one specific node of the tree, but rather over every node of the tree to gain information about them. I have a simple recursi
i want to make message view show all other messages that led up to that message. the original message will not have a response_to value and should terminate the recursion. is there a better way to do
I\'m writing a compiler for a small language, and my Parser class is currently in charge of building an AST for use later. However, recursive expressions are not working correctly because the vector i
I need compare file开发者_运维百科 names with user input and have to display the files that are matching. I am using a recursive function for that.I stored the matched files in a list.But I got proble
I want to use a function to recursively scan a folder, and assign the contents of each scan to an array.
I am in the process of refreshing my XST knowledge, and have decided to have a go at making an XSLT 1.0 stylesheet that convert the XMLHelp files from the C# compiler into a better formatted form.
加载中,请稍侯......