Search Results

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

Page 210/464 | < Previous Page | 206 207 208 209 210 211 212 213 214 215 216 217  | Next Page >

  • find and replace tokens in javascript

    - by Sourabh
    Hello, I have to do something like this string = " this is a good example to show" search = array {this,good,show} find and replace them with a token like string = " {1} is a {2} example to {3}" (order is intact) the string will undergo some processing and then string = " {1} is a {2} numbers to {3}" (order is intact) tokens are again replaced back to the string likem so that the string becomes string = " this is a good number to show" How should it be implemented so that the process is done at high performance ? Thanks in advance.

    Read the article

  • Application Profiling: Memory Usage

    - by Abs
    Hello all, I have switched on the Codeigniter profile (very useful) and I have noticed that a page of mine shows the memory used as: 2,405,496 bytes That's ~2MB and it's for one request - does it mean if 1000 users accessed this page at the same time, memory usage will be 2GB? Have I got my maths wrong or is there more to this than just multiplying two numbers? Thanks all for any help

    Read the article

  • How can I multiply each item in an array easily with PHP?

    - by Henry
    I have an array called $times. It is a list of small numbers (15,14,11,9,3,2). These will be user submitted and are supposed to be minutes. As PHP time works on seconds, I would like to multiply each element of my array by 60. I've been playing around with array_walk and array_map but I can't get those working :S Thanks.

    Read the article

  • Creating a unique URL safe hash

    - by Ben Foster
    I want to hash/encode a unique integer (database ID) to create a similarly unique string. It needs to meet the following requirements: Must start with a letter or number, and can contain only letters and numbers. All letters in a container name must be lowercase. Must be from 3 through 63 characters long (although the shorter the better) The result does not need to be reversible, just repeatable - so a 1-way hash would be fine.

    Read the article

  • Dedicating all processor power to a task

    - by Yktula
    Let's say we have a very processor-intensive task at hand which could be effectively parallelized. How can we dedicate all or almost all available processor power to performing that task? The task could be a variety of things, and iterative Fibonacci number generation that saves recorded numbers would be just one example.

    Read the article

  • C++ program to calculate large factorials

    - by xbonez
    How can I write a c++ program to calculate large factorials. Example, if I want to calculate (100!) / (99!), we know the answer is 100, but if i calculate the factorials of the numerator and denominator individually, both the numbers are gigantically large.

    Read the article

  • Rows and Column of Excel File

    - by Mark
    It is possible to write a code that specifying the rows and column of spread sheet in terms of NUMBERS and NOT LIKE (B2:D6) Example: excelSheet.Range("B2:D6").Interior.Color = RGB(100, 100, 255) instead of B2 and D6 I want to write 5 rows and 3 column.. It is posible to write in vb.net 2003 code?

    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

  • Little CSS problem with Auto height and nested div's

    - by GeekDrop.com
    So I'm finally learning my way around CSS more and have run into a small problem. I have a container div, with a few divs inside of it, one of them is a bit if text (which can be a random height) and an image that will have a MAX height of 200px. I am using a dotted/colored background behind them that needs to auto expand to the height of whichever is the tallest, either the text or the image. Right now when i use height:auto on the container div it works perfect for the random height text: Example Screenshot But it's only adjusting according to the text's height; if the image is taller than the text, the image overflows the bottom of the background dotted/colored box. Example Screenshot The CSS I'm using currently is this: h1 div#like_detailed { margin: 0; font-size: 1.1em; width: 700px; } #details-image img { border: none; clear: left; float: right; margin: -45px 0 0 0; max-height: 200px; padding: 0 7px 0 10px; } #deets-container { background-color: #FEF; border: #190AE7 1px dotted; height: auto; margin-top: 0; margin-bottom: 30px; padding-top: 10px; padding-right: 10px; padding-left: 10px; padding-bottom: 0; } And the HTML for it is this: <div id="deets-container" class="rounded"> <!-- Button --> <div class="likebtnframe">(some code)</div> <!-- Button --> <div class="tweetbtnframe">(some code)</div> <!-- Button --> <ul id="share"> <li><a name="share">(some code)</a></li> </ul> <!-- Submitted By --> <div class="submitter_detailed"><span class="submitter-color smalltext">(some code)</span> (some code)</div> <!-- Image --> <div id="**details-image**">(some code)</div> <!-- Like / Quote --> <h1 id="**like_detailed**">(some code)</h1> </div> I have a feeling this is pretty easy but I'm running out of time to sort it out on my own. Anyone?

    Read the article

  • Definition of Connect, Processing, Waiting in apache bench.

    - by rpatel
    When I run apache bench I get results like: Command: abs.exe -v 3 -n 10 -c 1 https://mysite Connection Times (ms) min mean[+/-sd] median max Connect: 203 213 8.1 219 219 Processing: 78 177 88.1 172 359 Waiting: 78 169 84.6 156 344 Total: 281 389 86.7 391 563 I can't seem to find the definition of Connect, Processing and Waiting. What do those numbers mean?

    Read the article

  • Using functions like formulas in Excel

    - by Arlen Beiler
    I am trying to use a formula to get a letter of the alphabet. Formula: =Keytable(RANDOM,ROW()) Function: Function KeyTable(seed As Long, position As Long) As String Dim i As Long Stop Dim calpha(1 To 26) As String Dim alpha(1 To 26) As String For i = 1 To 26 alpha(i) = Chr(i + UPPER_CASE - 1) Next i For i = 1 To 26 calpha(i) = alpha(seed Mod 27 - i) Next i Stop KeyTable = calpha(position) End Function Result: #Value! When I step through the function, it never gets to the second stop.

    Read the article

  • Can I use a binary literal in C or C++?

    - by hamza
    I need to work with a binary number. I tried writing: const x = 00010000 ; But it didn't work. I know that I can use an hexadecimal number that has the same value as 00010000 but I want to know if there is a type in C++ for binary numbers & if there isn't, is there another solution for my problem?

    Read the article

  • c program tringle

    - by Johnathon
    C program that accepts three integer values from the user representing the three sides of a triangle. echo whether the 3 numbers makes a equilateral, scalene or isosceles triangle.

    Read the article

  • Should I merge .pbxproj files with git using merge=union?

    - by Ortwin Gentz
    I'm wondering whether the merge=union option in .gitattributes makes sense for .pbxproj files. The manpage states for this option: Run 3-way file level merge for text files, but take lines from both versions, instead of leaving conflict markers. This tends to leave the added lines in the resulting file in random order and the user should verify the result. Normally, this should be fine for the 90% case of adding files to the project. Does anybody have experience with this?

    Read the article

  • Does the usage of interfaces slow down programs?

    - by Olga
    Is it true that interfaces slow down programs? I have heard that this is the case because during running time each during each usage of an object implementing this interface the decision has to be made which class implementing the interface this object belongs to. I am especially interested in an answer for C++, but also in general. And if this is true, some numbers would be helpful, too. Thank you very much!

    Read the article

  • a console code editor with CUA (ctrl-x ctrl-v ...) key bindings (unlike vi)

    - by clyfe
    I'm searching for a console code editor with CUA key bindings (ctrl-x c v etc.) Right now i'm toying mcedit but i don't really like it. My desired features are: * be fast * CUA key bindings (ctrl-x c v etc.) * toggle show line numbers * find/replace/goto line * bind custom keys to action( ctrl-shift-arrowdown to double the curent line etc.) * nice simple vi-like interface (no pointless menus) * be able to programatically extend it ... etc.

    Read the article

  • How to get unique values when using a UNION mysql query

    - by Roland
    I have 2 sql queries that return results, both contain a contract number, now I want to get the unique values of contract numbers HEre's the query (SELECT contractno, dsignoff FROM campaigns WHERE clientid = 20010490 AND contractno != '' GROUP BY contractno,dsignoff) UNION (SELECT id AS contractno,signoffdate AS dsignoff FROM contract_details WHERE clientid = 20010490) So for example, if the first query before the union returns two results with contract no 10, and the sql query after the union also returns 10, then we have 3 rows in total, however because contractno of all three rows is 10, I need to have only one row returned, Is this possible?

    Read the article

  • Avoiding explicit recursion in Haskell

    - by Travis Brown
    The following simple function applies a given monadic function iteratively until it hits a Nothing, at which point it returns the last non-Nothing value. It does what I need, and I understand how it works. lastJustM :: (Monad m) => (a -> m (Maybe a)) -> a -> m a lastJustM g x = g x >>= maybe (return x) (lastJustM g) As part of my self-education in Haskell I'm trying to avoid explicit recursion (or at least understand how to) whenever I can. It seems like there should be a simple non-explicitly recursive solution in this case, but I'm having trouble figuring it out. I don't want something like a monadic version of takeWhile, since it could be expensive to collect all the pre-Nothing values, and I don't care about them anyway. I checked Hoogle for the signature and nothing shows up. The m (Maybe a) bit makes me think a monad transformer might be useful here, but I don't really have the intuitions I'd need to come up with the details (yet). It's probably either embarrassingly easy to do this or embarrassingly easy to see why it can't or shouldn't be done, but this wouldn't be the first time I've used self-embarrassment as a pedagogical strategy. Background: Here's a simplified working example for context: suppose we're interested in random walks in the unit square, but we only care about points of exit. We have the following step function: randomStep :: (Floating a, Ord a, Random a) => a -> (a, a) -> State StdGen (Maybe (a, a)) randomStep s (x, y) = do (a, gen') <- randomR (0, 2 * pi) <$> get put gen' let (x', y') = (x + s * cos a, y + s * sin a) if x' < 0 || x' > 1 || y' < 0 || y' > 1 then return Nothing else return $ Just (x', y') Something like evalState (lastJustM (randomStep 0.01) (0.5, 0.5)) <$> newStdGen will give us a new data point.

    Read the article

< Previous Page | 206 207 208 209 210 211 212 213 214 215 216 217  | Next Page >