Search Results

Search found 1215 results on 49 pages for 'recursive acronym'.

Page 27/49 | < Previous Page | 23 24 25 26 27 28 29 30 31 32 33 34  | Next Page >

• Scaling an iterative, bitwise algorithm to solve the Towers of Hanoi using X discs and Y towers

  - by Robb

  I like the algorithm mentioned in this question: "How does this work? Weird Towers of Hanoi Solution" http://stackoverflow.com/questions/2209860/how-does-this-work-weird-towers-of-hanoi-solution Is there any way to scale that non-recursive solution of Towers of Hanoi to use X disks and Y towers, with towers represented as stacks?

  Read the article

• c# parameters question

  - by n00b

  I am new to c# and need help understanding what going on in the following function public bool parse(String s) { table.Clear(); return parse(s, table, null); } where table is a Dictionary. I can see that is is recursive but how is parse being passed three params when it is defined to take just a string?

  Read the article

• Finding the maximum weight subsequence of an array of positive integers?

  - by BeeBand

  I'm tring to find the maximum weight subsequence of an array of positive integers - the catch is that no adjacent members are allowed in the final subsequence. The exact same question was asked here, and a recursive solution was given by MarkusQ. He provides an explanation, but can anyone help me understand how he has expanded the function? How does this solution take into consideration non-adjacent members?

  Read the article

• k-combinations of a set of integers in ascending size order

  - by Adamski

  Programming challenge: Given a set of integers [1, 2, 3, 4, 5] I would like to generate all possible k-combinations in ascending size order in Java; e.g. [1], [2], [3], [4], [5], [1, 2], [1, 3] ... [1, 2, 3, 4, 5] It is fairly easy to produce a recursive solution that generates all combinations and then sort them afterwards but I imagine there's a more efficient way that removes the need for the additional sort.

  Read the article

• Nested routing in Ruby on Rails

  - by vooD

  My model class is: class Category < ActiveRecord::Base acts_as_nested_set has_many :children, :foreign_key => "parent_id", :class_name => 'Category' belongs_to :parent, :foreign_key => "parent_id", :class_name => 'Category' end def to_param slug end Is it possible to have such recursive route like this: /root_category_slug/child_category_slug/child_of_a_child_category_slug ... and so one Thank you for any help :)

  Read the article

• Google image Swirl - interactive information visualization

  - by skyde

  I have seen this image swirl effect on a visual thesaurus. Is there any open source code for this? Or research paper explaining how they made it. I don't care about the algorithm to match similar objects. I only am wondering about the effects. From what i understand they are called recursive orbital diagram. Screenshot: google Wonder Wheel google image swirl

  Read the article

• Hibernate cascade debug options

  - by Chris

  I have run into various StackOverflowErrors which occur during cascading. These have been extremely time consuming in debugging because I don't know which properties are being cascaded to cause this recursive behavior. Does anyone know of a log setting or some other form of debugging which could tell me specifically what properties are being cascaded?

  Read the article

• lexer skips a token

  - by Eugene Strizhok

  I am trying to do basic ANTLR-based scanning. I have a problem with a lexer not matching wanted tokens. lexer grammar DefaultLexer; ALPHANUM : (LETTER | DIGIT)+; ACRONYM : LETTER '.' (LETTER '.')+; HOST : ALPHANUM (('.' | '-') ALPHANUM)+; fragment LETTER : UNICODE_CLASS_LL | UNICODE_CLASS_LM | UNICODE_CLASS_LO | UNICODE_CLASS_LT | UNICODE_CLASS_LU; fragment DIGIT : UNICODE_CLASS_ND | UNICODE_CLASS_NL; For the grammar above, hello. world string given as an input results in world only. Whereas I would expect to get both hello and world. What am I missing? Thanks.

  Read the article

• T-SQL Hierarchy to duplicate Dependent Objects tree view in SQL Server 2005

  - by drewg

  Hi Id like to map the calling stack from one master stored procedure through its hundreds of siblings. i can see it in the dialog, but cannot copy or print it, but couldnt trap anythiing worthwhile in proflier. do you know what sproc fills that treeview? i must be a recursive CTE that reads syscomments or information_schema.routines, but its beyond my chops, though i can imagine it thanks in advance drew

  Read the article

• Are there any example of Mutual recursion?

  - by Yassir

  Are there any example for a recursive function that call an other one which calls the first one too ? example function1() { //do something f2(); //do something } function2() { //do something f1(); //do something }

  Read the article

• python: a way to get an exhaustive, sorted list of keys in a nested dictionary?

  - by saidimu

  exhaustive: - all keys in the dictionary, even if the keys are in a nested dictionary that is a value to a previous-level dictionary key. sorted: - this is to ensure the keys are always returned in the same order The nesting is arbitrarily deep. A non-recursive algorithm is preferred. level1 = { 'a' : 'aaaa', 'level2_1' : {'b': 'bbbbb', 'level3': {'c': 'cccc', 'd': 'dddddd'} }, 'level2_2' : { 'z': 'zzzzzzz' } }

  Read the article

• Which is the best algorithm to "Estimate and Visulize 2d skeleton using Opencv" from the drawn conto

  - by kumar

  Which is the best algorithm to "Estimate and Visulize 2d skeleton using Opencv" from the drawn contour Is the Recursive Centroid algorithm the Best? any reference links or docs please provide

  Read the article

• How do polymorphic inline caches work with mutable types?

  - by kingkilr

  A polymorphic inline cache works by caching the actual method by the type of the object, in order to avoid the expensive lookup procedures (usually a hashtable lookup). How does one handle the type comparison if the type objects are mutable (i.e. the method might be monkey patched into something different at run time). The one idea I've come up with would be a "class counter" that gets incremented each time a method is adjusted, however this seems like it would be exceptionally expensive in a heavily monkey patched environ since it would kill all the PICs for that class, even if the methods for them weren't altered. I'm sure there must be a good solution to this, as this issue is directly applicable to Javascript and AFAIK all 3 of the big JS VMs have PICs (wow acronym ahoy).

  Read the article

• recursively add file extension to all files

  - by seengee

  I have a few directories and sub-directories containing files with no file extension. I want to add .jpg to all the files contained within these directories. I have seen bash scripts for changing the file extension but not for just adding one. It also needs to be recursive, can someone help please?

  Read the article

• given a list of up to 10 integer numbers and a sum, will display a subset of the numbers whose total

  - by Felix

  Write a program which, given a list of up to 10 integer numbers and a sum, will display a subset of the numbers whose total is that sum if one exists or indicate that none exists otherwise. For example, for the list: 5,13,24,9,3,3 and sum = 28, your program should display 13, 9, 3, 3. How to do this in C++ using a recursive function?

  Read the article

• Does anyone actually use the phrase DHTML anymore?

  - by lafoaug

  I'm not sure if this is exactly appropriate but I have what I think is a interesting question. Does anyone actually use the phrase DHTML anymore in a professional environment? I came across the the word the other day for the first time in years and shuddered at the thought of it. To me the acronym Dynamic HTML just sounds so 1999, it brings me back to the days when I first discovered programming and web development and thought it was awesome to have scripts which modified the status bar and made things fly around the page. I for one have never used the phrase recently and would never dream of saying it in a professional environment to clients or colleges as I feel there is an amateur and dated stigma attached to it. What are your thoughts?

  Read the article

• How do I compare two complex data structures?

  - by Phil H

  I have some nested datastructures, each something like: [ ('foo', [ {'a':1, 'b':2}, {'a':3.3, 'b':7} ]), ('bar', [ {'a':4, 'd':'efg', 'e':False} ]) ] I need to compare these structures, to see if there are any differences. Short of writing a function to explicitly walk the structure, is there an existing library or method of doing this kind of recursive comparison?

  Read the article

• Python recursion with list returns None

  - by newman

  def foo(a): a.append(1) if len(a) > 10: print a return a else: foo(a) Why this recursive function returns None (see transcript below)? I can't quite understand what I am doing wrong. In [263]: x = [] In [264]: y = foo(x) [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] In [265]: print y None

  Read the article

• Copying only the changed files while mirroring a website

  - by Rishi Verma

  I am using wget to mirror website using this code $ wget \ --recursive \ --no-clobber \ --page-requisites \ --html-extension \ --convert-links \ --restrict-file-names=windows \ --domains website.org \ --no-parent \ www.website.org/tutorials/html/ The next time I run it it starts downloading the same files again, however I want only the changed files to be downloaded next time. I am open to use any other tool or script(preferably PHP,Curl) apart from using wget.

  Read the article

• Is this grammar SLR?

  - by Mike

  E - A | B A - a | c B - b | c My answer is no because it has a reduce/reduce conflict, can anyone else verify this? Also I gained my answer through constructing the transition diagram, is there a simpler way of finding this out? Thanks for the help! P.S Would a Recursive Descent be able to parse this?

  Read the article

• Java, Hibernate annotations, How to add methods to POJO object?

  - by RussianBear

  I am using hibernate annotations. How to add methods to POJO object? For example i have "getChildNodes" method, associated with database, but i want also add recursive method "getAllChildNodes". I get "org.hibernate.PropertyNotFoundException: Could not find a setter for property progress in class" exception when i do it.

  Read the article

• Sorting a 2 dimensional array on multiple columns

  - by Anon

  I need to sort a 2 dimensional array of doubles on multiple columns using either C or C++. Could someone point me to the algorithm that I should use or an existing library (perhaps boost?) that has this functionality? I have a feeling that writing a recursive function may be the way to go but I am too lazy to write out the algorithm or implement it myself if it has been done elsewhere. :-) Thanks

  Read the article

• Web site backup in PHP?

  - by Pekka

  Does anybody know a clean PHP-based solution that can backup remote web sites using FTP? Must haves: Recursive FTP backups Possible to run through a cron job Easy to configure (easy adding of multiple sites) Local storage of backup files is sufficient Would be nice: Backed up sites are stored as zip files A nice interface to manage things Provides notification when backup has succeeded or failed Does incremental backups Does MySQL Database backups I need this to be PHP (or Perl) based because it's going to be used on shared hosting packages that do not allow usage of the standard GNU/Linux tools available.

  Read the article

• What is doFilter doing in doFilter method in filters of java?

  - by giri

  I wanna know that in our dofilter method i made this call chain.doFilter. What is doFilter doing inside a doFilter?Is it not gonna get recursive call?

  Read the article

• mathing string in python

  - by nani

  Write two functions, called countSubStringMatch and countSubStringMatchRecursive that take two arguments, a key string and a target string. These functions iteratively and recursively count the number of instances of the key in the target string. You should complete definitions forthe remaining problems, we are going to explore other substring matching ideas. These problems can be solved with either an iterative function or a recursive one. You are welcome to use either approach, though you may find iterative approaches more intuitive in these cases of matching linear structures

  Read the article

< Previous Page | 23 24 25 26 27 28 29 30 31 32 33 34  | Next Page >