55 lines
41 KiB
HTML
55 lines
41 KiB
HTML
|
<!doctype html>
|
|||
|
|
<html lang="en" dir="ltr" class="docs-wrapper plugin-docs plugin-id-default docs-version-current docs-doc-page docs-doc-id-chap-26/b" data-has-hydrated="false">
|
|||
|
|
<head>
|
|||
|
|
<meta charset="UTF-8">
|
|||
|
|
<meta name="generator" content="Docusaurus v3.0.1">
|
|||
|
|
<title data-rh="true">B | Common Lisp (New) Language Reference</title><meta data-rh="true" name="viewport" content="width=device-width,initial-scale=1"><meta data-rh="true" name="twitter:card" content="summary_large_image"><meta data-rh="true" property="og:image" content="https://lisp-docs.github.io/cl-language-reference/img/1024px-Lisp_logo.svg.png"><meta data-rh="true" name="twitter:image" content="https://lisp-docs.github.io/cl-language-reference/img/1024px-Lisp_logo.svg.png"><meta data-rh="true" property="og:url" content="https://lisp-docs.github.io/cl-language-reference/chap-26/b"><meta data-rh="true" property="og:locale" content="en"><meta data-rh="true" name="docusaurus_locale" content="en"><meta data-rh="true" name="docsearch:language" content="en"><meta data-rh="true" name="google-site-verification" content="Vzaw013_bfdKeUVG89Ch3W1zC9_vH9ID2dPB9Dz0vr0"><meta data-rh="true" name="docusaurus_version" content="current"><meta data-rh="true" name="docusaurus_tag" content="docs-default-current"><meta data-rh="true" name="docsearch:version" content="current"><meta data-rh="true" name="docsearch:docusaurus_tag" content="docs-default-current"><meta data-rh="true" property="og:title" content="B | Common Lisp (New) Language Reference"><meta data-rh="true" name="description" content="B"><meta data-rh="true" property="og:description" content="B"><link data-rh="true" rel="icon" href="../img/favicon.ico"><link data-rh="true" rel="canonical" href="b.html"><link data-rh="true" rel="alternate" href="b.html" hreflang="en"><link data-rh="true" rel="alternate" href="b.html" hreflang="x-default"><link data-rh="true" rel="preconnect" href="https://C1F2Q5VM6X-dsn.algolia.net" crossorigin="anonymous"><link rel="preconnect" href="https://www.google-analytics.com">
|
|||
|
|
<link rel="preconnect" href="https://www.googletagmanager.com">
|
|||
|
|
<script async src="https://www.googletagmanager.com/gtag/js?id=G-8TJCE4NSF8"></script>
|
|||
|
|
<script>function gtag(){dataLayer.push(arguments)}window.dataLayer=window.dataLayer||[],gtag("js",new Date),gtag("config","G-8TJCE4NSF8",{})</script>
|
|||
|
|
|
|||
|
|
|
|||
|
|
<link rel="search" type="application/opensearchdescription+xml" title="Common Lisp (New) Language Reference" href="../opensearch.xml"><link rel="stylesheet" href="../assets/css/styles.f13b59fe.css">
|
|||
|
|
<script src="../assets/js/runtime~main.02699c25.js" defer="defer"></script>
|
|||
|
|
<script src="../assets/js/main.4f0a7a76.js" defer="defer"></script>
|
|||
|
|
</head>
|
|||
|
|
<body class="navigation-with-keyboard">
|
|||
|
|
<script>!function(){function t(t){document.documentElement.setAttribute("data-theme",t)}var e=function(){try{return new URLSearchParams(window.location.search).get("docusaurus-theme")}catch(t){}}()||function(){try{return localStorage.getItem("theme")}catch(t){}}();t(null!==e?e:"light")}(),function(){try{const c=new URLSearchParams(window.location.search).entries();for(var[t,e]of c)if(t.startsWith("docusaurus-data-")){var a=t.replace("docusaurus-data-","data-");document.documentElement.setAttribute(a,e)}}catch(t){}}()</script><div id="__docusaurus"><div role="region" aria-label="Skip to main content"><a class="skipToContent_fXgn" href="b.html#__docusaurus_skipToContent_fallback">Skip to main content</a></div><nav aria-label="Main" class="navbar navbar--fixed-top"><div class="navbar__inner"><div class="navbar__items"><button aria-label="Toggle navigation bar" aria-expanded="false" class="navbar__toggle clean-btn" type="button"><svg width="30" height="30" viewBox="0 0 30 30" aria-hidden="true"><path stroke="currentColor" stroke-linecap="round" stroke-miterlimit="10" stroke-width="2" d="M4 7h22M4 15h22M4 23h22"></path></svg></button><a href="../../index.html" target="_blank" rel="noopener noreferrer" class="navbar__brand"><div class="navbar__logo"><img src="../img/logo.svg" alt="Lisp Logo" class="themedComponent_mlkZ themedComponent--light_NVdE"><img src="../img/logo.svg" alt="Lisp Logo" class="themedComponent_mlkZ themedComponent--dark_xIcU"></div><b class="navbar__title text--truncate">Common Lisp Docs</b></a><a href="../../docs/tutorial/index.html" target="_blank" rel="noopener noreferrer" class="navbar__item navbar__link">Tutorial</a><a href="../index.html" target="_blank" rel="noopener noreferrer" class="navbar__item navbar__link">Technical Reference</a><a href="../../docs/whylisp.html" target="_blank" rel="noopener noreferrer" class="navbar__item navbar__link">Why Lisp?</a><a href="../../docs/howto.html" target="_blank" rel="noopener noreferrer" class="navbar__item navbar__link">Guides</a></div><div class="navbar__items navbar__items--right"><a href="../../docs/contribute.html" target="_blank" rel="noopener noreferrer" class="navbar__item navbar__link">Contribute!</a><a href="../../docs/help.html" target="_blank" rel="noopener noreferrer" class="navbar__item navbar__link">Getting Help</a><a href="../../docs/about.html" target="_blank" rel="noopener noreferrer" class="navbar__item navbar__link">About</a><a href="../../blog.html" target="_blank" rel="noopener noreferrer" class="navbar__item navbar__link">Blog</a><a href="https://github.com/lisp-docs" target="_blank" rel="noopener noreferrer" class="navbar__item navbar__link">GitHub<svg width="13.5" height="13.5" aria-hidden="true" viewBox="0 0 24 24" class="iconExternalLink_nPIU"><path fill="currentColor" d="M21 13v10h-21v-19h12v2h-10v15h17v-8h2zm3-12h-10.988l4.035 4-6.977 7.07 2.828 2.828 6.977-7.07 4.125 4.172v-11z"></path></svg></a><div class="toggle_vylO colorModeToggle_DEke"><button class="clean-btn toggleButton_gllP toggleButtonDisabled_aARS" type="button" disabled="" title="Switch between dark and light mode (currently light mode)" aria-label="Switch between dark and light mode (currently light mode)" aria-live="polite"><svg viewBox="0 0 24 24" width="24" height="24" class="lightToggleIcon_pyhR"><path fill="currentColor" d="M12,9c1.65,0,3,1.35,3,3s-1.35,3-3,3s-3-1.35-3-3S10.35,9,12,9 M12,7c-2.76,0-5,2.24-5,5s2.24,5,5,5s5-2.24,5-5 S14.76,7,12,7L12,7z M2,13l2,0c0.55,0,1-0.45,1-1s-0.45-1-1-1l-2,0c-0.55,0-1,0.45-1,1S1.45,13,2,13z M20,13l2,0c0.55,0,1-0.45,1-1 s-0.45-1-1-1l-2,0c-0.55,0-1,0.45-1,1S19.45,13,20,13z M11,2v2c0,0.55,0.45,1,1,1s1-0.45,1-1V2c0-0.55-0.45-1-1-1S11,1.45,11,2z M11,20v2c0,0.55,0.45,1,1,1s1-0.45,1-1v-2c0-0.55-0.45-1-1-1C11.45,19,11,19.45,11,20z M5.99,4.58c-0.39-0.39-1.03-0.39-1.41,0 c-0.39,0.39-0.39,1.03,0,1.41l1.06,1.06c0.39,0.39,1.03,0.39,1.41,0s0.39-1.03,0-1.41L5.99,4.58z M18.36,16.95 c-0.39-0.39-1.03-0.39-1.41,0c-0.39,0.39-0.39,1.03,0,1.41l1.06,1.06c0.39,0.39,1.03,0.39,1.41,0c0.39-0.39,0.39-1.03,0-1.41 L18.36,16.95z M19.42,5.99c0.39-0.39,0.39-1.
|
|||
|
|
<p><strong>backquote</strong> <em>n.</em> the <span><i>standard character</i></span> that is variously called “grave accent” or</p>
|
|||
|
|
<p>“backquote” (‘). See Figure 2–5.</p>
|
|||
|
|
<p><strong>backslash</strong> <em>n.</em> the <span><i>standard character</i></span> that is variously called “reverse solidus” or “backslash” (). See Figure 2–5.</p>
|
|||
|
|
<p><strong>base character</strong> <em>n.</em> a <span><i>character</i></span> of <span><i>type</i></span> <span><b>base-char</b></span>.</p>
|
|||
|
|
<p><strong>base string</strong> <em>n.</em> a <span><i>string</i></span> of <span><i>type</i></span> <span><b>base-string</b></span>.</p>
|
|||
|
|
<p><strong>before method</strong> <em>n.</em> a <span><i>method</i></span> having the <span><i>qualifier</i></span> <!-- -->:before<!-- -->.</p>
|
|||
|
|
<p><strong>bidirectional</strong> <em>adj.</em> (of a <span><i>stream</i></span>) being both an <em>input stream</em> and an <em>output stream</em>.</p>
|
|||
|
|
<p><strong>binary</strong> <em>adj.</em> 1. (of a <span><i>stream</i></span>) being a <span><i>stream</i></span> that has an <span><i>element type</i></span> that is a</p>
|
|||
|
|
<p><span><i>subtype</i></span> of <span><i>type</i></span> <span><b>integer</b></span>. The most fundamental operation on a <em>binary input stream</em> is <span><b>read-byte</b></span> and on a <em>binary output stream</em> is <span><b>write-byte</b></span>. See <span><i>character</i></span> . 2. (of a <span><i>file</i></span>) having been created by opening a <em>binary stream</em>. (It is <span><i>implementation-dependent</i></span> whether this is an detectable aspect of the <span><i>file</i></span>, or whether any given <em>character file</em> can be treated as a <em>binary file</em>.)</p>
|
|||
|
|
<p><strong>bind</strong> <em>v.t.</em> (a <span><i>variable</i></span>) to establish a <span><i>binding</i></span> for the <span><i>variable</i></span>.</p>
|
|||
|
|
<p><strong>binding</strong> <em>n.</em> an association between a <span><i>name</i></span> and that which the <span><i>name</i></span> denotes. “A lexical binding is a lexical association between a name and its value.” When the term <span><i>binding</i></span> is qualified by the name of a <span><i>namespace</i></span>, such as “variable” or “function,” it restricts the binding to the indicated namespace, as in: “<span><b>let</b></span> establishes variable bindings.” or “<span><b>let</b></span> establishes bindings of variables.”</p>
|
|||
|
|
<p><span><b>bit</b></span> <em>n.</em> an <span><i>object</i></span> of <span><i>type</i></span> <span><b>bit</b></span>; that is, the <em>integer</em> 0 or the <em>integer</em> 1.</p>
|
|||
|
|
<p><strong>bit array</strong> <em>n.</em> a specialized <span><i>array</i></span> that is of <span><i>type</i></span> (array bit), and whose elements are of <span><i>type</i></span> <span><b>bit</b></span>.</p>
|
|||
|
|
<p><strong>bit vector</strong> <em>n.</em> a specialized <span><i>vector</i></span> that is of <span><i>type</i></span> <span><b>bit-vector</b></span>, and whose elements are of <span><i>type</i></span> <span><b>bit</b></span>.</p>
|
|||
|
|
<p><strong>bit-wise logical operation specifier</strong> <em>n.</em> an <span><i>object</i></span> which names one of the sixteen possible bit-wise logical operations that can be performed by the <span><b>boole</b></span> function, and which is the <span><i>value</i></span> of exactly one of the <span><i>constant variables</i></span> <span><b>boole-clr</b></span>, <span><b>boole-set</b></span>, <span><b>boole-1</b></span>, <span><b>boole-2</b></span>, <span><b>boole-c1</b></span>, <span><b>boole-c2</b></span>, <span><b>boole-and</b></span>, <span><b>boole-ior</b></span>, <span><b>boole-xor</b></span>, <span><b>boole-eqv</b></span>, <span><b>boole-nand</b></span>, <span><b>boole-nor</b></span>, <span><b>boole-andc1</b></span>, <span><b>boole-andc2</b></span>, <span><b>boole-orc1</b></span>, or <span><b>boole-orc2</b></span>.</p>
|
|||
|
|
<p><span><b>block</b></span> <em>n.</em> a named lexical <em>exit point<span><i>, </i></span>established</em> explicitly by <span><b>block</b></span> or implicitly by <span><i>operators</i></span> such as <span><b>loop</b></span>, <span><b>do</b></span> and <strong>prog</strong>, to which control and values may be transfered by using a <span><b>return-from</b></span> <span><i>form</i></span> with the name of the <span><i>block</i></span>.</p>
|
|||
|
|
<p><strong>block tag</strong> <em>n.</em> the <span><i>symbol</i></span> that, within the <span><i>lexical scope</i></span> of a <span><b>block</b></span> <span><i>form</i></span>, names the <em>block established</em> by that <span><b>block</b></span> <span><i>form</i></span>. See <span><b>return</b></span> or <span><b>return-from</b></span>.</p>
|
|||
|
|
<p><strong>boa lambda list</strong> <em>n.</em> a <span><i>lambda list</i></span> that is syntactically like an <span><i>ordinary lambda list</i></span>, but that is processed in “<strong>b</strong>y <strong>o</strong>rder of <strong>a</strong>rgument” style. See Section 3.4.6 (Boa Lambda Lists).</p>
|
|||
|
|
<p><strong>body parameter</strong> <em>n.</em> a <span><i>parameter</i></span> available in certain <span><i>lambda lists</i></span> which from the point of view of <span><i>conforming programs</i></span> is like a <span><i>rest parameter</i></span> in every way except that it is introduced by <strong>&body</strong> instead of <strong>&rest</strong>. (<span><i>Implementations</i></span> are permitted to provide extensions which distinguish <span><i>body parameters</i></span> and <span><i>rest parameters</i></span>—<em>e.g.</em>, the <span><i>forms</i></span> for <span><i>operators</i></span> which were defined using a <span><i>body parameter</i></span> might be pretty printed slightly differently than <span><i>forms</i></span> for <span><i>operators</i></span> which were defined using <span><i>rest parameters</i></span>.)</p>
|
|||
|
|
<p><span><b>boolean</b></span> <em>n.</em> an <span><i>object</i></span> of <span><i>type</i></span> <span><b>boolean</b></span>; that is, one of the following <span><i>objects</i></span>: the</p>
|
|||
|
|
<p>symbol <span><b>t</b></span> (representing <span><i>true</i></span>), or the symbol <span><b>nil</b></span> (representing <span><i>false</i></span>). See <span><i>generalized boolean</i></span>.</p>
|
|||
|
|
<p><strong>boolean equivalent</strong> <em>n.</em> (of an <em>object O</em><sub>1</sub>) any <em>object O</em><sub>2</sub> that has the same truth value as <em>O</em><sub>1</sub> when both <em>O</em><sub>1</sub> and <em>O</em><sub>2</sub> are viewed as <span><i>generalized booleans</i></span>.</p>
|
|||
|
|
<p><strong>bound</strong> <em>adj.</em>, <em>v.t.</em> 1. <em>adj.</em> having an associated denotation in a <span><i>binding</i></span>. “The variables named by a <span><b>let</b></span> are bound within its body.” See <span><i>unbound</i></span>. 2. <em>adj.</em> having a local <span><i>binding</i></span> which <span><i>shadows</i></span><sub>2</sub> another. “The variable <span><b>*print-escape*</b></span> is bound while in the <span><b>princ</b></span> function.” 3. <em>v.t.</em> the past tense of <span><i>bind</i></span>.</p>
|
|||
|
|
<p><strong>bound declaration</strong> <em>n.</em> a <span><i>declaration</i></span> that refers to or is associated with a <span><i>variable</i></span> or <span><i>function</i></span> and that appears within the <span><i>special form</i></span> that <em>establishes</em> the <span><i>variable</i></span> or <span><i>function</i></span>, but before the body of that <span><i>special form</i></span> (specifically, at the head of that <span><i>form</i></span>’s body). (If a <span><i>bound declaration</i></span> refers to a <em>function binding</em> or a <em>lexical variable binding</em>, the <span><i>scope</i></span> of the <span><i>declaration</i></span> is exactly the <span><i>scope</i></span> of that <span><i>binding</i></span>. If the</p>
|
|||
|
|
<p><span><i>declaration</i></span> refers to a <em>dynamic variable binding</em>, the <span><i>scope</i></span> of the <span><i>declaration</i></span> is what the <span><i>scope</i></span> of the <span><i>binding</i></span> would have been if it were lexical rather than dynamic.)</p>
|
|||
|
|
<p><b>bounded</b> <i>adj.</i> (of a <i>sequence S</i>, by an ordered pair of <i>bounding indices i<sub>start</sub></i> and <i>i<sub>end</sub></i>) restricted to a subrange of the <i>elements</i> of <i>S</i> that includes each <i>element</i> beginning with (and including) the one indexed by <i>i<sub>start</sub></i> and continuing up to (but not including) the one indexed by <i>i<sub>end</sub></i>.</p>
|
|||
|
|
<p><b>bounding index</b> <i>n.</i> (of a <i>sequence</i> with <i>length n</i>) either of a conceptual pair of <i>integers</i>, <i>i<sub>start</sub></i> and <i>i<sub>end</sub></i>, respectively called the “lower bounding index” and “upper</p>
|
|||
|
|
<p>bounding index”, such that 0 <i>≤ i<sub>start</sub> ≤ i<sub>end</sub> ≤ n</i>, and which therefore delimit a subrange of the <i>sequence bounded</i> by <i>i<sub>start</sub></i> and <i>i<sub>end</sub></i>.</p>
|
|||
|
|
<p><strong>bounding index designator</strong> (for a <em>sequence</em>) one of two <span><i>objects</i></span> that, taken together as an ordered pair, behave as a <span><i>designator</i></span> for <em>bounding indices</em> of the <em>sequence</em>; that is, they denote <em>bounding indices</em> of the <em>sequence</em>, and are either: an <em>integer</em> (denoting</p>
|
|||
|
|
<p>itself) and <span><b>nil</b></span> (denoting the <span><i>length</i></span> of the <em>sequence</em>), or two <em>integers</em> (each denoting themselves).</p>
|
|||
|
|
<p><strong>break loop</strong> <em>n.</em> A variant of the normal <em>Lisp read-eval-print loop</em> that is recursively entered, usually because the ongoing <span><i>evaluation</i></span> of some other <span><i>form</i></span> has been suspended for the purpose of debugging. Often, a <span><i>break loop</i></span> provides the ability to exit in such a way as to continue the suspended computation. See the <span><i>function</i></span> <span><b>break</b></span>.</p>
|
|||
|
|
<p><strong>broadcast stream</strong> <em>n.</em> an <em>output stream</em> of <span><i>type</i></span> <span><b>broadcast-stream</b></span>.</p>
|
|||
|
|
<p><strong>built-in class</strong> <em>n.</em> a <span><i>class</i></span> that is a <span><i>generalized instance</i></span> of <span><i>class</i></span> <span><b>built-in-class</b></span>.</p>
|
|||
|
|
<p><strong>built-in type</strong> <em>n.</em> one of the <span><i>types</i></span> in Figure 4–2.</p>
|
|||
|
|
<p><span><b>byte</b></span> <em>n.</em> 1. adjacent bits within an <em>integer</em> . (The specific number of bits can vary from point to point in the program; see the <span><i>function</i></span> <span><b>byte</b></span>.) 2. an integer in a specified range. (The specific range can vary from point to point in the program; see the <span><i>functions</i></span> <span><b>open</b></span> and <span><b>write-byte</b></span>.)</p>
|
|||
|
|
<p><strong>byte specifier</strong> <em>n.</em> An <span><i>object</i></span> of <span><i>implementation-dependent</i></span> nature that is returned by the <span><i>function</i></span> <span><b>byte</b></span> and that specifies the range of bits in an <em>integer</em> to be used as a <span><i>byte</i></span> by <span><i>functions</i></span> such as <span><b>ldb</b></span>.</p></div><footer class="theme-doc-footer docusaurus-mt-lg"><div class="theme-doc-footer-edit-meta-row row"><div class="col"><a href="https://github.com/lisp-docs/cl-language-reference/tree/main/docs/chap-26/b.md" target="_blank" rel="noopener noreferrer" class="theme-edit-this-page"><svg fill="currentColor" height="20" width="20" viewBox="0 0 40 40" class="iconEdit_Z9Sw" aria-hidden="true"><g><path d="m34.5 11.7l-3 3.1-6.3-6.3 3.1-3q0.5-0.5 1.2-0.5t1.1 0.5l3.9 3.9q0.5 0.4 0.5 1.1t-0.5 1.2z m-29.5 17.1l18.4-18.5 6.3 6.3-18.4 18.4h-6.3v-6.2z"></path></g></svg>Edit this page</a></div><div class="col lastUpdated_vwxv"><span class="theme-last-updated">Last updated<!-- --> by <b>daninus14</b></span></div></div></footer></article><nav class="pagination-nav docusaurus-mt-lg" aria-label="Docs pages"><a class="pagination-nav__link pagination-nav__link--prev" href="a.html"><div class="pagination-nav__sublabel">Previous</div><div class="pagination-nav__label">A</div></a><a class="pagination-nav__link pagination-nav__link--next" href="c.html"><div class="pagination-nav__sublabel">Next</div><div class="pagination-nav__label">C</div></a></nav></div></div></div></div></main></div></div></div><footer class="footer footer--dark"><div class="container container-fluid"><div class="row footer__links"><div class="col footer__col"><div class="footer__title">Docs</div><ul class="footer__items clean-list"><li class="footer__item"><a href="../../docs/tutorial.html" target="_blank" rel="noopener noreferrer" class="footer__link-item">Common Lisp Tutorial</a></li><li class="footer__item"><a href="../index.html" target="_blank" rel="noopener noreferrer" class="footer__link-item">Common Lisp Technical Reference</a></li><li class="footer__item"><a href="../../docs/help.html" target="_blank" rel="noopener noreferrer" class="footer__link-item">Help</a></li></ul></div><div class="col footer__col"><div class="footer__title">Community</div><ul class="footer__items clean-list"><li class="footer__item"><a href="https://stackoverflow.com/questions/tagged/common-lisp" target="_blank" rel="noopener noreferrer" class="footer__link-item">Stack Overflow<svg width="13.5" height="13.5" aria-hidden="true" viewBox="0 0 24 24" class="iconExternalLink_nPIU"><path fill="currentColor" d="M21 13v10h-21v-19h12v2h-10v15h17v-8h2zm3-12h-10.988l4.035 4-6.977 7.07 2.828 2.828 6.977-7.07 4.125 4.172v-11z"></path></svg></a></li><li class="footer__item"><a href="https://discord.gg/hhk46CE" target="_blank" rel="noopener noreferrer" class="footer__link-item">Discord<svg width="13.5" height="13.5" aria-hidden="true" viewBox="0 0 24 24" class="iconExternalLink_nPIU"><path fill="currentColor" d="M21 13v10h-21v-19h12v2h-10v15h17v-8h2zm3-12h-10.988l4.035 4-6.977 7.07 2.828 2.828 6.977-7.07 4.125 4.172v-11z"></path></svg></a></li><li class="footer__item"><a href="https://www.reddit.com/r/common_lisp" target="_blank" rel="noopener noreferrer" class="footer__link-item">Reddit<svg width="13.5" height="13.5" aria-hidden="true" viewBox="0 0 24 24" class="iconExternalLink_nPIU"><path fill="currentColor" d="M21 13v10h-21v-19h12v2h-10v15h17v-8h2zm3-12h-10.988l4.035 4-6.977 7.07 2.828 2.828 6.977-7.07 4.125 4.172v-11z"></path></svg></a></li><li class="footer__item"><a href="https://irclog.tymoon.eu/libera/commonlisp" target="_blank" rel="noopener noreferrer" class="footer__link-item">IRC<svg width="13.5" height="13.5" aria-hidden="true" viewBox="0 0 24 24" class="iconExternalLink_nPIU"><path fill="currentColor" d="M21 13v10h-21v-19h12v2h-10v15h17v-8h2zm3-12h-10.988l4.035 4-6.977 7.07 2.828 2.828 6.977-7.07 4.125 4.172v-11z"></path></svg></a></li></ul></div><div class="col footer__col"><div class="footer__title">More</div><ul cla
|
|||
|
|
</body>
|
|||
|
|
</html>
|