-
Notifications
You must be signed in to change notification settings - Fork 7.1k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge branch 'master' into ADO-1406-add-link-to-creator-hub
* master: (27 commits) fix: Include cypress TypeScript types in /cypress folder (no-changelog) (#7746) refactor(core): Stop reporting to Sentry `NodeApiError` outside 500 range (no-changelog) (#7753) fix(core): Guard against node not found on cancelling test webhook (#7750) fix(JotForm Trigger Node): Fix iteration on form loader (#7751) refactor(core): Stop reporting to Sentry unknown cred on mapping (no-changelog) (#7752) feat(core): Coordinate manual workflow activation and deactivation in multi-main scenario (#7643) ci: Fix "Release: Create Pull Request" workflow fix(editor): Fix Admin panel icon in the sidebar for cloud deployments (no-changelog) (#7738) fix(editor): Remove `n8nHooksNext` flag (no-changelog) (#7733) fix(editor): Show v1 banner dismiss button if owner (#7722) fix(GitHub Node): Fix issue preventing file edits on branches (#7734) fix(core): Fix all dependency versions for backend packages (no-changelog) (#7745) refactor(core): Convert dynamic node-parameter routes to a decorated controller (no-changelog) (#7284) refactor: Stop reporting to Sentry Facebook multi-webhook error (no-changelog) (#7743) refactor(core): Stop reporting to Sentry unrecognized node errors (no-changelog) (#7728) fix(core): Account for non-ASCII chars in filename on binary data download (#7742) ci: Fix DB tests and Workflow tests (no-changelog) (#7741) refactor: Extract Invitation routes to InvitationController (no-changelog) (#7726) fix(editor): Handle permission edge cases (empty scopes) (#7723) ci: Skip the regularly failing tests in 2-credentials.cy.ts (no-changelog) (#7736) ...
- Loading branch information
Showing
132 changed files
with
4,013 additions
and
2,324 deletions.
There are no files selected for viewing
This file contains 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
This file contains 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
This file contains 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
This file contains 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
This file contains 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
This file contains 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
This file contains 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
This file contains 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
This file contains 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 |
|---|---|---|
| @@ -0,0 +1,116 @@ | ||
| import { WorkflowPage as WorkflowPageClass, NDV } from '../pages'; | ||
|
|
||
| const workflowPage = new WorkflowPageClass(); | ||
| const ndv = new NDV(); | ||
|
|
||
| describe('Node IO Filter', () => { | ||
| beforeEach(() => { | ||
| workflowPage.actions.visit(); | ||
| cy.createFixtureWorkflow('Node_IO_filter.json', `Node IO filter`); | ||
| workflowPage.actions.saveWorkflowOnButtonClick(); | ||
| workflowPage.actions.executeWorkflow(); | ||
| }); | ||
|
|
||
| it('should filter pinned data', () => { | ||
| workflowPage.getters.canvasNodes().first().dblclick(); | ||
| ndv.actions.close(); | ||
| workflowPage.getters.canvasNodes().first().dblclick(); | ||
| cy.wait(500); | ||
| ndv.getters.outputDataContainer().should('be.visible'); | ||
| cy.document().trigger('keyup', { key: '/' }); | ||
|
|
||
| const searchInput = ndv.getters.searchInput(); | ||
|
|
||
| searchInput.filter(':focus').should('exist'); | ||
| ndv.getters.pagination().find('li').should('have.length', 3); | ||
| cy.get('.highlight').should('not.exist'); | ||
|
|
||
| searchInput.type('ar'); | ||
| ndv.getters.pagination().find('li').should('have.length', 2); | ||
| cy.get('.highlight').its('length').should('be.gt', 0); | ||
|
|
||
| searchInput.type('i'); | ||
| ndv.getters.pagination().should('not.exist'); | ||
| cy.get('.highlight').its('length').should('be.gt', 0); | ||
| }); | ||
|
|
||
| it.only('should filter input/output data separately', () => { | ||
| workflowPage.getters.canvasNodes().eq(1).dblclick(); | ||
| cy.wait(500); | ||
| ndv.getters.outputDataContainer().should('be.visible'); | ||
| ndv.getters.inputDataContainer().should('be.visible'); | ||
| ndv.actions.switchInputMode('Table'); | ||
| cy.document().trigger('keyup', { key: '/' }); | ||
|
|
||
| ndv.getters.outputPanel().findChildByTestId('ndv-search').filter(':focus').should('not.exist'); | ||
|
|
||
| let focusedInput = ndv.getters | ||
| .inputPanel() | ||
| .findChildByTestId('ndv-search') | ||
| .filter(':focus') | ||
| .should('exist'); | ||
|
|
||
| const getInputPagination = () => | ||
| ndv.getters.inputPanel().findChildByTestId('ndv-data-pagination'); | ||
| const getInputCounter = () => ndv.getters.inputPanel().findChildByTestId('ndv-items-count'); | ||
| const getOuputPagination = () => | ||
| ndv.getters.outputPanel().findChildByTestId('ndv-data-pagination'); | ||
| const getOutputCounter = () => ndv.getters.outputPanel().findChildByTestId('ndv-items-count'); | ||
|
|
||
| getInputPagination().find('li').should('have.length', 3); | ||
| getInputCounter().contains('21 items').should('exist'); | ||
| getOuputPagination().find('li').should('have.length', 3); | ||
| getOutputCounter().contains('21 items').should('exist'); | ||
| focusedInput.type('ar'); | ||
|
|
||
| getInputPagination().find('li').should('have.length', 2); | ||
| getInputCounter().should('contain', '14 of 21 items'); | ||
| getOuputPagination().find('li').should('have.length', 3); | ||
| getOutputCounter().should('contain', '21 items'); | ||
| focusedInput.type('i'); | ||
|
|
||
| getInputPagination().should('not.exist'); | ||
| getInputCounter().should('contain', '8 of 21 items'); | ||
| getOuputPagination().find('li').should('have.length', 3); | ||
| getOutputCounter().should('contain', '21 items'); | ||
|
|
||
| focusedInput.clear(); | ||
| getInputPagination().find('li').should('have.length', 3); | ||
| getInputCounter().contains('21 items').should('exist'); | ||
| getOuputPagination().find('li').should('have.length', 3); | ||
| getOutputCounter().contains('21 items').should('exist'); | ||
|
|
||
| ndv.getters.outputDataContainer().trigger('mouseover'); | ||
| cy.document().trigger('keyup', { key: '/' }); | ||
| ndv.getters.inputPanel().findChildByTestId('ndv-search').filter(':focus').should('not.exist'); | ||
|
|
||
| focusedInput = ndv.getters | ||
| .outputPanel() | ||
| .findChildByTestId('ndv-search') | ||
| .filter(':focus') | ||
| .should('exist'); | ||
|
|
||
| getInputPagination().find('li').should('have.length', 3); | ||
| getInputCounter().contains('21 items').should('exist'); | ||
| getOuputPagination().find('li').should('have.length', 3); | ||
| getOutputCounter().contains('21 items').should('exist'); | ||
| focusedInput.type('ar'); | ||
|
|
||
| getInputPagination().find('li').should('have.length', 3); | ||
| getInputCounter().contains('21 items').should('exist'); | ||
| getOuputPagination().find('li').should('have.length', 2); | ||
| getOutputCounter().should('contain', '14 of 21 items'); | ||
| focusedInput.type('i'); | ||
|
|
||
| getInputPagination().find('li').should('have.length', 3); | ||
| getInputCounter().contains('21 items').should('exist'); | ||
| getOuputPagination().should('not.exist'); | ||
| getOutputCounter().should('contain', '8 of 21 items'); | ||
|
|
||
| focusedInput.clear(); | ||
| getInputPagination().find('li').should('have.length', 3); | ||
| getInputCounter().contains('21 items').should('exist'); | ||
| getOuputPagination().find('li').should('have.length', 3); | ||
| getOutputCounter().contains('21 items').should('exist'); | ||
| }); | ||
| }); |
This file contains 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.