Mercurial > traipse_dev
annotate upmana/mercurial/strutil.py @ 135:dcf4fbe09b70 beta
Traipse Beta 'OpenRPG' {091010-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 (Beta)
Added Bookmarks
Fix to Remote Admin Commands
Minor fix to text based Server
Fix to Pretty Print, from Core
Fix to Splitter Nodes not being created
Fix to massive amounts of images loading, from Core
Added 'boot' command to remote admin
Added confirmation window for sent nodes
Minor changes to allow for portability to an OpenSUSE linux OS
Miniatures Layer pop up box allows users to turn off Mini labels, from FlexiRPG
Zoom Mouse plugin added
Images added to Plugin UI
Switching to Element Tree
Map efficiency, from FlexiRPG
Added Status Bar to Update Manager
default_manifest.xml renamed to default_upmana.xml
Cleaner clode for saved repositories
New TrueDebug Class in orpg_log (See documentation for usage)
Mercurial's hgweb folder is ported to upmana
**Pretty important update that can help remove thousands of dead children from your gametree.
**Children, <forms />, <group_atts />, <horizontal />, <cols />, <rows />, <height />, etc... are all tags now. Check your gametree and
look for dead children!!
**New Gamtree Recusion method, mapping, and context sensitivity. !!Alpha - Watch out for infinite loops!!
| author | sirebral |
|---|---|
| date | Tue, 10 Nov 2009 14:11:28 -0600 |
| parents | |
| children |
| rev | line source |
|---|---|
| 135 | 1 # strutil.py - string utilities for Mercurial |
| 2 # | |
| 3 # Copyright 2006 Vadim Gelfer <vadim.gelfer@gmail.com> | |
| 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 def findall(haystack, needle, start=0, end=None): | |
| 9 if end is None: | |
| 10 end = len(haystack) | |
| 11 if end < 0: | |
| 12 end += len(haystack) | |
| 13 if start < 0: | |
| 14 start += len(haystack) | |
| 15 while start < end: | |
| 16 c = haystack.find(needle, start, end) | |
| 17 if c == -1: | |
| 18 break | |
| 19 yield c | |
| 20 start = c + 1 | |
| 21 | |
| 22 def rfindall(haystack, needle, start=0, end=None): | |
| 23 if end is None: | |
| 24 end = len(haystack) | |
| 25 if end < 0: | |
| 26 end += len(haystack) | |
| 27 if start < 0: | |
| 28 start += len(haystack) | |
| 29 while end >= 0: | |
| 30 c = haystack.rfind(needle, start, end) | |
| 31 if c == -1: | |
| 32 break | |
| 33 yield c | |
| 34 end = c - 1 |