-
Notifications
You must be signed in to change notification settings - Fork 199
feat(a11y): enhance keyboard interaction in search mode #592
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
Merged
Changes from 9 commits
Commits
Show all changes
25 commits
Select commit
Hold shift + click to select a range
e2112e9
feat(a11y): enhance keyboard interaction in search mode
aojunhao123 0411b7a
refactor(a11y): synchronize activeKey with search state
aojunhao123 481c983
fix: lint fix
aojunhao123 a9efbc7
feat: default active first item
aojunhao123 9b51e4a
chore: remove useless test case
aojunhao123 f4f76ab
feat: default active first item
aojunhao123 b99d2fb
refactor: merge active effect logic
aojunhao123 644bf9d
chore: adjust code style
aojunhao123 89900b8
fix: type fix
aojunhao123 2659bd1
feat: adjust active effect logic
aojunhao123 bf62a42
fix: lint fix
aojunhao123 e3ef3e5
chore: remove useless code
aojunhao123 516d0b8
feat: flatten tree to match first node
aojunhao123 750de00
chore: add .vscode to gitignore file
aojunhao123 945f128
feat: improve flatten treeData
aojunhao123 467b056
feat: improve flatten treeData
aojunhao123 37d7cfc
chore: adjust code style
aojunhao123 86cf480
perf: optimize tree node searching with flattened data
aojunhao123 134f4f4
chore: add comment
aojunhao123 5d29cc0
revert: restore recursive node search
aojunhao123 4640c4d
chore: remove unnecessary logic
aojunhao123 229f4f7
chore: remove unnecessary logic
aojunhao123 9c7ad27
chore: adjust logic
aojunhao123 6f5a84c
test: use testing-library
aojunhao123 97bde6c
fix: keep active matched item when search
aojunhao123 File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -76,7 +76,7 @@ const OptionList: React.ForwardRefRenderFunction<ReviseRefOptionListProps> = (_, | |
(prev, next) => next[0] && prev[1] !== next[1], | ||
); | ||
|
||
// ========================== Active ========================== | ||
// ========================== Active Key Effect ========================== | ||
const [activeKey, setActiveKey] = React.useState<Key>(null); | ||
const activeEntity = keyEntities[activeKey as SafeKey]; | ||
|
||
|
@@ -92,16 +92,34 @@ const OptionList: React.ForwardRefRenderFunction<ReviseRefOptionListProps> = (_, | |
}; | ||
}, [checkable, checkedKeys, halfCheckedKeys]); | ||
|
||
// ========================== Scroll ========================== | ||
// ========================== Scroll Effect ========================== | ||
React.useEffect(() => { | ||
// Single mode should scroll to current key | ||
if (open && !multiple && checkedKeys.length) { | ||
treeRef.current?.scrollTo({ key: checkedKeys[0] }); | ||
setActiveKey(checkedKeys[0]); | ||
} | ||
// eslint-disable-next-line react-hooks/exhaustive-deps | ||
}, [open]); | ||
|
||
// ========================== Events ========================== | ||
const onListMouseDown: React.MouseEventHandler<HTMLDivElement> = event => { | ||
event.preventDefault(); | ||
}; | ||
|
||
const onInternalSelect = (__: Key[], info: TreeEventInfo) => { | ||
const { node } = info; | ||
|
||
if (checkable && isCheckDisabled(node)) { | ||
return; | ||
} | ||
|
||
onSelect(node.key, { | ||
selected: !checkedKeys.includes(node.key), | ||
}); | ||
|
||
if (!multiple) { | ||
toggleOpen(false); | ||
} | ||
}; | ||
|
||
// ========================== Search ========================== | ||
const lowerSearchValue = String(searchValue).toLowerCase(); | ||
const filterTreeNode = (treeNode: EventDataNode<any>) => { | ||
|
@@ -122,13 +140,6 @@ const OptionList: React.ForwardRefRenderFunction<ReviseRefOptionListProps> = (_, | |
return searchValue ? searchExpandedKeys : expandedKeys; | ||
}, [expandedKeys, searchExpandedKeys, treeExpandedKeys, searchValue]); | ||
|
||
React.useEffect(() => { | ||
if (searchValue) { | ||
setSearchExpandedKeys(getAllKeys(treeData, fieldNames)); | ||
} | ||
// eslint-disable-next-line react-hooks/exhaustive-deps | ||
}, [searchValue]); | ||
|
||
const onInternalExpand = (keys: Key[]) => { | ||
setExpandedKeys(keys); | ||
setSearchExpandedKeys(keys); | ||
|
@@ -138,26 +149,59 @@ const OptionList: React.ForwardRefRenderFunction<ReviseRefOptionListProps> = (_, | |
} | ||
}; | ||
|
||
// ========================== Events ========================== | ||
const onListMouseDown: React.MouseEventHandler<HTMLDivElement> = event => { | ||
event.preventDefault(); | ||
// ========================== Search Effect ========================== | ||
aojunhao123 marked this conversation as resolved.
Outdated
Show resolved
Hide resolved
|
||
React.useEffect(() => { | ||
if (searchValue) { | ||
setSearchExpandedKeys(getAllKeys(treeData, fieldNames)); | ||
} | ||
}, [searchValue]); | ||
|
||
// ========================== Get First Selectable Node ========================== | ||
const getFirstMatchingNode = ( | ||
nodes: EventDataNode<any>[], | ||
predicate: (node: EventDataNode<any>) => boolean, | ||
): EventDataNode<any> | null => { | ||
for (const node of nodes) { | ||
if (predicate(node)) { | ||
return node; | ||
} | ||
if (node[fieldNames.children]) { | ||
const matchInChildren = getFirstMatchingNode(node[fieldNames.children], predicate); | ||
if (matchInChildren) { | ||
return matchInChildren; | ||
} | ||
} | ||
} | ||
return null; | ||
}; | ||
|
||
const onInternalSelect = (__: Key[], info: TreeEventInfo) => { | ||
const { node } = info; | ||
const getFirstSelectableNode = (nodes: EventDataNode<any>): EventDataNode<any> | null => | ||
getFirstMatchingNode(nodes, node => node.selectable !== false && !node.disabled); | ||
|
||
if (checkable && isCheckDisabled(node)) { | ||
const getFirstMatchNode = (nodes: EventDataNode<any>): EventDataNode<any> | null => | ||
getFirstMatchingNode(nodes, node => filterTreeNode(node) && !node.disabled); | ||
|
||
// ========================== Active Key Effect ========================== | ||
React.useEffect(() => { | ||
if (searchValue) { | ||
const firstMatchNode = getFirstMatchNode(memoTreeData); | ||
|
||
setActiveKey(firstMatchNode ? firstMatchNode[fieldNames.value] : null); | ||
return; | ||
} | ||
|
||
onSelect(node.key, { | ||
selected: !checkedKeys.includes(node.key), | ||
}); | ||
|
||
if (!multiple) { | ||
toggleOpen(false); | ||
if (open) { | ||
if (!multiple && checkedKeys.length) { | ||
setActiveKey(checkedKeys[0]); | ||
} else { | ||
const firstSelectableNode = getFirstSelectableNode(memoTreeData); | ||
if (firstSelectableNode) { | ||
setActiveKey(firstSelectableNode[fieldNames.value]); | ||
} | ||
} | ||
return; | ||
} | ||
}; | ||
setActiveKey(null); | ||
}, [open, searchValue]); | ||
|
||
// ========================= Keyboard ========================= | ||
React.useImperativeHandle(ref, () => ({ | ||
|
@@ -176,8 +220,8 @@ const OptionList: React.ForwardRefRenderFunction<ReviseRefOptionListProps> = (_, | |
// >>> Select item | ||
case KeyCode.ENTER: { | ||
if (activeEntity) { | ||
const { selectable, value } = activeEntity?.node || {}; | ||
if (selectable !== false) { | ||
const { selectable, value, disabled } = activeEntity?.node || {}; | ||
if (selectable !== false && !disabled) { | ||
onInternalSelect(null, { | ||
node: { key: activeKey }, | ||
selected: !checkedKeys.includes(value), | ||
|
@@ -197,10 +241,10 @@ const OptionList: React.ForwardRefRenderFunction<ReviseRefOptionListProps> = (_, | |
})); | ||
|
||
const loadDataFun = useMemo( | ||
() => searchValue ? null : (loadData as any), | ||
() => (searchValue ? null : (loadData as any)), | ||
[searchValue, treeExpandedKeys || expandedKeys], | ||
([preSearchValue], [nextSearchValue, nextExcludeSearchExpandedKeys]) => | ||
preSearchValue !== nextSearchValue && !!(nextSearchValue || nextExcludeSearchExpandedKeys) | ||
preSearchValue !== nextSearchValue && !!(nextSearchValue || nextExcludeSearchExpandedKeys), | ||
); | ||
|
||
// ========================== Render ========================== | ||
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -2,6 +2,7 @@ | |
import React, { useState } from 'react'; | ||
import { mount } from 'enzyme'; | ||
import TreeSelect, { TreeNode } from '../src'; | ||
import KeyCode from 'rc-util/lib/KeyCode'; | ||
|
||
describe('TreeSelect.SearchInput', () => { | ||
it('select item will clean searchInput', () => { | ||
|
@@ -198,4 +199,96 @@ describe('TreeSelect.SearchInput', () => { | |
nodes.first().simulate('click'); | ||
expect(called).toBe(1); | ||
}); | ||
|
||
describe('keyboard events', () => { | ||
it('should select first matched node when press enter', () => { | ||
const onSelect = jest.fn(); | ||
const wrapper = mount( | ||
|
||
<TreeSelect | ||
showSearch | ||
onSelect={onSelect} | ||
open | ||
treeData={[ | ||
{ value: '1', label: '1' }, | ||
{ value: '2', label: '2', disabled: true }, | ||
{ value: '3', label: '3' }, | ||
]} | ||
/>, | ||
); | ||
|
||
// Search and press enter, should select first matched non-disabled node | ||
wrapper.search('1'); | ||
wrapper.find('input').first().simulate('keyDown', { which: KeyCode.ENTER }); | ||
expect(onSelect).toHaveBeenCalledWith('1', expect.anything()); | ||
|
||
onSelect.mockReset(); | ||
|
||
// Search disabled node and press enter, should not select | ||
wrapper.search('2'); | ||
wrapper.find('input').first().simulate('keyDown', { which: KeyCode.ENTER }); | ||
expect(onSelect).not.toHaveBeenCalled(); | ||
}); | ||
|
||
it('should not select node when no matches found', () => { | ||
const onSelect = jest.fn(); | ||
const wrapper = mount( | ||
<TreeSelect | ||
showSearch | ||
onSelect={onSelect} | ||
open | ||
treeData={[ | ||
{ value: '1', label: '1' }, | ||
{ value: '2', label: '2' }, | ||
]} | ||
/>, | ||
); | ||
|
||
// Search non-existent value and press enter, should not select any node | ||
wrapper.search('not-exist'); | ||
wrapper.find('input').first().simulate('keyDown', { which: KeyCode.ENTER }); | ||
expect(onSelect).not.toHaveBeenCalled(); | ||
}); | ||
|
||
it('should ignore enter press when all matched nodes are disabled', () => { | ||
const onSelect = jest.fn(); | ||
const wrapper = mount( | ||
<TreeSelect | ||
showSearch | ||
onSelect={onSelect} | ||
open | ||
treeData={[ | ||
{ value: '1', label: '1', disabled: true }, | ||
{ value: '2', label: '2', disabled: true }, | ||
]} | ||
/>, | ||
); | ||
|
||
// When all matched nodes are disabled, press enter should not select any node | ||
wrapper.search('1'); | ||
wrapper.find('input').first().simulate('keyDown', { which: KeyCode.ENTER }); | ||
expect(onSelect).not.toHaveBeenCalled(); | ||
}); | ||
|
||
it('should activate first matched node when searching', () => { | ||
const wrapper = mount( | ||
<TreeSelect | ||
showSearch | ||
open | ||
treeData={[ | ||
{ value: '1', label: '1' }, | ||
{ value: '2', label: '2', disabled: true }, | ||
{ value: '3', label: '3' }, | ||
]} | ||
/>, | ||
); | ||
|
||
// When searching, first matched non-disabled node should be activated | ||
wrapper.search('1'); | ||
expect(wrapper.find('.rc-tree-select-tree-treenode-active').text()).toBe('1'); | ||
|
||
// Should skip disabled nodes | ||
wrapper.search('2'); | ||
expect(wrapper.find('.rc-tree-select-tree-treenode-active').length).toBe(0); | ||
}); | ||
}); | ||
}); |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Uh oh!
There was an error while loading. Please reload this page.