![]() ![]() So here we cover them mainly for completeness, while you can still find them in the old scripts. Today, they are mostly history, as querySelector is more powerful and shorter to write. There are also other methods to look for nodes by a tag, class, etc. ContributingĬontributions to MiniSearch are welcome! Please read the contributionsĪlso useful to understand the project goals and the technical implementation.Let chapter = document.querySelector('.chapter') // LIĪlert(chapter.closest('.contents')) // DIVĪlert(chapter.closest('h1')) // null (because h1 is not an ancestor) The packageīe used to provide those functions. Use functions like Object.entries, Array.includes, and om, whichĪre standard but not available on older browsers. Standards, but requires a polyfill when used in Internet Explorer, as it makes MiniSearch natively supports all modern browsers implementing JavaScript ![]() API Documentationįor details about configuration options and methods. The default term processor can be obtained by calling A collection of documents for our examples const documents = [ ) ![]() MiniSearch strives to expose a simple API that provides the building blocks toīuild custom solutions, while keeping a small and well tested codebase. Memory-efficient index, designed to support memory-constrained use casesĮxact match, prefix search, fuzzy match, field boosting.Īuto-suggestion engine, for auto-completion of search queries.ĭocuments can be added and removed from the index at any time. UIs, removing the need to make requests to a search server. Work offline, and can process queries quickly, without network latency.Ī prominent use-case is real time search "as you type" in web and mobileĪpplications, where keeping the index on the client enables fast and reactive By storing the index in local memory, MiniSearch can Whole Internet with it, there are surprisingly many use cases that are served To be indexed can fit locally in the process memory. prefix search, fuzzy search, ranking, boosting of fields…), but the data MiniSearch addresses use cases where full-text search features are needed It is respectful of resources, and it can comfortably run both inįind the complete documentation and API referenceĪnd more background about MiniSearch, including a comparison with otherĪnd documents releases and changes in the MiniSearch is a tiny but powerful in-memory fulltext search engine written in ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |