mirrors/phobos
1
0
Fork 0
mirror of https://github.com/dlang/phobos.git synced 2025-04-27 13:40:20 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions

Fix dscanner sugesstions in std/uri.d

Browse source
This commit is contained in:
Jack Stouffer 2017-03-13 14:22:55 -04:00
parent c35bab6c93
commit 2196247cb2
1 changed files with 5 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

10
std/uri.d
View file

@ -65,7 +65,7 @@ private immutable ubyte[128] uri_flags = // indexed by character
return uflags; return uflags;
})(); })();
private string URI_Encode(dstring string, uint unescapedSet) private string URI_Encode(dstring str, uint unescapedSet)
{ {
import core.exception : OutOfMemoryError; import core.exception : OutOfMemoryError;
import core.stdc.stdlib : alloca; import core.stdc.stdlib : alloca;
@ -81,7 +81,7 @@ private string URI_Encode(dstring string, uint unescapedSet)
uint Rlen; uint Rlen;
uint Rsize; // alloc'd size uint Rsize; // alloc'd size
auto len = string.length; immutable len = str.length;
R = buffer.ptr; R = buffer.ptr;
Rsize = buffer.length; Rsize = buffer.length;
@ -89,7 +89,7 @@ private string URI_Encode(dstring string, uint unescapedSet)
for (k = 0; k != len; k++) for (k = 0; k != len; k++)
{ {
C = string[k]; C = str[k];
// if (C in unescapedSet) // if (C in unescapedSet)
if (C < uri_flags.length && uri_flags[C] & unescapedSet) if (C < uri_flags.length && uri_flags[C] & unescapedSet)
{ {
@ -209,7 +209,7 @@ if (isSomeChar!Char)
dchar* R; dchar* R;
uint Rlen; uint Rlen;
auto len = uri.length; immutable len = uri.length;
auto s = uri.ptr; auto s = uri.ptr;
// Preallocate result buffer R guaranteed to be large enough for result // Preallocate result buffer R guaranteed to be large enough for result
@ -290,7 +290,7 @@ if (isSomeChar!Char)
if (C < uri_flags.length && uri_flags[C] & reservedSet) if (C < uri_flags.length && uri_flags[C] & reservedSet)
{ {
// R ~= s[start .. k + 1]; // R ~= s[start .. k + 1];
int width = (k + 1) - start; immutable width = (k + 1) - start;
for (int ii = 0; ii < width; ii++) for (int ii = 0; ii < width; ii++)
R[Rlen + ii] = s[start + ii]; R[Rlen + ii] = s[start + ii];
Rlen += width; Rlen += width;