Mike Meyer <[EMAIL PROTECTED]> writes:
> > When you want local variable in lisp you do :
> >
> > (let ((a 3)) (+ a 1))
>
> Excep that's not a decleration, that's a binding. That's identical to
> the Python fragment:
>
>a = 3
>return a + 1
>
> except for the creation of the new sc
"Michele Simionato" <[EMAIL PROTECTED]> writes:
> If you google a bit on the newsgroup, you should find a message
> from me asking about the ability to subclass FunctionType, and
> a reply from Tim Peters saying that the only reason why this
> was not done is lack of developer time and the fact tha
rbt <[EMAIL PROTECTED]> writes:
> 1. Do I need to use threads to handle requests, if so, how would I
> incorporate them? The clients are light and fast never sending more
> than 270 bytes of data and never connecting for more than 10 seconds
> at a time. There are currently 500 clients and potenti
Steven D'Aprano <[EMAIL PROTECTED]> writes:
> Anyone have any good ideas for how I should implement this?
These days you can use properties. Before, you'd have had to do it
manually with __setattr__ / __getattr__ methods. Here's how I'd do it
with properties, if I have the math right. You're us
Yeah, that's what I meant. Thanks.
--
http://mail.python.org/mailman/listinfo/python-list
rbt <[EMAIL PROTECTED]> writes:
> The server just logs data, nothing else. It's not private or important
> data... just sys admin type stuff (ip, mac addy, etc.). I just don't
> want some script kiddie discovering it and trying to 'hack' it. By doing
> so, they'd fill the log up with crap. So, If t
"Ivan Shevanski" <[EMAIL PROTECTED]> writes:
> choice1 = raw_input("> ")
choice1 is now the whole string that the user types
> Is there a way (I searched for a module but didnt find one) that I can
> do something like this?
>
> if choice1 in ('1', 'S', 's'):
> #do first option
You'd use cho
"Ivan Shevanski" <[EMAIL PROTECTED]> writes:
> Alright, I'm going to stop trying to defend my idea since it's
> obviously a bad one. What do you recommend?
Just choose the options that you present carefully. If you have
unsophisticated users and you want to be a bit fancier, put up a GUI
so they
[EMAIL PROTECTED] (Alex Martelli) writes:
> ap.py:4: No global (test) found
> ap.py:5: Local variable (ego1d) not used
> Helen:/tmp alex$
>
> If you're so typo-prone and averse to unittests that you consider this
> kind of issue to be a serious problem, just use pychecker and get
> informed about
rbt <[EMAIL PROTECTED]> writes:
> Off-topic here, but you've caused me to have a thought... Can hmac be
> used on untrusted clients? Clients that may fall into the wrong hands?
> How would one handle message verification when one cannot trust the
> client? What is there besides hmac? Thanks, rbt
I
Lasse Vågsæther Karlsen <[EMAIL PROTECTED]> writes:
> But trying to keep your email world into a pure text-based
> no-formatting-whatsoever world, that's a fantasy bubble that is bound
> to burst, sooner rather than later.
I read mail over an ssh connection to a Unix shell. I have no easy
way to
Mike Meyer <[EMAIL PROTECTED]> writes:
> > I read mail over an ssh connection to a Unix shell. I have no easy
> > way to read html email with a graphics browser.
>
> You don't need a grahics browser - you just need a browser.
Right, precisely. I use lynx, as I explained. It renders the html as
Steven D'Aprano <[EMAIL PROTECTED]> writes:
> > def cache_function(fn):
> > cache = {}
> > def cached_result(*args, **kwargs):
> > if args in cache:
> > return cache[args]
> > result = fn(*args, **kwargs)
> > cache[args] = result
> > return
Roedy Green <[EMAIL PROTECTED]> writes:
> >I read mail over an ssh connection to a Unix shell. I have no easy
> >way to read html email with a graphics browser.
>
> So the rest of the world should forgo rich communication because of
> your obsolete software? How could anything every evolve with
jena <[EMAIL PROTECTED]> writes:
> # BEGIN CODE
> def test():
> def x():
> print a
> a=2 # ***
> a=1
> x()
> print a
>
> test()
> # END CODE
>
> This code fails (on statement print a in def x), if I omit line marked
> ***, it works (it prints 1\n1\n). It look like when I assign var
"Fredrik Lundh" <[EMAIL PROTECTED]> writes:
> Tcl is an early example of a something that started as a "reusable
> command language" and turned into a "real programming language"
> along the way:
Yes, that's why tcl is such an awful language. And it happens all the
time. It's better to just star
Roedy Green <[EMAIL PROTECTED]> writes:
> >His reply wasn't exactly clear, but I that he means that wen you use HTM
> >mail, you don't have to attach the photo with the email. You can also
> >use the HTML to refer to an image somewhere on a webserver.
> There is that and also the use of HTML forma
Steven D'Aprano <[EMAIL PROTECTED]> writes:
> No. I'm obsessed with finding out what closures are, since nobody seems to
> have a good definition of them!
Why don't you read SICP:
http://mitpress.mit.edu/sicp/full-text/book/book.html
You will be a much wiser person for having done so.
> Howe
Steven D'Aprano <[EMAIL PROTECTED]> writes:
> Is it correct to say that Python *always* creates a closure whenever a def
> or lambda is executed? Or is it only for *certain* defs/lambdas?
The word closure is being used two different ways. First of all the
computer-science term "closure" which mea
Ville Voipio <[EMAIL PROTECTED]> writes:
> The software should be running continously for
> practically forever (at least a year without a reboot).
> Is the Python interpreter (on Linux) stable and
> leak-free enough to achieve this?
I would say give the app the heaviest stress testing that you c
Steven D'Aprano <[EMAIL PROTECTED]> writes:
> If performance is really not such an issue, would it really matter if you
> periodically restarted Python? Starting Python takes a tiny amount of time:
If you have to restart an application, every network peer connected to
it loses its connection. Thi
"Sean Berry" <[EMAIL PROTECTED]> writes:
> myList = [[value1, value2, value3],[value1, value2, value3], ...]
>
> I have a function which takes value3 from the lists above and returns
> another value. I want to use this returned value to sort the lists.
>
> So, my resultant list would be ordered
"Sean Berry" <[EMAIL PROTECTED]> writes:
> > def get_key(x): return x[2]
> > sorted_list = sorted(myList, key=get_key)
>
> Sorry if I am missing something. But. what is sorted here?
sorted is a built-in function that sorts the thing that you pass it.
It just appeared in Python 2.4, I think. Wit
Ville Voipio <[EMAIL PROTECTED]> writes:
> Goes without saying. But I would like to be confident (or as
> confident as possible) that all bugs are mine. If I use plain
> C, I think this is the case. Of course, bad memory management
> in the underlying platform will wreak havoc. I am planning to
> u
Ville Voipio <[EMAIL PROTECTED]> writes:
> Just one thing: how reliable is the garbage collecting system?
> Should I try to either not produce any garbage or try to clean
> up manually?
The GC is a simple, manually-updated reference counting system
augmented with some extra contraption to resolve
rbt <[EMAIL PROTECTED]> writes:
> > I don't understand the question. HMAC requires that both ends share a
> > secret key; does that help?
>
> That's what I don't get. If both sides have the key... how can it be
> 'secret'? All one would have to do is look at the code on any of the
> clients and
rbt <[EMAIL PROTECTED]> writes:
> > Instead, for client #i, let that client's key be something like
> > hmac(your_big_secret, str(i)).digest()
> > and the client would send #i as part of the string.
>
> How is this different from sending a pre-defined string from the client
> that the server kno
"dcrespo" <[EMAIL PROTECTED]> writes:
> I have a program that serves client programs. The server has a login
> password, which has to be used by each client for logging in. So, when
> the client connects, it sends a string with a password, which is then
> validated on the server side. The problem i
"dcrespo" <[EMAIL PROTECTED]> writes:
> Hi. I found TSL, a Python Library that supports SRP.
> Do you know where can I find a sample client and server code? Thanks
> for your help.
I don't know about TSL, but TLSLite (www.trevp.net/tlslite) supports SRP.
--
http://mail.python.org/mailman/listinfo
"dcrespo" <[EMAIL PROTECTED]> writes:
> 3. Both Client and Server creates a hash string from
>
> 4. Client sends the hash string to the server
> 5. Server compares his hash result with the hash string received from
> de client.
>
> I think it is a very good solution, Isn't it?
No. It's vulnerabl
Tom Anderson <[EMAIL PROTECTED]> writes:
> Has anyone looked into using a real GC for python? I realise it would
> be a lot more complexity in the interpreter itself, but it would be
> faster, more reliable, and would reduce the complexity of extensions.
The next PyPy sprint (this week I think) is
Dan Stromberg <[EMAIL PROTECTED]> writes:
> > No. It's vulnerable to dictionary search. Use SRP if you can.
> Where can I learn more about this?
http://srp.stanford.edu as already mentioned. Also, RFC 2945
describes an older version (still ok).
--
http://mail.python.org/mailman/listinfo/python-
Tom Anderson <[EMAIL PROTECTED]> writes:
> Okay, a crack at a definition: a closure is a function in which some
> of the variable names refer to variables outside the function.
That's misleading, I'd say a closure is a combination of a function
(executable code) and a lexical environment (the valu
Sybren Stuvel <[EMAIL PROTECTED]> writes:
> > I might be wrong expecting that a language whose moto is "Batteries
> > Included" would be able to produce exe files.
>
> Indeed, you're wrong. Why would such an ability be included in Python?
distutils.exe, included in Python, in fact does have the a
Laszlo Zsolt Nagy <[EMAIL PROTECTED]> writes:
> This is a bit offtopic here. I read the RFC and I do not see why SRP
> is not vulnerable to dictionary attacks.
> If I have a working client software then I can use it to reveal
> passwords. Isn't it a dictionary attack?
Dictionary attack in this con
"Chris Dewin" <[EMAIL PROTECTED]> writes:
> There was an excellent such primer on devshed, by Icarus, but they appear
> to have taken it down.
>
> I saved a copy of it to my HD. Would there be anything morally, or legally
> wrong with me uploading it to my site?
A little googling shows it's still
<[EMAIL PROTECTED]> writes:
> Because you can't run it yourself? If you cannot run the
> freshly-made exe yourself, why would you want to distrubute it,
> without even trying? But if you can, then you can run the InnoSetup
> as well.
Obviously I'd want someone to test the .exe before putting it in
Lasse Vågsæther Karlsen <[EMAIL PROTECTED]> writes:
> or is the "proper python" way simply this:
>
> def fn(*values, **options):
> if "cmp" in options: comparison = options["cmp"]
> else: comparison = cmp
> # rest of function here
>
> and thus ignoring the wrong parameter names?
I
"g.franzkowiak" <[EMAIL PROTECTED]> writes:
> Where can I find informations like this for Python ?
"Use the force, read the source". Python's interpreter is more like a
big switch statement on bytecodes, though.
--
http://mail.python.org/mailman/listinfo/python-list
[EMAIL PROTECTED] (Alex Martelli) writes:
> > Has anyone looked into using a real GC for python? ...
> > lot more complexity in the interpreter itself, but it would be faster,
> > more reliable, and would reduce the complexity of extensions.
>
> ??? It adds no complexity (it's already there), it'
Markus Rosenstihl <[EMAIL PROTECTED]> writes:
> This looks ugly (I htink) and I wonder if there is a nicer way to
> strip commata and change the comma to a dot already when reading in.
> Or should i do it with a shell script before processing in python?
First of all you should just set your local
Markus Rosenstihl <[EMAIL PROTECTED]> writes:
> indeed, it did it correctly by default:
>
> read_file = csv.reader(open('2005_08_Rechnung_4963184011.dat', 'r'),
> delimiter="\t")
> for row in read_file:
> rechnung.append(row)
Oh cool. I think you could even say:
rechnung = list(read_fi
Roedy Green <[EMAIL PROTECTED]> writes:
> So let's say I decide to send an email to Donald Knuth.
Good luck. Prof. Knuth stopped reading email years before there was a
big spam problem. He uses his own version of hashcash to cut down on
unimportant mail: if you want to write to him, you have to
Erik Max Francis <[EMAIL PROTECTED]> writes:
> > I've written lots of things whose standard out was designed
> > specifically to be read by another program, but never as binary data.
>
> Plenty of applications use that functionality and depend on it. See
> cjpeg, djpeg, the pbmplus library, and s
Roedy Green <[EMAIL PROTECTED]> writes:
> Next Mr. Phish had to present his passport etc when he got his Thawte
> ID. Now Interpol has a much better handle on putting him in jail.
> He can't repudiate his phishing attempt.
Any underage drinker in a college town can tell you a hundred ways to
get
"Diez B. Roggisch" <[EMAIL PROTECTED]> writes:
> AFAIK some LISPs do a similar trick to carry int values on
> cons-cells. And by this tehy reduce integer precision to 28 bit or
> something. Surely _not_ going to pass a regression test suite :)
Lisps often use just one tag bit, to distinguish betwe
[EMAIL PROTECTED] writes:
> Does anyone know of an available downloader for an amd64 bit
> build of (a modern) python?
I've gotten a bug report from someone using Python under Linux on an
amd64, so compiling for 64 bits definitely is feasible. You could try
the Fedora Core 4 amd64 distro (http://
"Diez B. Roggisch" <[EMAIL PROTECTED]> writes:
> That particular implementation used 3 or 4 tag-bits. Of course you are
> right that nowadays python won't notice the difference, as larger nums
> get implicitely converted to a suitable representation. But then the
> efficiency goes away... Basically
"Fredrik Lundh" <[EMAIL PROTECTED]> writes:
> (fwiw, switching to tagging in CPython would break most about
> everything. might as well start over, and nobody's likely to do
> that to speed up integer- dominated programs a little...)
Yeah, a change of that magnitude in CPython would be madness, b
Steve Holden <[EMAIL PROTECTED]> writes:
> Until someone does the experiment this stuff is bound to be
> speculation (what's that saying about "premature optimization"?).
40 years of practical Lisp implementation efforts and around the globe
and hundreds of published papers on the subject might n
Scott David Daniels <[EMAIL PROTECTED]> writes:
> Current speeds are due to deep pipelines, and a conditional in the
> INCREF code would blow a pipeline.
I think most of the time, branch prediction will prevent the cache
flush. Anyway, with consed integers, there's still going to be a
conditional
Jorgen Grahn <[EMAIL PROTECTED]> writes:
> It depends on what you mean by expensive -- web servers can fork for each
> HTTP request they get, in real-world scenarios, and get away with it.
This is OS dependent. Forking on Windows is much more expensive than
forking on Linux.
--
http://mail.pytho
Grant Edwards <[EMAIL PROTECTED]> writes:
> Since the NT kernel is descended from VMS, I'm not surprised
> that a fork is expensive.
Apache 2.x supports concurrency via threading as an alternative to
forking, basically in order to get acceptable performance on Windows.
--
http://mail.python.org/m
Scott David Daniels <[EMAIL PROTECTED]> writes:
> > I think most of the time, branch prediction will prevent the cache
> > flush.
> But, branch prediction is usually a compiler thing, based on code
> that is, in this case, a spot in the interpreter that is actually
> taking both sides of the branch
"Fredrik Lundh" <[EMAIL PROTECTED]> writes:
> itertools.count() # 0-based
> itertools.count(1) # 1-based
>
> gives you an iterator that generates all Python integers (the behaviour
> when it exceeds sys.maxint doesn't seem to be defined, but 2.4 wraps
> around to -(sys.maxint+1))
Ugh, I'd
Kenneth McDonald <[EMAIL PROTECTED]> writes:
> 1) Which plays best with Python? Ideally, it would already have some
> higher-level python libraries to hide the grotty stuff that is almost
> never needed when actually implementing apps.
>
> 2) Reliability of each?
>
> 3) Useful external libraries
Brendan Guild <[EMAIL PROTECTED]> writes:
> This was a problem, but modern browsers implement Javascript in such a
> way that it requires permission from the user before it will open a new
> window.
Not really true, it's easy to defeat that, and also generally the
pop-up blocker only blocks wind
"dcrespo" <[EMAIL PROTECTED]> writes:
> Ok, I understand... What about the MD5? Is it good enough to use when
> saving a hashed password on the database?
>
> For example:
> user_input = raw_input("Type your password: ")
> password = md5.md5(user_input).hexdigest()
> SavePasswordInDatabase(user,pas
[EMAIL PROTECTED] (Gordon Burditt) writes:
> I'm not sure that you can disable Javascript from reading cookies
> from other sites while allowing Javascript to read cookies from the
> site it came from on all browsers.
Javascript is not supposed to be able to read cross-site cookies.
It's bad but i
"dcrespo" <[EMAIL PROTECTED]> writes:
> > Can you say what your application is? That will help figure out
> > how far you need to go to protect these passwords, and what
> > alternatives might be possible.
>
> Sure, no problem (see this on fixed text):
Well, I mean, what kind of data is it? Spo
"Diez B. Roggisch" <[EMAIL PROTECTED]> writes:
> > Yes, that would describe just about every cpu for the past 30 years
> > that's a plausible Python target.
>
> No. The later 68K (>68020) could address on odd adresses. And AFAIK
> all x86 can because of their 8080 stemming.
Yes, "could" but not "
"dcrespo" <[EMAIL PROTECTED]> writes:
> Important data like diplomatic traffic. Must be accessible from all
> Clients inmediatly a client publish his data. Its an online system.
OK, if it's actual diplomatic traffic you need to work with your
government about criteria. If you're in the US, you'd
Steven D'Aprano <[EMAIL PROTECTED]> writes:
> Others have given answers involving xrange() and itertools.count(), but I
> thought I'd just mention that in my opinion, what you have written is
> pretty elegant and concise and best of all, doesn't have the same problems
> xrange() and itertools.count
Steve Holden <[EMAIL PROTECTED]> writes:
> >>And this presumes an architecture which byte-addresses and only
> >> uses "aligned" addresses.
>
> He was talking about the arachiteecture, for Pete's sake, not a compiler.
Yeah, I noticed that, I could have been pedantic about it but chose to
just d
[EMAIL PROTECTED] writes:
> Folks, most common GC schemes have been tried as experiments over
> the years. None have succeeeded, for various reasons. I think one
> of the main reasons is that Python has to "play nice" with external
> libraries, many of which weren't written with GC beyond malloc
Tim Tyler <[EMAIL PROTECTED]> writes:
> Are there any examples of HTML email causing security problems - outside
> of Microsoft's software?
There was a pretty good one that went something like
Click this link to download latest security patch!
http://www.mxx.com.>Microsoft Security C
"dcrespo" <[EMAIL PROTECTED]> writes:
> Now that you know what I have, I would like to add SRP functionality to
> the validation of each new connection.
> What I need to add to my code to get SRP to work? I don't know where to
> start. The docs are poor.
I don't know of a Python SRP module that on
"PyPK" <[EMAIL PROTECTED]> writes:
> now I want execute() function to get executed only once. That is the
> first time it is accessed.
> so taht when funcc2 access the execute fn it should have same values as
> when it is called from func1.
There's nothing built into Python for that. You have to
"snoe" <[EMAIL PROTECTED]> writes:
> Also why is it if I set tmp as a global and don't pass it as a
> paremeter to the various functions as per the OP that I get an
> "UnboundLocalError: local variable 'tmp' referenced before assignment"?
If you don't declare it as a global, and if you try to assi
"Amir Michail" <[EMAIL PROTECTED]> writes:
> The idea is to garbage collect the object as soon as possible, and this
> may be sooner than when dosomestuff returns.
If it's a parameter to dosomestuff, then there's still a reference
until dosomestuff returns. Simply getting rid of the name only fr
"Amir Michail" <[EMAIL PROTECTED]> writes:
> But dosomestuff can get rid of its reference before it returns (perhaps
> it has a lot more to do before it returns and so you would want to
> garbage collect the parameter object as soon as possible).
That would be so rare and weird that your best bet
"Fredrik Lundh" <[EMAIL PROTECTED]> writes:
> > Forcing every digest module to add code to cater for just one of many
> > use cases is most likely a waste of time.
> here's the hash API specification, btw:
> http://www.python.org/peps/pep-0247.html
I agree with you and Mike that a file checksu
Anthony Liu <[EMAIL PROTECTED]> writes:
> I do I split the string by using both ' ' and '_' as
> the delimiters at once?
Use re.split.
--
http://mail.python.org/mailman/listinfo/python-list
Leandro Lameiro <[EMAIL PROTECTED]> writes:
> Maybe I've got a distorted impression about the importance of this. As
> I'm not an experienced programmer, I'd probably trust more in your
> impressions than mine. :)
Good call. :)
> I mean, if we all agreed that it is a common thing, a patch for thi
Ognen Duzlevski <[EMAIL PROTECTED]> writes:
> > Optimizations have a tendency to make a complete mess of Big O
> > calculations, usually for the better. How does this support your
> > theory that Big O is a reliable predictor of program speed?
>
> There are many things that you cannot predict, how
Antoon Pardon <[EMAIL PROTECTED]> writes:
> The underlying implementation is an AVL balanced binary tree with
> inorder threading.
Dan Bernstein argues for switching from hash tables to crit-bit trees
(a/k/a Patricia trees), because of their guaranteed worst case
performance. He also claims:
Steven D'Aprano <[EMAIL PROTECTED]> writes:
> But if you are unlikely to discover this worst case behaviour by
> experimentation, you are equally unlikely to discover it in day to
> day usage.
Yes, that's the whole point. Since you won't discover it by
experimentation and you won't discover it by
Steve Holden <[EMAIL PROTECTED]> writes:
> Otherwise you have to write the worker thread to be capable of
> handling asynchronous signals, which is a notoriously difficult task.
Doing it properly needs a language extension.
http://www.cs.williams.edu/~freund/papers/02-lwl2.ps
--
http://mail.pyth
"Edward K. Ream" <[EMAIL PROTECTED]> writes:
> - Support for all frequently-used Emacs commands, including cursor and
> screen movement, basic character, word and paragraph manipulation, and
> commands to manipulate buffers, the kill ring, regions and rectangles.
Do you support re-search-backwar
Michael Ekstrand <[EMAIL PROTECTED]> writes:
> > 2) Keybindings in a web application
>
> Not sure here, but JavaScript may be able to do something to accomplish
> some of this. A web-delivered XUL app can definitely do this. But
> that's pushing the limits of what can be considered a web applica
Torsten Bronger <[EMAIL PROTECTED]> writes:
> Because everybody is capable of running a JS engine, even on
> computers on which you don't have rights to install something.
I don't think using JS so heavily without a compelling reason is
really in the WWW spirit. Lots of browsers don't have JS. A
[EMAIL PROTECTED] (Alex Martelli) writes:
> implementation of the components one's considering! Rough ideas of
> *EXPECTED* run-times (big-Theta) for various subcomponents one is
> sketching are *MUCH* more interesting and important than "asymptotic
> worst-case for amounts of input tending to in
[EMAIL PROTECTED] (Alex Martelli) writes:
> > You mean like google? Until recently, they're an outstanding example
> > of doing things right, and providing functionality that degrades
> > gracefully as the clients capabilities go down.
>
> I'm not sure what you mean by "until recently" in this con
"George Sakkis" <[EMAIL PROTECTED]> writes:
> I'm trying to create a dbm database with around 4.5 million entries
> but the existing dbm modules (dbhash, gdbm) don't seem to cut
> it. What happens is that the more entries are added, the more time
> per new entry is required, so the complexity seems
"Philippe C. Martin" <[EMAIL PROTECTED]> writes:
> * HOW (if there's a better way let me know please) **
> As I have not found any better solution yet, I am trying to do the following
> (on the server there is an html file and a cgi file)
If I understand it, you're trying to use a smart ca
"David Schwartz" <[EMAIL PROTECTED]> writes:
> If you want to sell meals with Whoppers in them, you have to get
> permission to do so from Burger King corporate. And they will not let you
> also sell Big Macs in the same store, even if McDonald's had no objection.
Why do you keep comparing M
"David Schwartz" <[EMAIL PROTECTED]> writes:
> > So, your observations about Burger King are irrelevant to Microsoft.
>
> Because the error I'm correcting is the belief that Microsoft's conduct
> was extremely unusual (unlike anything any reputable company had ever done,
> essentially).
MS'
"David Schwartz" <[EMAIL PROTECTED]> writes:
> But there is no law against that type of conduct, *unless* you are a
> monopolist. So your conclusion hinges on the determination that Microsoft
> had a monopoly, and that hinges on the definition of the "market". That's a
> different can of wor
Lasse Vågsæther Karlsen <[EMAIL PROTECTED]> writes:
> I have a list of items and a "rule" for ordering them.
>
> Unfortunately, the rule is not complete so it won't define the correct
> order for any two items in that list.
>
> In other words, if I pick two random items from the list I may or may
Lasse Vågsæther Karlsen <[EMAIL PROTECTED]> writes:
> In that application we talked about presenting the user with two and
> two images and he just had to click on the image that came first. The
> problem with this was to try to present the "right" images to the user
> so that he had to minimize th
"David Schwartz" <[EMAIL PROTECTED]> writes:
> The appeals courts upheld that the trial court did not abuse its
> discretion. However, both a finding of "yes, Microsoft had a monopoly" and a
> finding of "no, Microsoft did not have a monopoly" would both have been
> within the trial court's
"David Schwartz" <[EMAIL PROTECTED]> writes:
> I defy you to find any court that has ruled this practice illegal for a
> company that does not have a monopoly. Because if they did, I'm going after
> Doctor's Associates and Kenmore.
Of course it's legal for non-monopoly companies. You seem t
"David Schwartz" <[EMAIL PROTECTED]> writes:
> > Of course it's legal for non-monopoly companies. You seem to think
> > Microsoft's illegal monopoly is an irrelevant detail. It is not.
>
> What is an "illegal monopoly"?
It's what Microsoft still stands convicted of having.
http://cyber.law
"David Schwartz" <[EMAIL PROTECTED]> writes:
> Sorry to be pedantic, but I think it's an important point that no court
> ever found that Microsoft illegally acquired a monopoly. So to characterize
> the monopoly itself as "illegal" is simply erroneous.
Who is paying you to tell these ridicul
[EMAIL PROTECTED] writes:
> I want to scan a file byte for byte for occurences of the the four byte
> pattern 0x0100. I've tried with this:
use re.search or string.find. The simplest way is just read the whole
file into memory first. If the file is too big, you have to read it in
chunks and
"David Schwartz" <[EMAIL PROTECTED]> writes:
> Is it your position that Micorosoft's monopoly was illegal when they
> first acquired it?
It's utterly irrelevant whether it was illegal when they acquired it.
The law is against acquiring OR MAINTAINING a monopoly by
anticompetitive means. Tha
"KraftDiner" <[EMAIL PROTECTED]> writes:
> In C++ you can specify a comparision method, how can I do this with
> python...
Yes, see the docs. Just pass a comparison func to the sort method.
--
http://mail.python.org/mailman/listinfo/python-list
"Paul Watson" <[EMAIL PROTECTED]> writes:
> How could I identify when Python code does not close files and depends on
> the runtime to take care of this? I want to know that the code will work
> well under other Python implementations and future implementations which may
> not have this provide
[EMAIL PROTECTED] (John J. Lee) writes:
> Closing off this particular one would make it harder to get benefit of
> non-C implementations of Python, so it has been judged "not worth it".
> I think I agree with that judgement.
The right fix is PEP 343.
--
http://mail.python.org/mailman/listinfo/pyt
"Tor Erik Sønvisen" <[EMAIL PROTECTED]> writes:
> I need a time and space efficient way of storing up to 6 million bits. Time
> efficency is more important then space efficency as I'm going to do searches
> through the bit-set.
Umm, what kind of searches do you want to do? For speed you want to
501 - 600 of 4808 matches
Mail list logo
