java - Selenium webdriver wait, Element not clickable exception -


i using selenium webdriver chrome. testing web application lot of ajax contents after login application take seconds load ajax content in home page.

i've used explicit wait after login wait until finding element. fails mostly. i've given 25 seconds wait fails after 4 seconds of wait . error ,...

unknown error: element <a href="/ls/create_new" class="ajax adddashbutton haslink">...</a> not clickable @ point (144, 223).

other element receive click: (session info: chrome=60.0.3112.78) (

my code ..

public class login {     webdriver driver;    @test   public void f() {        system.setproperty("webdriver.chrome.driver", "filepath/chromedriver");       driver = new chromedriver();   driver.get("url");   driver.manage().window().maximize();        driver.findelement(by.name("username")).sendkeys("username");       driver.findelement(by.name("password")).sendkeys("password");       driver.findelement(by.classname("login")).click();        webdriverwait wait = new webdriverwait(driver, 25);        wait.until(expectedconditions.presenceofelementlocated(by.linktext("create new app")));       driver.findelement(by.linktext("create new app")).click();   } }

this part of code ..what correct way use webdriver wait. ty

intead of using presenceofelementlocated, try once visibilityofelementlocated .

  • visibilityofelementlocated: checks element should visible , present.
  • presenceofelementlocated: checks element present in dom or not.

for more information use can check below link- what exact difference between "expectedconditions.visibilityofelementlocated" , "expectedconditions.presenceofelementlocated"


Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more