Gap Buffer in C edit

I've implemented a gap buffer in C and made it available under an MIT-style license. I would add a link to it in this article, but felt that would be presumptuous. If someone else familiar with this algorithm feels that it is worth adding, it is available here: http://hansvanslooten.com/projects/gapbuffer.html --Hans (talk) 01:09, 25 June 2009 (UTC)Reply

comments edit

There are copyright violations in the content. Its a page on gap buffer and has no scope for implmenetation of it in emacs and the function in it. You can just mention that emacs uses it. Add diagrams, add sample C code. The lead has become too big, much of its content can be moved to sections. 80% of the current content is copy paste - remove it immediately! abhijit13(talk) 09:48, 15 September 2011 (UTC)Reply

I like how the Example is rendered in plain language and diagrams! Now, can someone provide an example of how this kind of buffer is actually implemented, either in pseudo-code or real code? Thanks!OlyDLG (talk) 00:13, 23 November 2015 (UTC)Reply

Copyright problem removed edit

Prior content in this article duplicated one or more previously published sources. The material was copied from: http://common-lisp.net/project/flexichain/download/StrandhVilleneuveMoore.pdf. Infringing material has been rewritten or removed and must not be restored, unless it is duly released under a compatible license. (For more information, please see "using copyrighted works from others" if you are not the copyright holder of this material, or "donating copyrighted materials" if you are.) For legal reasons, we cannot accept copyrighted text or images borrowed from other web sites or published material; such additions will be deleted. Contributors may use copyrighted publications as a source of information, but not as a source of sentences or phrases. Accordingly, the material may be rewritten, but only if it does not infringe on the copyright of the original or plagiarize from that source. Please see our guideline on non-free text for how to properly implement limited quotations of copyrighted text. Wikipedia takes copyright violations very seriously, and persistent violators will be blocked from editing. While we appreciate contributions, we must require all contributors to understand and comply with these policies. Thank you. MER-C 07:20, 2 December 2011 (UTC)Reply

Broken link edit

The link for [2] is broken. — Preceding unsigned comment added by 198.45.18.20 (talk) 19:56, 11 July 2014 (UTC)Reply

External links modified edit

Hello fellow Wikipedians,

I have just modified one external link on Gap buffer. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 18 January 2022).

  • If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
  • If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—InternetArchiveBot (Report bug) 21:50, 7 January 2017 (UTC)Reply

India Education Program course assignment edit

  This article was the subject of an educational assignment supported by Wikipedia Ambassadors through the India Education Program.

The above message was substituted from {{IEP assignment}} by PrimeBOT (talk) on 20:11, 1 February 2023 (UTC)Reply