Search Results

Search found 11587 results on 464 pages for 'pseudo random numbers'.

Page 304/464 | < Previous Page | 300 301 302 303 304 305 306 307 308 309 310 311  | Next Page >

• How to file split at a line number

  - by superspace

  I want to split a 400k line long log file from a particular line number. For this question, lets make this an arbitrary number 300k. Is there a linux function that allows me to do this? I know split lets me split the file in equal parts either by size or line numbers but that's not what I want. I want to the first 300k in one file and the last 100k in the second file. Any help would be appreciated. Thanks!

  Read the article

• Surely there is a better grid than DataGrid for the .NET Compact Framework...

  - by PavelR

  Having spent a couple of days wrestling with DataGrid in .NET CF, especially controlling the look and feel, I'm looking for alternatives. I don't mind purchasing a solution. I'm looking for Redistributable to our enterprise customers. We control the hardware so it doesn't have to work perfectly on every device. Display strings and numbers in columns with headings. Scrollable, but no paging. Don't row editing. Need to add and delete rows. User re-sizable column widths, and a way to persist that. Work with .NET CF 2.0 or 3.5 on Windows CE 6.0 Any suggestions on grids or toolkits?

  Read the article

• Spider a Website and Return URLs Only

  - by Rob Wilkerson

  I'm not quite sure how best to define/articulate this, but I'm looking for a way to pseudo-spider a website. The key is that I don't actually want the content, but rather a simple list of URIs. I can get reasonably close to this idea with Wget using the --spider option, but when piping that output through a grep, I can't seem to find the right magic to make it work: wget --spider --force-html -r -l1 http://somesite.com | grep 'Saving to:' The grep filter seems to have absolutely no affect on the wget output. Have I got something wrong or is there another tool I should try that's more geared towards providing this kind of limited result set? Thanks. UPDATE So I just found out offline that, by default, wget writes to stderr. I missed that in the man pages (in fact, I still haven't found it if it's in there). Once I piped the return to stdout, I got closer to what I need: wget --spider --force-html -r -l1 http://somesite.com 2>&1 | grep 'Saving to:' I'd still be interested in other/better means for doing this kind of thing, if any exist.

  Read the article

• Caching issues with TDBadgedCell

  - by Wolfgang Schreurs

  This post is closely related to my previous post: http://stackoverflow.com/questions/2201256/tdbadgedcell-keeps-caching-the-badgenumber The "badge" from TDBadgedCell keeps caching the numbers. A very simple example is shown here: - (UITableViewCell *)tableView:(UITableView *)_tableView cellForRowAtIndexPath:(NSIndexPath *)indexPath { static NSString *CellIdentifier = @"Cell"; TDBadgedCell *cell = (TDBadgedCell *)[_tableView dequeueReusableCellWithIdentifier:CellIdentifier]; if (cell == nil) { cell = [[TDBadgedCell alloc] initWithStyle:UITableViewCellStyleSubtitle reuseIdentifier:CellIdentifier]; [cell setAccessoryType:UITableViewCellAccessoryDisclosureIndicator]; } [cell setBadgeColor:[UIColor blackColor]]; [cell setBadgeNumber:[indexPath row]]; [[cell textLabel] setText:[NSString stringWithFormat:%@"%d", [indexPath row]]]; return cell; } Anyone has any clue why this happens? The textLabel and detailTextLabel don't cache the data. Any additonal info would be welcome as well, as I seem to have a lot of issues with the caching of graphics in UITableViewCells. Any best practices or other useful information would be most welcome.

  Read the article

• Randomized experiments in R

  - by gd047

  Here is a simple randomized experiment. In the following code I calculate the p-value under the null hypothesis that two different fertilizers applied to tomato plants have no effect in plants yields. The first random sample (x) comes from plants where a standard fertilizer has been used, while an "improved" one has been used in the plants where the second sample (y) comes from. x <- c(11.4,25.3,29.9,16.5,21.1) y <- c(23.7,26.6,28.5,14.2,17.9,24.3) total <- c(x,y) first <- combn(total,length(x)) second <- apply(first,2,function(x) total[!total %in% x]) dif.treat <- apply(second,2,mean) - apply(first,2,mean) # the first element of dif.treat is the one that I'm interested in (p.value <- length(dif.treat[dif.treat >= dif.treat[1]]) / length(dif.treat)) Do you know of any R function that performs tests like this one?

  Read the article

• Parallel Assignment operator in Ruby

  - by Bragaadeesh

  Hi, I was going through an example from Programming in Ruby book. This is that example def fib_up_to(max) i1, i2 = 1, 1 # parallel assignment (i1 = 1 and i2 = 1) while i1 <= max yield i1 i1, i2 = i2, i1+i2 end end fib_up_to(100) {|f| print f, " " } The above program simply prints the fibonacci numbers upto 100. Thats fine. My question here is when i replace the parallel assignment with something like this, i1 = i2 i2 = i1+i2 I am not getting the desired output. My question here is, is it advisable to use parallel assignments? (I come from Java background and it feels really wierd to see this type of assignment) One more doubt is : Is parallel assignment an operator?? Thanks

  Read the article

• Chaning coding style due to Android GC performance, how far is too far?

  - by Benju

  I keep hearing that Android applications should try to limit the number of objects created in order to reduce the workload on the garbage collector. It makes sense that you may not want to created massive numbers of objects to track on a limited memory footprint, for example on a traditional server application created 100,000 objects within a few seconds would not be unheard of. The problem is how far should I take this? I've seen tons of examples of Android applications relying on static state in order supposedly "speed things up". Does increasing the number of instances that need to be garbage collected from dozens to hundreds really make that big of a difference? I can imagine changing my coding style to now created hundreds of thousands of objects like you might have on a full-blown Java-EE server but relying on a bunch of static state to (supposedly) reduce the number of objects to be garbage collected seems odd. How much is it really necessary to change your coding style in order to create performance Android apps?

  Read the article

• Enable Datepicker only when first field has a value

  - by Syed Abdul Rahman

  Right now, the End Date selection is disabled. I want to only enable this when a Start Date is selected. if( $('#datepicker1').val().length === 0) { $('#datepicker2').datepicker("disable"); } else { $('#datepicker2').datepicker("enable"); } This clearly does not work. If I insert value = 'random date' into my first input field, it works fine. I'm not too sure on how do this. Clearly not as easy as I had hoped. My other problem, or hope, is to disable the dates including and before the first selection. You know, pick Start Date, and every date before and said date for the next picker would be disabled. But that is a whole other problem.

  Read the article

• How do you solve this Haskell problem using a fold map and take?

  - by Linda Cohen

  Define a function replicate which given a list of numbers returns a list with each number duplicated its value. Use a fold, map, and take .. replicate [5,1,3,2,8,1,2] output: [5,5,5,5,5,1,3,3,3,2,2,8,8,8,8,8,8,8,8,1,2,2] I've figure this out using List comprehension and recursion: replicate2 [] = [] replicate2 (n:nn) = take n(repeat n) ++ replicate2 nn but how would you use fold and map to do this? so far I have: replicate n = map (foldl1 (take n(repeat n)) n) n which is obviously wrong, but I think I am close.. so any help would be nice, THANKS!

  Read the article

• How to make tag group with including predefined attributes, to wrap other things quickly?

  - by jitendra

  for example. if i want to quickly wrap anything by this in once. in dreamweaver or in any other free software where i can do this. I want to select this <p>anything can be here - content, other html tag etc.</p> and in one shot want to wrap inside 2 divs with predefined classes <div class="one"> <div class="two"> <p>anything can be here - content, other html tag etc.</p> </div> </div> I have work with large amount of code and need to wrap random things in Divs with defined attributes.

  Read the article

• Centralizing a floating element :(

  - by 2x2p1p

  Hi guys :| My "div" element have a relative width, it isn't absolute so I can't use exact numbers to centralize. A nice solution is to use "display: inline-block": body { text-align: center; } #myDiv { border: 1px solid black; display: inline-block; padding: 50px; } But this element NEEDS to float, I tried this: #myDiv { border: 1px solid black; display: inline-block; float: left; padding: 50px; } And this: #myDiv { border: 1px solid black; display: inline-block; padding: 50px; position: absolute; } Without any success, can somebody help me ? Thanks

  Read the article

• Limiting input to specified regexp with uppercase chars in IE

  - by pixelboy

  I'm trying to limit what our users will be able to type in inputs, using javascript/jquery. Problem is, I have to limit this to Uppercase chars only, and numbers. Here's what I coded previously : $(input).keydown(function(e){ if ($(input).attr("class")=="populationReference"){ var ValidPattern = /^[A-Z_0-9]*$/; var char = String.fromCharCode(e.charCode); if (!ValidPattern.test(char) && e.charCode!=0){ return false; e.preventDefault(); } } }); If Firefox supports charCode, IE doesn't. How then, could I test if the user is typing uppercase or lowercase characters ? Thanks for any help !

  Read the article

• Real life usage of the projective plane theory

  - by Elazar Leibovich

  I'm learning about the theory of the projective plane. Very generally speaking, it is an extension of the plane, which includes additional points which are defined as the intersection points of two parallel lines. In the projective plane, every two lines have an interesection point. Whether they're parallel or not. Every point in the projective plane can be represented by three numbers (you actually need less than that, but nevemind now). Is there any real life application which uses the projective plane? I can think that, for instance, a software which needs to find the intersections of a line, can benefit from always having an intersection point which might lead to simpler code, but is it really used?

  Read the article

• Simplest way to use isdigit and isalpha commands ?

  - by ZaZu

  Hello, Can anyone briefly explain how do these two commands work ? isdigit and isalpha .. Ofcourse I read online sources before asking the question, but unfortunately I tried them and didnt get them to work. What is the simplest way ? I know it gives back a value, so im assuming I can use it like this : if(isdigit(someinput)==1) return -1; Is that correct ? can I use this for any number ? Can I compare it with a float number ? Can I compare arrays ? Can I also use it when scanning documents or files ? For example, if I want to scanf a text file that has numbers and letters, and determine is what im scanning (isdigit) or (isalpha) ?? Thanks :)

  Read the article

• Beginner to RUBY - Array Question

  - by WANNABE

  a = [ 1, 3, 5, 7, 9 ] ? [1, 3, 5, 7, 9] a[2, 2] = ’cat’ ? [1, 3, "cat", 9] a[2, 0] = ’dog’ ? [1, 3, "dog", "cat", 9] a[1, 1] = [ 9, 8, 7 ] ? [1, 9, 8, 7, "dog", "cat", 9] a[0..3] = [] ? ["dog", "cat", 9] a[5..6] = 99, 98 ? ["dog", "cat", 9, nil, nil, 99, 98] I can understand how the last four amendments to this array work, but why do they use a[2, 2] = 'cat' and a[2,0] = 'dog' ??? What do the two numbers represent? Couldnt they just use a[2] = 'dog'?

  Read the article

• Unix: millionth number in the serie 2 3 4 6 9 13 19 28 42 63 ... ?

  - by HH

  It takes about minute to achieve 3000 in my comp but I need to know the millionth number in the serie. The definition is recursive so I cannot see any shortcuts except to calculate everything before the millionth number. How can you fast calculate millionth number in the serie? Serie Def n_{i+1} = \floor{ 3/2 * n_{i} } and n_{0}=2. Interestingly, only one site list the serie according to Goolge: this one. Too slow Bash code #!/bin/bash function serie { n=$( echo "3/2*$n" | bc -l | tr '\n' ' ' | sed -e 's@\\@@g' -e 's@ @@g' ); # bc gives \ at very large numbers, sed-tr for it n=$( echo $n/1 | bc ) #DUMMY FLOOR func } n=2 nth=1 while [ true ]; #$nth -lt 500 ]; do serie $n # n gets new value in the function throught global value echo $nth $n nth=$( echo $nth + 1 | bc ) #n++ done

  Read the article

• What's the best way to offer javascript embed that won't slow a page down?

  - by Shpigford

  I have a chunk of javascript that users can copy and paste to put on their sites. I'm currently using the following code (ala WEDJE) that allows the rest of the page to load even if my script is slow or not responding. <script type="text/javascript"> var number = "987654321"; var key = "123abc"; (function(){ document.write('<div id="ttp"></div>'); s=document.createElement('script'); s.type="text/javascript"; s.src="http://example.com/javascripts/embed.js?" + Math.random(); setTimeout("document.getElementById('ttp').appendChild(s);",1); })() </script> But that method is a few years old and so I wasn't sure if there was a more efficient way of doing the same thing that others have come up with.

  Read the article

• Only the last run in a for loop in Javascript works

  - by Mengfei Murphy

  Here is a for loop written by Javascript. It is trying to apply queries for websql. for (var i = 0; i < 10; i++){ db.transaction(function (tx){ tx.executeSql('INSERT INTO ProjSetsT (ProjID) VALUES (?);', [i]); }); } The attempt is obvious, I tried to add values "0, 1, 2, ... 9" into column ProjID in table ProjSetsT. It does not work. I only got the last element, i.e. "9" inserted, but not the first eight numbers. Is there any syntax mistakes?

  Read the article

• Avoiding a fork()/SIGCHLD race condition

  - by larry

  Please consider the following fork()/SIGCHLD pseudo-code. // main program excerpt for (;;) { if ( is_time_to_make_babies ) { pid = fork(); if (pid == -1) { /* fail */ } else if (pid == 0) { /* child stuff */ print "child started" exit } else { /* parent stuff */ print "parent forked new child ", pid children.add(pid); } } } // SIGCHLD handler sigchld_handler(signo) { while ( (pid = wait(status, WNOHANG)) > 0 ) { print "parent caught SIGCHLD from ", pid children.remove(pid); } } In the above example there's a race-condition. It's possible for "/* child stuff */" to finish before "/* parent stuff */" starts which can result in a child's pid being added to the list of children after it's exited, and never being removed. When the time comes for the app to close down, the parent will wait endlessly for the already-finished child to finish. One solution I can think of to counter this is to have two lists: started_children and finished_children. I'd add to started_children in the same place I'm adding to children now. But in the signal handler, instead of removing from children I'd add to finished_children. When the app closes down, the parent can simply wait until the difference between started_children and finished_children is zero. Another possible solution I can think of is using shared-memory, e.g. share the parent's list of children and let the children .add and .remove themselves? But I don't know too much about this. EDIT: Another possible solution, which was the first thing that came to mind, is to simply add a sleep(1) at the start of /* child stuff */ but that smells funny to me, which is why I left it out. I'm also not even sure it's a 100% fix. So, how would you correct this race-condition? And if there's a well-established recommended pattern for this, please let me know! Thanks.

  Read the article

• VS2005 project has dependency that is not built

  - by Eyal

  I have VS2005 solution that contains many projects and dependencies (some C++, some C#) - in the past it compiled successfully. when I rebuild all the solution it fails on a project claiming dll is missing (dll that was needed to built before according to dependency). the thing is that from time to time it fails on random project (not all the time the same project). I'm not sure it is meaningful but I see in output console Deleting intermediate and output files for project doesn't VS2005 go according to "Project Build Order" and ReBuild every project starting with its dependencies?

  Read the article

• Code/Approach Golf: Find row in text file with too many columns

  - by awshepard

  Given a text file that is supposed to contain 10 tab-delimited columns (i.e. 9 tabs), I'd like to find all rows that have more than 10 columns (more than 9 tabs). Each row ends with CR-LF. Assume nothing about the data, field widths, etc, other than the above. Comments regarding approach, and/or working code would be extremely appreciated. Bonus for printing line numbers of offending lines as well. Thanks in advance!

  Read the article

• Automatically determining the size of a UITableViewCell

  - by hanno

  I am trying to determine the size of a UITableCellView. The reason being that I am using one class for different orientations and devices. The cell contains one subview that is supposed to fill the entire cell. Right know I'm doing this in the UITableViewCell's init method: if (UI_USER_INTERFACE_IDIOM() == UIUserInterfaceIdiomPad){ //iPad subv = [[OrbitView alloc] initWithFrame:CGRectMake(52, 5, 660, 420) ]; }else{ //iPhone subv = [[OrbitView alloc] initWithFrame:CGRectMake(15, 5, 290, 200) ]; } Clearly, there must be a better way of doing this, without the magic numbers. How/Where should I set the frame of the subview in the UITableViewCell so that it fills the entire UITableViewCell?

  Read the article

• Stable Scala 2.8 plugin

  - by Felix

  Does anyone know if there exists a stable version of the Scala plugin for eclipse, running with Scala 2.8 (any version of scala 2.8...RC or beta or whatever). I like the fact that it compiles 10 times faster than the netbeans plugin, but it is very unstable, and auto-imports doesnt work. Also, sometimes it cant find classes when I hit "run", then I have to clean it again. This is with some random nightly build of the 2.8 eclipse scala plugin. Is there a stable version? If so, can you link me to it? Thanks in advance :)

  Read the article

• RegEx/Javascript validation: Don't allow comma as a valid character

  - by baldwingrand

  I'm doing Javascript validation on my number fields. I'm using RegEx to do this - first time RegEx user. I need the user to only enter numbers and decimals, but not commas. (i.e. 3600.00 is okay, but 3,600.00 is not). I can't figure out how to eliminate the commas as an accepted character. Any help is appreciated. Thanks! var filter = /^([0-9])/; if (!filter.test(txtItemAmount.value)) { msg += "Item amount must be a number.\n"; txtItemAmount.focus }

  Read the article

• Multiplying char and int together in C part 2

  - by teehoo

  If I do the following: int c0 = CHAR_MAX; //8 bit int c1 = CHAR_MAX; //8-bit int i = c0*c1; //store in 32-bit variable printf("%d\n", i); //prints 16129 We can see that there is no problem with to 8-bit numbers being multiplied together, and producing a 32-bit output. However, if I do int i0 = INT_MAX; //32-bit int i1 = INT_MAX; //32 bit variable long long int ll = i0*i1; //store in 64-bit variable printf("%lld\n", ll); //prints 1..overflow!! In this case, two 32-bit variables were multiplied together, overflowed, and then were assigned to the 64-bit variable. So why did this overflow happen when multiplying the ints, but not the chars? Is it dependent on the default word-size of my machine? (32-bits)

  Read the article

< Previous Page | 300 301 302 303 304 305 306 307 308 309 310 311  | Next Page >