Topic: -={ Challenge }=- Subst at n

[Lee Mac]

Some more fun 

Code: [Select]

(defun Subst_at_n (item lst n / Sub)

  (defun Sub (a b c)
    (if b
      (cons
        (if (zerop c)
          (progn
            (defun Sub (a b c)
              (if b
                (cons (car b)
                      (Sub a (cdr b) c))))
            a)
          (car b))
        (Sub a (cdr b) (1- c)))
      (car b)))

  (Sub item lst n))


[wizman]

Some more fun 

Code: [Select]

(defun Subst_at_n (item lst n / Sub)

  (defun Sub (a b c)
    (if b
      (cons
        (if (zerop c)
          (progn
            (defun Sub (a b c)
              (if b
                (cons (car b)
                      (Sub a (cdr b) c))))
            a)
          (car b))
        (Sub a (cdr b) (1- c)))
      (car b)))

  (Sub item lst n))


Nice one Lee.  Just throwing this one for the record:
(acet-list-put-nth a lst n)

[JohnK]

I dont understand this one at all.
http://www.theswamp.org/index.php?topic=32800.msg382733#msg382733

It's like its written in a different language.

[Lee Mac]

Nice one Lee.  Just throwing this one for the record:
(acet-list-put-nth a lst n)

Thanks Wiz, does documentation exist for the acet-* functions, I know there is a few listed over at AfraLISP, but is there a full list anywhere?

[Lee Mac]

I dont understand this one at all.
http://www.theswamp.org/index.php?topic=32800.msg382733#msg382733

It's like its written in a different language.

Its the one above it written as anonymous functions... or 'obfuscated' as Michael would say 

[wizman]

I haven't seen one Lee, i just do a search at vlide's appropos, then figure out the arguments. 

[LE3]

In any of these challenges, do we've known who or which of the proposals has won? or do we just end up uploading all the possible options, for future reference? and decide which one is the best to fit the current needs, can we or who will judge them? or can we simple open a topic to place/write a function to do some specific task? and this can end being like a library reference - it is challenge the proper wording?

And yes I like these type of topics.

Sorry folks, got to ask, hope you won't mind, thanks.

 

[Lee Mac]

I like to see the ingenious/interesting approaches to the problem, and really enjoy these kind of topics also 

[MP]

In any of these challenges, do we've known who or which of the proposals has won? or do we just end up uploading all the possible options, for future reference? and decide which one is the best to fit the current needs, can we or who will judge them? or can we simple open a topic to place/write a function to do some specific task? and this can end being like a library reference - it is challenge the proper wording?

And yes I like these type of topics.

Sorry folks, got to ask, hope you won't mind, thanks.

The winner is the body of knowledge that the swamp represents. I'm not interested in anything else, in particular nonsense like "Person A's submission is better than Person B's". That's the fastest way to have people stop posting their ideas or deleting posts when "better" solutions are posted. Sometimes we bench performance, and that's cool, because performance itself is only one of many things that constitutes a good algorithm. </opinion>

[Lee Mac]

In any of these challenges, do we've known who or which of the proposals has won? or do we just end up uploading all the possible options, for future reference? and decide which one is the best to fit the current needs, can we or who will judge them? or can we simple open a topic to place/write a function to do some specific task? and this can end being like a library reference - it is challenge the proper wording?

And yes I like these type of topics.

Sorry folks, got to ask, hope you won't mind, thanks.

The winner is the body of knowledge that the swamp represents. I'm not interested in anything else, in particular nonsense like "Person A's submission is better than Person B's". That's the fastest way to have people stop posting their ideas or deleting posts when "better" solutions are posted. Sometimes we bench performance, and that's cool, because performance itself is only one of many things that constitutes a good algorithm. </opinion>

I couldn't have put it better, completely agree.

[JohnK]

Challenges are all about learning in my opinion -i.e. "We are supposed to teach each other not beat each other". (c) Se7en inc.

I think LE3 is on to something though (each user should pick and choose the solution best to fit their need(s)). ...we need to add more comments and be maybe be more academic about our solutions.

[JohnK]

Code: [Select]

#include "stdafx.h"
#include <array>
#include <iostream>

using namespace std;
using namespace std::tr1;

int _tmain(int argc, _TCHAR* argv[])
{
  array<int,9> ints = {1,2,3,4,5,6,7,8,9};
  ints[2] = 9;
  for_each(ints.begin(), ints.end(), [](int n) { cout << n << " "; });
  cout << endl;
  system("pause");
  return 0;
}


I cant compile this: where/what is "stdafx.h"? I dont got that one.

[MP]

I cant compile this: where/what is "stdafx.h"? I dont got that one.

Compile it with visual c++ instead of gnu/gcc.

Subtitle: stdafx.h is a visual c++ centric pre-compiled header.

/guess

[JohnK]

awe visual studio?! ...nope, never mind, not worth it.

[MP]

It was a parody / lampoon post anyway, direct element access is fundamental to arrays in C, C++, VB, Python ...