はてなブックマーク

Diff takes two texts and finds the differences. This implementation works on a character by character basis. The result of any diff may contain 'chaff', irrelevant small commonalities which complicate the output. A post-diff cleanup algorithm factors out these trivial commonalities. Text Version 1:I am the very model of a modern Major-General, I've information vegetable, animal, and mineral, I kno

27 July 2009 [Sorry, this is a technical post. Non-programmers should probably skip this and listen to some nice accordion music instead.] Occasionally one has to defeat the same-origin policy and exchange data from a 3rd party server. The least ugly hack is the badly named JSONP technique. Basically you create a script tag, append it to head, then it will fetch a remote JavaScript file and execut

by Neil Fraser, April 2006 Computing the differences between two sequences is at the core of many applications. Below is a simple example of the difference between two texts: Text 1: Apples are a fruit. Text 2: Bananas are also fruit. Diff:   AppleBananas are also fruit. This paper surveys the literature on difference algorithms, compares them, and describes several techniques for improving the us

MobWrite This project is now located on Google Code. Developer only: Daemon: Local Demos Remote Demos Unit Tests AppEngine: Local Demos Remote Demos Unit Tests Last modified: 3 March 2009