Mercurial > traipse
annotate upmana/mercurial/mpatch.py @ 35:ee890f424e16 ornery-orc
Traipse 'OpenRPG' {100505-00}
Traipse is a distribution of OpenRPG that is designed to be easy to setup and go. Traipse also makes it easy for
developers to work on code without fear of sacrifice. 'Ornery-Orc' continues the trend of 'Grumpy' and adds fixes to
the code. 'Ornery-Orc's main goal is to offer more advanced features and enhance the productivity of the user.
Update Summary (Patch-2)
http://traipse.assembla.com/wiki/show/traipse/Patch-2
New Features:
New Namespace method with two new syntaxes
New Namespace Internal is context sensitive, always!
New Namespace External is 'as narrow as you make it'
New Namespace FutureCheck helps ensure you don't receive an incorrect node
New Namespace 2.0 documentation in the User Manual
New Namespace plugin, Allows Traipse users to use the Standard syntax !@ :: @!
New Mini Library with minis from Devin Knight
New PluginDB access for URL2Link plugin
New to Forms, they now show their content in Design Mode
New to Update Manager, checks Repo for updates on software start
New to Mini Lib node, change title in design mode
New to Game Tree, never lose a node, appends a number to the end of corrupted trees
New to Server GUI, Traipse Suite's Debug Console
New Warhammer PC Sheet
Updates:
Update to White Board layer, uses a pencil image for color button
Update to Grid Layer, uses a grid image for color button
Update to Chat Window, size of drop down menus
Update to default lobby message
Update to template Text node
Update to 4e PC Sheet node
Update to how display names are acquired
Update to Server, added some 'Pious' technology
Update to features node
Fixes:
Fix to Server GUI startup errors
Fix to Server GUI Rooms tab updating
Fix to Chat and Settings if non existant die roller is picked
Fix to Dieroller and .open() used with .vs(). Successes are correctly calculated
Fix to Alias Lib's Export to Tree, Open, Save features
Fix to alias node, now works properly
Fix to Splitter node, minor GUI cleanup
Fix to Backgrounds not loading through remote loader
Fix to Node name errors
Fix to rolling dice in chat Whispers
Fix to Splitters Sizing issues
Fix to URL2Link plugin, modified regex compilation should remove memory leak
Fix to mapy.py, a roll back due to zoomed grid issues
Fix to whiteboard_handler, Circles work by you clicking the center of the circle
Fix to Servers parse_incoming_dom which was outdated and did not respect XML
Fix to a broken link in the server welcome message
Fix to InterParse and logger requiring traceback
Fix to Update Manager Status Bar
Fix to failed image and erroneous pop up
Fix to Mini Lib node that was preventing use
Fix to plugins that parce dice but did not call InterParse
Fix to nodes for name changing by double click
Fix to Game Tree, node ordering on drag and drop corrected
Fix to Game Tree, corrupted error message was not showing
Fix to Update Manager, checks for internet connection
Fix to Update Manager, Auto Update corrections
Fix to Server GUI's broadcast, room, player messaging
| author | sirebral |
|---|---|
| date | Wed, 05 May 2010 08:55:51 -0500 |
| parents | ff154cf3350c |
| children |
| rev | line source |
|---|---|
| 28 | 1 # mpatch.py - Python implementation of mpatch.c |
| 2 # | |
| 3 # Copyright 2009 Matt Mackall <mpm@selenic.com> and others | |
| 4 # | |
| 5 # This software may be used and distributed according to the terms of the | |
| 6 # GNU General Public License version 2, incorporated herein by reference. | |
| 7 | |
| 8 import struct | |
| 9 try: | |
| 10 from cStringIO import StringIO | |
| 11 except ImportError: | |
| 12 from StringIO import StringIO | |
| 13 | |
| 14 # This attempts to apply a series of patches in time proportional to | |
| 15 # the total size of the patches, rather than patches * len(text). This | |
| 16 # means rather than shuffling strings around, we shuffle around | |
| 17 # pointers to fragments with fragment lists. | |
| 18 # | |
| 19 # When the fragment lists get too long, we collapse them. To do this | |
| 20 # efficiently, we do all our operations inside a buffer created by | |
| 21 # mmap and simply use memmove. This avoids creating a bunch of large | |
| 22 # temporary string buffers. | |
| 23 | |
| 24 def patches(a, bins): | |
| 25 if not bins: return a | |
| 26 | |
| 27 plens = [len(x) for x in bins] | |
| 28 pl = sum(plens) | |
| 29 bl = len(a) + pl | |
| 30 tl = bl + bl + pl # enough for the patches and two working texts | |
| 31 b1, b2 = 0, bl | |
| 32 | |
| 33 if not tl: return a | |
| 34 | |
| 35 m = StringIO() | |
| 36 def move(dest, src, count): | |
| 37 """move count bytes from src to dest | |
| 38 | |
| 39 The file pointer is left at the end of dest. | |
| 40 """ | |
| 41 m.seek(src) | |
| 42 buf = m.read(count) | |
| 43 m.seek(dest) | |
| 44 m.write(buf) | |
| 45 | |
| 46 # load our original text | |
| 47 m.write(a) | |
| 48 frags = [(len(a), b1)] | |
| 49 | |
| 50 # copy all the patches into our segment so we can memmove from them | |
| 51 pos = b2 + bl | |
| 52 m.seek(pos) | |
| 53 for p in bins: m.write(p) | |
| 54 | |
| 55 def pull(dst, src, l): # pull l bytes from src | |
| 56 while l: | |
| 57 f = src.pop(0) | |
| 58 if f[0] > l: # do we need to split? | |
| 59 src.insert(0, (f[0] - l, f[1] + l)) | |
| 60 dst.append((l, f[1])) | |
| 61 return | |
| 62 dst.append(f) | |
| 63 l -= f[0] | |
| 64 | |
| 65 def collect(buf, list): | |
| 66 start = buf | |
| 67 for l, p in list: | |
| 68 move(buf, p, l) | |
| 69 buf += l | |
| 70 return (buf - start, start) | |
| 71 | |
| 72 for plen in plens: | |
| 73 # if our list gets too long, execute it | |
| 74 if len(frags) > 128: | |
| 75 b2, b1 = b1, b2 | |
| 76 frags = [collect(b1, frags)] | |
| 77 | |
| 78 new = [] | |
| 79 end = pos + plen | |
| 80 last = 0 | |
| 81 while pos < end: | |
| 82 m.seek(pos) | |
| 83 p1, p2, l = struct.unpack(">lll", m.read(12)) | |
| 84 pull(new, frags, p1 - last) # what didn't change | |
| 85 pull([], frags, p2 - p1) # what got deleted | |
| 86 new.append((l, pos + 12)) # what got added | |
| 87 pos += l + 12 | |
| 88 last = p2 | |
| 89 frags = new + frags # what was left at the end | |
| 90 | |
| 91 t = collect(b2, frags) | |
| 92 | |
| 93 m.seek(t[1]) | |
| 94 return m.read(t[0]) | |
| 95 | |
| 96 def patchedsize(orig, delta): | |
| 97 outlen, last, bin = 0, 0, 0 | |
| 98 binend = len(delta) | |
| 99 data = 12 | |
| 100 | |
| 101 while data <= binend: | |
| 102 decode = delta[bin:bin + 12] | |
| 103 start, end, length = struct.unpack(">lll", decode) | |
| 104 if start > end: | |
| 105 break | |
| 106 bin = data + length | |
| 107 data = bin + 12 | |
| 108 outlen += start - last | |
| 109 last = end | |
| 110 outlen += length | |
| 111 | |
| 112 if bin != binend: | |
| 113 raise Exception("patch cannot be decoded") | |
| 114 | |
| 115 outlen += orig - last | |
| 116 return outlen |