commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From bugzi...@apache.org
Subject DO NOT REPLY [Bug 19371] New: - [fileupload] findSeparator should use a fast string search algorithm
Date Sun, 27 Apr 2003 18:37:26 GMT
DO NOT REPLY TO THIS EMAIL, BUT PLEASE POST YOUR BUG 
RELATED COMMENTS THROUGH THE WEB INTERFACE AVAILABLE AT
<http://nagoya.apache.org/bugzilla/show_bug.cgi?id=19371>.
ANY REPLY MADE TO THIS MESSAGE WILL NOT BE COLLECTED AND 
INSERTED IN THE BUG DATABASE.

http://nagoya.apache.org/bugzilla/show_bug.cgi?id=19371

[fileupload] findSeparator should use a fast string search algorithm

           Summary: [fileupload] findSeparator should use a fast string
                    search algorithm
           Product: Commons
           Version: 1.0 Beta 1
          Platform: All
        OS/Version: Windows NT/2K
            Status: NEW
          Severity: Normal
          Priority: Other
         Component: File Upload
        AssignedTo: commons-dev@jakarta.apache.org
        ReportedBy: thierry.deleeuw@advalvas.be


Currently the findSeparator() of MutlipartStream scans the stream by steps of 1 
byte. Using an optimized method could use steps of n bytes (where n is the 
length of the string searched).

An easy method would be to search for '-' using steps of the length of the '-' 
separator line then ensure when we find one, we go back and forth to ensure 
this is a valid separator. 

We could also use Boyer-Moore implementation.

For other algorithms, you can refer to http://www-igm.univ-
mlv.fr/~lecroq/string/

---------------------------------------------------------------------
To unsubscribe, e-mail: commons-dev-unsubscribe@jakarta.apache.org
For additional commands, e-mail: commons-dev-help@jakarta.apache.org


Mime
View raw message