Search Results

Search found 53464 results on 2139 pages for 'find and replace'.

Page 121/2139 | < Previous Page | 117 118 119 120 121 122 123 124 125 126 127 128  | Next Page >

• Watin ContainsText method fails to find text in FireFox

  - by alonp

  The ContainsText method finds the text only in specific area in the html but fails to find id in other parts of the page. The text that located under 'div id="content"' can be found But the text in other area of the html is not found (f.e 'form id="aspnetForm"') Browser b = new FireFox("http://localhost:8668/login.aspx"); b.Button("login.login.button")).Click(); bool blah = b.ContainsText("Hello"); I'm using the latest watin release. The issue is reproduced with FF3.0, FF3.5 and FF3.6 In IE it's working fine for the tested text.

  Read the article

• Find if id of a link equals id of parent container

  - by Robert Lawson

  Hi guys needing a bit of help. I am creating a one page personal site. Each section has a menu in it to jump to another section, however i want to have a class added to menu for the current section: i.e. if you are in about the about link would have a class 'current'. This is how it looks. <section id="about"> <nav> <li><a href="#" id ="about">About</a></li> <li><a href="#" id ="contact">About</a></li> <li><a href="#" id ="blog">About</a></li> </nav> New to jquery so i am struggling to find out how to do this. Any help will be greatly appreciated. Thanks

  Read the article

• Find order of data inside an array

  - by user271619

  I have a simple array of stuff: $array = array("apples","oranges","strawberries"); I am trying to find the order of the stuff inside the array. (sometimes the order changes, and so do the items) I'm expecting to get something like this: "apples" = 0, "oranges = 1, "strawberries = 2 The end result has something to do with database sorting. Something like this, inside a foreach loop: UPDATE tbl SET sortorder = $neworder WHERE fruit = '$fruitname' The $neworder variable would be populated with the new order, inside the array. While the $fruit variable comes from the item inside the array.

  Read the article

• Passing null as a param for replace() in javascript behaving weird?

  - by Babiker

  I have the follwing jQuery: $("#textArea").keyup(function(){ var textAreaValue = $("textArea"); if(!textArea.value.indexOf("some string")){ textArea.value = textArea.value.replace("some string",null); alert("It was there!"); } }); Is it normal for element.value.replace("some string",null); to replace "some string" with "null"as a string? And if normal can you please explain why? I have tested it with element.value.replace("some string",""), and that works fine, so what would be the difference between null and ""? Thanks in advance.

  Read the article

• Find point which sum of distances to set of other points is minimal

  - by Pawel Markowski

  I have one set (X) of points (not very big let's say 1-20 points) and the second (Y), much larger set of points. I need to choose some point from Y which sum of distances to all points from X is minimal. I came up with an idea that I would treat X as a vertices of a polygon and find centroid of this polygon, and then I will choose a point from Y nearest to the centroid. But I'm not sure whether centroid minimizes sum of its distances to the vertices of polygon, so I'm not sure whether this is a good way? Is there any algorithm for solving this problem? Points are defined by geographical coordinates.

  Read the article

• Efficient way to find node set having relationships to given nodes using neo4j

  - by Jonas

  Is there an efficient way with given two nodes to find a set of their common nodes (with defined relationships). For example, having nodes A1, B1, C1-C4 connected with relationships x and y: A1 --x--> C1 A1 --x--> C2 A1 --x--> C3 B1 --y--> C2 B1 --y--> C3 B1 --y--> C4 a common node set for A1(x) and B1(y) would be [C2, C3].

  Read the article

• ghc can't find my cabal installed packages

  - by nont

  I've installed ghc 6.12.3, and then the Haskell Platform. I'm trying to compile a test program: $ ghc test.hs test.hs:3:0: Failed to load interface for `Bindings': Use -v to see a list of the files searched for. so, naturally, I do cabal install Bindings Which works fine, and places the package in ~/.cabal/lib/bindings-0.1.2 The problem is, that when I go to compile again with ghc, it still doesn't find the package I've installed with cabal. compiling in verbose mode gives: ghc -v test.hs Using binary package database: /home/ludflu/ghc/lib/ghc-6.12.3/package.conf.d/package.cache Using binary package database: /home/ludflu/.ghc/x86_64-linux 6.12.3/package.conf.d/package.cache As suggested by another stackoverflow user, I tried: ghc-pkg describe rts > rts.pkg vi rts.pkg # add the /home/ludflu/.cabal/lib to `library-dirs` field ghc-pkg update rts.pkg But to no avail. How to I add the .cabal to the list of package directories to search? Thank you!

  Read the article

• why does .replace method use forward slash characters to enclose the first argument?

  - by Phillip Dodd

  I am working through a book about Javascript and have encountered the following example of code designed to replace the value of the class attribute of a table header HTML element: th.className = th.className.replace(/asc/,"dsc"); th.className = th.className.replace(/dsc/,"asc"); Why is the first parameter of .replace, the current value of th.className, enclosed in forward slashes instead of quotation marks? Why not use quotation marks to enclose both parameters, not just the second one? Thank you in advance for any help given. First time posting, apologies if I duplicated a question despite searching the site before posting.

  Read the article

• How do I find the largest factor of an integer in mysql

  - by Bill H

  I am trying to write a select query that will dynamically determine the minimum number of items that can be packaged together. I am having trouble with one part of the query. ... CASE WHEN (pid.product_id) THEN 1 WHEN ((p.case_pack = p.inner_pack) AND (p.inner_pack % 11 = 0)) THEN CEILING(p.inner_pack / 11) WHEN ((p.case_pack = p.inner_pack) AND (p.inner_pack % 7 = 0)) THEN CEILING(p.inner_pack / 7) WHEN ((p.case_pack = p.inner_pack) AND (p.inner_pack % 6 = 0)) THEN CEILING(p.inner_pack / 6) WHEN ((p.case_pack = p.inner_pack) AND (p.inner_pack % 5 = 0)) THEN CEILING(p.inner_pack / 5) WHEN ((p.case_pack = p.inner_pack) AND (p.inner_pack % 4 = 0)) THEN CEILING(p.inner_pack / 4) WHEN ((p.case_pack = p.inner_pack) AND (p.inner_pack % 3 = 0)) THEN CEILING(p.inner_pack / 3) WHEN ((p.case_pack = p.inner_pack) AND (p.inner_pack % 2 = 0)) THEN CEILING(p.inner_pack / 2) ELSE p.inner_pack END AS min_pack ... What I want to do is find the largest factorial of an integer (p.inner_pack) that is under 12. Is there a better way to do this in mysql?

  Read the article

• Find all paths from root to leaves of tree in Scheme

  - by grifaton

  Given a tree, I want to find the paths from the root to each leaf. So, for this tree: D / B / \ A E \ C-F-G has the following paths from root (A) to leaves (D, E, G): (A B D), (A B E), (A C F G) If I represent the tree above as (A (B D E) (C (F G))) then the function g does the trick: (define (g tree) (cond ((empty? tree) '()) ((pair? tree) (map (lambda (path) (if (pair? path) (cons (car tree) path) (cons (car tree) (list path)))) (map2 g (cdr tree)))) (else (list tree)))) (define (map2 fn lst) (if (empty? lst) '() (append (fn (car lst)) (map2 fn (cdr lst))))) But this looks all wrong. I've not had to do this kind of thinking for a while, but I feel there should be a neater way of doing it. Any ideas for a better solution (in any language) would be appreciated.

  Read the article

• What's the best way to replace remote.origin.url in Git?

  - by suzukimilanpaak

  I'm new to Git. Let's say Alice and Bob had been developing their project by using two Git repositories for each. And, Alice at certain times want to set up a new repository to manage their common progress. Do you think what is the best way to replace remote.origin.url in the configuration of Git? to replace by git config --replace to create new repos by git clone MAIN_REPOS or any?

  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

• Find Loding performance of the Website

  - by pandora

  How to find the site performance, there is a tools like YSLOW, Speed traker in google that shows the speed of the website. I have done a php project on LMS with Zend Framework, Everything is in live. When user post contents for a subject that may be size 200K and submitted to the server takes too slow. Sometime server may get DOWN. I login to server(PUTTY) and checked i found that there is more resource occupied in my server. It uses full memory on the server. When i cleared the resource the site loads well. Site is in Dedicated server with 3 more domains with 4GB Ram. Because of this LMS website all the website gets down. I need to check what is wrong in my website. How do i Start?

  Read the article

• Find element using jQuery

  - by Frode Lillerud

  Hi, I've got some HTML that looks like this. <li class="t-item t-first"> <div class="t-top"> <span class="t-icon t-plus"></span> <span class="t-in">Offshore</span> </div> <input type="hidden" value="41393" name="itemValue" class="t-input"> </li> The HTML is a single item from a treeview created by Telerik. The real data here is that "Offshore" has an id of "41393". From the Telerik code I get the span-element with class"t-in", but I'm unable to get the ID-value from it. How can I use jQuery to find the value of the hidden input type?

  Read the article

• selenium cannot find element with class in IE

  - by Rob

  I'm using selenium_client with cucumber, webrat + IE As you'd expect, Firefox works fine. I've tried the following: selenium.is_visible("css=#flash .flash_notice") selenium.is_visible("xpath=//*[@id='flash']/*[@class='flash_notice]") selenium.is_visible("xpath=//*[@id='flash']/*[contains(@class,'flash_notice]')") both cannot find the element. I think it must be something to do with IE, looking closer at the html selenium returns from IE... It looks like this: <UL id=flash> <LI className=flash_notice>Deleted</LI> </UL> Notice IE returns the class attribute as className, is this confusing selenium? How can I get round this so that I can use the same statement for selenium using IE and Firefox Just to confuse us even more, this example works, confirming its something to do with checking the class attribute selenium.is_visible("xpath=//*[@id='flash']/*[. =\'Deleted\']")

  Read the article

• Creating a program to find longest path

  - by stef89

  Hi everyone, I'm fairly new to programming and I'm having a few problems. Basically I have to make a function that will find the lengths of all the paths through a network diagram. I've been working on this for hours but I can't seem to get anywhere. Using recursion I can navigate through every path but I'm just unsure as to how I should record the lengths of the paths. Any help would be greatly appreciated. Thanks! $dependencies = array("","","","1","3","4,2"); $durations = array("5","3","4","11","9","10"); function tracePath($path,$dependencies,$durations,$returnArray=array()) { if($dependencies[$path] != "") { $currentTaskDependencies = preg_split("/[\s]*[,][\s]*/", $dependencies[$path]); for($i=0;$i<count($currentTaskDependencies);$i++) { tracePath($currentTaskDependencies[$i]-1,$dependencies,$durations,$returnArray[$i]); } } return $returnArray; } tracePath(6,$dependencies,$durations);

  Read the article

• Code to find nth largest number in an array

  - by user136104

  I have written following code in perl #!/usr/bin/perl @array = (3,6,8,1,2); my $second_largest = 0; my $largest = 0; for (@array) { if($_ > $largest) { $second_largest = $largest; $largest = $_; } if($_ > $second_largest && $_ < $largest) { $second_largest = $_; } } print "Second largest::".$second_largest; print "largest::".$largest; But I need a general code to find out "Nth" largest and smallest number of an array Please help me

  Read the article

• Search a string to find which records in table are inside said string

  - by Improfane

  Hello, Say I have a string. Then I have a number of unique tokens or keywords, potentially a large number in a database. I want to search and find out which of these database strings are inside the string I provide (and get the IDs of them). Is there a way of using a query to search the provided string or must it be taken to application space? Am I right in thinking that this is not a 'full text search'? Would the best method be to insert it into the database to make it a full text search?

  Read the article

• Parallel Haskell in order to find the divisors of a huge number

  - by Dragno

  I have written the following program using Parallel Haskell to find the divisors of 1 billion. import Control.Parallel parfindDivisors :: Integer->[Integer] parfindDivisors n = f1 `par` (f2 `par` (f1 ++ f2)) where f1=filter g [1..(quot n 4)] f2=filter g [(quot n 4)+1..(quot n 2)] g z = n `rem` z == 0 main = print (parfindDivisors 1000000000) I've compiled the program with ghc -rtsopts -threaded findDivisors.hs and I run it with: findDivisors.exe +RTS -s -N2 -RTS I have found a 50% speedup compared to the simple version which is this: findDivisors :: Integer->[Integer] findDivisors n = filter g [1..(quot n 2)] where g z = n `rem` z == 0 My processor is a dual core 2 duo from Intel. I was wondering if there can be any improvement in above code. Because in the statistics that program prints says: Parallel GC work balance: 1.01 (16940708 / 16772868, ideal 2) and SPARKS: 2 (1 converted, 0 overflowed, 0 dud, 0 GC'd, 1 fizzled) What are these converted , overflowed , dud, GC'd, fizzled and how can help to improve the time.

  Read the article

• Is it possible to preg replace unique variables into a string?

  - by Scarface

  What I want to do is use preg replace to replace matches within a string with a varying replacement, and I was wondering if anyone knew if that is possible in php or at least achievable by some means. For example, a string has two matches, then those matches will be replaced with two different variables. What I want are replacements to each be a unique id and I cannot figure out how this could possibly work or if php could even do this. For example if the match is 'a' and there is a sentence, 'put a smile on a person' then one 'a' will be unique id 98aksd00 and the other will be 09alkj08. I am retrieving my comments from a database so the preg replace is happening within while ($row=mysql_fetch_assoc($query)){ //preg replace If anyone could provide any insight into this, I would really appreciate it

  Read the article

• How to find date ranges in records with consecutive dates and duplicate data

  - by alan s

  There's probably any easy solution for this, but I can't see it. I have a table with consecutive dates and often duplicate associated data for several of these consecutive dates: Date Col1 Col2 5/13/2010 1 A 5/14/2010 1 A 5/15/2010 2 B 5/16/2010 1 A 5/17/2010 1 A 5/18/2010 3 C 5/19/2010 3 C 5/20/2010 3 C Using MS T-SQL, I wish to find the start and end dates for each run of distinct Col1 and Col2 values: StartDate EndDate Col1 Col2 5/13/2010 5/14/2010 1 A 5/15/2010 5/15/2010 2 B 5/16/2010 5/17/2010 1 A 5/18/2010 5/20/2010 3 C Assumptions: There are never any missing dates. Col1 and Col2 are not null. Any ideas - preferably that don't use cursors? Many thanks, -alan

  Read the article

• How to find an array from parent array

  - by Me-and-Coding

  Hi, I am using below code to find an array inside parent array but it is not working that is retuning empty even though the specified key exits in the parent array. $cards_parent = $feedData['BetradarLivescoreData']['Sport']['Category']['Tournament']['Match']; $cards = array(); foreach($cards_parent as $key => $card) { if ($key === 'Cards') { $cards[] = $cards_parent[$key]; break; } } Do you know any array function that will search parent array for specified key and if found it will create an array starting from that key. Thanks

  Read the article

• how find teh objects between two labels in clearcase

  - by cheia

  Hi , I would like to get all sources/objects between two releases that happened within a month from clear case.I wrote the below command and it displays only less number of sources compared to the actual one. Please advive where I am wrong Cleartool find < -element "lbtype (Label b) && ! lbtype(label a) && ! -element (.../Branch1/latest)" -print where label a is the label of last month release lable b is the current label and brach1 is the branch from where all release happened Thanks in advance

  Read the article

• Find the "name" of a library (-L -l switches)

  - by sebastiangeiger

  Being fairly new to C++ I have a question bascially concerning the g++ compiler and especially the inclusion of libraries. Consider the following makefile: CPPFLAGS= -I libraries/boost_1_43_0-bin/include/ -I libraries/jpeg-8b-bin/include/ LDLIBS= libraries/jpeg-8b-bin/lib/libjpeg.a # LDLIBS= -L libraries/jpeg-8b-bin/lib -llibjpeg all: main main: main.o c++ -o main main.o $(LDLIBS) main.o: main.cpp c++ $(CPPFLAGS) -c main.cpp clean: rm -rf *.o main As you can see I declared the LDLIBS variable twice. My code is compiling and working if I use the makefile above. But if I deactivate the first LDLIBS entry and active the second one I get ld: library not found for -llibjpeg. I assume my libjpeg.a is just not called libjpeg but bears some different name. Is there a way to find out the name of a given "libraryfile" libsomething.a or libsomething.dyn?

  Read the article

• When can I find out the width/height of my view

  - by michael

  When is the earliest I can find out the actual (after layout) width/height of my view? I tried to do that @Override protected void onFinishInflate() { super.onFinishInflate(); w = getWidth(); h = getHeight(); } But it gives me 0. I have cases in which the view is invisible in the beginning and that programmically become visible. I think I can do that in onDraw(), but i dont' want to do that in everything I draw() something.

  Read the article

< Previous Page | 117 118 119 120 121 122 123 124 125 126 127 128  | Next Page >