You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Fires when input box receives focus or the dropdown arrow is clicked. This is helpful for setting `dirty` or `touched` flags with forms.
216
+
217
+
### onBlur
218
+
219
+
Type: `function`
220
+
221
+
Fires when input box loses focus or the dropdown arrow is clicked again (and the dropdown collapses). This is helpful for setting `dirty` or `touched` flags with forms.
222
+
211
223
### data
212
224
213
225
Type: `Object` or `Array`
@@ -323,16 +335,16 @@ You can reference the files from `node_modules/react-dropdown-tree-select/dist/s
323
335
324
336
Once you import default styles, it is easy to add/override the provided styles to match popular frameworks. Checkout `/docs` folder for some examples.
325
337
326
-
*[With Bootstrap](/docs/examples/bootstrap)
327
-
*[With Material Design ](/docs/examples/material)
338
+
-[With Bootstrap](/docs/examples/bootstrap)
339
+
-[With Material Design ](/docs/examples/material)
328
340
329
341
## Performance
330
342
331
343
### Search optimizations
332
344
333
-
* The tree creates a flat list of nodes from hierarchical tree data to perform searches that are linear in time irrespective of the tree depth or size.
334
-
* It also memoizes each search term, so subsequent searches are instantaneous (almost).
335
-
* Last but not the least, the search employs progressive filtering technique where subsequent searches are performed on the previous search set. E.g., say the tree has 4000 nodes altogether and the user wants to filter nodes that contain the text: "2002". As the user enters each key press the search goes like this:
345
+
- The tree creates a flat list of nodes from hierarchical tree data to perform searches that are linear in time irrespective of the tree depth or size.
346
+
- It also memoizes each search term, so subsequent searches are instantaneous (almost).
347
+
- Last but not the least, the search employs progressive filtering technique where subsequent searches are performed on the previous search set. E.g., say the tree has 4000 nodes altogether and the user wants to filter nodes that contain the text: "2002". As the user enters each key press the search goes like this:
0 commit comments