PageSourceSearch

https://feyoudao-next.netlify.app/assets/inherit.html-XWRlpkiz.js

js feyoudao-next.netlify.app collected 2026-10-03 10:45:20 UTC 1,627 bytes, 1 lines download raw bytes

1const l=JSON.parse('{"key":"v-495924b7","path":"/docs/interview/JavaScript/inherit.html","title":"面试官:Javascript如何实现继承?","lang":"en-US","frontmatter":{"title":"面试官:Javascript如何实现继承?","date":"2022-07-04T10:46:56.000Z","categories":["interview","JavaScript"],"tags":[null],"columns":[null]},"headers":[{"level":2,"title":"一、是什么","slug":"一、是什么","link":"#一、是什么","children":[]},{"level":2,"title":"二、实现方式","slug":"二、实现方式","link":"#二、实现方式","children":[{"level":3,"title":"原型链继承","slug":"原型链继承","link":"#原型链继承","children":[]},{"level":3,"title":"构造函数继承","slug":"构造函数继承","link":"#构造函数继承","children":[]},{"level":3,"title":"组合继承","slug":"组合继承","link":"#组合继承","children":[]},{"level":3,"title":"原型式继承","slug":"原型式继承","link":"#原型式继承","children":[]},{"level":3,"title":"寄生式继承","slug":"寄生式继承","link":"#寄生式继承","children":[]},{"level":3,"title":"寄生组合式继承","slug":"寄生组合式继承","link":"#寄生组合式继承","children":[]}]},{"level":2,"title":"三、总结","slug":"三、总结","link":"#三、总结","children":[]},{"level":2,"title":"相关链接","slug":"相关链接","link":"#相关链接","children":[]}],"git":{"updatedTime":1703214392000,"contributors":[{"name":"qqlcx5","email":"[email protected]","commits":2},{"name":"another","email":"[email protected]","commits":1}]},"filePathRelative":"docs/interview/JavaScript/inherit.md"}');export{l as data};

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.