java - How to dynamically change the text box value according to the recently selected spinner value? -


here screenshot ...my changes in spinner value reflects after 2 swipes i have app 10 screens , have 1 spinner in main activity , textbox in fragment .i want display selected spinner value in textbox .

i wrote code display selected spinner value in text box , become stable throughout screens.but don't know how dynamically change text box value according selected spinner value. (before downvoting kindly suggest me solutions)

here code spinner value 

string pos = (string) spinner.getselecteditem();         sharedpreferences sharedpref = getsharedpreferences("mode", activity.mode_private);         sharedpreferences.editor prefeditor = sharedpref.edit();         prefeditor.putstring("userchoicemode", pos);         prefeditor.commit();

here code retrieve it

textview modeselect = (textview) view.findviewbyid(r.id.pass);          sharedpreferences sharedpref = this.getactivity().getsharedpreferences("mode", activity.mode_private);         string = sharedpref.getstring("userchoicemode",selected);          modeselect.settext("" + get);

call below method

spinner.setonitemselectedlistener(new adapterview.onitemselectedlistener() {     @override     public void onitemselected(adapterview<?> parent, view view, int position, long id) {        string text=spinner.getselecteditem().tostring();        txtview.settext(text);                     }             }              @override             public void onnothingselected(adapterview<?> parent) {              }         });

this above method calls when list set spinner , whenever user selects item spinner, can spinner value button click calling getselecteditem() or if u want text when user selects item spinner have call above override method


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