1
0
mirror of https://github.com/vlang/v.git synced 2023-08-10 21:13:21 +03:00
v/vlib/net/urllib/values.v

123 lines
2.6 KiB
V
Raw Permalink Normal View History

2023-03-28 23:55:57 +03:00
// Copyright (c) 2019-2023 Alexander Medvednikov. All rights reserved.
2019-08-01 16:01:03 +03:00
// Use of this source code is governed by an MIT license
// that can be found in the LICENSE file.
module urllib
struct QueryValue {
pub mut:
key string
value string
2019-08-01 16:01:03 +03:00
}
pub struct Values {
pub mut:
data []QueryValue
len int
2019-08-01 16:01:03 +03:00
}
// new_values returns a new Values struct for creating
2019-11-14 09:53:05 +03:00
// urlencoded query string parameters. it can also be to
// post form data with application/x-www-form-urlencoded.
// values.encode() will return the encoded data
pub fn new_values() Values {
2019-08-01 16:01:03 +03:00
return Values{
data: []QueryValue{}
2019-08-01 16:01:03 +03:00
}
}
// get gets the first value associated with the given key.
// If there are no values associated with the key, get returns
// none.
pub fn (v &Values) get(key string) ?string {
2020-06-21 17:51:02 +03:00
if v.data.len == 0 {
return none
2019-08-01 16:01:03 +03:00
}
for qvalue in v.data {
if qvalue.key == key {
return qvalue.value
}
2019-08-01 16:01:03 +03:00
}
return none
2019-08-01 16:01:03 +03:00
}
// get_all gets the all the values associated with the given key.
// If there are no values associated with the key, get returns
// a empty []string.
pub fn (v &Values) get_all(key string) []string {
2020-06-21 17:51:02 +03:00
if v.data.len == 0 {
2019-11-14 09:53:05 +03:00
return []
}
mut values := []string{}
for qvalue in v.data {
if qvalue.key == key {
values << qvalue.value
}
}
return values
}
// set sets the key to value. It replaces any existing
// values, or create a new bucket with the new key if it is missed.
pub fn (mut v Values) set(key string, value string) {
// A query string can contains several
// duplicate, so we need to make sure that we
// cover all the edge case.
mut found := false
for mut qvalue in v.data {
if qvalue.key == key {
found = true
qvalue.value = value
}
}
if !found {
v.add(key, value)
}
2019-08-01 16:01:03 +03:00
}
// add adds the value to key. It appends to any existing
2019-08-01 16:01:03 +03:00
// values associated with key.
pub fn (mut v Values) add(key string, value string) {
v.data << QueryValue{
key: key
value: value
}
2020-06-21 17:51:02 +03:00
v.len = v.data.len
2019-08-01 16:01:03 +03:00
}
// del deletes the values associated with key.
2020-05-17 14:51:18 +03:00
pub fn (mut v Values) del(key string) {
for idx, qvalue in v.data {
if qvalue.key == key {
v.data.delete(idx)
}
}
2020-06-21 17:51:02 +03:00
v.len = v.data.len
2019-08-01 16:01:03 +03:00
}
// return the list of values in the query string
pub fn (v Values) values() []string {
mut values := []string{}
for qvalue in v.data {
if qvalue.value != '' {
values << qvalue.value
}
}
return values
}
// return a map <key []value> of the query string
pub fn (v Values) to_map() map[string][]string {
mut result := map[string][]string{}
for qvalue in v.data {
if qvalue.key in result {
result[qvalue.key] << qvalue.value
} else {
result[qvalue.key] = [qvalue.value]
}
}
return result
}