Search Results

Search found 1580 results on 64 pages for 'scheme'.

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

Page 4/64 | < Previous Page | 1 2 3 4 5 6 7 8 9 10 11 12  | Next Page >

  • Color scheme: Smooth Dark

    - by xsl
    As requested by James McNellis I exported my Visual Studio color scheme and posted it here. It is basically the default Visual Studio color scheme with a dark background and slightly modified colors. Visual Studio 2010 Download: http://www.file-upload.net/download-2588083/Smooth-Dark.vssettings.html Installation: Select Tools > Import and Export Settings. Choose Import Selected Environment Settings. Select the file you downloaded. Import only the color settings. Click Finish. Console2 Installation In the file console.xml replace the color element with: <colors> <color id="0" r="23" g="27" b="32"/> <color id="1" r="120" g="150" b="180"/> <color id="2" r="139" g="163" b="137"/> <color id="3" r="119" g="181" b="181"/> <color id="4" r="181" g="122" b="119"/> <color id="5" r="186" g="141" b="183"/> <color id="6" r="168" g="171" b="129"/> <color id="7" r="182" g="182" b="182"/> <color id="8" r="114" g="114" b="114"/> <color id="9" r="120" g="150" b="180"/> <color id="10" r="139" g="163" b="137"/> <color id="11" r="119" g="181" b="181"/> <color id="12" r="181" g="122" b="119"/> <color id="13" r="186" g="141" b="183"/> <color id="14" r="168" g="171" b="129"/> <color id="15" r="255" g="255" b="255"/> </colors>

    Read the article

  • Scheme Homework Assignment

    - by user1704677
    In a course I am taking we recently had to learn the programming language Scheme. I get all of the basics, which is pretty much all that we have gone though. I'm just having trouble learning to think in the different way that Scheme consists of. I was given an assignment and really do not even know how to start. I have sat here for a few hours trying to figure out how to even get started, but I'm kind of stumped. For the record, I'm not asking for the code to solve this problem, but more of some thoughts to get me on the right track. Anyway, here is the gist of the assignment... We are given a list of ten numbers that represent a voter's votes. The numbers are -1, 0 or 1. Then we are given a list of lists of Candidates, with a name and then ten numbers corresponding to that candidate's votes. These numbers are also -1 0 and 1. So for example. '(0 0 0 -1 -1 1 0 1 0 -1) '(Adams 0 1 -1 0 1 1 0 -1 -1 0 0) We are asked to implement a function called best_candidates that will take in a list of numbers (Voter) and a list of lists of Candidates. Then we have to compare the votes of the voter against the list of each candidate and return a list of names with the most common votes. So far, I've come up with a few things. I'm just confused on how I will check the values and retain the name of the voter? I guess I'm still stuck in thinking C/Java and it's making this very tough. Any suggestions to help get me started?

    Read the article

  • Graph representation in Dr Scheme

    - by John Retallack
    I want to represent a graph in Dr. Scheme in the following manner: For each node I want to store it's value and a list of adjacent nodes,the problem which i'm having difficulties with is that I want the adjacent nodes to be stored as references to other nodes. For example: I want node ny to be stored as („NY“ (l p)) where l and p are adjacent nodes,and not as („NY“ („London“ „Paris“)).

    Read the article

  • Cartesian product in Scheme

    - by John Retallack
    I've been trying to do a function that returns the Cartesian Product of n sets,in Dr Scheme,the sets are given as a list of lists,I've been stuck at this all day,I would like a few guidelines as where to start,I've wrote a pice of code but it dosen't work. (define cart-n(?(l) (if (null? l) '(()) (map (?(lst) (cons (car ( car(l))) lst)) (cart-n (cdr l) )))))

    Read the article

  • PLT Scheme sort function

    - by Danny
    PLT Scheme guide says that it's implemented sort function is able to sort a list according to an extarcted value using a lambda function. link text The guide provides an unworking code example of this- (sort '(("aardvark") ("dingo") ("cow") ("bear")) #:key car string<?) Which returns an error. How is this function is supposed to be calles so that it will actually sort a list according to values calculated by a given function?

    Read the article

  • Scheme Editor/IDE for Mac

    - by Carlton Gibson
    I've begun working through Structure and Interpretation of Computer Programs. Dutifully, I've installed mit-scheme. What I need now is an editor/IDE for the Mac that can handle the indentation and balance parentheses (or advice on how to best to configure the packaged tools). Any suggestions? TIA

    Read the article

  • plt-scheme : catching mouse click event on canvas

    - by Thura
    I am writing a tic-tac-toe game in plt-scheme as my AI course project. The idea for gui is a grid with 9 boxes, each with a canvas, using panes ... When the user click on a canvas, 'X' or 'O' will be drawn accordingly ... The question is how can I catch mouse click event on canvas? I found out I need to use on-event, but still don't know how? Any clues?

    Read the article

  • Dark color scheme for Eclipse?

    - by Bartosz Radaczynski
    Is Eclipse at all themeable? I would like to install a dark color scheme for it, since I much prefer white text on dark background than the other way around. Edit: so apparently there is NO easy way to do it. Shame, I really prefer Eclipse to NetBeans, but I cannot stand the white background (and NetBeans does support themes).

    Read the article

  • Continuation (call/cc) in Scheme

    - by darkie15
    Hi All, I need to understand Continuations in Scheme for my upcoming exams and I have no idea about continuations at all. Can anyone please suggest me sources of how to go about learning continuations? Regards, darkie

    Read the article

  • scheme recursive lambda

    - by Mike
    Is there a way to have a recursive lambda expression in scheme without relying an external identifier? I know you can have (define fact (lambda (n) (if (= n 0) 1 (fact (- n 1)))) but it would be nice if fact wasn't hard coded in the lambda expression, it seems improper.

    Read the article

  • Scheme define/lambda shorthand

    - by incrediman
    In Scheme, how can I make use of the define/lambda shorthand for nested lambda expressions within my define? For example given the following procedure... (define add (lambda (num1 num2) (+ num1 num2))) One can shorten it to this: (define (add num1 num2) (+ num1 num2)) However, how can I shorten the following function similarly ? (define makeOperator (lambda (operator) (lambda (num1 num2) (operator num1 num2)))) ;example useage - equivalent to (* 3 4): ((makeOperator *) 3 4)

    Read the article

  • small & readable scheme interpreter in C++ ?

    - by anon
    Anyone know of a good / small scheme interpreter in C++? Perferably something < 2000 LOC, with a simple garbage collectro (either compacting or mark & sweep), no need to support all of R5RS, just basics of if/lambda/set!/cons/car/cdr and some basic operations. Thanks!

    Read the article

  • iOS - Open certain view controller with URL scheme

    - by hansenmd
    I'm playing around with URL schemes in my app. I easily made one to open my app, just adding the necessary items to info.plist. This current URL "myappname://" takes the user to the initial view controller, FirstTableViewController, but I was wondering if it would be possible to modify that URL scheme so it I can have one that takes the user to a certain view controller, such as ThirdTableViewController. I would use this as a handy feature in something like Launch Center.

    Read the article

  • Does approaching SICP in clojure have a high chance of success? [on hold]

    - by ironicaldiction
    I am a third year bachelor student in a software engineering program, and I brought up the idea of reading SICP to an adviser to gain a deeper and more fundamental understanding of the principles behind all this software we engineer. He suggested not to learn scheme to complete the book (because it's not as common as modern dialects of lisp) but to do the exercises in clojure instead. My worry is that completing exercises in clojure instead of scheme will make an already difficult book tortuous. If I do attempt the book's exercises in the more modern clojure, will it be difficult to succeed (for example, because I can't find any real solutions, the syntax they teach for scheme is different, etc.), or do you think approaching the book in clojure could be just as successful as approaching it in scheme? I'm really not knowledgeable enough about either clojure or scheme to make an argument about this, so I wanted to know if I should bring it up or not.

    Read the article

  • Determining your websites color scheme

    - by Steve Hayes
    One of the biggest issues I have, from a UI standpoint, when building a new website is figuring out what colors I will use and of those colors, do they actually work well together. I found this site that has really helped me out and I figured I would share it with all of you and also get some responses back about either sites similar or other ways that you get/figure out your color schemes. Here is the site that I currently use: http://kuler.adobe.com/ With Adobe Kuler, you can chose a base color and it will suggest 5 colors, including your color, that go well with one another. You can, of course, modify the colors it chooses. Also,one of the main features I use, is the image color matching. You can upload an image and it will determine a color scheme based on the colors of the image. So if you have a logo and want to use the colors of the logo, then this works perfectly for you. Thank you and I look forward to your feedback!

    Read the article

  • Scheme early "short circuit return"?

    - by Suan
    I'm trying to find out how I can do an "early return" in a scheme procedure without using a top-level if or cond like construct. (define (win b) (let* ((test (first (first b))) (result (every (lambda (i) (= (list-ref (list-ref b i) i) test)) (enumerate (length b))))) (when (and (not (= test 0)) result) test)) 0) For example, in the code above, I want win to return test if the when condition is met, otherwise return 0. However, what happens is that the procedure will always return 0, regardless of the result of the when condition. The reason I am structuring my code this way is because in this procedure I need to do numerous complex checks (multiple blocks similar to the let* in the example) and putting everything in a big cond would be very unwieldy.

    Read the article

  • What's the point of lambda in scheme?

    - by incrediman
    I am learning scheme. I know how to use both lambda and let expressions. However I'm struggling to figure out what the point is of using lambda. Can't you do everything with let that you can with lambda? It would be especially helpful to see an example of a situation where a lambda expression is a better choice than let. One other thing - are there also situations where let is more useful than lambda? If so such an example would be nice as well. Thanks!

    Read the article

  • Scheme procedure problem

    - by Zun
    I defined the Scheme procedure to return another procedure with 2 parameters : (define (smooth f) (?(x dx)(/ (+ (f (- x dx)) (f x) (f (+ x dx))) 3.0))) if i run this procedure with sin procedure with 2 arguments 10 and 0.0001 then it is ok ((smooth sin) 10 0.0001) ==> -0.544021109075966 if i run this procedure recursively, then it has error ((smooth (smooth sin)) 10 0.0001) ==> procedure expects 2 arguments, given 1: #<promise:temp6> So can anyone tell me where is my problem? Thank you in advance !!! PS:this is apart of exercise 1.44 in SICP

    Read the article

  • Scheme open source projects?

    - by Ben
    Hi I'm learning scheme and was wondering if there are any active open-source projects I might be able to get involved in? I'm nearing the end of SICP and although this has good complex examples no textbook code compares to real-world applications. eg testing code / benchmarking / revision control styles / sheer size and scope etc. Hence my curiousity at seeing a project in the wild. I tried searching google code but only found projects that are interpreters that implement RSR5/6. Perhaps there are not many projects out there and I should consider scala?! Advice or even pointers to specific projects appreciated.

    Read the article

  • trying to make a scheme procedure

    - by asfejaeofijfe
    trying to make a scheme procedure called make-odd-mapper! its supposed to be a procedure that takes one input, a procedure, and produces a procedure as an output ex: (define i4 (mlist 10 2 30 4)) (i4) {10 2 30 4} ((make-odd-mapper! add-one) i4) i4 {11 2 31 4} I know the problem needs to mutate the input list and that set-mcar! and void are apart of it......could anyone give me some reasonable lines of code to solve this? It would be useful in case anyone was wondering about mutation.....and using it to create a procedure that makes a procedure as its output....

    Read the article

  • Problems making an accurate Visual Studio scheme for Vim (vim scheme specialist needed) .

    - by janoChen
    I'm trying to make an accurate Visual Studio scheme. I set hi function to blood color (#9A1102) for the "CSS function" (selector). But now the brackets with properties (id, class) in html elements also have blood color: (ironically the same color here in Stackoverflow). But I want them blue (#2902FC) e.g.: <div class="first"> <div id="nopic"> Sample of code: " Syntax highlighting hi Comment guifg=#777777 gui=none hi Todo guifg=#8f8f8f gui=none hi Constant guifg=#e5786d gui=none hi String guifg=#2902FC gui=none hi Identifier guifg=#2902FC gui=none hi Function guifg=#9A1102 gui=none hi Type guifg=#EF2811 gui=none hi Statement guifg=#9A1102 gui=none hi Keyword guifg=#9A1102 gui=none hi PreProc guifg=#2902FC gui=none hi Number guifg=#2902FC gui=none hi Special guifg=#2902FC gui=none " Bottom hi Question guifg=white gui=none hi Question ctermfg=white term=none hi ModeMsg guifg=white gui=none

    Read the article

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

< Previous Page | 1 2 3 4 5 6 7 8 9 10 11 12  | Next Page >