Skip to content
This repository has been archived by the owner on Jan 19, 2023. It is now read-only.
Switch branches/tags

Name already in use

A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
Go to file
Cannot retrieve contributors at this time
from Foundation import *
from AppKit import *
MAGICVAR = "__magic_var__"
class ValueLadder:
view = None
visible = False
value = None
origValue = None
dirty = False
type = None
negative = False
unary = False
add = False
def __init__(self, textView, value, clickPos, screenPoint, viewPoint):
self.textView = textView
self.value = value
self.origValue = value
self.type = type(value)
self.clickPos = clickPos
self.origX, self.origY = screenPoint
self.x, self.y = screenPoint
self.viewPoint = viewPoint
(x,y),(self.width,self.height) = self.textView.bounds()
self.originalString = self.textView.string()
self.backgroundColor = NSColor.colorWithCalibratedRed_green_blue_alpha_(0.4,0.4,0.4,1.0)
self.strokeColor = NSColor.colorWithCalibratedRed_green_blue_alpha_(0.1,0.1,0.1, 1.0)
self.textColor = NSColor.colorWithCalibratedRed_green_blue_alpha_(1.,1.,1.,1.)
paraStyle = NSMutableParagraphStyle.alloc().init()
font = NSFont.fontWithName_size_("Monaco", 10)
self.textAttributes = {NSForegroundColorAttributeName:self.textColor,NSParagraphStyleAttributeName:paraStyle,NSFontAttributeName:font}
# To speed things up, the code is compiled only once.
# The number is replaced with a magic variable, that is set in the
# namespace when executing the code.
begin,end = self.clickPos
self.patchedSource = self.originalString[:begin] + MAGICVAR + self.originalString[end:]
#ast = parse(self.patchedSource + "\n\n")
success, output = self.textView.document._boxedRun(self._parseAndCompile)
if success:
def _parseAndCompile(self):
from compiler import parse
ast = parse(self.patchedSource.encode('ascii', 'replace') + "\n\n")
def _checkSigns(self, node):
"""Recursively check for special sign cases.
The following cases are special:
- Substraction. When you select the last part of a substraction
(e.g. the 5 of "10-5"), it might happen that you drag the number to
a positive value. In that case, the result should be "10+5".
- Unary substraction. Values like "-5" should have their sign removed
when you drag them to a positive value.
- Addition. When you select the last part of an addition
(e.g. the 5 of "10+5"), and drag the number to a negative value,
the result should be "10-5".
This algorithm checks for these cases. It tries to find the magic var,
and then checks the parent node to see if it is one of these cases,
then sets the appropriate state variables in the object.
This algorithm is recursive. Because we have to differ between a
"direct hit" (meaning the current child was the right one) and a
"problem resolved" (meaning the algorithm found the node, did its
work and now needs to bail out), we have three return codes:
- -1: nothing was found in this node and its child nodes.
- 1: direct hit. The child you just searched contains the magicvar.
check the current node to see if it is one of the special cases.
- 0: bail out. Somewhere, a child contained the magicvar, and we
acted upon it. Now leave this algorithm as soon as possible.
from compiler.ast import Sub, UnarySub, Add
# Check whether I am the correct node
return 1 # If i am, return the "direct hit" code.
except AttributeError:
# We keep an index to see what child we are checking. This
# is important for binary operations, were we are only interested
# in the second part. ("a-10" has to change to "a+10",
# but "10-a" shouldn't change to "+10-a")
index = 0
# Recursively check my children
for child in node.getChildNodes():
retVal = self._checkSigns(child)
# Direct hit. The child I just searched contains the magicvar.
# Check whether this node is one of the special cases.
if retVal == 1:
# Unary substitution.
if isinstance(node, UnarySub):
self.negative = True
self.unary = True
# Binary substitution. Only the second child is of importance.
elif isinstance(node, Sub) and index == 1:
self.negative = True
# Binary addition. Only the second child is of importance.
elif isinstance(node, Add) and index == 1:
self.add = True
# Return the "bail out" code, whether we found some
# special case or not. There can only be one magicvar in the
# code, so once that is found we can stop looking.
return 0
# If the child returns a bail out code, we leave this routine
# without checking the other children, passing along the
# bail out code.
elif retVal == 0:
return 0 # Nothing more needs to be done.
# Next child.
index += 1
# We searched all children, but couldn't find any magicvars.
return -1
def show(self):
self.visible = True
def hide(self):
"""Hide the ValueLadder and update the code.
Updating the code means we have to replace the current value with
the new value, and account for any special cases."""
self.visible = False
begin,end = self.clickPos
# Potentionally change the sign on the number.
# The following cases are valid:
# - A subtraction where the value turned positive "random(5-8)" --> "random(5+8)"
# - A unary subtraction where the value turned positive "random(-5)" --> "random(5)"
# Note that the sign dissapears here.
# - An addition where the second part turns negative "random(5+8)" --> "random(5-8)"
# Note that the code replaces the sign on the place where it was, leaving the code intact.
# Case 1: Negative numbers where the new value is negative as well.
# This means the numbers turn positive.
if self.negative and self.value < 0:
# Find the minus sign.
i = begin - 1
notFound = True
while True:
if self.originalString[i] == '-':
if self.unary: # Unary subtractions will have the sign removed.
# Re-create the string: the spaces between the value and the '-' + the value
value = self.originalString[i+1:begin] + str(abs(self.value))
else: # Binary subtractions get a '+'
value = '+' + self.originalString[i+1:begin] + str(abs(self.value))
range = (i,end-i)
i -= 1
# Case 2: Additions (only additions where we are the second part
# interests us, this is checked already on startup)
elif self.add and self.value < 0:
# Find the plus sign.
i = begin - 1
notFound = True
while True:
if self.originalString[i] == '+':
# Re-create the string:
# - a '+' (instead of the minus)
# - the spaces between the '-' and the constant
# - the constant itself
value = '-' + self.originalString[i+1:begin] + str(abs(self.value))
range = (i,end-i)
i -= 1
# Otherwise, it's a normal case. Note that here also, positive numbers
# can turn negative, but no existing signs have to be changed.
value = str(self.value)
range = (begin, end-begin)
# The following textView methods make sure that an undo operation
# is registered, so users can undo their drag.
self.textView.shouldChangeTextInRange_replacementString_(range, value)
self.textView.textStorage().replaceCharactersInRange_withString_(range, value)
self.textView.setNeedsDisplay_(True) = False
def draw(self):
x = mx-20
w = 80
h = 20
h2 = h*2
context = NSGraphicsContext.currentContext()
aa = context.shouldAntialias()
r = ((mx-w/2,my+12),(w,h))
# A standard value just displays the value that you have been dragging.
if not self.negative:
v = str(self.value)
# When the value is negative, we don't display a double negative,
# but a positive.
elif self.value < 0:
v = str(abs(self.value))
# When the value is positive, we have to add a minus sign.
v = "-" + str(self.value)
NSString.drawInRect_withAttributes_(v, ((mx-w/2,my+14),(w,h2)), self.textAttributes)
def mouseDragged_(self, event):
mod = event.modifierFlags()
newX, newY = NSEvent.mouseLocation()
deltaX = newX-self.x
delta = deltaX
if self.negative:
delta = -delta
if mod & NSAlternateKeyMask:
delta /= 100.0
elif mod & NSShiftKeyMask:
delta *= 10.0
self.value = self.type(self.value + delta)
self.x, self.y = newX, newY
self.dirty = True
self.textView.document.magicvar = self.value = True