excel - Converting a formula into vba -


i have sheet evaluation. in sheet, have 3 columns s, t, , u.

if column s contains invalid , if column t , u both filled, need filter complete row.

for this, tried below code. code works fine me. other colleagues, filter not work according condition.

column z considered helper column marks true, or false depending on condition. if both columns t , u filled , s invalid , marks false, , rest true

i have used option explicit above modules.

can suggest, how can overcome ? can 1 me code , without using formula

sub fc() dim totalrows long dim sformula  totalrows = range("a5").end(xldown).row   sheets("evaluation").range("z5:z" & totalrows)   ' if s5 not equal invalid , 1 of column t , u filled, activate autofilter     sformula = "=and(s5<>""invalid"",or(isblank(t5),isblank(u5)))"      .formula = sformula     .autofilter 26, true     .value = .value   end end sub

i tried out, , according experience there, following should work:

sub fc() dim totalrows long, sformula string sformula = "=and(s5<>""invalid"",or(isblank(t5),isblank(u5)))"  totalrows = range("a5").end(xldown).row   sheets("evaluation").range("z5:z" & totalrows)     .formula = sformula     .autofilter 1, true ' take first column of current range   end end sub

in version used .autofilter 26, true would work, had applied range [a1:z<no of rows>], since working on range [z1:z<no of rows>] have 1 column in range.

i don't know trying achieve .value = .value. far can see, replace current value current value, i. e. nothing useful, or missing something?


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