.net - C# listing directory via FTP receives dots only -


i try list files in 1 folder via ftp:

 ftpwebrequest reqftp;  //uri string - webhost.com/public_html/some_dir/myfolder  reqftp = (ftpwebrequest)ftpwebrequest.create(new uri("ftp://" + ftpserverip + "/" + remotedir + "/" + folder));  reqftp.usebinary = true;  reqftp.credentials = new networkcredential(ftpuserid, ftppassword);  reqftp.method = webrequestmethods.ftp.listdirectory;  reqftp.proxy = null;  reqftp.keepalive = false;  reqftp.usepassive = false;  reqftp.timeout = 300000;//wait 5 min   response = reqftp.getresponse();   reader = new streamreader(response.getresponsestream());  string line = reader.readline();    while (line != null) //line '.' here   {       if(line.length > 3)       {           line = line.split('/')[1];           result.append(line);           result.append("\n");           line = reader.readline();       }    }

the connection seems ok, response gets:

statusdescription 150 connecting port 50058\r\n welcomemessage 230 ok. current restricted directory /\r\n

but problem when read line single dot. while loop goes infinite.

i tried connect server , it's working fine. i'd appreciate advice.

the first entry in directory . = reference "this" directory.

and never passed read next entry within if block, never to.

the code should like:

while (line != null) {     if (line.length > 3)     {         line = line.split('/')[1];         result.append(line);         result.append("\n");     }      line = reader.readline(); }

though line.length > 3 condition seems suspicious on own. that's different question.


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