Search This Blog

Sunday, July 19, 2015

Responsive Design

Responsive Design

Ruby and Smalltalk

Is rails going to survive with this kind of thinking. Can't the community learn from other people mistakes. Uncle Bob "Acceptance of solving the dirty problems, solving the problems of the horrible schema, we need to solve the problems to survive, we gotta sit down and deal with that otherwise someone else is going to solve the problem, remember the fate of the powerful and influential language of the 70 and 80, the fate of that language was near oblivion and the people who used it and loved it on that language had to work on Java and that nearly killed them. We have a great tool in this language, we can kill by making a mess, we can kill it by being arrogant about it,we can kill it by not dealing with the enterprise." Uncle Bob @RailsConf 2009. DHH "I am not worried about the enterprise I want to help the little guy" DHH @Railsconf 2015

Saturday, July 18, 2015

The Worst Programming Language

What lessons can be learn from languages pitfalls

http://www.infoq.com/presentations/worst-programming-language

We Will All Be Game Programmers by Hunter Loftis



Kent Beck Ease at Work

I am still astonished by this talk


Functional Javascript

I really love this aspect of javascript.

Links

Uncle Bob professionalism


Programming is terrible by Thomas Figg


UI Algorithms


Upgrading the web by Douglas Crockford


The Better Parts by Douglas Crockford


Douglas Crockford - The Better Parts from NDC Conferences on Vimeo.

Uncle Bob on Software Architecture


Quicksort

I was a little bit bore this saturday morning so, I implemented a surely flawed version of quicksort
function eq(x){
  return function(item){
    return item === x;
  };
}
function gt(x){
  return function(item){
    return item > x;
  };
}

function lt(x){
  return function (item){
    return item < x;
  };
}

function filter(array, filter){
  return array.filter(filter);
}

function quicksort(array){
  if(array.length === 0) return [];
  if(array.length === 1) return array;

  var index    = Math.ceil(array.length / 2.0);
  var value    = array[index];

  var values = filter(array, eq(value));
  var left   = filter(array, lt(value));
  var right  = filter(array, gt(value));
  return quicksort(left)
    .concat(values)
    .concat(quicksort(right));
}

Not Just Code Monkeys


Software Design XXI Century


Sandi Metz teaches OO


Uncle Bob Interview


Impossible Programs

Never thought at this level of abstraction I loved this talk: