PageSourceSearch

https://www.buscape.com.br/ais/_next/static/chunks/12089.bc2525e71fa48c38.js

js buscape.com.br collected 2026-09-24 08:53:45 UTC 10,383 bytes, 17 lines download raw bytes

vendor: 6,805 bytes, lines 1-17
1"use strict";(self.webpackChunk_N_E=self.webpackChunk_N_E||[]).push([[12089,10841,57825,43414,41607,12014,58703],{12089:function(e,t,r){r.r(t);var n=r(10841),o=r(95255);let u=(0,o.memo)(e=>(0,n.jsx)("svg",{xmlns:"http://www.w3.org/2000/svg",viewBox:"0 0 16 14",...e,children:(0,n.jsx)("path",{id:"icon",fillRule:"evenodd",d:"M10.048 1.75c-1.11-.015-2.039.904-2.039 1.977v1.091a.75.75 0 0 1-.871.74c-1.811-.297-3.436-1.18-4.585-1.96-.294-.2-.56-.395-.794-.575-.092 2.046.558 3.47 1.263 4.415.433.579.897.99 1.25 1.255a5.008 5.008 0 0 0 .555.362l.003.001h-.002a.748.748 0 0 1 .288 1.091c-.62.917-1.513 1.584-2.235 2.02.283.05.633.083 1.061.083a8.157 8.157 0 0 0 5.54-2.159 7.923 7.923 0 0 0 2.537-5.3.75.75 0 0 1 .222-.486l.93-.918h-.61a.75.75 0 0 1-.687-.447 1.987 1.987 0 0 0-.73-.858 2.041 2.041 0 0 0-1.094-.332h-.002Zm-9.13 9.728.013-.005.06-.024a8.646 8.646 0 0 0 1.048-.526A6.719 6.719 0 0 0 3.383 9.9l-.011-.008a7.772 7.772 0 0 1-1.55-1.558C.737 6.884-.153 4.63.44 1.41a.75.75 0 0 1 1.264-.398l.004.003.02.019a11.196 11.196 0 0 0 .42.375c.294.25.721.59 1.247.948.856.58 1.94 1.18 3.114 1.522v-.152C6.51 1.801 8.14.224 10.07.25a3.541 3.541 0 0 1 1.896.577 3.48 3.48 0 0 1 1.043 1.06H15a.75.75 0 0 1 .527 1.284l-2.034 2.006a9.426 9.426 0 0 1-2.992 6.016 9.655 9.655 0 0 1-6.559 2.557c-1.198 0-2.007-.222-2.543-.486A2.682 2.682 0 0 1 .8 12.87a1.766 1.766 0 0 1-.23-.249l-.008-.01-.004-.006-.001-.002-.001-.001v-.001a.75.75 0 0 1 .36-1.123h.001Z",clipRule:"evenodd"})}));t.default=u},17414:function(e,t,r){/**
2 * @license React
3 * react-jsx-runtime.production.min.js
4 *
5 * Copyright (c) Meta Platforms, Inc. and affiliates.
6 *
7 * This source code is licensed under the MIT license found in the
8 * LICENSE file in the root directory of this source tree.
9 */var n=r(95255),o=Symbol.for("react.element"),u=Symbol.for("react.fragment"),a=Object.prototype.hasOwnProperty,c=n.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED.ReactCurrentOwner,l={key:!0,ref:!0,__self:!0,__source:!0};function q(e,t,r){var n,u={},f=null,i=null;for(n in void 0!==r&&(f=""+r),void 0!==t.key&&(f=""+t.key),void 0!==t.ref&&(i=t.ref),t)a.call(t,n)&&!l.hasOwnProperty(n)&&(u[n]=t[n]);if(e&&e.defaultProps)for(n in t=e.defaultProps)void 0===u[n]&&(u[n]=t[n]);return{$$typeof:o,type:e,key:f,ref:i,props:u,_owner:c.current}}t.Fragment=u,t.jsx=q,t.jsxs=q},65779:function(e,t){/**
10 * @license React
11 * react.production.min.js
12 *
13 * Copyright (c) Meta Platforms, Inc. and affiliates.
14 *
15 * This source code is licensed under the MIT license found in the
16 * LICENSE file in the root directory of this source tree.
17 */var r=Symbol.for("react.element"),n=Symbol.for("react.portal"),o=Symbol.for("react.fragment"),u=Symbol.for("react.strict_mode"),a=Symbol.for("react.profiler"),c=Symbol.for("react.provider"),l=Symbol.for("react.context"),f=Symbol.for("react.server_context"),i=Symbol.for("react.forward_ref"),s=Symbol.for("react.suspense"),p=Symbol.for("react.memo"),y=Symbol.for("react.lazy"),d=Symbol.for("react.default_value"),_=Symbol.iterator,v={isMounted:function(){return!1},enqueueForceUpdate:function(){},enqueueReplaceState:function(){},enqueueSetState:function(){}},h=Object.assign,m={};function G(e,t,r){this.props=e,this.context=t,this.refs=m,this.updater=r||v}function H(){}function I(e,t,r){this.props=e,this.context=t,this.refs=m,this.updater=r||v}G.prototype.isReactComponent={},G.prototype.setState=function(e,t){if("object"!=typeof e&&"function"!=typeof e&&null!=e)throw Error("setState(...): takes an object of state variables to update or a function which returns an object of state variables.");this.updater.enqueueSetState(this,e,t,"setState")},G.prototype.forceUpdate=function(e){this.updater.enqueueForceUpdate(this,e,"forceUpdate")},H.prototype=G.prototype;var b=I.prototype=new H;b.constructor=I,h(b,G.prototype),b.isPureReactComponent=!0;var w=Array.isArray,C=Object.prototype.hasOwnProperty,E={current:null},k={key:!0,ref:!0,__self:!0,__source:!0};function O(e,t,n){var o,u={},a=null,c=null;if(null!=t)for(o in void 0!==t.ref&&(c=t.ref),void 0!==t.key&&(a=""+t.key),t)C.call(t,o)&&!k.hasOwnProperty(o)&&(u[o]=t[o]);var l=arguments.length-2;if(1===l)u.children=n;else if(1<l){for(var f=Array(l),i=0;i<l;i++)f[i]=arguments[i+2];u.children=f}if(e&&e.defaultProps)for(o in l=e.defaultProps)void 0===u[o]&&(u[o]=l[o]);return{$$typeof:r,type:e,key:a,ref:c,props:u,_owner:E.current}}function P(e){return"object"==typeof e&&null!==e&&e.$$typeof===r}var g=/\/+/g;function R(e,t){var r,n;return"object"==typeof e&&null!==e&&null!=e.key?(r=""+e.key,n={"=":"=0",":":"=2"},"$"+r.replace(/[=:]/g,function(e){return n[e]})):t.toString(36)}function T(e,t,o){if(null==e)return e;var u=[],a=0;return!function S(e,t,o,u,a){var c,l,f,i=typeof e;("undefined"===i||"boolean"===i)&&(e=null);var s=!1;if(null===e)s=!0;else switch(i){case"string":case"number":s=!0;break;case"object":switch(e.$$typeof){case r:case n:s=!0}}if(s)return a=a(s=e),e=""===u?"."+R(s,0):u,w(a)?(o="",null!=e&&(o=e.replace(g,"$&/")+"/"),S(a,t,o,"",function(e){return e})):null!=a&&(P(a)&&(c=a,l=o+(!a.key||s&&s.key===a.key?"":(""+a.key).replace(g,"$&/")+"/")+e,a={$$typeof:r,type:c.type,key:l,ref:c.ref,props:c.props,_owner:c._owner}),t.push(a)),1;if(s=0,u=""===u?".":u+":",w(e))for(var p=0;p<e.length;p++){var y=u+R(i=e[p],p);s+=S(i,t,o,y,a)}else if("function"==typeof(y=null===(f=e)||"object"!=typeof f?null:"function"==typeof(f=_&&f[_]||f["@@iterator"])?f:null))for(e=y.call(e),p=0;!(i=e.next()).done;)y=u+R(i=i.value,p++),s+=S(i,t,o,y,a);else if("object"===i)throw Error("Objects are not valid as a React child (found: "+("[object Object]"===(t=String(e))?"object with keys {"+Object.keys(e).join(", ")+"}":t)+"). If you meant to render a collection of children, use an array instead.");return s}(e,u,"","",function(e){return t.call(o,e,a++)}),u}function ba(e){if(-1===e._status){var t=e._result;(t=t()).then(function(t){(0===e._status||-1===e._status)&&(e._status=1,e._result=t)},function(t){(0===e._status||-1===e._status)&&(e._status=2,e._result=t)}),-1===e._status&&(e._status=0,e._result=t)}if(1===e._status)return e._result.default;throw e._result}var $={current:null};function ca(){return new WeakMap}function V(){return{s:0,v:void 0,o:null,p:null}}var x={current:null},j={transition:null},N={ReactCurrentDispatcher:x,ReactCurrentCache:$,ReactCurrentBatchConfig:j,ReactCurrentOwner:E,ContextRegistry:{}},A=N.ContextRegistry;t.Children={map:T,forEach:function(e,t,r){T(e,function(){t.apply(this,arguments)},r)},count:function(e){var t=0;return T(e,function(){t++}),t},toArray:function(e){return T(e,function(e){return e})||[]},only:function(e){if(!P(e))throw Error("React.Children.only expected to receive a single React element child.");return e}},t.Component=G,t.Fragment=o,t.Profiler=a,t.PureComponent=I,t.StrictMode=u,t.Suspense=s,t.__SECRET_INT
17ERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED=N,t.cache=function(e){return function(){var t=$.current;if(!t)return e.apply(null,arguments);var r=t.getCacheForType(ca);void 0===(t=r.get(e))&&(t=V(),r.set(e,t)),r=0;for(var n=arguments.length;r<n;r++){var o=arguments[r];if("function"==typeof o||"object"==typeof o&&null!==o){var u=t.o;null===u&&(t.o=u=new WeakMap),void 0===(t=u.get(o))&&(t=V(),u.set(o,t))}else null===(u=t.p)&&(t.p=u=new Map),void 0===(t=u.get(o))&&(t=V(),u.set(o,t))}if(1===t.s)return t.v;if(2===t.s)throw t.v;try{var a=e.apply(null,arguments);return(r=t).s=1,r.v=a}catch(e){throw(a=t).s=2,a.v=e,e}}},t.cloneElement=function(e,t,n){if(null==e)throw Error("React.cloneElement(...): The argument must be a React element, but you passed "+e+".");var o=h({},e.props),u=e.key,a=e.ref,c=e._owner;if(null!=t){if(void 0!==t.ref&&(a=t.ref,c=E.current),void 0!==t.key&&(u=""+t.key),e.type&&e.type.defaultProps)var l=e.type.defaultProps;for(f in t)C.call(t,f)&&!k.hasOwnProperty(f)&&(o[f]=void 0===t[f]&&void 0!==l?l[f]:t[f])}var f=arguments.length-2;if(1===f)o.children=n;else if(1<f){l=Array(f);for(var i=0;i<f;i++)l[i]=arguments[i+2];o.children=l}return{$$typeof:r,type:e.type,key:u,ref:a,props:o,_owner:c}},t.createContext=function(e){return(e={$$typeof:l,_currentValue:e,_currentValue2:e,_threadCount:0,Provider:null,Consumer:null,_defaultValue:null,_globalName:null}).Provider={$$typeof:c,_context:e},e.Consumer=e},t.createElement=O,t.createFactory=function(e){var t=O.bind(null,e);return t.type=e,t},t.createRef=function(){return{current:null}},t.createServerContext=function(e,t){var r=!0;if(!A[e]){r=!1;var n={$$typeof:f,_currentValue:t,_currentValue2:t,_defaultValue:t,_threadCount:0,Provider:null,Consumer:null,_globalName:e};n.Provider={$$typeof:c,_context:n},A[e]=n}if((n=A[e])._defaultValue===d)n._defaultValue=t,n._currentValue===d&&(n._currentValue=t),n._currentValue2===d&&(n._currentValue2=t);else if(r)throw Error("ServerContext: "+e+" already defined");return n},t.forwardRef=function(e){return{$$typeof:i,render:e}},t.isValidElement=P,t.lazy=function(e){return{$$typeof:y,_payload:{_status:-1,_result:e},_init:ba}},t.memo=function(e,t){return{$$typeof:p,type:e,compare:void 0===t?null:t}},t.startTransition=function(e){var t=j.transition;j.transition={};try{e()}finally{j.transition=t}},t.unstable_act=function(){throw Error("act(...) is not supported in production builds of React.")},t.unstable_useCacheRefresh=function(){return x.current.useCacheRefresh()},t.use=function(e){return x.current.use(e)},t.useCallback=function(e,t){return x.current.useCallback(e,t)},t.useContext=function(e){return x.current.useContext(e)},t.useDebugValue=function(){},t.useDeferredValue=function(e){return x.current.useDeferredValue(e)},t.useEffect=function(e,t){return x.current.useEffect(e,t)},t.useId=function(){return x.current.useId()},t.useImperativeHandle=function(e,t,r){return x.current.useImperativeHandle(e,t,r)},t.useInsertionEffect=function(e,t){return x.current.useInsertionEffect(e,t)},t.useLayoutEffect=function(e,t){return x.current.useLayoutEffect(e,t)},t.useMemo=function(e,t){return x.current.useMemo(e,t)},t.useReducer=function(e,t,r){return x.current.useReducer(e,t,r)},t.useRef=function(e){return x.current.useRef(e)},t.useState=function(e){return x.current.useState(e)},t.useSyncExternalStore=function(e,t,r){return x.current.useSyncExternalStore(e,t,r)},t.useTransition=function(){return x.current.useTransition()},t.version="18.3.0-canary-1dba980e1f-20241220"},95255:function(e,t,r){e.exports=r(65779)},10841:function(e,t,r){e.exports=r(17414)}}]);

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.