Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
W
webgl25
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
RIFI Zaynab
webgl25
Commits
df972978
Commit
df972978
authored
4 months ago
by
Nguyen Quang-Liem
Browse files
Options
Downloads
Patches
Plain Diff
Upload New File
parent
43d67cdb
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
lib/sprintf.js
+134
-0
134 additions, 0 deletions
lib/sprintf.js
with
134 additions
and
0 deletions
lib/sprintf.js
0 → 100644
+
134
−
0
View file @
df972978
/*! sprintf.js | Copyright (c) 2007-2013 Alexandru Marasteanu <hello at alexei dot ro> | 3 clause BSD license */
(
function
(
ctx
)
{
var
sprintf
=
function
()
{
if
(
!
sprintf
.
cache
.
hasOwnProperty
(
arguments
[
0
]))
{
sprintf
.
cache
[
arguments
[
0
]]
=
sprintf
.
parse
(
arguments
[
0
]);
}
return
sprintf
.
format
.
call
(
null
,
sprintf
.
cache
[
arguments
[
0
]],
arguments
);
};
sprintf
.
format
=
function
(
parse_tree
,
argv
)
{
var
cursor
=
1
,
tree_length
=
parse_tree
.
length
,
node_type
=
''
,
arg
,
output
=
[],
i
,
k
,
match
,
pad
,
pad_character
,
pad_length
;
for
(
i
=
0
;
i
<
tree_length
;
i
++
)
{
node_type
=
get_type
(
parse_tree
[
i
]);
if
(
node_type
===
'
string
'
)
{
output
.
push
(
parse_tree
[
i
]);
}
else
if
(
node_type
===
'
array
'
)
{
match
=
parse_tree
[
i
];
// convenience purposes only
if
(
match
[
2
])
{
// keyword argument
arg
=
argv
[
cursor
];
for
(
k
=
0
;
k
<
match
[
2
].
length
;
k
++
)
{
if
(
!
arg
.
hasOwnProperty
(
match
[
2
][
k
]))
{
throw
(
sprintf
(
'
[sprintf] property "%s" does not exist
'
,
match
[
2
][
k
]));
}
arg
=
arg
[
match
[
2
][
k
]];
}
}
else
if
(
match
[
1
])
{
// positional argument (explicit)
arg
=
argv
[
match
[
1
]];
}
else
{
// positional argument (implicit)
arg
=
argv
[
cursor
++
];
}
if
(
/
[^
s
]
/
.
test
(
match
[
8
])
&&
(
get_type
(
arg
)
!=
'
number
'
))
{
throw
(
sprintf
(
'
[sprintf] expecting number but found %s
'
,
get_type
(
arg
)));
}
switch
(
match
[
8
])
{
case
'
b
'
:
arg
=
arg
.
toString
(
2
);
break
;
case
'
c
'
:
arg
=
String
.
fromCharCode
(
arg
);
break
;
case
'
d
'
:
arg
=
parseInt
(
arg
,
10
);
break
;
case
'
e
'
:
arg
=
match
[
7
]
?
arg
.
toExponential
(
match
[
7
])
:
arg
.
toExponential
();
break
;
case
'
f
'
:
arg
=
match
[
7
]
?
parseFloat
(
arg
).
toFixed
(
match
[
7
])
:
parseFloat
(
arg
);
break
;
case
'
o
'
:
arg
=
arg
.
toString
(
8
);
break
;
case
'
s
'
:
arg
=
((
arg
=
String
(
arg
))
&&
match
[
7
]
?
arg
.
substring
(
0
,
match
[
7
])
:
arg
);
break
;
case
'
u
'
:
arg
=
arg
>>>
0
;
break
;
case
'
x
'
:
arg
=
arg
.
toString
(
16
);
break
;
case
'
X
'
:
arg
=
arg
.
toString
(
16
).
toUpperCase
();
break
;
}
arg
=
(
/
[
def
]
/
.
test
(
match
[
8
])
&&
match
[
3
]
&&
arg
>=
0
?
'
+
'
+
arg
:
arg
);
pad_character
=
match
[
4
]
?
match
[
4
]
==
'
0
'
?
'
0
'
:
match
[
4
].
charAt
(
1
)
:
'
'
;
pad_length
=
match
[
6
]
-
String
(
arg
).
length
;
pad
=
match
[
6
]
?
str_repeat
(
pad_character
,
pad_length
)
:
''
;
output
.
push
(
match
[
5
]
?
arg
+
pad
:
pad
+
arg
);
}
}
return
output
.
join
(
''
);
};
sprintf
.
cache
=
{};
sprintf
.
parse
=
function
(
fmt
)
{
var
_fmt
=
fmt
,
match
=
[],
parse_tree
=
[],
arg_names
=
0
;
while
(
_fmt
)
{
if
((
match
=
/^
[^\x
25
]
+/
.
exec
(
_fmt
))
!==
null
)
{
parse_tree
.
push
(
match
[
0
]);
}
else
if
((
match
=
/^
\x
25
{2}
/
.
exec
(
_fmt
))
!==
null
)
{
parse_tree
.
push
(
'
%
'
);
}
else
if
((
match
=
/^
\x
25
(?:([
1-9
]\d
*
)\$
|
\(([^\)]
+
)\))?(\+)?(
0|'
[^
$
])?(
-
)?(\d
+
)?(?:\.(\d
+
))?([
b-fosuxX
])
/
.
exec
(
_fmt
))
!==
null
)
{
if
(
match
[
2
])
{
arg_names
|=
1
;
var
field_list
=
[],
replacement_field
=
match
[
2
],
field_match
=
[];
if
((
field_match
=
/^
([
a-z_
][
a-z_
\d]
*
)
/i
.
exec
(
replacement_field
))
!==
null
)
{
field_list
.
push
(
field_match
[
1
]);
while
((
replacement_field
=
replacement_field
.
substring
(
field_match
[
0
].
length
))
!==
''
)
{
if
((
field_match
=
/^
\.([
a-z_
][
a-z_
\d]
*
)
/i
.
exec
(
replacement_field
))
!==
null
)
{
field_list
.
push
(
field_match
[
1
]);
}
else
if
((
field_match
=
/^
\[(\d
+
)\]
/
.
exec
(
replacement_field
))
!==
null
)
{
field_list
.
push
(
field_match
[
1
]);
}
else
{
throw
(
'
[sprintf] huh?
'
);
}
}
}
else
{
throw
(
'
[sprintf] huh?
'
);
}
match
[
2
]
=
field_list
;
}
else
{
arg_names
|=
2
;
}
if
(
arg_names
===
3
)
{
throw
(
'
[sprintf] mixing positional and named placeholders is not (yet) supported
'
);
}
parse_tree
.
push
(
match
);
}
else
{
throw
(
'
[sprintf] huh?
'
);
}
_fmt
=
_fmt
.
substring
(
match
[
0
].
length
);
}
return
parse_tree
;
};
var
vsprintf
=
function
(
fmt
,
argv
,
_argv
)
{
_argv
=
argv
.
slice
(
0
);
_argv
.
splice
(
0
,
0
,
fmt
);
return
sprintf
.
apply
(
null
,
_argv
);
};
/**
* helpers
*/
function
get_type
(
variable
)
{
return
Object
.
prototype
.
toString
.
call
(
variable
).
slice
(
8
,
-
1
).
toLowerCase
();
}
function
str_repeat
(
input
,
multiplier
)
{
for
(
var
output
=
[];
multiplier
>
0
;
output
[
--
multiplier
]
=
input
)
{
/* do nothing */
}
return
output
.
join
(
''
);
}
/**
* export to either browser or node.js
*/
ctx
.
sprintf
=
sprintf
;
ctx
.
vsprintf
=
vsprintf
;
})(
typeof
exports
!=
"
undefined
"
?
exports
:
window
);
\ No newline at end of file
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment