asterui 0.12.1 → 0.12.2

package/dist/index14.js.map

@@ -1 +1 @@
-{"version":3,"file":"index14.js","sources":["../src/components/Cascader.tsx"],"sourcesContent":["import React, { useState, useRef, useEffect, useCallback, useId } from 'react'\n\nexport interface CascaderOption {\n  value: string | number\n  label: React.ReactNode\n  disabled?: boolean\n  children?: CascaderOption[]\n}\n\nexport interface CascaderProps extends Omit<React.HTMLAttributes<HTMLDivElement>, 'onChange'> {\n  options: CascaderOption[]\n  value?: (string | number)[]\n  onChange?: (value: (string | number)[], selectedOptions: CascaderOption[]) => void\n  placeholder?: string\n  disabled?: boolean\n  allowClear?: boolean\n  expandTrigger?: 'click' | 'hover'\n  displayRender?: (labels: React.ReactNode[], selectedOptions: CascaderOption[]) => React.ReactNode\n  size?: 'xs' | 'sm' | 'md' | 'lg'\n}\n\nexport function Cascader({\n  options,\n  value,\n  onChange,\n  placeholder = 'Please select',\n  disabled = false,\n  allowClear = true,\n  expandTrigger = 'click',\n  displayRender,\n  size = 'md',\n  className = '',\n  ...rest\n}: CascaderProps) {\n  const [isOpen, setIsOpen] = useState(false)\n  const [selectedPath, setSelectedPath] = useState<(string | number)[]>(value || [])\n  const [hoveredPath, setHoveredPath] = useState<(string | number)[]>([])\n  const containerRef = useRef<HTMLDivElement>(null)\n  const inputId = useId()\n  const listboxId = useId()\n\n  // Sync with controlled value\n  useEffect(() => {\n    if (value !== undefined) {\n      setSelectedPath(value)\n    }\n  }, [value])\n\n  // Close on outside click\n  useEffect(() => {\n    const handleClickOutside = (e: MouseEvent) => {\n      if (containerRef.current && !containerRef.current.contains(e.target as Node)) {\n        setIsOpen(false)\n        setHoveredPath([])\n      }\n    }\n\n    if (isOpen) {\n      document.addEventListener('mousedown', handleClickOutside)\n      return () => document.removeEventListener('mousedown', handleClickOutside)\n    }\n  }, [isOpen])\n\n  // Get options at each level based on path\n  const getOptionsAtLevel = useCallback((level: number, path: (string | number)[]): CascaderOption[] => {\n    if (level === 0) return options\n\n    let currentOptions = options\n    for (let i = 0; i < level; i++) {\n      const selected = currentOptions.find(opt => opt.value === path[i])\n      if (!selected?.children) return []\n      currentOptions = selected.children\n    }\n    return currentOptions\n  }, [options])\n\n  // Get selected options objects from path\n  const getSelectedOptions = useCallback((path: (string | number)[]): CascaderOption[] => {\n    const result: CascaderOption[] = []\n    let currentOptions = options\n\n    for (const val of path) {\n      const found = currentOptions.find(opt => opt.value === val)\n      if (!found) break\n      result.push(found)\n      currentOptions = found.children || []\n    }\n\n    return result\n  }, [options])\n\n  // Determine which path to use for displaying columns\n  const activePath = isOpen ? (hoveredPath.length > 0 ? hoveredPath : selectedPath) : selectedPath\n\n  // Build columns to display\n  const columns: CascaderOption[][] = []\n  columns.push(options)\n\n  for (let i = 0; i < activePath.length; i++) {\n    const nextOptions = getOptionsAtLevel(i + 1, activePath)\n    if (nextOptions.length > 0) {\n      columns.push(nextOptions)\n    }\n  }\n\n  const handleOptionClick = (option: CascaderOption, level: number) => {\n    if (option.disabled) return\n\n    const newPath = [...activePath.slice(0, level), option.value]\n\n    if (option.children && option.children.length > 0) {\n      // Has children - just expand, don't select yet\n      setHoveredPath(newPath)\n    } else {\n      // Leaf node - select and close\n      setSelectedPath(newPath)\n      setIsOpen(false)\n      setHoveredPath([])\n      onChange?.(newPath, getSelectedOptions(newPath))\n    }\n  }\n\n  const handleOptionHover = (option: CascaderOption, level: number) => {\n    if (expandTrigger !== 'hover' || option.disabled) return\n\n    const newPath = [...activePath.slice(0, level), option.value]\n    setHoveredPath(newPath)\n  }\n\n  const handleClear = (e: React.MouseEvent) => {\n    e.stopPropagation()\n    setSelectedPath([])\n    onChange?.([], [])\n  }\n\n  const handleKeyDown = (e: React.KeyboardEvent) => {\n    if (disabled) return\n\n    switch (e.key) {\n      case 'Enter':\n      case ' ':\n        e.preventDefault()\n        setIsOpen(!isOpen)\n        break\n      case 'Escape':\n        e.preventDefault()\n        setIsOpen(false)\n        setHoveredPath([])\n        break\n    }\n  }\n\n  // Display value\n  const selectedOptions = getSelectedOptions(selectedPath)\n  const labels = selectedOptions.map(opt => opt.label)\n  const displayValue = displayRender\n    ? displayRender(labels, selectedOptions)\n    : labels.join(' / ')\n\n  // Size classes\n  const sizeClasses = {\n    xs: 'input-xs text-xs',\n    sm: 'input-sm text-sm',\n    md: 'input-md',\n    lg: 'input-lg text-lg',\n  }\n\n  const dropdownSizeClasses = {\n    xs: 'text-xs',\n    sm: 'text-sm',\n    md: 'text-base',\n    lg: 'text-lg',\n  }\n\n  return (\n    <div ref={containerRef} className={`relative inline-block w-full ${className}`} data-state={isOpen ? 'open' : 'closed'} {...rest}>\n      {/* Input/Trigger */}\n      <div\n        id={inputId}\n        role=\"combobox\"\n        aria-expanded={isOpen}\n        aria-haspopup=\"listbox\"\n        aria-controls={listboxId}\n        tabIndex={disabled ? -1 : 0}\n        className={`input input-bordered w-full flex items-center justify-between cursor-pointer ${sizeClasses[size]} ${\n          disabled ? 'input-disabled cursor-not-allowed' : ''\n        } ${isOpen ? 'border-primary' : ''}`}\n        onClick={() => !disabled && setIsOpen(!isOpen)}\n        onKeyDown={handleKeyDown}\n      >\n        <span className={selectedPath.length === 0 ? 'text-base-content/50' : ''}>\n          {selectedPath.length > 0 ? displayValue : placeholder}\n        </span>\n        <div className=\"flex items-center gap-1\">\n          {allowClear && selectedPath.length > 0 && !disabled && (\n            <button\n              type=\"button\"\n              className=\"btn btn-ghost btn-xs btn-circle\"\n              onClick={handleClear}\n              aria-label=\"Clear selection\"\n            >\n              <svg className=\"w-3 h-3\" fill=\"none\" viewBox=\"0 0 24 24\" stroke=\"currentColor\">\n                <path strokeLinecap=\"round\" strokeLinejoin=\"round\" strokeWidth={2} d=\"M6 18L18 6M6 6l12 12\" />\n              </svg>\n            </button>\n          )}\n          <svg\n            className={`w-4 h-4 transition-transform ${isOpen ? 'rotate-180' : ''}`}\n            fill=\"none\"\n            viewBox=\"0 0 24 24\"\n            stroke=\"currentColor\"\n          >\n            <path strokeLinecap=\"round\" strokeLinejoin=\"round\" strokeWidth={2} d=\"M19 9l-7 7-7-7\" />\n          </svg>\n        </div>\n      </div>\n\n      {/* Dropdown */}\n      {isOpen && (\n        <div\n          id={listboxId}\n          className={`absolute z-50 mt-1 bg-base-100 border border-base-300 rounded-lg shadow-lg flex ${dropdownSizeClasses[size]}`}\n        >\n          {columns.map((columnOptions, colIndex) => (\n            <ul\n              key={colIndex}\n              role=\"listbox\"\n              className={`min-w-[120px] max-h-[200px] overflow-y-auto py-1 ${\n                colIndex > 0 ? 'border-l border-base-300' : ''\n              }`}\n            >\n              {columnOptions.map((option) => {\n                const isSelected = selectedPath[colIndex] === option.value\n                const isHovered = activePath[colIndex] === option.value\n                const hasChildren = option.children && option.children.length > 0\n\n                return (\n                  <li\n                    key={option.value}\n                    role=\"option\"\n                    aria-selected={isSelected}\n                    aria-disabled={option.disabled}\n                    className={`px-3 py-2 cursor-pointer flex items-center justify-between gap-2 ${\n                      option.disabled\n                        ? 'text-base-content/30 cursor-not-allowed'\n                        : isSelected\n                        ? 'bg-primary text-primary-content'\n                        : isHovered\n                        ? 'bg-base-200'\n                        : 'hover:bg-base-200'\n                    }`}\n                    onClick={() => handleOptionClick(option, colIndex)}\n                    onMouseEnter={() => handleOptionHover(option, colIndex)}\n                  >\n                    <span>{option.label}</span>\n                    {hasChildren && (\n                      <svg className=\"w-4 h-4\" fill=\"none\" viewBox=\"0 0 24 24\" stroke=\"currentColor\">\n                        <path strokeLinecap=\"round\" strokeLinejoin=\"round\" strokeWidth={2} d=\"M9 5l7 7-7 7\" />\n                      </svg>\n                    )}\n                  </li>\n                )\n              })}\n            </ul>\n          ))}\n        </div>\n      )}\n    </div>\n  )\n}\n"],"names":["Cascader","options","value","onChange","placeholder","disabled","allowClear","expandTrigger","displayRender","size","className","rest","isOpen","setIsOpen","useState","selectedPath","setSelectedPath","hoveredPath","setHoveredPath","containerRef","useRef","inputId","useId","listboxId","useEffect","handleClickOutside","e","getOptionsAtLevel","useCallback","level","path","currentOptions","i","selected","opt","getSelectedOptions","result","val","found","activePath","columns","nextOptions","handleOptionClick","option","newPath","handleOptionHover","handleClear","handleKeyDown","selectedOptions","labels","displayValue","sizeClasses","dropdownSizeClasses","jsxs","jsx","columnOptions","colIndex","isSelected","isHovered","hasChildren"],"mappings":";;AAqBO,SAASA,EAAS;AAAA,EACvB,SAAAC;AAAA,EACA,OAAAC;AAAA,EACA,UAAAC;AAAA,EACA,aAAAC,IAAc;AAAA,EACd,UAAAC,IAAW;AAAA,EACX,YAAAC,IAAa;AAAA,EACb,eAAAC,IAAgB;AAAA,EAChB,eAAAC;AAAA,EACA,MAAAC,IAAO;AAAA,EACP,WAAAC,IAAY;AAAA,EACZ,GAAGC;AACL,GAAkB;AAChB,QAAM,CAACC,GAAQC,CAAS,IAAIC,EAAS,EAAK,GACpC,CAACC,GAAcC,CAAe,IAAIF,EAA8BZ,KAAS,CAAA,CAAE,GAC3E,CAACe,GAAaC,CAAc,IAAIJ,EAA8B,CAAA,CAAE,GAChEK,IAAeC,EAAuB,IAAI,GAC1CC,IAAUC,EAAA,GACVC,IAAYD,EAAA;AAGlB,EAAAE,EAAU,MAAM;AACd,IAAItB,MAAU,UACZc,EAAgBd,CAAK;AAAA,EAEzB,GAAG,CAACA,CAAK,CAAC,GAGVsB,EAAU,MAAM;AACd,UAAMC,IAAqB,CAACC,MAAkB;AAC5C,MAAIP,EAAa,WAAW,CAACA,EAAa,QAAQ,SAASO,EAAE,MAAc,MACzEb,EAAU,EAAK,GACfK,EAAe,CAAA,CAAE;AAAA,IAErB;AAEA,QAAIN;AACF,sBAAS,iBAAiB,aAAaa,CAAkB,GAClD,MAAM,SAAS,oBAAoB,aAAaA,CAAkB;AAAA,EAE7E,GAAG,CAACb,CAAM,CAAC;AAGX,QAAMe,IAAoBC,EAAY,CAACC,GAAeC,MAAgD;AACpG,QAAID,MAAU,EAAG,QAAO5B;AAExB,QAAI8B,IAAiB9B;AACrB,aAAS+B,IAAI,GAAGA,IAAIH,GAAOG,KAAK;AAC9B,YAAMC,IAAWF,EAAe,KAAK,CAAAG,MAAOA,EAAI,UAAUJ,EAAKE,CAAC,CAAC;AACjE,UAAI,CAACC,GAAU,SAAU,QAAO,CAAA;AAChC,MAAAF,IAAiBE,EAAS;AAAA,IAC5B;AACA,WAAOF;AAAA,EACT,GAAG,CAAC9B,CAAO,CAAC,GAGNkC,IAAqBP,EAAY,CAACE,MAAgD;AACtF,UAAMM,IAA2B,CAAA;AACjC,QAAIL,IAAiB9B;AAErB,eAAWoC,KAAOP,GAAM;AACtB,YAAMQ,IAAQP,EAAe,KAAK,CAAAG,MAAOA,EAAI,UAAUG,CAAG;AAC1D,UAAI,CAACC,EAAO;AACZ,MAAAF,EAAO,KAAKE,CAAK,GACjBP,IAAiBO,EAAM,YAAY,CAAA;AAAA,IACrC;AAEA,WAAOF;AAAA,EACT,GAAG,CAACnC,CAAO,CAAC,GAGNsC,IAAa3B,KAAUK,EAAY,SAAS,IAAIA,IAA8BF,GAG9EyB,IAA8B,CAAA;AACpC,EAAAA,EAAQ,KAAKvC,CAAO;AAEpB,WAAS+B,IAAI,GAAGA,IAAIO,EAAW,QAAQP,KAAK;AAC1C,UAAMS,IAAcd,EAAkBK,IAAI,GAAGO,CAAU;AACvD,IAAIE,EAAY,SAAS,KACvBD,EAAQ,KAAKC,CAAW;AAAA,EAE5B;AAEA,QAAMC,IAAoB,CAACC,GAAwBd,MAAkB;AACnE,QAAIc,EAAO,SAAU;AAErB,UAAMC,IAAU,CAAC,GAAGL,EAAW,MAAM,GAAGV,CAAK,GAAGc,EAAO,KAAK;AAE5D,IAAIA,EAAO,YAAYA,EAAO,SAAS,SAAS,IAE9CzB,EAAe0B,CAAO,KAGtB5B,EAAgB4B,CAAO,GACvB/B,EAAU,EAAK,GACfK,EAAe,CAAA,CAAE,GACjBf,IAAWyC,GAAST,EAAmBS,CAAO,CAAC;AAAA,EAEnD,GAEMC,IAAoB,CAACF,GAAwBd,MAAkB;AACnE,QAAItB,MAAkB,WAAWoC,EAAO,SAAU;AAElD,UAAMC,IAAU,CAAC,GAAGL,EAAW,MAAM,GAAGV,CAAK,GAAGc,EAAO,KAAK;AAC5D,IAAAzB,EAAe0B,CAAO;AAAA,EACxB,GAEME,IAAc,CAAC,MAAwB;AAC3C,MAAE,gBAAA,GACF9B,EAAgB,CAAA,CAAE,GAClBb,IAAW,CAAA,GAAI,EAAE;AAAA,EACnB,GAEM4C,IAAgB,CAAC,MAA2B;AAChD,QAAI,CAAA1C;AAEJ,cAAQ,EAAE,KAAA;AAAA,QACR,KAAK;AAAA,QACL,KAAK;AACH,YAAE,eAAA,GACFQ,EAAU,CAACD,CAAM;AACjB;AAAA,QACF,KAAK;AACH,YAAE,eAAA,GACFC,EAAU,EAAK,GACfK,EAAe,CAAA,CAAE;AACjB;AAAA,MAAA;AAAA,EAEN,GAGM8B,IAAkBb,EAAmBpB,CAAY,GACjDkC,IAASD,EAAgB,IAAI,CAAAd,MAAOA,EAAI,KAAK,GAC7CgB,IAAe1C,IACjBA,EAAcyC,GAAQD,CAAe,IACrCC,EAAO,KAAK,KAAK,GAGfE,IAAc;AAAA,IAClB,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,EAAA,GAGAC,IAAsB;AAAA,IAC1B,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,EAAA;AAGN,SACE,gBAAAC,EAAC,OAAA,EAAI,KAAKlC,GAAc,WAAW,gCAAgCT,CAAS,IAAI,cAAYE,IAAS,SAAS,UAAW,GAAGD,GAE1H,UAAA;AAAA,IAAA,gBAAA0C;AAAA,MAAC;AAAA,MAAA;AAAA,QACC,IAAIhC;AAAA,QACJ,MAAK;AAAA,QACL,iBAAeT;AAAA,QACf,iBAAc;AAAA,QACd,iBAAeW;AAAA,QACf,UAAUlB,IAAW,KAAK;AAAA,QAC1B,WAAW,gFAAgF8C,EAAY1C,CAAI,CAAC,IAC1GJ,IAAW,sCAAsC,EACnD,IAAIO,IAAS,mBAAmB,EAAE;AAAA,QAClC,SAAS,MAAM,CAACP,KAAYQ,EAAU,CAACD,CAAM;AAAA,QAC7C,WAAWmC;AAAA,QAEX,UAAA;AAAA,UAAA,gBAAAO,EAAC,QAAA,EAAK,WAAWvC,EAAa,WAAW,IAAI,yBAAyB,IACnE,UAAAA,EAAa,SAAS,IAAImC,IAAe9C,GAC5C;AAAA,UACA,gBAAAiD,EAAC,OAAA,EAAI,WAAU,2BACZ,UAAA;AAAA,YAAA/C,KAAcS,EAAa,SAAS,KAAK,CAACV,KACzC,gBAAAiD;AAAA,cAAC;AAAA,cAAA;AAAA,gBACC,MAAK;AAAA,gBACL,WAAU;AAAA,gBACV,SAASR;AAAA,gBACT,cAAW;AAAA,gBAEX,UAAA,gBAAAQ,EAAC,SAAI,WAAU,WAAU,MAAK,QAAO,SAAQ,aAAY,QAAO,gBAC9D,4BAAC,QAAA,EAAK,eAAc,SAAQ,gBAAe,SAAQ,aAAa,GAAG,GAAE,wBAAuB,EAAA,CAC9F;AAAA,cAAA;AAAA,YAAA;AAAA,YAGJ,gBAAAA;AAAA,cAAC;AAAA,cAAA;AAAA,gBACC,WAAW,gCAAgC1C,IAAS,eAAe,EAAE;AAAA,gBACrE,MAAK;AAAA,gBACL,SAAQ;AAAA,gBACR,QAAO;AAAA,gBAEP,UAAA,gBAAA0C,EAAC,UAAK,eAAc,SAAQ,gBAAe,SAAQ,aAAa,GAAG,GAAE,iBAAA,CAAiB;AAAA,cAAA;AAAA,YAAA;AAAA,UACxF,EAAA,CACF;AAAA,QAAA;AAAA,MAAA;AAAA,IAAA;AAAA,IAID1C,KACC,gBAAA0C;AAAA,MAAC;AAAA,MAAA;AAAA,QACC,IAAI/B;AAAA,QACJ,WAAW,mFAAmF6B,EAAoB3C,CAAI,CAAC;AAAA,QAEtH,UAAA+B,EAAQ,IAAI,CAACe,GAAeC,MAC3B,gBAAAF;AAAA,UAAC;AAAA,UAAA;AAAA,YAEC,MAAK;AAAA,YACL,WAAW,oDACTE,IAAW,IAAI,6BAA6B,EAC9C;AAAA,YAEC,UAAAD,EAAc,IAAI,CAACZ,MAAW;AAC7B,oBAAMc,IAAa1C,EAAayC,CAAQ,MAAMb,EAAO,OAC/Ce,IAAYnB,EAAWiB,CAAQ,MAAMb,EAAO,OAC5CgB,IAAchB,EAAO,YAAYA,EAAO,SAAS,SAAS;AAEhE,qBACE,gBAAAU;AAAA,gBAAC;AAAA,gBAAA;AAAA,kBAEC,MAAK;AAAA,kBACL,iBAAeI;AAAA,kBACf,iBAAed,EAAO;AAAA,kBACtB,WAAW,oEACTA,EAAO,WACH,4CACAc,IACA,oCACAC,IACA,gBACA,mBACN;AAAA,kBACA,SAAS,MAAMhB,EAAkBC,GAAQa,CAAQ;AAAA,kBACjD,cAAc,MAAMX,EAAkBF,GAAQa,CAAQ;AAAA,kBAEtD,UAAA;AAAA,oBAAA,gBAAAF,EAAC,QAAA,EAAM,YAAO,MAAA,CAAM;AAAA,oBACnBK,uBACE,OAAA,EAAI,WAAU,WAAU,MAAK,QAAO,SAAQ,aAAY,QAAO,gBAC9D,UAAA,gBAAAL,EAAC,QAAA,EAAK,eAAc,SAAQ,gBAAe,SAAQ,aAAa,GAAG,GAAE,eAAA,CAAe,EAAA,CACtF;AAAA,kBAAA;AAAA,gBAAA;AAAA,gBApBGX,EAAO;AAAA,cAAA;AAAA,YAwBlB,CAAC;AAAA,UAAA;AAAA,UArCIa;AAAA,QAAA,CAuCR;AAAA,MAAA;AAAA,IAAA;AAAA,EACH,GAEJ;AAEJ;"}
+{"version":3,"file":"index14.js","sources":["../src/components/Card.tsx"],"sourcesContent":["import React from 'react'\n\nexport interface CardProps extends Omit<React.HTMLAttributes<HTMLDivElement>, 'title'> {\n  children: React.ReactNode\n  title?: React.ReactNode\n  cover?: React.ReactNode\n  actions?: React.ReactNode\n  size?: 'xs' | 'sm' | 'md' | 'lg' | 'xl'\n  bordered?: boolean\n  side?: boolean\n  imageFull?: boolean\n  actionsJustify?: 'start' | 'center' | 'end'\n  loading?: boolean\n  hoverable?: boolean\n  // Meta props for avatar + description layout\n  avatar?: React.ReactNode\n  description?: React.ReactNode\n}\n\nexport interface CardGridProps extends React.HTMLAttributes<HTMLDivElement> {\n  children: React.ReactNode\n  hoverable?: boolean\n}\n\nfunction CardGrid({ children, hoverable = false, className = '', style, ...rest }: CardGridProps) {\n  const classes = [\n    'p-6 border border-base-content/10',\n    hoverable && 'cursor-pointer hover:shadow-md transition-shadow',\n    className,\n  ]\n    .filter(Boolean)\n    .join(' ')\n\n  return (\n    <div className={classes} style={style} {...rest}>\n      {children}\n    </div>\n  )\n}\n\nfunction CardRoot({\n  children,\n  title,\n  cover,\n  actions,\n  className = '',\n  style,\n  size,\n  bordered = true,\n  side = false,\n  imageFull = false,\n  actionsJustify = 'end',\n  loading = false,\n  hoverable = false,\n  avatar,\n  description,\n  ...rest\n}: CardProps) {\n  const sizeClasses: Record<string, string> = {\n    xs: 'card-xs',\n    sm: 'card-sm',\n    md: 'card-md',\n    lg: 'card-lg',\n    xl: 'card-xl',\n  }\n\n  const classes = [\n    'card',\n    'bg-base-100',\n    size && sizeClasses[size],\n    bordered && 'border border-base-content/10 shadow-sm',\n    side && 'card-side',\n    imageFull && 'image-full',\n    hoverable && 'transition-shadow hover:shadow-lg cursor-pointer',\n    className,\n  ]\n    .filter(Boolean)\n    .join(' ')\n\n  const justifyClasses: Record<string, string> = {\n    start: 'justify-start',\n    center: 'justify-center',\n    end: 'justify-end',\n  }\n\n  if (loading) {\n    return (\n      <div className={classes} style={style} {...rest}>\n        {cover && (\n          <figure>\n            <div className=\"skeleton h-48 w-full rounded-none\" />\n          </figure>\n        )}\n        <div className=\"card-body\">\n          {(avatar || title) && (\n            <div className=\"flex gap-4 mb-4\">\n              {avatar && <div className=\"skeleton w-12 h-12 rounded-full flex-shrink-0\" />}\n              <div className=\"flex-1 space-y-2\">\n                <div className=\"skeleton h-6 w-2/3\" />\n                {description && <div className=\"skeleton h-4 w-full\" />}\n              </div>\n            </div>\n          )}\n          {!avatar && !title && (\n            <>\n              <div className=\"skeleton h-6 w-2/3 mb-4\" />\n              <div className=\"space-y-2\">\n                <div className=\"skeleton h-4 w-full\" />\n                <div className=\"skeleton h-4 w-5/6\" />\n                <div className=\"skeleton h-4 w-4/6\" />\n              </div>\n            </>\n          )}\n          {actions && (\n            <div className={`card-actions ${justifyClasses[actionsJustify]} mt-4`}>\n              <div className=\"skeleton h-10 w-20\" />\n              <div className=\"skeleton h-10 w-20\" />\n            </div>\n          )}\n        </div>\n      </div>\n    )\n  }\n\n  // Render with avatar + title + description layout (meta style)\n  const hasMetaLayout = avatar || (title && description)\n\n  return (\n    <div className={classes} style={style} {...rest}>\n      {cover && <figure>{cover}</figure>}\n      <div className=\"card-body\">\n        {hasMetaLayout ? (\n          <>\n            <div className=\"flex gap-4\">\n              {avatar && <div className=\"flex-shrink-0\">{avatar}</div>}\n              <div className=\"flex-1 min-w-0\">\n                {title && <h2 className=\"card-title\">{title}</h2>}\n                {description && <p className=\"text-sm opacity-70 mt-1\">{description}</p>}\n              </div>\n            </div>\n            {children}\n          </>\n        ) : (\n          <>\n            {title && <h2 className=\"card-title\">{title}</h2>}\n            {children}\n          </>\n        )}\n        {actions && <div className={`card-actions ${justifyClasses[actionsJustify]}`}>{actions}</div>}\n      </div>\n    </div>\n  )\n}\n\nexport const Card = Object.assign(CardRoot, {\n  Grid: CardGrid,\n})\n\nexport default Card\n"],"names":["CardGrid","children","hoverable","className","style","rest","classes","CardRoot","title","cover","actions","size","bordered","side","imageFull","actionsJustify","loading","avatar","description","justifyClasses","jsx","jsxs","Fragment","Card"],"mappings":";AAwBA,SAASA,EAAS,EAAE,UAAAC,GAAU,WAAAC,IAAY,IAAO,WAAAC,IAAY,IAAI,OAAAC,GAAO,GAAGC,KAAuB;AAChG,QAAMC,IAAU;AAAA,IACd;AAAA,IACAJ,KAAa;AAAA,IACbC;AAAA,EAAA,EAEC,OAAO,OAAO,EACd,KAAK,GAAG;AAEX,2BACG,OAAA,EAAI,WAAWG,GAAS,OAAAF,GAAe,GAAGC,GACxC,UAAAJ,GACH;AAEJ;AAEA,SAASM,EAAS;AAAA,EAChB,UAAAN;AAAA,EACA,OAAAO;AAAA,EACA,OAAAC;AAAA,EACA,SAAAC;AAAA,EACA,WAAAP,IAAY;AAAA,EACZ,OAAAC;AAAA,EACA,MAAAO;AAAA,EACA,UAAAC,IAAW;AAAA,EACX,MAAAC,IAAO;AAAA,EACP,WAAAC,IAAY;AAAA,EACZ,gBAAAC,IAAiB;AAAA,EACjB,SAAAC,IAAU;AAAA,EACV,WAAAd,IAAY;AAAA,EACZ,QAAAe;AAAA,EACA,aAAAC;AAAA,EACA,GAAGb;AACL,GAAc;AASZ,QAAMC,IAAU;AAAA,IACd;AAAA,IACA;AAAA,IACAK,KAX0C;AAAA,MAC1C,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IAAA,EAMgBA,CAAI;AAAA,IACxBC,KAAY;AAAA,IACZC,KAAQ;AAAA,IACRC,KAAa;AAAA,IACbZ,KAAa;AAAA,IACbC;AAAA,EAAA,EAEC,OAAO,OAAO,EACd,KAAK,GAAG,GAELgB,IAAyC;AAAA,IAC7C,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,KAAK;AAAA,EAAA;AAGP,SAAIH,sBAEC,OAAA,EAAI,WAAWV,GAAS,OAAAF,GAAe,GAAGC,GACxC,UAAA;AAAA,IAAAI,uBACE,UAAA,EACC,UAAA,gBAAAW,EAAC,OAAA,EAAI,WAAU,qCAAoC,GACrD;AAAA,IAEF,gBAAAC,EAAC,OAAA,EAAI,WAAU,aACX,UAAA;AAAA,OAAAJ,KAAUT,MACV,gBAAAa,EAAC,OAAA,EAAI,WAAU,mBACZ,UAAA;AAAA,QAAAJ,KAAU,gBAAAG,EAAC,OAAA,EAAI,WAAU,gDAAA,CAAgD;AAAA,QAC1E,gBAAAC,EAAC,OAAA,EAAI,WAAU,oBACb,UAAA;AAAA,UAAA,gBAAAD,EAAC,OAAA,EAAI,WAAU,qBAAA,CAAqB;AAAA,UACnCF,KAAe,gBAAAE,EAAC,OAAA,EAAI,WAAU,sBAAA,CAAsB;AAAA,QAAA,EAAA,CACvD;AAAA,MAAA,GACF;AAAA,MAED,CAACH,KAAU,CAACT,KACX,gBAAAa,EAAAC,GAAA,EACE,UAAA;AAAA,QAAA,gBAAAF,EAAC,OAAA,EAAI,WAAU,0BAAA,CAA0B;AAAA,QACzC,gBAAAC,EAAC,OAAA,EAAI,WAAU,aACb,UAAA;AAAA,UAAA,gBAAAD,EAAC,OAAA,EAAI,WAAU,sBAAA,CAAsB;AAAA,UACrC,gBAAAA,EAAC,OAAA,EAAI,WAAU,qBAAA,CAAqB;AAAA,UACpC,gBAAAA,EAAC,OAAA,EAAI,WAAU,qBAAA,CAAqB;AAAA,QAAA,EAAA,CACtC;AAAA,MAAA,GACF;AAAA,MAEDV,uBACE,OAAA,EAAI,WAAW,gBAAgBS,EAAeJ,CAAc,CAAC,SAC5D,UAAA;AAAA,QAAA,gBAAAK,EAAC,OAAA,EAAI,WAAU,qBAAA,CAAqB;AAAA,QACpC,gBAAAA,EAAC,OAAA,EAAI,WAAU,qBAAA,CAAqB;AAAA,MAAA,EAAA,CACtC;AAAA,IAAA,EAAA,CAEJ;AAAA,EAAA,GACF,sBAQD,OAAA,EAAI,WAAWd,GAAS,OAAAF,GAAe,GAAGC,GACxC,UAAA;AAAA,IAAAI,KAAS,gBAAAW,EAAC,YAAQ,UAAAX,EAAA,CAAM;AAAA,IACzB,gBAAAY,EAAC,OAAA,EAAI,WAAU,aACZ,UAAA;AAAA,MANeJ,KAAWT,KAASU,IAOlC,gBAAAG,EAAAC,GAAA,EACE,UAAA;AAAA,QAAA,gBAAAD,EAAC,OAAA,EAAI,WAAU,cACZ,UAAA;AAAA,UAAAJ,KAAU,gBAAAG,EAAC,OAAA,EAAI,WAAU,iBAAiB,UAAAH,GAAO;AAAA,UAClD,gBAAAI,EAAC,OAAA,EAAI,WAAU,kBACZ,UAAA;AAAA,YAAAb,KAAS,gBAAAY,EAAC,MAAA,EAAG,WAAU,cAAc,UAAAZ,GAAM;AAAA,YAC3CU,KAAe,gBAAAE,EAAC,KAAA,EAAE,WAAU,2BAA2B,UAAAF,EAAA,CAAY;AAAA,UAAA,EAAA,CACtE;AAAA,QAAA,GACF;AAAA,QACCjB;AAAA,MAAA,EAAA,CACH,IAEA,gBAAAoB,EAAAC,GAAA,EACG,UAAA;AAAA,QAAAd,KAAS,gBAAAY,EAAC,MAAA,EAAG,WAAU,cAAc,UAAAZ,GAAM;AAAA,QAC3CP;AAAA,MAAA,GACH;AAAA,MAEDS,uBAAY,OAAA,EAAI,WAAW,gBAAgBS,EAAeJ,CAAc,CAAC,IAAK,UAAAL,EAAA,CAAQ;AAAA,IAAA,EAAA,CACzF;AAAA,EAAA,GACF;AAEJ;AAEO,MAAMa,IAAO,OAAO,OAAOhB,GAAU;AAAA,EAC1C,MAAMP;AACR,CAAC;"}

package/dist/index140.js

@@ -1,5 +1,5 @@
-var e = {};
+var r = {};
 export {
-  e as __exports
+  r as __exports
 };
 //# sourceMappingURL=index140.js.map

package/dist/index141.js

@@ -1,24 +1,35 @@
-import { __exports as e } from "./index151.js";
-var s;
-function R() {
-  if (s) return e;
-  s = 1;
-  const n = "[0-9]+", E = "[A-Z $%*+\\-./:]+";
-  let u = "(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+";
-  u = u.replace(/u/g, "\\u");
-  const i = "(?:(?![A-Z0-9 $%*+\\-./:]|" + u + `)(?:.|[\r
-]))+`;
-  e.KANJI = new RegExp(u, "g"), e.BYTE_KANJI = new RegExp("[^A-Z0-9 $%*+\\-./:]+", "g"), e.BYTE = new RegExp(i, "g"), e.NUMERIC = new RegExp(n, "g"), e.ALPHANUMERIC = new RegExp(E, "g");
-  const c = new RegExp("^" + u + "$"), g = new RegExp("^" + n + "$"), A = new RegExp("^[A-Z0-9 $%*+\\-./:]+$");
-  return e.testKanji = function(t) {
-    return c.test(t);
-  }, e.testNumeric = function(t) {
-    return g.test(t);
-  }, e.testAlphanumeric = function(t) {
-    return A.test(t);
-  }, e;
+import { __exports as f } from "./index153.js";
+import { __require as c } from "./index154.js";
+var m;
+function y() {
+  return m ? f : (m = 1, (function(o) {
+    const u = c();
+    o.mul = function(t, n) {
+      const e = new Uint8Array(t.length + n.length - 1);
+      for (let r = 0; r < t.length; r++)
+        for (let l = 0; l < n.length; l++)
+          e[r + l] ^= u.mul(t[r], n[l]);
+      return e;
+    }, o.mod = function(t, n) {
+      let e = new Uint8Array(t);
+      for (; e.length - n.length >= 0; ) {
+        const r = e[0];
+        for (let i = 0; i < n.length; i++)
+          e[i] ^= u.mul(n[i], r);
+        let l = 0;
+        for (; l < e.length && e[l] === 0; ) l++;
+        e = e.slice(l);
+      }
+      return e;
+    }, o.generateECPolynomial = function(t) {
+      let n = new Uint8Array([1]);
+      for (let e = 0; e < t; e++)
+        n = o.mul(n, new Uint8Array([1, u.exp(e)]));
+      return n;
+    };
+  })(f), f);
 }
 export {
-  R as __require
+  y as __require
 };
 //# sourceMappingURL=index141.js.map

package/dist/index141.js.map

@@ -1 +1 @@
-{"version":3,"file":"index141.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/regex.js"],"sourcesContent":["const numeric = '[0-9]+'\nconst alphanumeric = '[A-Z $%*+\\\\-./:]+'\nlet kanji = '(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|' +\n  '[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|' +\n  '[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|' +\n  '[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+'\nkanji = kanji.replace(/u/g, '\\\\u')\n\nconst byte = '(?:(?![A-Z0-9 $%*+\\\\-./:]|' + kanji + ')(?:.|[\\r\\n]))+'\n\nexports.KANJI = new RegExp(kanji, 'g')\nexports.BYTE_KANJI = new RegExp('[^A-Z0-9 $%*+\\\\-./:]+', 'g')\nexports.BYTE = new RegExp(byte, 'g')\nexports.NUMERIC = new RegExp(numeric, 'g')\nexports.ALPHANUMERIC = new RegExp(alphanumeric, 'g')\n\nconst TEST_KANJI = new RegExp('^' + kanji + '$')\nconst TEST_NUMERIC = new RegExp('^' + numeric + '$')\nconst TEST_ALPHANUMERIC = new RegExp('^[A-Z0-9 $%*+\\\\-./:]+$')\n\nexports.testKanji = function testKanji (str) {\n  return TEST_KANJI.test(str)\n}\n\nexports.testNumeric = function testNumeric (str) {\n  return TEST_NUMERIC.test(str)\n}\n\nexports.testAlphanumeric = function testAlphanumeric (str) {\n  return TEST_ALPHANUMERIC.test(str)\n}\n"],"names":["numeric","alphanumeric","kanji","byte","regex","TEST_KANJI","TEST_NUMERIC","TEST_ALPHANUMERIC","str"],"mappings":";;;;;AAAA,QAAMA,IAAU,UACVC,IAAe;AACrB,MAAIC,IAAQ;AAIZ,EAAAA,IAAQA,EAAM,QAAQ,MAAM,KAAK;AAEjC,QAAMC,IAAO,+BAA+BD,IAAQ;AAAA;AAEpD,EAAAE,EAAA,QAAgB,IAAI,OAAOF,GAAO,GAAG,GACrCE,EAAA,aAAqB,IAAI,OAAO,yBAAyB,GAAG,GAC5DA,EAAA,OAAe,IAAI,OAAOD,GAAM,GAAG,GACnCC,EAAA,UAAkB,IAAI,OAAOJ,GAAS,GAAG,GACzCI,EAAA,eAAuB,IAAI,OAAOH,GAAc,GAAG;AAEnD,QAAMI,IAAa,IAAI,OAAO,MAAMH,IAAQ,GAAG,GACzCI,IAAe,IAAI,OAAO,MAAMN,IAAU,GAAG,GAC7CO,IAAoB,IAAI,OAAO,wBAAwB;AAE7D,SAAAH,EAAA,YAAoB,SAAoBI,GAAK;AAC3C,WAAOH,EAAW,KAAKG,CAAG;AAAA,EAC5B,GAEAJ,EAAA,cAAsB,SAAsBI,GAAK;AAC/C,WAAOF,EAAa,KAAKE,CAAG;AAAA,EAC9B,GAEAJ,EAAA,mBAA2B,SAA2BI,GAAK;AACzD,WAAOD,EAAkB,KAAKC,CAAG;AAAA,EACnC;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index141.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/polynomial.js"],"sourcesContent":["const GF = require('./galois-field')\n\n/**\n * Multiplies two polynomials inside Galois Field\n *\n * @param  {Uint8Array} p1 Polynomial\n * @param  {Uint8Array} p2 Polynomial\n * @return {Uint8Array}    Product of p1 and p2\n */\nexports.mul = function mul (p1, p2) {\n  const coeff = new Uint8Array(p1.length + p2.length - 1)\n\n  for (let i = 0; i < p1.length; i++) {\n    for (let j = 0; j < p2.length; j++) {\n      coeff[i + j] ^= GF.mul(p1[i], p2[j])\n    }\n  }\n\n  return coeff\n}\n\n/**\n * Calculate the remainder of polynomials division\n *\n * @param  {Uint8Array} divident Polynomial\n * @param  {Uint8Array} divisor  Polynomial\n * @return {Uint8Array}          Remainder\n */\nexports.mod = function mod (divident, divisor) {\n  let result = new Uint8Array(divident)\n\n  while ((result.length - divisor.length) >= 0) {\n    const coeff = result[0]\n\n    for (let i = 0; i < divisor.length; i++) {\n      result[i] ^= GF.mul(divisor[i], coeff)\n    }\n\n    // remove all zeros from buffer head\n    let offset = 0\n    while (offset < result.length && result[offset] === 0) offset++\n    result = result.slice(offset)\n  }\n\n  return result\n}\n\n/**\n * Generate an irreducible generator polynomial of specified degree\n * (used by Reed-Solomon encoder)\n *\n * @param  {Number} degree Degree of the generator polynomial\n * @return {Uint8Array}    Buffer containing polynomial coefficients\n */\nexports.generateECPolynomial = function generateECPolynomial (degree) {\n  let poly = new Uint8Array([1])\n  for (let i = 0; i < degree; i++) {\n    poly = exports.mul(poly, new Uint8Array([1, GF.exp(i)]))\n  }\n\n  return poly\n}\n"],"names":["GF","require$$0","exports","p1","p2","coeff","i","j","divident","divisor","result","offset","degree","poly"],"mappings":";;;;;AAAA,UAAMA,IAAKC,EAAA;AASXC,IAAAA,EAAA,MAAc,SAAcC,GAAIC,GAAI;AAClC,YAAMC,IAAQ,IAAI,WAAWF,EAAG,SAASC,EAAG,SAAS,CAAC;AAEtD,eAASE,IAAI,GAAGA,IAAIH,EAAG,QAAQG;AAC7B,iBAASC,IAAI,GAAGA,IAAIH,EAAG,QAAQG;AAC7B,UAAAF,EAAMC,IAAIC,CAAC,KAAKP,EAAG,IAAIG,EAAGG,CAAC,GAAGF,EAAGG,CAAC,CAAC;AAIvC,aAAOF;AAAA,IACT,GASAH,EAAA,MAAc,SAAcM,GAAUC,GAAS;AAC7C,UAAIC,IAAS,IAAI,WAAWF,CAAQ;AAEpC,aAAQE,EAAO,SAASD,EAAQ,UAAW,KAAG;AAC5C,cAAMJ,IAAQK,EAAO,CAAC;AAEtB,iBAAS,IAAI,GAAG,IAAID,EAAQ,QAAQ;AAClC,UAAAC,EAAO,CAAC,KAAKV,EAAG,IAAIS,EAAQ,CAAC,GAAGJ,CAAK;AAIvC,YAAIM,IAAS;AACb,eAAOA,IAASD,EAAO,UAAUA,EAAOC,CAAM,MAAM,IAAG,CAAAA;AACvD,QAAAD,IAASA,EAAO,MAAMC,CAAM;AAAA,MAChC;AAEE,aAAOD;AAAA,IACT,GASAR,EAAA,uBAA+B,SAA+BU,GAAQ;AACpE,UAAIC,IAAO,IAAI,WAAW,CAAC,CAAC,CAAC;AAC7B,eAASP,IAAI,GAAGA,IAAIM,GAAQN;AAC1B,QAAAO,IAAOX,EAAQ,IAAIW,GAAM,IAAI,WAAW,CAAC,GAAGb,EAAG,IAAIM,CAAC,CAAC,CAAC,CAAC;AAGzD,aAAOO;AAAA,IACT;AAAA;;","x_google_ignoreList":[0]}

package/dist/index142.js

@@ -1,5 +1,5 @@
-var e = {};
+var r = {};
 export {
-  e as __exports
+  r as __exports
 };
 //# sourceMappingURL=index142.js.map

package/dist/index143.js

@@ -1,27 +1,11 @@
-import { __require as h } from "./index124.js";
-var u, s;
-function c() {
-  if (s) return u;
-  s = 1;
-  const g = h();
-  function t(i) {
-    this.mode = g.NUMERIC, this.data = i.toString();
-  }
-  return t.getBitsLength = function(e) {
-    return 10 * Math.floor(e / 3) + (e % 3 ? e % 3 * 3 + 1 : 0);
-  }, t.prototype.getLength = function() {
-    return this.data.length;
-  }, t.prototype.getBitsLength = function() {
-    return t.getBitsLength(this.data.length);
-  }, t.prototype.write = function(e) {
-    let r, n, a;
-    for (r = 0; r + 3 <= this.data.length; r += 3)
-      n = this.data.substr(r, 3), a = parseInt(n, 10), e.put(a, 10);
-    const o = this.data.length - r;
-    o > 0 && (n = this.data.substr(r), a = parseInt(n, 10), e.put(a, o * 3 + 1));
-  }, u = t, u;
+import { __exports as e } from "./index155.js";
+var i;
+function t() {
+  return i ? e : (i = 1, e.isValid = function(r) {
+    return !isNaN(r) && r >= 1 && r <= 40;
+  }, e);
 }
 export {
-  c as __require
+  t as __require
 };
 //# sourceMappingURL=index143.js.map

package/dist/index143.js.map

@@ -1 +1 @@
-{"version":3,"file":"index143.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/numeric-data.js"],"sourcesContent":["const Mode = require('./mode')\n\nfunction NumericData (data) {\n  this.mode = Mode.NUMERIC\n  this.data = data.toString()\n}\n\nNumericData.getBitsLength = function getBitsLength (length) {\n  return 10 * Math.floor(length / 3) + ((length % 3) ? ((length % 3) * 3 + 1) : 0)\n}\n\nNumericData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nNumericData.prototype.getBitsLength = function getBitsLength () {\n  return NumericData.getBitsLength(this.data.length)\n}\n\nNumericData.prototype.write = function write (bitBuffer) {\n  let i, group, value\n\n  // The input data string is divided into groups of three digits,\n  // and each group is converted to its 10-bit binary equivalent.\n  for (i = 0; i + 3 <= this.data.length; i += 3) {\n    group = this.data.substr(i, 3)\n    value = parseInt(group, 10)\n\n    bitBuffer.put(value, 10)\n  }\n\n  // If the number of input digits is not an exact multiple of three,\n  // the final one or two digits are converted to 4 or 7 bits respectively.\n  const remainingNum = this.data.length - i\n  if (remainingNum > 0) {\n    group = this.data.substr(i)\n    value = parseInt(group, 10)\n\n    bitBuffer.put(value, remainingNum * 3 + 1)\n  }\n}\n\nmodule.exports = NumericData\n"],"names":["Mode","require$$0","NumericData","data","length","bitBuffer","i","group","value","remainingNum","numericData"],"mappings":";;;;;AAAA,QAAMA,IAAOC,EAAA;AAEb,WAASC,EAAaC,GAAM;AAC1B,SAAK,OAAOH,EAAK,SACjB,KAAK,OAAOG,EAAK,SAAQ;AAAA,EAC3B;AAEA,SAAAD,EAAY,gBAAgB,SAAwBE,GAAQ;AAC1D,WAAO,KAAK,KAAK,MAAMA,IAAS,CAAC,KAAMA,IAAS,IAAOA,IAAS,IAAK,IAAI,IAAK;AAAA,EAChF,GAEAF,EAAY,UAAU,YAAY,WAAsB;AACtD,WAAO,KAAK,KAAK;AAAA,EACnB,GAEAA,EAAY,UAAU,gBAAgB,WAA0B;AAC9D,WAAOA,EAAY,cAAc,KAAK,KAAK,MAAM;AAAA,EACnD,GAEAA,EAAY,UAAU,QAAQ,SAAgBG,GAAW;AACvD,QAAIC,GAAGC,GAAOC;AAId,SAAKF,IAAI,GAAGA,IAAI,KAAK,KAAK,KAAK,QAAQA,KAAK;AAC1C,MAAAC,IAAQ,KAAK,KAAK,OAAOD,GAAG,CAAC,GAC7BE,IAAQ,SAASD,GAAO,EAAE,GAE1BF,EAAU,IAAIG,GAAO,EAAE;AAKzB,UAAMC,IAAe,KAAK,KAAK,SAASH;AACxC,IAAIG,IAAe,MACjBF,IAAQ,KAAK,KAAK,OAAOD,CAAC,GAC1BE,IAAQ,SAASD,GAAO,EAAE,GAE1BF,EAAU,IAAIG,GAAOC,IAAe,IAAI,CAAC;AAAA,EAE7C,GAEAC,IAAiBR;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index143.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/version-check.js"],"sourcesContent":["/**\n * Check if QR Code version is valid\n *\n * @param  {Number}  version QR Code version\n * @return {Boolean}         true if valid version, false otherwise\n */\nexports.isValid = function isValid (version) {\n  return !isNaN(version) && version >= 1 && version <= 40\n}\n"],"names":["versionCheck","version"],"mappings":";;;yBAMAA,EAAA,UAAkB,SAAkBC,GAAS;AAC3C,WAAO,CAAC,MAAMA,CAAO,KAAKA,KAAW,KAAKA,KAAW;AAAA,EACvD;;","x_google_ignoreList":[0]}

package/dist/index144.js

@@ -1,74 +1,5 @@
-import { __require as s } from "./index124.js";
-var r, o;
-function d() {
-  if (o) return r;
-  o = 1;
-  const u = s(), n = [
-    "0",
-    "1",
-    "2",
-    "3",
-    "4",
-    "5",
-    "6",
-    "7",
-    "8",
-    "9",
-    "A",
-    "B",
-    "C",
-    "D",
-    "E",
-    "F",
-    "G",
-    "H",
-    "I",
-    "J",
-    "K",
-    "L",
-    "M",
-    "N",
-    "O",
-    "P",
-    "Q",
-    "R",
-    "S",
-    "T",
-    "U",
-    "V",
-    "W",
-    "X",
-    "Y",
-    "Z",
-    " ",
-    "$",
-    "%",
-    "*",
-    "+",
-    "-",
-    ".",
-    "/",
-    ":"
-  ];
-  function t(i) {
-    this.mode = u.ALPHANUMERIC, this.data = i;
-  }
-  return t.getBitsLength = function(a) {
-    return 11 * Math.floor(a / 2) + 6 * (a % 2);
-  }, t.prototype.getLength = function() {
-    return this.data.length;
-  }, t.prototype.getBitsLength = function() {
-    return t.getBitsLength(this.data.length);
-  }, t.prototype.write = function(a) {
-    let e;
-    for (e = 0; e + 2 <= this.data.length; e += 2) {
-      let h = n.indexOf(this.data[e]) * 45;
-      h += n.indexOf(this.data[e + 1]), a.put(h, 11);
-    }
-    this.data.length % 2 && a.put(n.indexOf(this.data[e]), 6);
-  }, r = t, r;
-}
+var o = {};
 export {
-  d as __require
+  o as __exports
 };
 //# sourceMappingURL=index144.js.map

package/dist/index144.js.map

@@ -1 +1 @@
-{"version":3,"file":"index144.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/alphanumeric-data.js"],"sourcesContent":["const Mode = require('./mode')\n\n/**\n * Array of characters available in alphanumeric mode\n *\n * As per QR Code specification, to each character\n * is assigned a value from 0 to 44 which in this case coincides\n * with the array index\n *\n * @type {Array}\n */\nconst ALPHA_NUM_CHARS = [\n  '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',\n  'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',\n  'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',\n  ' ', '$', '%', '*', '+', '-', '.', '/', ':'\n]\n\nfunction AlphanumericData (data) {\n  this.mode = Mode.ALPHANUMERIC\n  this.data = data\n}\n\nAlphanumericData.getBitsLength = function getBitsLength (length) {\n  return 11 * Math.floor(length / 2) + 6 * (length % 2)\n}\n\nAlphanumericData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nAlphanumericData.prototype.getBitsLength = function getBitsLength () {\n  return AlphanumericData.getBitsLength(this.data.length)\n}\n\nAlphanumericData.prototype.write = function write (bitBuffer) {\n  let i\n\n  // Input data characters are divided into groups of two characters\n  // and encoded as 11-bit binary codes.\n  for (i = 0; i + 2 <= this.data.length; i += 2) {\n    // The character value of the first character is multiplied by 45\n    let value = ALPHA_NUM_CHARS.indexOf(this.data[i]) * 45\n\n    // The character value of the second digit is added to the product\n    value += ALPHA_NUM_CHARS.indexOf(this.data[i + 1])\n\n    // The sum is then stored as 11-bit binary number\n    bitBuffer.put(value, 11)\n  }\n\n  // If the number of input data characters is not a multiple of two,\n  // the character value of the final character is encoded as a 6-bit binary number.\n  if (this.data.length % 2) {\n    bitBuffer.put(ALPHA_NUM_CHARS.indexOf(this.data[i]), 6)\n  }\n}\n\nmodule.exports = AlphanumericData\n"],"names":["Mode","require$$0","ALPHA_NUM_CHARS","AlphanumericData","data","length","bitBuffer","i","value","alphanumericData"],"mappings":";;;;;AAAA,QAAMA,IAAOC,EAAA,GAWPC,IAAkB;AAAA,IACtB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAC7C;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAC5D;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAC5D;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,EAC1C;AAEA,WAASC,EAAkBC,GAAM;AAC/B,SAAK,OAAOJ,EAAK,cACjB,KAAK,OAAOI;AAAA,EACd;AAEA,SAAAD,EAAiB,gBAAgB,SAAwBE,GAAQ;AAC/D,WAAO,KAAK,KAAK,MAAMA,IAAS,CAAC,IAAI,KAAKA,IAAS;AAAA,EACrD,GAEAF,EAAiB,UAAU,YAAY,WAAsB;AAC3D,WAAO,KAAK,KAAK;AAAA,EACnB,GAEAA,EAAiB,UAAU,gBAAgB,WAA0B;AACnE,WAAOA,EAAiB,cAAc,KAAK,KAAK,MAAM;AAAA,EACxD,GAEAA,EAAiB,UAAU,QAAQ,SAAgBG,GAAW;AAC5D,QAAIC;AAIJ,SAAKA,IAAI,GAAGA,IAAI,KAAK,KAAK,KAAK,QAAQA,KAAK,GAAG;AAE7C,UAAIC,IAAQN,EAAgB,QAAQ,KAAK,KAAKK,CAAC,CAAC,IAAI;AAGpD,MAAAC,KAASN,EAAgB,QAAQ,KAAK,KAAKK,IAAI,CAAC,CAAC,GAGjDD,EAAU,IAAIE,GAAO,EAAE;AAAA,IAC3B;AAIE,IAAI,KAAK,KAAK,SAAS,KACrBF,EAAU,IAAIJ,EAAgB,QAAQ,KAAK,KAAKK,CAAC,CAAC,GAAG,CAAC;AAAA,EAE1D,GAEAE,IAAiBN;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index144.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index145.js

@@ -1,24 +1,5 @@
-import { __require as g } from "./index124.js";
-var r, i;
-function s() {
-  if (i) return r;
-  i = 1;
-  const o = g();
-  function e(t) {
-    this.mode = o.BYTE, typeof t == "string" ? this.data = new TextEncoder().encode(t) : this.data = new Uint8Array(t);
-  }
-  return e.getBitsLength = function(n) {
-    return n * 8;
-  }, e.prototype.getLength = function() {
-    return this.data.length;
-  }, e.prototype.getBitsLength = function() {
-    return e.getBitsLength(this.data.length);
-  }, e.prototype.write = function(t) {
-    for (let n = 0, a = this.data.length; n < a; n++)
-      t.put(this.data[n], 8);
-  }, r = e, r;
-}
+var e = {};
 export {
-  s as __require
+  e as __exports
 };
 //# sourceMappingURL=index145.js.map

package/dist/index145.js.map

@@ -1 +1 @@
-{"version":3,"file":"index145.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/byte-data.js"],"sourcesContent":["const Mode = require('./mode')\n\nfunction ByteData (data) {\n  this.mode = Mode.BYTE\n  if (typeof (data) === 'string') {\n    this.data = new TextEncoder().encode(data)\n  } else {\n    this.data = new Uint8Array(data)\n  }\n}\n\nByteData.getBitsLength = function getBitsLength (length) {\n  return length * 8\n}\n\nByteData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nByteData.prototype.getBitsLength = function getBitsLength () {\n  return ByteData.getBitsLength(this.data.length)\n}\n\nByteData.prototype.write = function (bitBuffer) {\n  for (let i = 0, l = this.data.length; i < l; i++) {\n    bitBuffer.put(this.data[i], 8)\n  }\n}\n\nmodule.exports = ByteData\n"],"names":["Mode","require$$0","ByteData","data","length","bitBuffer","i","l","byteData"],"mappings":";;;;;AAAA,QAAMA,IAAOC,EAAA;AAEb,WAASC,EAAUC,GAAM;AACvB,SAAK,OAAOH,EAAK,MACb,OAAQG,KAAU,WACpB,KAAK,OAAO,IAAI,YAAW,EAAG,OAAOA,CAAI,IAEzC,KAAK,OAAO,IAAI,WAAWA,CAAI;AAAA,EAEnC;AAEA,SAAAD,EAAS,gBAAgB,SAAwBE,GAAQ;AACvD,WAAOA,IAAS;AAAA,EAClB,GAEAF,EAAS,UAAU,YAAY,WAAsB;AACnD,WAAO,KAAK,KAAK;AAAA,EACnB,GAEAA,EAAS,UAAU,gBAAgB,WAA0B;AAC3D,WAAOA,EAAS,cAAc,KAAK,KAAK,MAAM;AAAA,EAChD,GAEAA,EAAS,UAAU,QAAQ,SAAUG,GAAW;AAC9C,aAASC,IAAI,GAAGC,IAAI,KAAK,KAAK,QAAQD,IAAIC,GAAGD;AAC3C,MAAAD,EAAU,IAAI,KAAK,KAAKC,CAAC,GAAG,CAAC;AAAA,EAEjC,GAEAE,IAAiBN;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index145.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index146.js

@@ -1,37 +1,24 @@
-import { __require as u } from "./index124.js";
-import { __require as h } from "./index113.js";
-var a, n;
-function c() {
-  if (n) return a;
-  n = 1;
-  const o = u(), s = h();
-  function r(i) {
-    this.mode = o.KANJI, this.data = i;
-  }
-  return r.getBitsLength = function(e) {
-    return e * 13;
-  }, r.prototype.getLength = function() {
-    return this.data.length;
-  }, r.prototype.getBitsLength = function() {
-    return r.getBitsLength(this.data.length);
-  }, r.prototype.write = function(i) {
-    let e;
-    for (e = 0; e < this.data.length; e++) {
-      let t = s.toSJIS(this.data[e]);
-      if (t >= 33088 && t <= 40956)
-        t -= 33088;
-      else if (t >= 57408 && t <= 60351)
-        t -= 49472;
-      else
-        throw new Error(
-          "Invalid SJIS character: " + this.data[e] + `
-Make sure your charset is UTF-8`
-        );
-      t = (t >>> 8 & 255) * 192 + (t & 255), i.put(t, 13);
-    }
-  }, a = r, a;
+import { __exports as e } from "./index156.js";
+var s;
+function R() {
+  if (s) return e;
+  s = 1;
+  const n = "[0-9]+", E = "[A-Z $%*+\\-./:]+";
+  let u = "(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+";
+  u = u.replace(/u/g, "\\u");
+  const i = "(?:(?![A-Z0-9 $%*+\\-./:]|" + u + `)(?:.|[\r
+]))+`;
+  e.KANJI = new RegExp(u, "g"), e.BYTE_KANJI = new RegExp("[^A-Z0-9 $%*+\\-./:]+", "g"), e.BYTE = new RegExp(i, "g"), e.NUMERIC = new RegExp(n, "g"), e.ALPHANUMERIC = new RegExp(E, "g");
+  const c = new RegExp("^" + u + "$"), g = new RegExp("^" + n + "$"), A = new RegExp("^[A-Z0-9 $%*+\\-./:]+$");
+  return e.testKanji = function(t) {
+    return c.test(t);
+  }, e.testNumeric = function(t) {
+    return g.test(t);
+  }, e.testAlphanumeric = function(t) {
+    return A.test(t);
+  }, e;
 }
 export {
-  c as __require
+  R as __require
 };
 //# sourceMappingURL=index146.js.map

package/dist/index146.js.map

@@ -1 +1 @@
-{"version":3,"file":"index146.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/kanji-data.js"],"sourcesContent":["const Mode = require('./mode')\nconst Utils = require('./utils')\n\nfunction KanjiData (data) {\n  this.mode = Mode.KANJI\n  this.data = data\n}\n\nKanjiData.getBitsLength = function getBitsLength (length) {\n  return length * 13\n}\n\nKanjiData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nKanjiData.prototype.getBitsLength = function getBitsLength () {\n  return KanjiData.getBitsLength(this.data.length)\n}\n\nKanjiData.prototype.write = function (bitBuffer) {\n  let i\n\n  // In the Shift JIS system, Kanji characters are represented by a two byte combination.\n  // These byte values are shifted from the JIS X 0208 values.\n  // JIS X 0208 gives details of the shift coded representation.\n  for (i = 0; i < this.data.length; i++) {\n    let value = Utils.toSJIS(this.data[i])\n\n    // For characters with Shift JIS values from 0x8140 to 0x9FFC:\n    if (value >= 0x8140 && value <= 0x9FFC) {\n      // Subtract 0x8140 from Shift JIS value\n      value -= 0x8140\n\n    // For characters with Shift JIS values from 0xE040 to 0xEBBF\n    } else if (value >= 0xE040 && value <= 0xEBBF) {\n      // Subtract 0xC140 from Shift JIS value\n      value -= 0xC140\n    } else {\n      throw new Error(\n        'Invalid SJIS character: ' + this.data[i] + '\\n' +\n        'Make sure your charset is UTF-8')\n    }\n\n    // Multiply most significant byte of result by 0xC0\n    // and add least significant byte to product\n    value = (((value >>> 8) & 0xff) * 0xC0) + (value & 0xff)\n\n    // Convert result to a 13-bit binary string\n    bitBuffer.put(value, 13)\n  }\n}\n\nmodule.exports = KanjiData\n"],"names":["Mode","require$$0","Utils","require$$1","KanjiData","data","length","bitBuffer","i","value","kanjiData"],"mappings":";;;;;;AAAA,QAAMA,IAAOC,EAAA,GACPC,IAAQC,EAAA;AAEd,WAASC,EAAWC,GAAM;AACxB,SAAK,OAAOL,EAAK,OACjB,KAAK,OAAOK;AAAA,EACd;AAEA,SAAAD,EAAU,gBAAgB,SAAwBE,GAAQ;AACxD,WAAOA,IAAS;AAAA,EAClB,GAEAF,EAAU,UAAU,YAAY,WAAsB;AACpD,WAAO,KAAK,KAAK;AAAA,EACnB,GAEAA,EAAU,UAAU,gBAAgB,WAA0B;AAC5D,WAAOA,EAAU,cAAc,KAAK,KAAK,MAAM;AAAA,EACjD,GAEAA,EAAU,UAAU,QAAQ,SAAUG,GAAW;AAC/C,QAAIC;AAKJ,SAAKA,IAAI,GAAGA,IAAI,KAAK,KAAK,QAAQA,KAAK;AACrC,UAAIC,IAAQP,EAAM,OAAO,KAAK,KAAKM,CAAC,CAAC;AAGrC,UAAIC,KAAS,SAAUA,KAAS;AAE9B,QAAAA,KAAS;AAAA,eAGAA,KAAS,SAAUA,KAAS;AAErC,QAAAA,KAAS;AAAA;AAET,cAAM,IAAI;AAAA,UACR,6BAA6B,KAAK,KAAKD,CAAC,IAAI;AAAA;AAAA,QACX;AAKrC,MAAAC,KAAWA,MAAU,IAAK,OAAQ,OAASA,IAAQ,MAGnDF,EAAU,IAAIE,GAAO,EAAE;AAAA,IAC3B;AAAA,EACA,GAEAC,IAAiBN;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index146.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/regex.js"],"sourcesContent":["const numeric = '[0-9]+'\nconst alphanumeric = '[A-Z $%*+\\\\-./:]+'\nlet kanji = '(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|' +\n  '[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|' +\n  '[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|' +\n  '[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+'\nkanji = kanji.replace(/u/g, '\\\\u')\n\nconst byte = '(?:(?![A-Z0-9 $%*+\\\\-./:]|' + kanji + ')(?:.|[\\r\\n]))+'\n\nexports.KANJI = new RegExp(kanji, 'g')\nexports.BYTE_KANJI = new RegExp('[^A-Z0-9 $%*+\\\\-./:]+', 'g')\nexports.BYTE = new RegExp(byte, 'g')\nexports.NUMERIC = new RegExp(numeric, 'g')\nexports.ALPHANUMERIC = new RegExp(alphanumeric, 'g')\n\nconst TEST_KANJI = new RegExp('^' + kanji + '$')\nconst TEST_NUMERIC = new RegExp('^' + numeric + '$')\nconst TEST_ALPHANUMERIC = new RegExp('^[A-Z0-9 $%*+\\\\-./:]+$')\n\nexports.testKanji = function testKanji (str) {\n  return TEST_KANJI.test(str)\n}\n\nexports.testNumeric = function testNumeric (str) {\n  return TEST_NUMERIC.test(str)\n}\n\nexports.testAlphanumeric = function testAlphanumeric (str) {\n  return TEST_ALPHANUMERIC.test(str)\n}\n"],"names":["numeric","alphanumeric","kanji","byte","regex","TEST_KANJI","TEST_NUMERIC","TEST_ALPHANUMERIC","str"],"mappings":";;;;;AAAA,QAAMA,IAAU,UACVC,IAAe;AACrB,MAAIC,IAAQ;AAIZ,EAAAA,IAAQA,EAAM,QAAQ,MAAM,KAAK;AAEjC,QAAMC,IAAO,+BAA+BD,IAAQ;AAAA;AAEpD,EAAAE,EAAA,QAAgB,IAAI,OAAOF,GAAO,GAAG,GACrCE,EAAA,aAAqB,IAAI,OAAO,yBAAyB,GAAG,GAC5DA,EAAA,OAAe,IAAI,OAAOD,GAAM,GAAG,GACnCC,EAAA,UAAkB,IAAI,OAAOJ,GAAS,GAAG,GACzCI,EAAA,eAAuB,IAAI,OAAOH,GAAc,GAAG;AAEnD,QAAMI,IAAa,IAAI,OAAO,MAAMH,IAAQ,GAAG,GACzCI,IAAe,IAAI,OAAO,MAAMN,IAAU,GAAG,GAC7CO,IAAoB,IAAI,OAAO,wBAAwB;AAE7D,SAAAH,EAAA,YAAoB,SAAoBI,GAAK;AAC3C,WAAOH,EAAW,KAAKG,CAAG;AAAA,EAC5B,GAEAJ,EAAA,cAAsB,SAAsBI,GAAK;AAC/C,WAAOF,EAAa,KAAKE,CAAG;AAAA,EAC9B,GAEAJ,EAAA,mBAA2B,SAA2BI,GAAK;AACzD,WAAOD,EAAkB,KAAKC,CAAG;AAAA,EACnC;;","x_google_ignoreList":[0]}

package/dist/index147.js

@@ -1,73 +1,5 @@
-import { __module as c } from "./index152.js";
-var m;
-function j() {
-  return m ? c.exports : (m = 1, (function(y) {
-    var u = {
-      single_source_shortest_paths: function(o, t, e) {
-        var r = {}, i = {};
-        i[t] = 0;
-        var n = u.PriorityQueue.make();
-        n.push(t, 0);
-        for (var f, p, s, h, _, d, a, v, l; !n.empty(); ) {
-          f = n.pop(), p = f.value, h = f.cost, _ = o[p] || {};
-          for (s in _)
-            _.hasOwnProperty(s) && (d = _[s], a = h + d, v = i[s], l = typeof i[s] > "u", (l || v > a) && (i[s] = a, n.push(s, a), r[s] = p));
-        }
-        if (typeof e < "u" && typeof i[e] > "u") {
-          var q = ["Could not find a path from ", t, " to ", e, "."].join("");
-          throw new Error(q);
-        }
-        return r;
-      },
-      extract_shortest_path_from_predecessor_list: function(o, t) {
-        for (var e = [], r = t; r; )
-          e.push(r), o[r], r = o[r];
-        return e.reverse(), e;
-      },
-      find_path: function(o, t, e) {
-        var r = u.single_source_shortest_paths(o, t, e);
-        return u.extract_shortest_path_from_predecessor_list(
-          r,
-          e
-        );
-      },
-      /**
-       * A very naive priority queue implementation.
-       */
-      PriorityQueue: {
-        make: function(o) {
-          var t = u.PriorityQueue, e = {}, r;
-          o = o || {};
-          for (r in t)
-            t.hasOwnProperty(r) && (e[r] = t[r]);
-          return e.queue = [], e.sorter = o.sorter || t.default_sorter, e;
-        },
-        default_sorter: function(o, t) {
-          return o.cost - t.cost;
-        },
-        /**
-         * Add a new item to the queue and ensure the highest priority element
-         * is at the front of the queue.
-         */
-        push: function(o, t) {
-          var e = { value: o, cost: t };
-          this.queue.push(e), this.queue.sort(this.sorter);
-        },
-        /**
-         * Return the highest priority element in the queue.
-         */
-        pop: function() {
-          return this.queue.shift();
-        },
-        empty: function() {
-          return this.queue.length === 0;
-        }
-      }
-    };
-    y.exports = u;
-  })(c), c.exports);
-}
+var e = {};
 export {
-  j as __require
+  e as __exports
 };
 //# sourceMappingURL=index147.js.map

package/dist/index147.js.map

@@ -1 +1 @@
-{"version":3,"file":"index147.js","sources":["../../../node_modules/.pnpm/dijkstrajs@1.0.3/node_modules/dijkstrajs/dijkstra.js"],"sourcesContent":["'use strict';\n\n/******************************************************************************\n * Created 2008-08-19.\n *\n * Dijkstra path-finding functions. Adapted from the Dijkstar Python project.\n *\n * Copyright (C) 2008\n *   Wyatt Baldwin <self@wyattbaldwin.com>\n *   All rights reserved\n *\n * Licensed under the MIT license.\n *\n *   http://www.opensource.org/licenses/mit-license.php\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *****************************************************************************/\nvar dijkstra = {\n  single_source_shortest_paths: function(graph, s, d) {\n    // Predecessor map for each node that has been encountered.\n    // node ID => predecessor node ID\n    var predecessors = {};\n\n    // Costs of shortest paths from s to all nodes encountered.\n    // node ID => cost\n    var costs = {};\n    costs[s] = 0;\n\n    // Costs of shortest paths from s to all nodes encountered; differs from\n    // `costs` in that it provides easy access to the node that currently has\n    // the known shortest path from s.\n    // XXX: Do we actually need both `costs` and `open`?\n    var open = dijkstra.PriorityQueue.make();\n    open.push(s, 0);\n\n    var closest,\n        u, v,\n        cost_of_s_to_u,\n        adjacent_nodes,\n        cost_of_e,\n        cost_of_s_to_u_plus_cost_of_e,\n        cost_of_s_to_v,\n        first_visit;\n    while (!open.empty()) {\n      // In the nodes remaining in graph that have a known cost from s,\n      // find the node, u, that currently has the shortest path from s.\n      closest = open.pop();\n      u = closest.value;\n      cost_of_s_to_u = closest.cost;\n\n      // Get nodes adjacent to u...\n      adjacent_nodes = graph[u] || {};\n\n      // ...and explore the edges that connect u to those nodes, updating\n      // the cost of the shortest paths to any or all of those nodes as\n      // necessary. v is the node across the current edge from u.\n      for (v in adjacent_nodes) {\n        if (adjacent_nodes.hasOwnProperty(v)) {\n          // Get the cost of the edge running from u to v.\n          cost_of_e = adjacent_nodes[v];\n\n          // Cost of s to u plus the cost of u to v across e--this is *a*\n          // cost from s to v that may or may not be less than the current\n          // known cost to v.\n          cost_of_s_to_u_plus_cost_of_e = cost_of_s_to_u + cost_of_e;\n\n          // If we haven't visited v yet OR if the current known cost from s to\n          // v is greater than the new cost we just found (cost of s to u plus\n          // cost of u to v across e), update v's cost in the cost list and\n          // update v's predecessor in the predecessor list (it's now u).\n          cost_of_s_to_v = costs[v];\n          first_visit = (typeof costs[v] === 'undefined');\n          if (first_visit || cost_of_s_to_v > cost_of_s_to_u_plus_cost_of_e) {\n            costs[v] = cost_of_s_to_u_plus_cost_of_e;\n            open.push(v, cost_of_s_to_u_plus_cost_of_e);\n            predecessors[v] = u;\n          }\n        }\n      }\n    }\n\n    if (typeof d !== 'undefined' && typeof costs[d] === 'undefined') {\n      var msg = ['Could not find a path from ', s, ' to ', d, '.'].join('');\n      throw new Error(msg);\n    }\n\n    return predecessors;\n  },\n\n  extract_shortest_path_from_predecessor_list: function(predecessors, d) {\n    var nodes = [];\n    var u = d;\n    var predecessor;\n    while (u) {\n      nodes.push(u);\n      predecessor = predecessors[u];\n      u = predecessors[u];\n    }\n    nodes.reverse();\n    return nodes;\n  },\n\n  find_path: function(graph, s, d) {\n    var predecessors = dijkstra.single_source_shortest_paths(graph, s, d);\n    return dijkstra.extract_shortest_path_from_predecessor_list(\n      predecessors, d);\n  },\n\n  /**\n   * A very naive priority queue implementation.\n   */\n  PriorityQueue: {\n    make: function (opts) {\n      var T = dijkstra.PriorityQueue,\n          t = {},\n          key;\n      opts = opts || {};\n      for (key in T) {\n        if (T.hasOwnProperty(key)) {\n          t[key] = T[key];\n        }\n      }\n      t.queue = [];\n      t.sorter = opts.sorter || T.default_sorter;\n      return t;\n    },\n\n    default_sorter: function (a, b) {\n      return a.cost - b.cost;\n    },\n\n    /**\n     * Add a new item to the queue and ensure the highest priority element\n     * is at the front of the queue.\n     */\n    push: function (value, cost) {\n      var item = {value: value, cost: cost};\n      this.queue.push(item);\n      this.queue.sort(this.sorter);\n    },\n\n    /**\n     * Return the highest priority element in the queue.\n     */\n    pop: function () {\n      return this.queue.shift();\n    },\n\n    empty: function () {\n      return this.queue.length === 0;\n    }\n  }\n};\n\n\n// node.js module exports\nif (typeof module !== 'undefined') {\n  module.exports = dijkstra;\n}\n"],"names":["dijkstra","graph","s","d","predecessors","costs","open","closest","u","v","cost_of_s_to_u","adjacent_nodes","cost_of_e","cost_of_s_to_u_plus_cost_of_e","cost_of_s_to_v","first_visit","msg","nodes","opts","T","t","key","a","b","value","cost","item","module"],"mappings":";;;;AAuBA,QAAIA,IAAW;AAAA,MACb,8BAA8B,SAASC,GAAOC,GAAGC,GAAG;AAGlD,YAAIC,IAAe,CAAA,GAIfC,IAAQ,CAAA;AACZ,QAAAA,EAAMH,CAAC,IAAI;AAMX,YAAII,IAAON,EAAS,cAAc,KAAI;AACtC,QAAAM,EAAK,KAAKJ,GAAG,CAAC;AAUd,iBARIK,GACAC,GAAGC,GACHC,GACAC,GACAC,GACAC,GACAC,GACAC,GACG,CAACT,EAAK,WAAS;AAGpB,UAAAC,IAAUD,EAAK,IAAG,GAClBE,IAAID,EAAQ,OACZG,IAAiBH,EAAQ,MAGzBI,IAAiBV,EAAMO,CAAC,KAAK,CAAA;AAK7B,eAAKC,KAAKE;AACR,YAAIA,EAAe,eAAeF,CAAC,MAEjCG,IAAYD,EAAeF,CAAC,GAK5BI,IAAgCH,IAAiBE,GAMjDE,IAAiBT,EAAMI,CAAC,GACxBM,IAAe,OAAOV,EAAMI,CAAC,IAAM,MAC/BM,KAAeD,IAAiBD,OAClCR,EAAMI,CAAC,IAAII,GACXP,EAAK,KAAKG,GAAGI,CAA6B,GAC1CT,EAAaK,CAAC,IAAID;AAAA,QAI9B;AAEI,YAAI,OAAOL,IAAM,OAAe,OAAOE,EAAMF,CAAC,IAAM,KAAa;AAC/D,cAAIa,IAAM,CAAC,+BAA+Bd,GAAG,QAAQC,GAAG,GAAG,EAAE,KAAK,EAAE;AACpE,gBAAM,IAAI,MAAMa,CAAG;AAAA,QACzB;AAEI,eAAOZ;AAAA,MACX;AAAA,MAEE,6CAA6C,SAASA,GAAcD,GAAG;AAIrE,iBAHIc,IAAQ,CAAA,GACRT,IAAIL,GAEDK;AACL,UAAAS,EAAM,KAAKT,CAAC,GACEJ,EAAaI,CAAC,GAC5BA,IAAIJ,EAAaI,CAAC;AAEpB,eAAAS,EAAM,QAAO,GACNA;AAAA,MACX;AAAA,MAEE,WAAW,SAAShB,GAAOC,GAAGC,GAAG;AAC/B,YAAIC,IAAeJ,EAAS,6BAA6BC,GAAOC,GAAGC,CAAC;AACpE,eAAOH,EAAS;AAAA,UACdI;AAAA,UAAcD;AAAA,QAAC;AAAA,MACrB;AAAA;AAAA;AAAA;AAAA,MAKE,eAAe;AAAA,QACb,MAAM,SAAUe,GAAM;AACpB,cAAIC,IAAInB,EAAS,eACboB,IAAI,CAAA,GACJC;AACJ,UAAAH,IAAOA,KAAQ,CAAA;AACf,eAAKG,KAAOF;AACV,YAAIA,EAAE,eAAeE,CAAG,MACtBD,EAAEC,CAAG,IAAIF,EAAEE,CAAG;AAGlB,iBAAAD,EAAE,QAAQ,CAAA,GACVA,EAAE,SAASF,EAAK,UAAUC,EAAE,gBACrBC;AAAA,QACb;AAAA,QAEI,gBAAgB,SAAUE,GAAGC,GAAG;AAC9B,iBAAOD,EAAE,OAAOC,EAAE;AAAA,QACxB;AAAA;AAAA;AAAA;AAAA;AAAA,QAMI,MAAM,SAAUC,GAAOC,GAAM;AAC3B,cAAIC,IAAO,EAAC,OAAOF,GAAO,MAAMC,EAAI;AACpC,eAAK,MAAM,KAAKC,CAAI,GACpB,KAAK,MAAM,KAAK,KAAK,MAAM;AAAA,QACjC;AAAA;AAAA;AAAA;AAAA,QAKI,KAAK,WAAY;AACf,iBAAO,KAAK,MAAM,MAAK;AAAA,QAC7B;AAAA,QAEI,OAAO,WAAY;AACjB,iBAAO,KAAK,MAAM,WAAW;AAAA,QACnC;AAAA,MACA;AAAA;AAME,IAAAC,YAAiB3B;AAAA;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index147.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index148.js

@@ -1,5 +1,27 @@
-var o = {};
+import { __require as h } from "./index129.js";
+var u, s;
+function c() {
+  if (s) return u;
+  s = 1;
+  const g = h();
+  function t(i) {
+    this.mode = g.NUMERIC, this.data = i.toString();
+  }
+  return t.getBitsLength = function(e) {
+    return 10 * Math.floor(e / 3) + (e % 3 ? e % 3 * 3 + 1 : 0);
+  }, t.prototype.getLength = function() {
+    return this.data.length;
+  }, t.prototype.getBitsLength = function() {
+    return t.getBitsLength(this.data.length);
+  }, t.prototype.write = function(e) {
+    let r, n, a;
+    for (r = 0; r + 3 <= this.data.length; r += 3)
+      n = this.data.substr(r, 3), a = parseInt(n, 10), e.put(a, 10);
+    const o = this.data.length - r;
+    o > 0 && (n = this.data.substr(r), a = parseInt(n, 10), e.put(a, o * 3 + 1));
+  }, u = t, u;
+}
 export {
-  o as __exports
+  c as __require
 };
 //# sourceMappingURL=index148.js.map

package/dist/index148.js.map

@@ -1 +1 @@
-{"version":3,"file":"index148.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}
+{"version":3,"file":"index148.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/numeric-data.js"],"sourcesContent":["const Mode = require('./mode')\n\nfunction NumericData (data) {\n  this.mode = Mode.NUMERIC\n  this.data = data.toString()\n}\n\nNumericData.getBitsLength = function getBitsLength (length) {\n  return 10 * Math.floor(length / 3) + ((length % 3) ? ((length % 3) * 3 + 1) : 0)\n}\n\nNumericData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nNumericData.prototype.getBitsLength = function getBitsLength () {\n  return NumericData.getBitsLength(this.data.length)\n}\n\nNumericData.prototype.write = function write (bitBuffer) {\n  let i, group, value\n\n  // The input data string is divided into groups of three digits,\n  // and each group is converted to its 10-bit binary equivalent.\n  for (i = 0; i + 3 <= this.data.length; i += 3) {\n    group = this.data.substr(i, 3)\n    value = parseInt(group, 10)\n\n    bitBuffer.put(value, 10)\n  }\n\n  // If the number of input digits is not an exact multiple of three,\n  // the final one or two digits are converted to 4 or 7 bits respectively.\n  const remainingNum = this.data.length - i\n  if (remainingNum > 0) {\n    group = this.data.substr(i)\n    value = parseInt(group, 10)\n\n    bitBuffer.put(value, remainingNum * 3 + 1)\n  }\n}\n\nmodule.exports = NumericData\n"],"names":["Mode","require$$0","NumericData","data","length","bitBuffer","i","group","value","remainingNum","numericData"],"mappings":";;;;;AAAA,QAAMA,IAAOC,EAAA;AAEb,WAASC,EAAaC,GAAM;AAC1B,SAAK,OAAOH,EAAK,SACjB,KAAK,OAAOG,EAAK,SAAQ;AAAA,EAC3B;AAEA,SAAAD,EAAY,gBAAgB,SAAwBE,GAAQ;AAC1D,WAAO,KAAK,KAAK,MAAMA,IAAS,CAAC,KAAMA,IAAS,IAAOA,IAAS,IAAK,IAAI,IAAK;AAAA,EAChF,GAEAF,EAAY,UAAU,YAAY,WAAsB;AACtD,WAAO,KAAK,KAAK;AAAA,EACnB,GAEAA,EAAY,UAAU,gBAAgB,WAA0B;AAC9D,WAAOA,EAAY,cAAc,KAAK,KAAK,MAAM;AAAA,EACnD,GAEAA,EAAY,UAAU,QAAQ,SAAgBG,GAAW;AACvD,QAAIC,GAAGC,GAAOC;AAId,SAAKF,IAAI,GAAGA,IAAI,KAAK,KAAK,KAAK,QAAQA,KAAK;AAC1C,MAAAC,IAAQ,KAAK,KAAK,OAAOD,GAAG,CAAC,GAC7BE,IAAQ,SAASD,GAAO,EAAE,GAE1BF,EAAU,IAAIG,GAAO,EAAE;AAKzB,UAAMC,IAAe,KAAK,KAAK,SAASH;AACxC,IAAIG,IAAe,MACjBF,IAAQ,KAAK,KAAK,OAAOD,CAAC,GAC1BE,IAAQ,SAASD,GAAO,EAAE,GAE1BF,EAAU,IAAIG,GAAOC,IAAe,IAAI,CAAC;AAAA,EAE7C,GAEAC,IAAiBR;;","x_google_ignoreList":[0]}