Search Results

Search found 30720 results on 1229 pages for 'anon support 2010'.

Page 385/1229 | < Previous Page | 381 382 383 384 385 386 387 388 389 390 391 392  | Next Page >

  • Open txt files from a directory, compare the values, and output the top 15 in PHP

    - by Anon
    Hello, I recently designed a referral game website for the fun of it. There's a simple MySQL user system with a email verification. It's using the UserCake user management system. On top of this i added a php page that the user could give to "victims" that when they visit it they get "infected" and can infect other users or "victims". This page uses GET to get the username from the url. I have a folder that when a user registers it creates a file with 4 digits and then the username. (ex; 0000Username.txt) All the numbers are the same, it's just so that if a user discovers the folder they won't be able to find the files. There is also a txt file in the same format with IPS in the name. (ex; 0000IPSUsername.txt) The file when visited gets the username from the url, then checks if the text file for that username exists. If the username is present in the url, and a valid user it opens the IPS file and adds the IP of the visitor, then opens the user text file, takes the value and adds one to it, and saves. At the end it makes the difference between saying "You are infected, Username has infected (amount) people." or just you have been infected. Now to what i need! I need to add a hi-scores to the website so people can compete to be the one with the most "infections". I thought i could use readdir to get a list of the files and open them with the value in an array, but i need it to also strip the username from the file name. It would be best if it just saves to a text file like "Username | value" because then i can add echo's of the html tags and have it include the file in the page i want it to be one. Many thanks in advance.

    Read the article

  • Query Tamino server with xql parameter in URL. Exclude nodes with specific child.

    - by Anon
    I have to query a Tamino database through HTTP. http://example.com/db?DocumentType=publication&year=all gives me a list of all publication in the database, something like: <publication> <title> The first publications title </title> <author> Author, M </author> <LastModification> <year> 2008 </year> <month> 05 </month> </LastModification> <year> 2006 </year> </publication> <publication> <title> The second publications title </title> <author> Secauthor, M </author> <LastModification> <year> 2005 </year> <month> 01 </month> </LastModification> <year> 2000 </year> </publication> <publication> <title> Another publications title </title> <author> Anauthor, M </author> <year> 2008 </year> </publication> (Simplified values) There is a xql parameter that can be specified and that can be used to filter the output, so I can do: http://example.com/db?DocumentType=publication&year=all&xql=LastModification/year~>2008 Which results in: <publication> <title> The publications title </title> <author> Author, M </author> <LastModification> <year> 2008 </year> <month> 05 </month> </LastModification> <year> 2006 </year> </publication> <publication> <title> Another publications title </title> <author> Anauthor, M </author> <year> 2008 </year> </publication> There is very little documentation... I want to be able to first get all publications that have changed since the last update (and only those), and then in a second query all publications that do not have a <LastModification> tag.

    Read the article

  • Percent of internet running Google Native Client?

    - by anon
    Anyone have numbers on how many machines / % of internet uses have Google Native Client? I'm curious about google NaCL as a platform: it seems to combine the best of the web (just a webpage, accessible on any machine) and desktop apps (OpenGL, C/C++ power). The only question is -- what percent of the world actually use it. Anyone have data on this? Thanks!

    Read the article

  • LaTeX symbol under nabla

    - by anon
    In LaTeX, with \displaystyle , if I do something like: \sum_{i=0} then the i=0 appears under a giant Sigma. This is good. Now, if I do (also in \displaystyle) \nabla_{x} the x does not appear under the nabla. It appears to the lower right. How can I make it appear under the nabla instead?

    Read the article

  • Synthesizing Singing

    - by anon
    So this is from the late 90s ... http://www.cs.princeton.edu/~prc/SingingSynth.html Why hasn't this taken off? (We can synthesize photorealistic like images, but the synthesis of singing ... still seems to be in very primitive stages). What exactly is it that makes the synthesis of singing difficult? http://www.interspeech2007.org/Technical/synthesis_of_singing_challenge.php <-- still seems primitive. Thanks!

    Read the article

  • Hidden features of Emacs Lisp?

    - by anon
    What are some features of Emacs Lisp that you use to solve real problems? One feature per answer Give an example and short description of the feature, not just a link to documentation Label the feature using bold title as the first line See also: Hidden features of Python Hidden features of Ruby Hidden features of Perl Hidden features of Java

    Read the article

  • FPGA Place & Route

    - by anon
    For programming FPGAS, is it possible to write my own place & route routines? [The point is not that mine would be better; the point is whether I have the freedom to do so] -- or does the place & route stage output into undocumented bitfiles, essengially forcing me to use proprietary tools? Thanks!

    Read the article

  • c++ object sizes

    - by anon
    Suppose I have: struct Foo: public Bar { .... } Foo introduces no new member varaibles. Foo only introduces a bunch of member functions & static functions. Does any part of the C++ standard now guarantee me that: sizeof(Foo) == sizeof(Bar) ? Thanks!

    Read the article

  • Resources for writing kernel in C

    - by anon
    I don't want to write my own boot loader -- happy to use Grub. I just want to implement pre-emptive multi threading, a basic file system, and virtual memory. I want something that can run on top of qemu. What's a good resource (book / tutorial) for accomplishing this goal? Thanks!

    Read the article

  • vim unicode bufread/bufwrite script

    - by anon
    Problem: I want my unicode characters to be stored on disk as (rather tan utf8/16 encoding) \u#### However, I want them dispalyed as unicode characters when opened up in vim. I think the easiest way to acheive this is some bufopen/bufwrite script that automatically: on opening, convert \u#### to unicode character on writing, convert unicode characters into \u#### However, I don't know what functions to call to make this happen. Can someone lend a hand? Thanks!

    Read the article

  • Sex appeal of computer graphics: movie like UI systems [closed]

    - by anon
    It's well know that 1) the way computers actually work 2) the way computers are protrayed in movies are not the same. In particular (2) looks much much cooler than (1). Where can I learn more about making flashy, superficially useful but deepdown useless fancy graphics UIs like that? It's almost in the realm of "hollywood special effects" -- like fire/smoke/fire, but I don't want natural phenomenon; I want user interfaces. Concrete question: where can I learn about creating flashy, cool looking (though not necessairly useful) user interfaces? [Perferably in OpenGL]

    Read the article

  • Badge for low score?

    - by anon
    I have a question: http://stackoverflow.com/questions/2465308/code-golf-write-an-stackoverflow-clone-closed that is at -12. Can I get a badge of some sort for this?

    Read the article

  • How to print source code lines in python logger

    - by anon
    Is there some relatively simple way to programmatically include source code lines to python logger report. For example... import logging def main(): something_is_not_right = True logging.basicConfig(level=logging.DEBUG, format=('%(filename)s: ' '%(levelname)s: ' '%(funcName)s(): ' '%(lineno)d:\t' '%(message)s') ) if something_is_not_right == True: logging.debug('some way to get previous line of source code here?') So that output would look like this. example.py: DEBUG: main(): 14: if something_is_not_right == True:

    Read the article

  • C# code analysis - VS 2005

    - by anon
    I have a C# user control project which causes intermittent .NET run time error, a generic error, and wondering if there is any code analysis tool that I can point at my .sln file which would tell me what may be causing my error

    Read the article

  • interactive lua prompt in opengl application

    - by anon
    Okay, so when I run lua, I get something like: lua Lua 5.1.4 Copyright (C) 1994-2008 Lua.org, PUC-Rio > Now, I want a prompt like this, 1) in a GUI application I've written. My GUI application can provide functions like: get_input_from_screen(); and write_this_crap_out_to_screen(); and more functions I can write as necessary I also know how to embed a lua interpreter in my C++ code (short tutorial on the web) What I don't know .. is how to connect the input/output of a lua interpreter with my GUI stuff. Any help/links apreciated. Thanks!

    Read the article

  • Vim, vimgrep, and file caching

    - by anon
    My entire source code base is < 20MB. I want it all loaded in memory in the background. So that when I do vimgrep */.cpp */.cxx */.hpp , it doesn't ahve to do file IO since vim has loaded all the files into memory already. How can I achieve this? Thakns!

    Read the article

  • objdump -S - source code listing

    - by anon
    How does objdump manage to display source code? Is there a reference to the source file in the binary? I tried running strings on the binary and couldn't find any reference to the source file listed... Thanks.

    Read the article

  • Template trick to optimize out allocations

    - by anon
    I have: struct DoubleVec { std::vector<double> data; }; DoubleVec operator+(const DoubleVec& lhs, const DoubleVec& rhs) { DoubleVec ans(lhs.size()); for(int i = 0; i < lhs.size(); ++i) { ans[i] = lhs[i]] + rhs[i]; // assume lhs.size() == rhs.size() } return ans; } DoubleVec someFunc(DoubleVec a, DoubleVec b, DoubleVec c, DoubleVec d) { DoubleVec ans = a + b + c + d; } Now, in the above, the "a + b + c + d" will cause the creation of 3 temporary DoubleVec's -- is there a way to optimize this away with some type of template magic ... i.e. to optimize it down to something equivalent to: DoubleVec ans(a.size()); for(int i = 0; i < ans.size(); i++) ans[i] = a[i] + b[i] + c[i] + d[i]; You can assume all DoubleVec's have the same # of elements. The high level idea is to have do some type of templateied magic on "+", which "delays the computation" until the =, at which point it looks into itself, goes hmm ... I'm just adding thes numbers, and syntheizes a[i] + b[i] + c[i] + d[i] ... instead of all the temporaries. Thanks!

    Read the article

  • C++ compile time purity checks?

    - by anon
    Is it possible to specify compile time "purity" checks in C++? I.e.: this function does not read from anything other than it's arguments this function does not write to anything; it only returns the return value

    Read the article

  • Seg Fault with malloc'd pointers

    - by anon
    I'm making a thread class to use as a wrapper for pthreads. I have a Queue class to use as a queue, but I'm having trouble with it. It seems to allocate and fill the queue struct fine, but when I try to get the data from it, it Seg. faults. http://pastebin.com/Bquqzxt0 (the printf's are for debugging, both throw seg faults) edit: the queue is stored in a dynamically allocated "struct queueset" array as a pointer to the data and an index for the data

    Read the article

< Previous Page | 381 382 383 384 385 386 387 388 389 390 391 392  | Next Page >