Search Results

Search found 64010 results on 2561 pages for 'google app engine python'.

Page 227/2561 | < Previous Page | 223 224 225 226 227 228 229 230 231 232 233 234  | Next Page >

• Reading and writing to/from memory in Python

  - by Honza Pokorny

  Let's imagine a situation: I have two Python programs. The first one will write some data (str) to computer memory, and then exit. I will then start the second program which will read the in-memory data saved by the first program. Is this possible?

  Read the article

• Memory efficient int-int dict in Python

  - by Bolo

  Hi, I need a memory efficient int-int dict in Python that would support the following operations in O(log n) time: d[k] = v # replace if present v = d[k] # None or a negative number if not present I need to hold ~250M pairs, so it really has to be tight. Do you happen to know a suitable implementation (Python 2.7)? EDIT Removed impossible requirement and other nonsense. Thanks, Craig and Kylotan! To rephrase. Here's a trivial int-int dictionary with 1M pairs: >>> import random, sys >>> from guppy import hpy >>> h = hpy() >>> h.setrelheap() >>> d = {} >>> for _ in xrange(1000000): ... d[random.randint(0, sys.maxint)] = random.randint(0, sys.maxint) ... >>> h.heap() Partition of a set of 1999530 objects. Total size = 49161112 bytes. Index Count % Size % Cumulative % Kind (class / dict of class) 0 1 0 25165960 51 25165960 51 dict (no owner) 1 1999521 100 23994252 49 49160212 100 int On average, a pair of integers uses 49 bytes. Here's an array of 2M integers: >>> import array, random, sys >>> from guppy import hpy >>> h = hpy() >>> h.setrelheap() >>> a = array.array('i') >>> for _ in xrange(2000000): ... a.append(random.randint(0, sys.maxint)) ... >>> h.heap() Partition of a set of 14 objects. Total size = 8001108 bytes. Index Count % Size % Cumulative % Kind (class / dict of class) 0 1 7 8000028 100 8000028 100 array.array On average, a pair of integers uses 8 bytes. I accept that 8 bytes/pair in a dictionary is rather hard to achieve in general. Rephrased question: is there a memory-efficient implementation of int-int dictionary that uses considerably less than 49 bytes/pair?

  Read the article

• Why is "while" loop really needed in Python?

  - by Tomaž Pisanski

  I was told that 95% of all loops in Python are "for" loops. Since "while" loops are clearly more "dangerous" than "for" loops, I would like to know if there are situations in which the use of a "while" loop is essential. For teaching purposes it would be useful to know if there is a systematic way of transforming "while" loops into "for" loops.

  Read the article

• mkdir -p functionality in python

  - by SetJmp

  Is there a way to get functionality similar to mkdir -p on the shell... from within python. I am looking for a solution other than a system call. I am sure the code is less than 20 lines... really I am wondering if someone has already written it?

  Read the article

• Algorithm detect repeating/similiar strings in a corpus of data -- say email subjects, in Python

  - by RizwanK

  I'm downloading a long list of my email subject lines , with the intent of finding email lists that I was a member of years ago, and would want to purge them from my Gmail account (which is getting pretty slow.) I'm specifically thinking of newsletters that often come from the same address, and repeat the product/service/group's name in the subject. I'm aware that I could search/sort by the common occurrence of items from a particular email address (and I intend to), but I'd like to correlate that data with repeating subject lines.... Now, many subject lines would fail a string match, but "Google Friends : Our latest news" "Google Friends : What we're doing today" are more similar to each other than a random subject line, as is: "Virgin Airlines has a great sale today" "Take a flight with Virgin Airlines" So -- how can I start to automagically extract trends/examples of strings that may be more similar. Approaches I've considered and discarded ('because there must be some better way'): Extracting all the possible substrings and ordering them by how often they show up, and manually selecting relevant ones Stripping off the first word or two and then count the occurrence of each sub string Comparing Levenshtein distance between entries Some sort of string similarity index ... Most of these were rejected for massive inefficiency or likelyhood of a vast amount of manual intervention required. I guess I need some sort of fuzzy string matching..? In the end, I can think of kludgy ways of doing this, but I'm looking for something more generic so I've added to my set of tools rather than special casing for this data set. After this, I'd be matching the occurring of particular subject strings with 'From' addresses - I'm not sure if there's a good way of building a data structure that represents how likely/not two messages are part of the 'same email list' or by filtering all my email subjects/from addresses into pools of likely 'related' emails and not -- but that's a problem to solve after this one. Any guidance would be appreciated.

  Read the article

• how to get all markers on google-maps-v3..

  - by zjm1126

  has any simply way ? thanks

  Read the article

• python regex of a date in some text

  - by Horace Ho

  How can I find as many date patterns as possible from a text file by python? The date pattern is defined as: dd mmm yyyy ^ ^ | | +---+--- spaces where: dd is a two digit number mmm is three-character English month name (e.g. Jan, Mar, Dec) yyyy is four digit year there are two spaces as separators Thanks!

  Read the article

• accessing google maps via UIWebView - illegal?

  - by Karin

  New to iPhone development. Working on first app. I'm accessing google maps via UIWebView to forward geocode an address using "http://maps.google.com/maps?q=my address". It works, although it has this quirk of requiring you to hit "Back" button and then the "Detail" button (provided by the navigation bar) to get back to the screen from whence you started. If anyone knows why it does this, I'd love to hear. My real question, however, is this a legal use of google maps? Since I intend this app for commercial use, am I violating Google's rules + regs? If it is illegal, what's my alternative? Thanks.

  Read the article

• Make an URL point to google maps app on Nokia (symbian)

  - by tvgemert

  Hi, The iPhone has a functionality that when a google maps URL is typed into (or linked) the mobile browser it will open the Google Maps app instead of displaying it in the mobile browser. Now I'm wondering if that same functionality exists for say a Nokia (Symbian) phone? Is there a way to set up the link to open the Google maps app on the Symbian phone?

  Read the article

• Finding maximum of a list of lists by sum of elements in Python

  - by Don Stewart

  What's the idiomatic way to do maximumBy (higher order function taking a comparison function for the test), on a list of lists, where the comparison we want to make is the sum of the list, in Python? Here's a Haskell implementation and example output: > maximumBy (compare `on` sum) [[1,2,3],[4,5,6],[1,3,5]] > [4,5,6]

  Read the article

• Python way to clone a git repository

  - by Mike

  Is there a Python way without using a subprocess to clone a git repository? I'm up for using any sort of modules you recommend.

  Read the article

• R or Python for file manipulation

  - by danspants

  I have 4 reasonably complex r scripts that are used to manipulate csv and xml files. These were created by another department where they work exclusively in r. My understanding is that while r is very fast when dealing with data, it's not really optimised for file manipulation. Can I expect to get significant speed increases by converting these scripts to python? Or is this something of a waste of time?

  Read the article

• How to start a Python script several functions in

  - by chrissygormley

  Hello, I have a Python script and I want to call it several functions down the script. Example code below: class Name(): def __init__(self): self.name = 'John' self.address = 'Place' self.age = '100' def printName(self): print self.name def printAddress(self): print self.address def printAge(self): print self.age if __name__ == '__main__': Person = Name() Person.printName() Person.printAddress() Person.printage() I execute this code by entering ./name.py. How could I exectute this code from the function printAddress() down the the end of the script? Thanks

  Read the article

• get from video.google videos id picture

  - by lolalola

  Hi, how get from video.google current video pictures? For example i have this video: http://video.google.com/videoplay?docid=1811233136844420765 And this video pictures url is: http://video.google.com/ThumbnailServer2?app=vss&contentid=d53e613f82f74c96&offsetms=50000&itag=w160&lang=en&sigh=QGtXRNh3rW4hfa6DSQSFtfOimno ................. http://images.metacafe.com/thumb/386357/2767198/4/catalog_top_item5/0/teach_magic_be_magician_money_magic.jpg And from wher get metacafe second id (2767198) ? So how only from video id to get a picture link?

  Read the article

• Up To Date Documentation on Wrapping gobjects with Python

  - by Matthew Talbert

  I'm looking for up-to-date documentation and tutorials on creating Python bindings for gobjects. Everything I can find on the web is either incomplete or out of date.

  Read the article

• Python: what package contains the installation metadata?

  - by Mark Harrison

  e.g., how can I find out that the executable has been installed in "/usr/bin/python" and the library files in "/usr/lib/python2.6"?

  Read the article

• Bind any version of MySql.Data using the app.config

  - by Martin Kirsche

  How do I bind any version or a range of versions of an assembly by using the app.config? I'm currently binding the MySql.Data assembly like this: <runtime> <assemblyBinding xmlns="urn:schemas-microsoft-com:asm.v1" applies-to="v2.0.50727"> <qualifyAssembly partialName="MySql.Data" fullName="MySql.Data, Version=6.2.2.0, Culture=neutral, PublicKeyToken=c5687fc88969c44d, processorArchitecture=MSIL"/> </assemblyBinding> </runtime> Any version of MySql.Data other than 6.2.2.0 is not working this way. The versions of this assembly are changing fast so I either want to bind any or all versions beginning with 6.2 to my application without changing the app.config each time.

  Read the article

• can we display glass bar chart in python with google app engine

  - by Rahul

  i am using bar chat and i want to use glass bar chart instead of that tutorials are given for PHP only.

  Read the article

• how to measure running time of algorithms in python

  - by Bunny Rabbit

  How can i mesure and compare the running times of my algorithms written in python .Also point me to a nice algorithms site/forum like stackoverflow if you can.

  Read the article

• Enthought Python, Sage, or others (in Unix clusters)

  - by vailen

  I am currently get access to a cluster of Unix machines, but they don't have the software I need (numpy, scipy, matplotlib, etc), and I have to install them by myself (I don't have the root permission, either, so commands like apt-get or yast doesn't work). In the worst case, I have to compile them all from source. Is there any better way to do so? I hear something about Enthought Python and Sage, but not sure what is the best way to do so. Any suggestion?

  Read the article

• python programme.

  - by siva

  hi, i am siva this is frist time taken the python programming language i have a small problem please help me the question is **Write two functions, called countSubStringMatch and countSubStringMatchRecursive that take two arguments, a key string and a target string. These functions iteratively and recursively count the number of instances of the key in the target string. You should complete definitions for def countSubStringMatch(target,key): and def countSubStringMatchRecursive (target, key): **

  Read the article

• javascript html object model and template engine

  - by ais

  I am looking something like var items = [1,2]; var html = div( ul({id:"some-id", class:"some-class"})(items.each(function(item){ return li(item); }) ); html == "<div><ul id='some-id' class='some-class'><li >1</li><li>2</li></ul></div>"

  Read the article

• Have to find if some window name has some string on it with python

  - by Shady

  First of all, I get the name of the current window win32gui.GetWindowText(win32gui.GetForegroundWindow()) k, no problem with that... But now, how can I make an if with the result for having an specific string on it... For example, the result gave me C:/Python26/ How can I make an True of False for the result containing the word, 'python' ? I'm trying with re.search, but I'm not being able to make it do it

  Read the article

• python set difference

  - by user1311992

  I'm doing a set difference operation in Python: from sets import Set from mongokit import ObjectId x = [ObjectId("4f7aba8a43f1e51544000006"), ObjectId("4f7abaa043f1e51544000007"), ObjectId("4f7ac02543f1e51a44000001")] y = [ObjectId("4f7acde943f1e51fb6000003")] print list(Set(x).difference(Set(y))) I'm getting: [ObjectId('4f7abaa043f1e51544000007'), ObjectId('4f7ac02543f1e51a44000001'), ObjectId('4f7aba8a43f1e51544000006')] I need to get the first element for next operation which is important. How can I retain the list x in original format?

  Read the article

• Equivalent of python eval in Haskell

  - by TheMachineCharmer

  There is function in python called eval that takes string input and evaluates it. >>> x = 1 >>> print eval('x+1') 2 >>> print eval('12 + 32') 44 >>> What is Haskell equivalent of eval function?

  Read the article

< Previous Page | 223 224 225 226 227 228 229 230 231 232 233 234  | Next Page >