Mercurial > traipse_dev
view orpg/dieroller/base.py @ 191:a3d7e05085da beta
Traipse Beta 'OpenRPG' {100201-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)
New Features:
New Bookmarks Feature
New 'boot' command to remote admin
New confirmation window for sent nodes
Miniatures Layer pop up box allows users to turn off Mini labels, from
FlexiRPG
New Zoom Mouse plugin added
New Images added to Plugin UI
Switching to Element Tree
New Map efficiency, from FlexiRPG
New Status Bar to Update Manager
New TrueDebug Class in orpg_log (See documentation for usage)
New Portable Mercurial
New Tip of the Day, from Core and community
New Reference Syntax added for custom PC sheets
New Child Reference for gametree
New Parent Reference for gametree
New Gametree Recursion method, mapping, context sensitivity, and
effeciency..
New Features node with bonus nodes and Node Referencing help added
New Dieroller structure from Core
New DieRoller portability for odd Dice
New 7th Sea die roller; ie [7k3] = [7d10.takeHighest(3).open(10)]
New 'Mythos' System die roller added
New vs. die roller method for WoD; ie [3v3] = [3d10.vs(3)]. Included for
Mythos roller also
New Warhammer FRPG Die Roller (Special thanks to Puu-san for the
support)
New EZ_Tree Reference system. Push a button, Traipse the tree, get a
reference (Beta!)
New Grids act more like Spreadsheets in Use mode, with Auto Calc
Fixes:
Fix to allow for portability to an OpenSUSE linux OS
Fix to mplay_client for Fedora and OpenSUSE
Fix to Text based Server
Fix to Remote Admin Commands
Fix to Pretty Print, from Core
Fix to Splitter Nodes not being created
Fix to massive amounts of images loading, from Core
Fix to Map from gametree not showing to all clients
Fix to gametree about menus
Fix to Password Manager check on startup
Fix to PC Sheets from tool nodes. They now use the tabber_panel
Fix to Whiteboard ID to prevent random line or text deleting.
Fixes to Server, Remote Server, and Server GUI
Fix to Update Manager; cleaner clode for saved repositories
Fixes made to Settings Panel and now reactive settings when Ok is
pressed
Fixes to Alternity roller's attack roll. Uses a simple Tuple instead of
a Splice
Fix to Use panel of Forms and Tabbers. Now longer enters design mode
Fix made Image Fetching. New fetching image and new failed image
Fix to whiteboard ID's to prevent non updated clients from ruining the
fix.
default_manifest.xml renamed to default_upmana.xml
author | sirebral |
---|---|
date | Mon, 01 Feb 2010 09:57:07 -0600 |
parents | dcae32e219f1 |
children | 13054be69834 |
line wrap: on
line source
#!/usr/bin/env python # Copyright (C) 2000-2001 The OpenRPG Project # # openrpg-dev@lists.sourceforge.net # # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. # -- # # File: die.py # Author: Andrew Bennett # Maintainer: # Version: # $Id: die.py,v Traipse 'Ornery-Orc' prof.ebral Exp $ # # Description: This class is used to make working with dice easier # __version__ = "$Id: die.py,v Traipse 'Ornery-Orc' prof.ebral Exp Exp $" import random import UserList import copy class die_base(UserList.UserList): name = None def __init__(self,source = []): if isinstance(source, (int, float, basestring)): s = [] s.append(di(source)) else: s = source UserList.UserList.__init__(self,s) def sum(self): s = 0 for a in self.data: s += int(a) return s def __lshift__(self,other): if type(other) == type(3) or type(other) == type(3.0): o = other elif hasattr(other,"sum"): o = other.sum() else: return None result = [] for die in self: if die < o: result.append(die) return self.__class__(result) def __rshift__(self,other): if type(other) == type(3) or type(other) == type(3.0): o = other elif hasattr(other,"sum"): o = other.sum() else: return None result = [] for die in self: if die > o: result.append(die) return self.__class__(result) def __rlshift__(self,other): return self.__rshift__(other) def __rrshift__(self,other): return self.__lshift__(other) def __str__(self): if len(self.data) > 0: myStr = "[" + str(self.data[0]) for a in self.data[1:]: myStr += "," myStr += str(a) myStr += "] = (" + str(self.sum()) + ")" else: myStr = "[] = (0)" return myStr def __lt__(self,other): if type(other) == type(3) or type(other) == type(3.0): return (self.sum() < other) elif hasattr(other,"sum"): return (self.sum() < other.sum()) else: return UserList.UserList.__lt__(self,other) def __le__(self,other): if type(other) == type(3) or type(other) == type(3.0): return (self.sum() <= other) elif hasattr(other,"sum"): return (self.sum() <= other.sum()) else: return UserList.UserList.__le__(self,other) def __eq__(self,other): if type(other) == type(3) or type(other) == type(3.0): return (self.sum() == other) elif hasattr(other,"sum"): return (self.sum() == other.sum()) else: return UserList.UserList.__eq__(self,other) def __ne__(self,other): if type(other) == type(3) or type(other) == type(3.0): return (self.sum() != other) elif hasattr(other,"sum"): return (self.sum() != other.sum()) else: return UserList.UserList.__ne__(self,other) def __gt__(self,other): if type(other) == type(3) or type(other) == type(3.0): return (self.sum() > other) elif hasattr(other,"sum"): return (self.sum() > other.sum()) else: return UserList.UserList.__gt__(self,other) def __ge__(self,other): if type(other) == type(3) or type(other) == type(3.0): return (self.sum() >= other) elif hasattr(other,"sum"): return (self.sum() >= other.sum()) else: return UserList.UserList.__ge__(self,other) def __cmp__(self,other): # this function included for backwards compatibility # As of 2.1, lists implement the "rich comparison" # methods overloaded above. if type(other) == type(3) or type(other) == type(3.0): return cmp(self.sum(), other) elif hasattr(other,"sum"): return cmp(self.sum(), other.sum()) else: return UserList.UserList.__cmp__(self,other) def __rcmp__(self,other): return self.__cmp__(other) def __add__(self,other): mycopy = copy.deepcopy(self) if type(other) == type(3) or type(other) == type(3.0): other = [static_di(other)] elif type(other) == type("test"): return self mycopy.extend(other) return mycopy def __iadd__(self,other): return self.__add__(other) def __radd__(self,other): mycopy = copy.deepcopy(self) if type(other) == type(3) or type(other) == type(3.0): new_die = di(0) new_die.set_value(other) other = new_die mycopy.insert(0,other) return mycopy def __int__(self): return self.sum() def __sub__(self,other): mycopy = copy.deepcopy(self) if type(other) == type(3) or type(other) == type(3.0): neg_die = static_di(-other) other = [neg_die] else: other = -other mycopy.extend(other) return mycopy def __rsub__(self,other): mycopy = -copy.deepcopy(self) if type(other) == type(3) or type(other) == type(3.0): new_die = di(0) new_die.set_value(other) other = new_die mycopy.insert(0,other) return mycopy def __isub__(self,other): return self.__sub__(other) def __mul__(self,other): if type(other) == type(3) or type(other) == type(3.0): return self.sum() * other elif hasattr(other,"sum"): return other.sum() * self.sum() else: return UserList.UserList.__mul__(self,other) def __rmul__(self,other): return self.__mul__(other) def __div__(self,other): if type(other) == type(3) or type(other) == type(3.0): return float(self.sum()) / other elif hasattr(other,"sum"): return float(self.sum()) / other.sum() else: return UserList.UserList.__div__(self,other) def __rdiv__(self,other): if type(other) == type(3) or type(other) == type(3.0): return other / float(self.sum()) elif hasattr(other,"sum"): return other.sum() / float(self.sum()) else: return UserList.UserList.__rdiv__(self,other) def __mod__(self,other): if type(other) == type(3) or type(other) == type(3.0): return self.sum()%other elif hasattr(other,"sum"): return self.sum() % other.sum() else: return UserList.UserList.__mod__(self,other) def __rmod__(self,other): if type(other) == type(3) or type(other) == type(3.0): return other % self.sum() elif hasattr(other,"sum"): return other.sum() % self.sum() else: return UserList.UserList.__rmod__(self,other) def __neg__(self): for i in range(len(self.data)): self.data[i] = -self.data[i] return self def __pos__(self): for i in range(len(self.data)): self.data[i] = +self.data[i] return self def __abs__(self): for i in range(len(self.data)): self.data[i] = abs(self.data[i]) return self def __pow__(self,other): if type(other) == type(3) or type(other) == type(3.0): return self.sum() ** other elif hasattr(other,"sum"): return self.sum() ** other.sum() else: return UserList.UserList.__pow__(self,other) def __rpow__(self,other): # We're overloading exponentiation of ints to create "other" number of dice if other >= 1: result = self.__class__(self[0].sides) for t in range(other-1): result+=self.__class__(self[0].sides) else: result = None return result ### di class to handle actual dice class di: def __init__(self,sides,min=1): self.sides = sides self.history = None self.value = None self.target = None self.roll(min) def __str__(self): if len(self.history) > 1: return str(self.history) else: return str(self.value) def __neg__(self): self.value = -self.value for i in range(len(self.history)): self.history[i] = -self.history[i] return self def __pos__(self): self.value = +self.value for i in range(len(self.history)): self.history[i] = +self.history[i] return self def __abs__(self): self.value = abs(self.value) for i in range(len(self.history)): self.history[i] = abs(self.history[i]) return self def __repr__(self): if len(self.history) > 1: return str(self.history) else: return str(self.value) def __int__(self): return self.value def __lt__(self,other): if type(other) == type(3) or type(other) == type(3.0): return self.value < other elif hasattr(other,"value"): return self.value < other.value else: return self < other def __le__(self,other): if type(other) == type(3) or type(other) == type(3.0): return self.value <= other elif hasattr(other,"value"): return self.value <= other.value else: return self <= other def __eq__(self,other): if type(other) == type(3) or type(other) == type(3.0): return self.value == other elif hasattr(other,"value"): return self.value == other.value else: return self == other def __ne__(self,other): if type(other) == type(3) or type(other) == type(3.0): return self.value != other elif hasattr(other,"value"): return self.value != other.value else: return self != other def __gt__(self,other): if type(other) == type(3) or type(other) == type(3.0): return self.value > other elif hasattr(other,"value"): return self.value > other.value else: return self > other def __ge__(self,other): if type(other) == type(3) or type(other) == type(3.0): return self.value >= other elif hasattr(other,"value"): return self.value >= other.value else: return self >= other def __cmp__(self,other): # this function included for backwards compatibility # As of 2.1, lists implement the "rich comparison" # methods overloaded above. if type(other) == type(3) or type(other) == type(3.0): return cmp(self.value, other) elif hasattr(other,"value"): return cmp(self.value, other.value) else: return cmp(self,other) def roll(self,min=1): if isinstance(self.sides, basestring) and self.sides.lower() == 'f': self.value = random.randint(-1, 1) else: self.value = int(random.uniform(min, self.sides+1)) self.history = [] self.history.append(self.value) def extraroll(self): if isinstance(self.sides, basestring) and self.sides.lower() == 'f': result = random.randint(-1, 1) else: result = int(random.uniform(1,self.sides+1)) self.value += result self.history.append(result) def lastroll(self): return self.history[len(self.history)-1] def set_value(self,value): self.value = value self.history = [] self.history.append(self.value) def modify(self,mod): self.value += mod self.history.append(mod) def gethistory(self): return self.history[:] class static_di(di): def __init__(self,value): di.__init__(self,value,value) self.set_value(value) class DieRollers(object): _rollers = {} def __new__(cls): it = cls.__dict__.get("__it__") if it is not None: return it cls.__it__ = it = object.__new__(cls) return it def keys(self): return self._rollers.keys() def register(self, roller): if not self._rollers.has_key(roller.name): self._rollers[roller.name] = roller def __getitem__(self, roller_name): return self._rollers.get(roller_name, None) def __setitem__(self, *args): raise AttributeError die_rollers = DieRollers()