Search Results

Search found 17972 results on 719 pages for 'always on'.

Page 246/719 | < Previous Page | 242 243 244 245 246 247 248 249 250 251 252 253  | Next Page >

  • VB.net SyncLock Object

    - by Budius
    I always seen on SyncLock examples people using Private Lock1 As New Object ' declaration SyncLock Lock1 ' usage but why? In my specific case I'm locking a Queue to avoid problems on mult-threading Enqueueing and Dequeueing my data. Can I lock the Queue object itself, like this? Private cmdQueue As New Queue(Of QueueItem) ' declaration SyncLock cmdQueue ' usage Any help appreciated. Thanks.

    Read the article

  • Perl, foreach order

    - by Mike
    Does Perl's foreach loop operator require that the list items be presented in order? For example my @a=(1,2,3); foreach my $item (@a) { print $item; } will always print 1 2 3? I suspect so, but I can't find it documented.

    Read the article

  • jQuery Validator - Dynamic Text

    - by James
    Adding a validator to my form: jQuery.validator.addMethod('whatever', function(val, el) { // whatever goes here }, 'A maximum of ' + $('#my_id_here').val() + ' categories can be selected.'); This doesn't fly. I always get undefined. Is this a good, simple way to do this? Thanks

    Read the article

  • How to use Split with jQuery?

    - by Matt
    I need to break apart a string that always looks like this: something -- something_else. I need to put "something_else" in another input field. Currently, this string example is being added to an HTML table row on the fly like this: tRow.append($('<td>').text($('[id$=txtEntry2]').val())); I figure "split" is the way to go but there is very little documentation that I can find yet.

    Read the article

  • C++ program infile won't open in xcode?

    - by ennuikiller
    Why does the c++ program produce the error shown? I'm especially confused since outfile opens without error yet infile displays the error? Both are defined in xcode exactly the same!! I've altering the "path type" setting without success. The open on infile always fails! Any suggestions would be very much appreciated!!

    Read the article

  • Jquery with call back functions

    - by pplegend
    Hi, i have one problem with the Jquery callback functions, here is the link: http://saveenergy.metropolia.fi/views/pihkapuisto/ as you can see, the first page works fine. but all the others are not fine. they always right side and the size is too small. anyone knows how to change the position and size, make it looks like the first one? thanks

    Read the article

  • new items on GRUB screen in ubuntu/linux

    - by artsince
    I regularly update my ubuntu (10.04), and new minor versions keep accumulating on the GRUB screen. Right now I have 5 different versions listed on the GRUB, even though I always select the latest version to work with. Am I supposed to do anything to get rid of the old version references? Do these old versions affect disk space/performance?

    Read the article

  • Is this safe? Is this OK to do in MYSQL?

    - by alex
    I have always done this: mysqldump -hlocalhost -uuser -ppass MYDATABASE > /home/f/db_backup/MYDATABASE.sql mysql -uuser -ppass MYDATABASE < MYDATABASE.sql But, if I do this instead...is this safe? Is this identical to the above??? mysqldump -hlocalhost -uuser -ppass MYDATABASE | gzip > /home/f/db_backup/MYDATABASE.sql.gz zcat MYDATABASE.sql.gz | mysql -uuser -ppass MYDATABASE

    Read the article

  • Python `if x is not None` or `if not x is None`?

    - by orokusaki
    I've always thought of the if not x is None version to be more clear, but Google's style guide implies (based on this excerpt) that they use if x is not None. Is there any minor performance difference (I'm assuming not), and is there any case where one really doesn't fit (making the other a clear winner for my convention)?* *I'm referring to any singleton, rather than just None. ...to compare singletons like None. Use is or is not.

    Read the article

  • Prevent ListBox scrolling to top when updated

    - by WDZ
    I'm trying to build a simple music player with a ListBox playlist. When adding audio files to the playlist, it first fills the ListBox with the filenames and then (on a separate thread) extracts the ID3 data and overwrites the filenames with the correct Artist - Title information (much like Winamp). But while the ListBox is being updated, it's unscrollable, as it always jumps to the top on every item overwrite. Any way to prevent this?

    Read the article

  • cx-freeze + linux + python 2.6 + wxpython

    - by avp
    Hi All, Not able to create standalone python binary package 1) The binary package works only on the machine on which it is build 2) There is always an error with respect console.py dependent on cx_freeze and wx libraries (.so files). 3) Tried the rpath trick suggested at this link http://wiki.wxpython.org/CreatingStandaloneExecutables 4) I have also experimented with GUI2exe , but still dependency problem exists. Please let me know if there is working python script to solve these dependence problem of cx_freeze and wx._core (.so) files. Thank you

    Read the article

  • Type-casting. C and C++

    - by thecoshman
    I always though that float var_a = 9.99; int var_b = (int)var_a; was they way to typecast in c++... But here it said that its not the proper C++ way, its the old C way. So I ask, What is the proper C++ way, and more importantly, how do they differ? the C method should still work though shouldn't it.

    Read the article

  • InternetCheckConnection in VB6 returning false

    - by user191582
    Hi all, Not a VB6 expert... Trying to come up with a VB6 test app that calls InternetCheckConnection. In my test app, InternetCheckConnection always returns false regardless of the URL I use. I copied and pasted this code from a larger spaghetti-code app, but in the spaghetti-code, InternetCheckConnection seems to work fine, returns true. Is there some other function I have to call first in order for InternetCheckConnection to work?

    Read the article

  • how to use sort function the same way as max or min in mathematica

    - by Qiang Li
    Please take a look at the following code: Sort[{1, y, x}, Greater] Max[{1, x, y}] x = 1 y = 2 Sort[{1, y, x}, Greater] Max[{1, x, y}] It is interesting to note that the first Sort always produce a definite result while the first Max does not, even when Greater is specified. Note I have not given any numerical values for x and y. Why is this and how can I have a Sort function behave the same way as the Max (or Min) function? Thanks!

    Read the article

  • Javascript match part of url, if statement based on result.

    - by nick
    Here is an example of the url i'm trying to match: http://store.mywebsite.com/folder-1/folder-2/item3423434.aspx What im trying to match is http: //store.mywebsite.com/folder-1 except that "folder-1" will always be a different value. I can't figure out how to write an if statement for this: Example (pseudo-code) if(url contains http://store.mywebsite.com/folder-1) do this else if (url contains http://store.mywebsite.com/folder-2) do something else etc

    Read the article

  • Performance impact using culture invariant resources

    - by Praveen S
    I would like to know the performance impact of using the culture invariant resources instead of culture specific ones. For example, we plan to deploy a website and not have any en-US resources. This is because our culture invariant resources are always identical to the en-US resources. Is this a good idea ? What are the cons?

    Read the article

  • Recurssion Question : Revision

    - by stan
    My slides say that A recurssive call should always be on a smaller data structure than the current one There must be a non recurssive option if the data structure is too small You need a wrapper method to make the recurssive method accessible Just reading this from the slides makes no sence, especially seeing as it was a topic from before christmas! Could anyone try and clear up what it means please? Thank you

    Read the article

< Previous Page | 242 243 244 245 246 247 248 249 250 251 252 253  | Next Page >