Search Results

Search found 1233 results on 50 pages for 'recursive repl'.

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

• 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

• 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

• 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

• 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

• 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

• Managing log4j.properties with lein

  - by erikcw

  I'm trying to figure out how I can manage my log4j.properties file with leiningen. I'd like to be able to automatically include the file in the jars that lein creates as well as have the properties file be accessible to "lein swank" (and lein repl). Right now I have the file in my project "root", but I get this error when I using logging from swank [null] log4j:WARN No appenders could be found for logger (com.dev). [null] log4j:WARN Please initialize the log4j system properly. Thanks!

  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

• 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

• Help using Lisp debugger

  - by Joel

  I'm trying understand how to interpret the output of, and use, the Lisp debugger. I've got a pretty simple Backtrace for the evaluation of my function, but I cann't seem to work out how to use it to find out in which Lisp 'form' in my function the exception occurred. I'd appreciate any clues as to what I should be doing, to find the source of the error. I've attached a screen shot (if it's too small to read I can re-post it in parts), with the debug output, the function and the repl (please ignore my very wrong function, I'm just interested in learning how to use the debugger properly). In addition, I hit 'v' on the first frame to go to the source, but this resulted in the error at the bottom of the screen.

  Read the article

• Simple Scala syntax - trying to define "==" operator - what am I missing?

  - by Alex R

  While experimenting with some stuff on the REPL, I got to a point where I needed something like this: scala class A(x:Int) { println(x); def ==(a:A) : Boolean = { this.x == a.x; } } Just a simple class with an "==" operator. Why doesn't it work??? Here's the result: :10: error: type mismatch; found : A required: ?{val x: ?} Note that implicit conversions are not applicable because they are ambiguous: both method any2ArrowAssoc in object Predef of type [A](x: A)ArrowAssoc[A] and method any2Ensuring in object Predef of type [A](x: A)Ensuring[A] are possible conversion functions from A to ?{val x: ?} class A(x:Int) { println(x); def ==(a:A) : Boolean = { this.x == a.x; } } ^ This is scala 2.8 RC1. Thanks

  Read the article

• why can't I call .update on a MessageDigest instance

  - by Arthur Ulfeldt

  when i run this from the repl: (def md (MessageDigest/getInstance "SHA-1")) (. md update (into-array [(byte 1) (byte 2) (byte 3)])) I get: No matching method found: update for class java.security.MessageDigest$Delegate the Java 6 docs for MessageDigest show: update(byte[] input) Updates the digest using the specified array of bytes. and the class of (class (into-array [(byte 1) (byte 2) (byte 3)])) is [Ljava.lang.Byte; Am I missing something in the definition of update? Not creating the class I think I am? Not passing it the type I think I am?

  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

• How do I set up the Clojure classpath in Emacs after installing with ELPA?

  - by derefed

  I'm trying to add paths to my classpath in the Clojure REPL that I've set up in Emacs using ELPA. Apparently, this isn't the $CLASSPATH environment variable, but rather the swank-clojure-classpath variable that Swank sets up. Because I used ELPA to install Swank, Clojure, etc., there are a ton of .el files that take care of everything instead of my .emacs file. Unfortunately, I can't figure out how to change the classpath now. I've tried using (setq 'swank-clojure-extra-classpaths (list ...)) both before and after the ELPA stuff in my .emacs, and I've tried adding paths directly to swank-clojure-classpath in .emacs, .emacs.d/init.el, and .emacs.d/user/user.el, but nothing works. What I'm ultimately trying to do is to add both the current directory "." and the directory in which I keep my Clojure programs. I'm assuming swank-clojure-classpath is the thing I need to set here. Thanks for your help.

  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

• Linked list Recursion ...

  - by epsilon_G

  hey , I'd like to make a recursive function using C++ I make this class class linklist { private: struct node { int data; node *link; }*p; void linklist::print_num(node* p) { if (p != NULL) { cout << p->data << " "; print_num (p->link); } } in the main program what should I write ...

  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

• Flatten a java project directory structure prepending the path to the file.

  - by Fork

  Hi there, I am trying to write a script (preferably in bash) to flatten a java projet directory structure prepending the path to the file. Example: | src | org | apache | file2.java | file1.java would result in: | src | org|apache|file2.java | org|file1.java The script should be recursive since the directory could have many subfolders.

  Read the article

• XSLT for-each loop for element collection

  - by brain_pusher

  Is it possible to make a for-each loop in XSLT not for a node set, but for my own collection of elements? For example, I split some string and have a string collection as a result. And I need to create a node for each item in the collection. I know that issue can be solved with a recursive template, but I want to know if it is possible to avoid a recursion.

  Read the article

• LINQ to SQL .Count takes way to much process time and decreases performances.

  - by soldieraman

  LINQ to SQL .Count takes way to much process time and decreases performances. I am doing a recursive loop and for one child (lets call it parent) I have to check the number of children under it to make a decision if it should be included or not. The Count is too slow 8 ms :( for 120 parent records. Any ideas to make it quicker.

  Read the article

• Why is this Scala example of implicit paremeter not working?

  - by Alex R

  simple REPL test... def g(a:Int)(implicit b:Int) = {a+b} Why do neither of these attempted usages work? 1. scala class A { var b:Int =8; var c = g(2) } :6: error: could not find implicit value for parameter b: Int class A { var b:Int =8; var c = g(2) } 2. scala class A(var b:Int) { var c = g(2) } :6: error: could not find implicit value for parameter b: Int class A(var b:Int) { var c = g(2) } ^ Thanks

  Read the article

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