mirror of
https://github.com/oven-sh/bun
synced 2026-02-14 21:01:52 +00:00
* fix valid status code range * update path * highwatermark option * throw DOMException * remove extra transpiler output * more transpiler tests * comment * get index not quickly * replace with `getDirectIndex` * update abort test * throw out of range status code * promisify test fix * move stdio test instance files * working crypto tests * allow duplicate set-cookie headers * different formatting * revert, fix will be in different pr * it is called * use min buffer size * fix url tests * null origin for other protocols * remove overload * add very large file test * await * coerce to int64 * 64 * no cast * add todo blob url tests * use `tryConvertToInt52`
195 lines
6.3 KiB
C++
195 lines
6.3 KiB
C++
/*
|
|
* Copyright (C) 2016 Apple Inc. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
|
|
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
|
|
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
|
|
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#include "URLSearchParams.h"
|
|
|
|
#include "DOMURL.h"
|
|
#include "wtf/URLParser.h"
|
|
#include "helpers.h"
|
|
#include "JSURLSearchParams.h"
|
|
|
|
namespace WebCore {
|
|
|
|
extern "C" JSC::EncodedJSValue URLSearchParams__create(JSDOMGlobalObject* globalObject, const ZigString* input)
|
|
{
|
|
String str = Zig::toString(*input);
|
|
auto result = URLSearchParams::create(str, nullptr);
|
|
return JSC::JSValue::encode(WebCore::toJSNewlyCreated(globalObject, globalObject, WTFMove(result)));
|
|
}
|
|
|
|
extern "C" WebCore::URLSearchParams* URLSearchParams__fromJS(JSC::EncodedJSValue value)
|
|
{
|
|
return WebCoreCast<WebCore::JSURLSearchParams, WebCore::URLSearchParams>(value);
|
|
}
|
|
|
|
// callback accepting a void* and a const ZigString*, returning void
|
|
typedef void (*URLSearchParams__toStringCallback)(void* ctx, const ZigString* str);
|
|
|
|
extern "C" void URLSearchParams__toString(WebCore::URLSearchParams* urlSearchParams, void* ctx, URLSearchParams__toStringCallback callback)
|
|
{
|
|
String str = urlSearchParams->toString();
|
|
auto zig = Zig::toZigString(str);
|
|
callback(ctx, &zig);
|
|
}
|
|
|
|
URLSearchParams::URLSearchParams(const String& init, DOMURL* associatedURL)
|
|
: m_associatedURL(associatedURL)
|
|
, m_pairs(init.startsWith('?') ? WTF::URLParser::parseURLEncodedForm(StringView(init).substring(1)) : WTF::URLParser::parseURLEncodedForm(init))
|
|
{
|
|
}
|
|
|
|
URLSearchParams::URLSearchParams(const Vector<KeyValuePair<String, String>>& pairs)
|
|
: m_pairs(pairs)
|
|
{
|
|
}
|
|
|
|
ExceptionOr<Ref<URLSearchParams>> URLSearchParams::create(std::variant<Vector<Vector<String>>, Vector<KeyValuePair<String, String>>, String>&& variant)
|
|
{
|
|
auto visitor = WTF::makeVisitor([&](const Vector<Vector<String>>& vector) -> ExceptionOr<Ref<URLSearchParams>> {
|
|
Vector<KeyValuePair<String, String>> pairs;
|
|
for (const auto& pair : vector) {
|
|
if (pair.size() != 2)
|
|
return Exception { TypeError };
|
|
pairs.append({pair[0], pair[1]});
|
|
}
|
|
return adoptRef(*new URLSearchParams(WTFMove(pairs))); }, [&](const Vector<KeyValuePair<String, String>>& pairs) -> ExceptionOr<Ref<URLSearchParams>> { return adoptRef(*new URLSearchParams(pairs)); }, [&](const String& string) -> ExceptionOr<Ref<URLSearchParams>> { return adoptRef(*new URLSearchParams(string, nullptr)); });
|
|
return std::visit(visitor, variant);
|
|
}
|
|
|
|
String URLSearchParams::get(const String& name) const
|
|
{
|
|
for (const auto& pair : m_pairs) {
|
|
if (pair.key == name)
|
|
return pair.value;
|
|
}
|
|
return String();
|
|
}
|
|
|
|
bool URLSearchParams::has(const String& name) const
|
|
{
|
|
for (const auto& pair : m_pairs) {
|
|
if (pair.key == name)
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
void URLSearchParams::sort()
|
|
{
|
|
std::stable_sort(m_pairs.begin(), m_pairs.end(), [](const auto& a, const auto& b) {
|
|
return WTF::codePointCompareLessThan(a.key, b.key);
|
|
});
|
|
updateURL();
|
|
}
|
|
|
|
void URLSearchParams::set(const String& name, const String& value)
|
|
{
|
|
for (auto& pair : m_pairs) {
|
|
if (pair.key != name)
|
|
continue;
|
|
if (pair.value != value)
|
|
pair.value = value;
|
|
bool skippedFirstMatch = false;
|
|
m_pairs.removeAllMatching([&](const auto& pair) {
|
|
if (pair.key == name) {
|
|
if (skippedFirstMatch)
|
|
return true;
|
|
skippedFirstMatch = true;
|
|
}
|
|
return false;
|
|
});
|
|
updateURL();
|
|
needsSorting = true;
|
|
return;
|
|
}
|
|
m_pairs.append({ name, value });
|
|
needsSorting = true;
|
|
updateURL();
|
|
}
|
|
|
|
void URLSearchParams::append(const String& name, const String& value)
|
|
{
|
|
m_pairs.append({ name, value });
|
|
updateURL();
|
|
needsSorting = true;
|
|
}
|
|
|
|
Vector<String> URLSearchParams::getAll(const String& name) const
|
|
{
|
|
Vector<String> values;
|
|
values.reserveInitialCapacity(m_pairs.size());
|
|
for (const auto& pair : m_pairs) {
|
|
if (pair.key == name)
|
|
values.uncheckedAppend(pair.value);
|
|
}
|
|
values.shrinkToFit();
|
|
return values;
|
|
}
|
|
|
|
void URLSearchParams::remove(const String& name)
|
|
{
|
|
if (!m_pairs.removeAllMatching([&](const auto& pair) {
|
|
return pair.key == name;
|
|
})
|
|
&& m_pairs.size() > 0)
|
|
return;
|
|
updateURL();
|
|
needsSorting = true;
|
|
}
|
|
|
|
String URLSearchParams::toString() const
|
|
{
|
|
return WTF::URLParser::serialize(m_pairs);
|
|
}
|
|
|
|
void URLSearchParams::updateURL()
|
|
{
|
|
if (m_associatedURL)
|
|
m_associatedURL->setQuery(WTF::URLParser::serialize(m_pairs));
|
|
}
|
|
|
|
void URLSearchParams::updateFromAssociatedURL()
|
|
{
|
|
ASSERT(m_associatedURL);
|
|
String search = m_associatedURL->search();
|
|
m_pairs = search.startsWith('?') ? WTF::URLParser::parseURLEncodedForm(StringView(search).substring(1)) : WTF::URLParser::parseURLEncodedForm(search);
|
|
}
|
|
|
|
std::optional<KeyValuePair<String, String>> URLSearchParams::Iterator::next()
|
|
{
|
|
auto& pairs = m_target->pairs();
|
|
if (m_index >= pairs.size())
|
|
return std::nullopt;
|
|
|
|
auto& pair = pairs[m_index++];
|
|
return KeyValuePair<String, String> { pair.key, pair.value };
|
|
}
|
|
|
|
URLSearchParams::Iterator::Iterator(URLSearchParams& params)
|
|
: m_target(params)
|
|
{
|
|
}
|
|
|
|
}
|