Zak Arntson wrote:
On Mon, 06 Dec 2004 13:08:15 -0800, Scott David Daniels
<[EMAIL PROTECTED]> wrote:
Zak Arntson wrote:
On Fri, 03 Dec 2004 14:48:30 -0800, Scott David Daniels wrote:
...The real advantage is clarity: the inner dictionaries in a dict-of-dict
implementation have no real &q
, so I will have to sort 12 times.
Well, good sorting is O(N * log(N)), so you should be able to calculate
from a sample timing (once you get out of cache effects). If you use a
variant of the above, simply time a few of the intervals you've chosen
and do a nice linear extrapolation.
--Scott David D
= zipfile.ZipFile('box.zip', 'w', zipfile.ZIP_DEFLATED)
archive.write('source/somewhere/one.txt', 'name.txt')
archive.write('two.txt', 'another.txt')
archive.close()
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
mastervar be contained within the scope of the inheriting classes? Why
is it being treated like a global variable and being modified by the
other instances?
By over-riding mastervar in class c, I hope I've shown that a class
variable is shared by all of its instances, but can be over-ri
like:
def contents(filename):
source = open(filename)
try:
return source.read()
finally:
source.close()
and then you can make your small uses clear.
-Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
b_\t_here'
len(s.split()) == 1
len(s.decode('string_escape').split()) == 2
s = 'tab_\t_here'
len(s.split()) == 2
len(s.encode('string_escape').split()) == 1
-Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
a.fromstring(message)
for i in range(len(a)):
a[i] += 1
return a.tostring()
print mangle('Hello, Harry')
-Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
Martijn Faassen wrote:
It's slow and no scientific research exists in its favor! Also it
doesn't work. Why would I need polymorphism? Lisp had all of this 50
years ago anyway. But functional programming by the way SUX TOO! So does
procedural programming! And structured programming SUX, GOTO all
odule,
the "numpy" implementation, and the "numarray" implementation. Clearly
there are some trade offs here with no clear winner. Until there is a
clear favorite, it would be a bad idea to choose a winner.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
l Reference for that kind of
book -- no fat, lotsa goodies.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
are better off
returning a function which can take the remaining arguments, and
controlling when the final function is called by returning a function
that can take all the remaining arguments at once.
-Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
hine words).
the strings you pass to pyserial are treated as byte sequences
Just one other bit (byte?) of data that wasn't mentioned here:
the array module also provides handy conversions.
array.array('B', [1,2,3,4]).tostring() == '\1\2\3\4'
This may prove useful as you cre
int. If you can encode numbers like
11300, that might help (also throw in some negative numbers and some
small numbers). I'd like 0 and +/- versions of 2**n for n in range(16)
and +/- versions of 10**n for n in range(1,7).
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
:
u = UsesMissing()
except NotImplementedError, e:
print 'Got expected exception:', e
else:
raise ValueError, 'Did not get expected exception'
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
d))
for expr in source[1::2])
return ''.join(source)
amount = 1
cost = 2.0
what = 'potato'
print fix("""I'll have "amount" "what"s
for "'$%.2f' % cost"s please""", locals())
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
M.E.Farmer wrote:
I dont have itertools yet. That module looks like it rocks.
thanks for the pointers,
M.E.Farmer
If you have python 2.3 or 2.4, you have itertools.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
Gábor Farkas wrote:
Scott David Daniels wrote:
If you have python 2.3 or 2.4, you have itertools.
for me it seems that 2.3 does not have itertools.groupby.
it has itertools, but not itertools.groupby.
True. The 2.4 document says that itertools.groupby() is equivalent to:
class groupby(object
s
def isrecursive(obj):
try:
walks(obj, set())
except RecursionFoundError, err:
return True# err.args[0] is the looping object
return False
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
ns. I
don't know if anyone has a tested way of using lcc.
With MinGW32, your build step will be the delightfully easy:
python setup.py build --compiler=mingw32
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
Bengt Richter wrote:
Not true on NT4 at least:
Alt-Spacebar gets you the system menu
paste into the dos window with Alt-spacebar e p
Thanks immensely for this -- I love it.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
Jim Hill wrote:
Fredrik Lundh wrote:
Scott David Daniels wrote:
And if you enjoy building insecure stuff, try:
def fix(text, globals_=None, locals=None, quote='"'):
d = (globals_ or locals or globals()).copy()
source = text.split(quote)
source[1::2] = (s
o write for
windows with a GNU compiler; you'll be swimming upstream a bit less.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
valid element %r in string %r" % (
e.args[0], text)
stack = [0]
for num in numbers:
if num >= 100:
stack[-1] *= num
if num >= 1000:
stack.append(0)
else:
y"
(run.py from the same directory where demo.py or demo.pyw lives)
to your local directory where you are playing.
--Scott David [EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
ell, and (once we've done that) we can pass the lessons
on for other compiler is desired.
--Scott David Daniels
[EMAIL PROTECTED]
p.s. I am able (and willing) to use the MS free compiler, but I have
sympathy for those who aren't. I'd like to see it possible to use
_lots_ of differ
francisl wrote:
Can we, directly from unix select and insert data in a remote mssql
database?
In some sense you can. I used python and mxODBC to talk ODBC protocol
to DB2 / MS SqlServer / Access. It was quite a while ago, and I may
have had to use an odbc-on-linux piece I don't know about. But
es two different lists.
This is half the problem. In the period where an element is in the
wrong hash bucket, a new entry for the same value can be created in
the proper hash bucket. Then the code will have to determine how to
merge two entries at rehash time.
--Scott David Daniels
[EMAIL PROTE
d I knew a number of people who hung out at Keysey's place and a
few "on the bus" types -- none of them ever used the "drank the Kool-
Aid" phrase before Jonestown to my knowledge.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
statement. "a = 6 5" _is_ a syntax error; there is no way to
interpret "6 6" as an expression, and there is no way to interpret
" 6" as a statement. So, even if your proposal were to
be implemented, it would probably be an "access to undeclared
identifier"
omething. Only that type should not be enforced and 'expects' makes
this clear.
You need to explain why anyone would want to write expects at all.
If you are expecting the code generation to change, you'd better
enforce, rather than advise, unless you are defining points at which
to do code
this command
-d enable debugger
-e edit mode; arguments are files to be edited
-s run $IDLESTARTUP or $PYTHONSTARTUP first
-t titleset title of shell window
On Windows, it is likely to be idle.pyw. So, add a -s to the command
line used in the shortcut t
early if the larger
transaction has not in fact "read" the data they will right. Also,
in some cases, the smaller ones may be allowed to proceed and force
the larger one to abort if it attempts to acquire locks on the data
they write.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.pyth
B.G.R. wrote:
numline=0
for line in sys.stdin:
numline+=1
workwithline(line)
I'd use:
for numline, line in enumerate(sys.stdin):
workwithline(line)
Note: The line numbers start at 0, but that is often acceptable.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.pytho
re,
and "deepcopy" needn't copy such objects. The only way to safely
do deepcopy is to copy down to immutables, but usually there is a
shallower and faster implementation that depends on application
semantics.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
Michael Hobbs wrote:
I've always found that with Haskell, if I can get my program to
compile without error, it usually runs flawlessly. (Except for the
occasional off-by-one error. :-)
Then you need "Scott and Dave's Programming Language" -- SAD/PL.
By providing separate dat
em, a standard line of attack is a queue of
work-to-do tasklets, with each worker going back for more when he
finishes. The slowest running worker should then only be finished
after the fastest worker by at most the longest-running tasklet's time.
--Scott David Daniels
[EMAIL PROTECTE
t), B(A), C(A), D(B,C) hierarchy, but they should
match.
* implementing types/classes in C -- a checklist w/ advice on testing.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
Antoon Pardon wrote:
Op 2004-12-23, Scott David Daniels schreef <[EMAIL PROTECTED]>:
This is half the problem. In the period where an element is in the
wrong hash bucket, a new entry for the same value can be created in
the proper hash bucket. Then the code will have to determine how to
's another way: # (Return something with __iter__ and next methods)
Py> class R2(object):
def __init__(self, data):
self.d = data
self.i = len(data)
def __iter__(self):
return iter(self.d)
Py> s = R2('spam')
Py> list(s)
['s', 'p', 'a', 'm']
Py> list(s)
['s', 'p', 'a', 'm']
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
, prophetic,
invented a language, herpetic.
decidedly brilliant,
syntacticly elegant,
Made ideas far less hypothetic.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
eq in sorted(mydict.items(), key=sortkey):
print '%-6s %s' % word_freq
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
Anthony Liu wrote:
--- Scott David Daniels <[EMAIL PROTECTED]> wrote:
def sortkey((word, frequency)):
return -frequency, word
for word_freq in sorted(mydict.items(), key=sortkey):
print '%-6s %s' % word_freq
Thank you scott, but 'sorted' itse
Bouke Woudstra wrote:
It turned out that some flac files have tags like Artist=artistname and others
have artist=artistname. Therefore it couldn't find the artist! So now I just
look for 'rtist=' which works great.
You might want try using something like this:
wanted = set('artist album date
more likely to help you out. This is a
_collective_ effort. You spotted a problem; submit at least a bug
report if not a fix.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
nicke wrote:
Peter Hansen <[EMAIL PROTECTED]> wrote:
Scott David Daniels wrote:
nicke wrote:
If it really is like this it is uncoherent and quite stupid :P
Name-calling won't make anyone more likely to help you out. This is a
_collective_ effort. You spotted a problem; submit at
"reversed" generator to avoid a copy.
for line in reversed(readlines()):
....
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
ntrol yourself). Just write a function "commad" and use it.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
uot;module switch" must happen very early (probably at
the top of the main program).
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
d"
and do a commit after each distinct name_id is finished. This
strategy would keep data for individuals coherent.
4) In fact, I'd leave the data in the database. Perhaps more like a
set of queries like:
UPDATE names
SET names.prefix = name_parts.name
"secret register" for the moving data,
and a "first part done" part of executing the opcode.
Modern RISC-structured machines have at most one memory operation,
so the instruction is simply completed or not, and can safely be
re-executed if it is not complete.
--Scott David Dani
Michael Spencer wrote:
itertools.groupby enables you to do this, you just need to define a
suitable grouping function, that stores its state:
Michael, this would make a great Python Cookbook Recipe.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
n(sys.argv[1 :])
else:
output = open(sys.argv[-1], 'w')
try:
main(sys.argv[1 : -1], output)
finally:
output.close()
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
Michael Spencer wrote:
Scott David Daniels wrote:
Michael Spencer wrote:
OK, will do. What would you call it? Something like: "Stateful
grouping of iterable items"
How about "Using groupby to fill lines"?
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mai
Qertoip wrote:
Dnia Fri, 25 Mar 2005 12:51:59 -0800, Scott David Daniels napisał(a):
> ...
for word in line.split():
try:
corpus[word] += 1
except KeyError:
corpus[word] = 1
Above is (probably) not efficient when exception is thr
our code).
You could also be changing the format used to send the data to the
database (of that I'm not quite as sure).
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
earth would want that? ;)
Reinhold
You certainly do get lots of adding/subtracting even if they start at 1.
For example the length of lst[a : b] would be (a - b + 1). I certainly
had my share of fencepost problems in Fortran I, II, IV, V ...
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail
e boilerplate to me. I'm wondering whether others
think this is an interesting insight into what decorators are "for,"
or they think I'm working on "the moral equivalent of a macro."
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
Jack Diederich wrote:
On Wed, Mar 30, 2005 at 02:48:51PM -0800, Scott David Daniels wrote:
In particular, I thought about something like:
@mousexy
def OnRightClick(self, x, y):
...
so all event-responding methods tend to look like:
def OnRightClick(self, event):
x
tly open file.
Or, if you like to click:
File -> Open (choose file)
Run -> Run Module
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
dea. You probably don't see it since you aren't doing much
engineering work.
--Scott David Daniels
[EMAIL PROTECTED]
-- No truth has been harmed by this April Fool's post. :-)
--
http://mail.python.org/mailman/listinfo/python-list
ways expect certain kinds of errors)
lest you accidentally capture an real attempt to stop the program
such as the exception a Control-C causes.
-Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
Python is not for poetry.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
Roy Smith wrote:
... How our tools warp our thinking.
That is what it means to be human. I can think of no better reason
for a programmer to regularly learn languages: "our tools warp our
thinking." A programmer is a professionally warped thinker.
--Scott David Daniels
[EMAIL PROTECTE
Thomas Rast wrote:
Tom Carrick <[EMAIL PROTECTED]> writes:
In my attempted learning of python, I've decided to recode an old
anagram solving program I made in C++. The C++ version runs in less
than a second, while the python takes 30 seconds.
Indeed, your program can be improved to run about ten ti
Donn Cave wrote:
Quoth Scott David Daniels <[EMAIL PROTECTED]>:
| Sunnan wrote:
| > ...Because what is "boring"? The opposite of dense, tense, intense. Utterly
| > predictable; it's like the combination of all my prejudices. Even before
| > I knew, I thought "B
ur tests cannot be run on a non-debug version.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
u write is that you are referring to
tweakdoc as a decorator, when it is a function returning a decorator.
and not:
@decorator(x)(y)
This is only prevented by syntax (probably a good idea, otherwise
we would see some very complicated expressions before function
declarations).
--Scott David
Bengt Richter wrote:
If there is to be an MSPython, how long 'til Mozilla FirePython? ;-)
Mexico has already designed the flag for that, I think.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
Aahz wrote:
You just can't have your cake and eat it, too.
I've always wondered about this turn of phrase. I seldom
eat a cake at one sitting.
-Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
function), and
if it needs more clarity, of your non-oderiferous proposals, I'd take:
Decorator expression for short?
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
Guess I am listening to language funny today.
Steve Holden wrote:
By the way, we pass *parameters* to functions, *perimeters* surround
things.
But we do pass parameters *around*, which may be the source of the
confusion. :-)
-Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman
not
necessarily a bug in the sense of a fixable bug; floating point has
vagaries that are not necessarily easily controllable from the C source
side.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
Steve Holden wrote:
Scott David Daniels wrote:
Terry Reedy wrote:
On my Windows machine with 2.2.1, I get exactly what you expected:
1e1
1.#INF
...
If you get wrong behavior on a later version, then a bug has been
introduced somewhere, even perhaps in VC 7, used for 2.4.
Nope, it is also
ed(b, c, a)
except Success, instance:
result, = instance.args
return result
else:
raise ValueError, 'Nothing found'
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
objects, but in Python objects refer
to each other.
How about this:
class Holder(object): pass
v = [1 + 11 * 2]
w = [1, v, 3]
d = {1: v}
o = Holder()
o.x = v
What is the parent of v?
Or even worse:
v = [1]
v[0] = v
What is the parent of v now?
--Scott David Daniels
[EMAIL
g is length 7 vs 8)
In the first one, the final byte is '?' (I made the same mistake
myself when I first read it).
Also note:
float('1e1') is 1.#INF both in Idle and from the command line.
I suspect an Idle bug.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
Scott David Daniels wrote:
Bengt Richter wrote:
Aha! Same version (2.3.4):
Idle:
>>> 1e1
1.0
>>> import struct; struct.pack('d', 1e1)
'\x00\x00\x00\x00\x00\x00\xf0?'
(which is actually 1.0)
python via command line (readline support):
Matthew Thorley wrote:
Scott David Daniels wrote: ...(explaining Python has no "the" parent)
I see what your saying, but I my situation the values of the dictionary
are unique objects created by a parent object.
But that is your convention, not Python's. Some good general rules:
alue get converted to text -- the subprocess or
the parent?
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
a time, but it is
chock-a-block with great stuff. I paid about twenty bucks a fascicle.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
be:
...
from progadn import *
def checkDNA(seq):
...
def main():
...
for x in extseq:
f = open(x, "r")
try:
print checkDNA(f.read())
finally:
f.close()
if __name__ = '__ma
and use better algorithms. Only in the
core of a frequently used inner loop should you even care about the
cost of exceptions. Even then, you can often lift the exception
handler around the loop and recover the most necessary performance.
--Scott David Daniels
[EMAIL PROTECTED]
--
http
ut are negative bases. For example, 3(10) =
111(-2). That's 1*(-2)^2 + 1*(-2)^1 + 1*(-2)^0 = 4 - 2 + 1. I can't
think of any use for negative bases, but they are a fun game to play with
(if you're into that sort of stuff).
Non-integer bases are fun too.
If you think those are fu
bclasses of unittest.TestCase.
To run all of these the tests, at a command prompt type:
python test_prog.py
To run them all and see which are being run,
python test_prog.py -v
You can run individual tests with:
python test_prog.py TestCase.test_second
TestCase here is the name of the class
ttribute it?
;-)
Clearly to Greg.
--Scott David Daniels
[EMAIL PROTECTED]
(who should have said something as soon as he saw the mis-attribution)
--
http://mail.python.org/mailman/listinfo/python-list
Simon Brunning wrote:
"Get real. I can't imagine using anything so complex." -- Scott David
Daniels, in response to a suggestion to try (1j-1) as a counting base
Oops -- once again I get credit for someone's response to my post. (I
was the "try (1j-1)" poster).
2 bits per character). I suppose it could be done, but a
naïve program might be in for a big shock about memory consumption.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
used long after
storing is a candidate for more validation. This rule applies "in
spades" for persistent data (stored in any form of database). The
rule is to catch issues where you can figure them out.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
t "-v"
as in:
python -v prog.py -args ...
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
Bill Davy wrote:
Hi Scott,
Nice idea. Tried that but no more information about where the file was
(not) found (see below).
But many thanks for a useful flag. I did not see them in the documentation.
What should I be lkooking for? [StopPres: Ah ha -h why did I not think of
that?]
...
import
Mage wrote:
Scott David Daniels wrote:
See, the body of your anonymous function just looks for "the current
value of n" when it is _invoked_, not when it is _defined_.
The "lambda functions" was an unclear part of the tutorial I read.
Should I use them? Are they pythonic?
A
'mask')
result = list(part2)
input.close()
output = open(networkConf, 'w')
try:
output.writelines(result)
finally:
output.close()
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
You didn't pass in self as the first arg to open. This is necessary.
S
On 19 December 2013 09:22, Igor Korot wrote:
> Hi, Peter,
> Thank you for the great suggestion.
>
> I tried to implement you code but failed.
>
> Here's what I have:
>
> class FileReader:
> def __init__(self, filena
So, this is what I came up with. It works, which is good but it’s a little
different from a few things you guys had mentioned. For one, I got the correct
time by calculating the number of time run and converting that into seconds
then back out to hr:mn:sc. I didn’t calculate from midnight. T
You guys are awesome! I think I was over complicating things for one. Plus I
was looking at some code I wrote for another problem that asked to put in the
number of seconds to calculate the problem and I didn’t need some of the things
I added to this problem. Anyways, you guys have given me a
Also, can any of you reccommend sites that may have little “projects” that I
could work on to help me learn python better?
On Jan 31, 2014, at 1:30 AM, Chris Angelico wrote:
> On Fri, Jan 31, 2014 at 7:17 PM, Gregory Ewing
> wrote:
>> sjud9227 wrote:
>>>
>>> Doesn't
>>> assigning seconds/(
Also, any help on how to get the hours and seconds into double digits that
would be cool too. 00:00:00
On Jan 31, 2014, at 1:30 AM, Chris Angelico wrote:
> On Fri, Jan 31, 2014 at 7:17 PM, Gregory Ewing
> wrote:
>> sjud9227 wrote:
>>>
>>> Doesn't
>>> assigning seconds/(60*60) mean that calcu
, Scott W Dunning wrote:
> Any chance you guys could help with another question I have? Below is a code
> to a different problem. The only thing I don’t understand is why when
> calculating the 'discounted price’ you have to subtract 1? Thanks again
> guys!
>
>
uot;:", seconds,”am"
On Jan 31, 2014, at 5:57 PM, Chris Angelico wrote:
> On Sat, Feb 1, 2014 at 11:42 AM, Scott W Dunning wrote:
>> Also, any help on how to get the hours and seconds into double digits that
>> would be cool too. 00:00:00
>
> Once you can divide
Ok cool, thanks Denis!
On Jan 31, 2014, at 8:02 PM, Denis McMahon wrote:
> On Thu, 30 Jan 2014 21:12:19 -0800, scottwd80 wrote:
>
>> Here is the question that was asked and below that I'll paste the code I
>> have so far.
>
> The following is a reasonably but not highly obfuscated short solut
801 - 900 of 2114 matches
Mail list logo
