// // Copyright (c) 2019 Vinnie Falco (vinnie.falco@gmail.com) // Copyright (c) 2022 Alan de Freitas (alandefreitas@gmail.com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // Official repository: https://github.com/boostorg/url // #include #include #include #include #include #include #include #include namespace boost { namespace urls { //------------------------------------------------ // // Special Members // //------------------------------------------------ params_encoded_ref:: params_encoded_ref( url_base& u) noexcept : params_encoded_base(u.impl_) , u_(&u) { } params_encoded_ref& params_encoded_ref:: operator=( params_encoded_ref const& other) { if (!ref_.alias_of( other.ref_ )) assign(other.begin(), other.end()); return *this; } params_encoded_ref& params_encoded_ref:: operator=(std::initializer_list< param_pct_view> init) { assign(init.begin(), init.end()); return *this; } params_encoded_ref:: operator params_encoded_view() const noexcept { return {ref_}; } //------------------------------------------------ // // Modifiers // //------------------------------------------------ void params_encoded_ref:: assign( std::initializer_list< param_pct_view> init) { assign(init.begin(), init.end()); } auto params_encoded_ref:: insert( iterator before, param_pct_view const& p) -> iterator { return u_->edit_params( before.it_, before.it_, detail::param_encoded_iter(p)); } auto params_encoded_ref:: insert( iterator before, std::initializer_list< param_pct_view> init) -> iterator { return insert( before, init.begin(), init.end()); } std::size_t params_encoded_ref:: erase( pct_string_view key, ignore_case_param ic) noexcept { // end() can't be fully cached, // since erase invalidates it. iterator it; { auto const end_ = end(); it = find_last(end_, key, ic); if(it == end_) return 0; } std::size_t n = 0; for(;;) { ++n; // Use it->key instead of key, // to handle self-intersection auto prev = find_last(it, it->key, ic); if(prev == end()) break; erase(it); it = prev; } erase(it); return n; } auto params_encoded_ref:: replace( iterator pos, param_pct_view const& p) -> iterator { return u_->edit_params( pos.it_, std::next(pos).it_, detail::param_encoded_iter(p)); } auto params_encoded_ref:: replace( iterator from, iterator to, std::initializer_list< param_pct_view> init) -> iterator { return replace( from, to, init.begin(), init.end()); } auto params_encoded_ref:: unset( iterator pos) noexcept -> iterator { BOOST_ASSERT(pos.it_.nk > 0); pct_string_view s; return u_->edit_params( pos.it_, pos.it_.next(), detail::param_encoded_value_iter( pos.it_.nk - 1, s, false)); } auto params_encoded_ref:: set( iterator pos, pct_string_view value) -> iterator { BOOST_ASSERT(pos.it_.nk > 0); return u_->edit_params( pos.it_, pos.it_.next(), detail::param_encoded_value_iter( pos.it_.nk - 1, value, true)); } auto params_encoded_ref:: set( pct_string_view key, pct_string_view value, ignore_case_param ic) -> iterator { // VFALCO we can't cache end() here // because it is invalidated // every time we set or erase. auto it0 = find(key, ic); if(it0 == end()) return append({key, value}); it0 = set(it0, value); auto it = end(); for(;;) { it = find_last(it, key, ic); if(it == it0) return it0; it = erase(it); } } auto params_encoded_ref:: erase( iterator pos) noexcept -> iterator { return erase( pos, std::next(pos)); } auto params_encoded_ref:: erase( iterator first, iterator last) noexcept -> iterator { core::string_view s("", 0); return u_->edit_params( first.it_, last.it_, detail::query_string_iter(s)); } } // urls } // boost