-
-
Notifications
You must be signed in to change notification settings - Fork 8.5k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
fix(reactivity): shallowReactive collection to not-readonly (#1212)
- Loading branch information
Showing
3 changed files
with
127 additions
and
48 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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,125 @@ | ||
import { shallowReactive, isReactive, reactive } from '../src/reactive' | ||
import { effect } from '../src/effect' | ||
|
||
describe('shallowReactive', () => { | ||
test('should not make non-reactive properties reactive', () => { | ||
const props = shallowReactive({ n: { foo: 1 } }) | ||
expect(isReactive(props.n)).toBe(false) | ||
}) | ||
|
||
test('should keep reactive properties reactive', () => { | ||
const props: any = shallowReactive({ n: reactive({ foo: 1 }) }) | ||
props.n = reactive({ foo: 2 }) | ||
expect(isReactive(props.n)).toBe(true) | ||
}) | ||
|
||
describe('collections', () => { | ||
test('should be reactive', () => { | ||
const shallowSet = shallowReactive(new Set()) | ||
const a = {} | ||
let size | ||
|
||
effect(() => { | ||
size = shallowSet.size | ||
}) | ||
|
||
expect(size).toBe(0) | ||
|
||
shallowSet.add(a) | ||
expect(size).toBe(1) | ||
|
||
shallowSet.delete(a) | ||
expect(size).toBe(0) | ||
}) | ||
|
||
test('should not observe when iterating', () => { | ||
const shallowSet = shallowReactive(new Set()) | ||
const a = {} | ||
shallowSet.add(a) | ||
|
||
const spreadA = [...shallowSet][0] | ||
expect(isReactive(spreadA)).toBe(false) | ||
}) | ||
|
||
test('should not get reactive entry', () => { | ||
const shallowMap = shallowReactive(new Map()) | ||
const a = {} | ||
const key = 'a' | ||
|
||
shallowMap.set(key, a) | ||
|
||
expect(isReactive(shallowMap.get(key))).toBe(false) | ||
}) | ||
|
||
test('should not get reactive on foreach', () => { | ||
const shallowSet = shallowReactive(new Set()) | ||
const a = {} | ||
shallowSet.add(a) | ||
|
||
shallowSet.forEach(x => expect(isReactive(x)).toBe(false)) | ||
}) | ||
|
||
// #1210 | ||
test('onTrack on called on objectSpread', () => { | ||
const onTrackFn = jest.fn() | ||
const shallowSet = shallowReactive(new Set()) | ||
let a | ||
effect( | ||
() => { | ||
a = Array.from(shallowSet) | ||
}, | ||
{ | ||
onTrack: onTrackFn | ||
} | ||
) | ||
|
||
expect(a).toMatchObject([]) | ||
expect(onTrackFn).toHaveBeenCalled() | ||
}) | ||
}) | ||
|
||
describe('array', () => { | ||
test('should be reactive', () => { | ||
const shallowArray = shallowReactive<unknown[]>([]) | ||
const a = {} | ||
let size | ||
|
||
effect(() => { | ||
size = shallowArray.length | ||
}) | ||
|
||
expect(size).toBe(0) | ||
|
||
shallowArray.push(a) | ||
expect(size).toBe(1) | ||
|
||
shallowArray.pop() | ||
expect(size).toBe(0) | ||
}) | ||
test('should not observe when iterating', () => { | ||
const shallowArray = shallowReactive<object[]>([]) | ||
const a = {} | ||
shallowArray.push(a) | ||
|
||
const spreadA = [...shallowArray][0] | ||
expect(isReactive(spreadA)).toBe(false) | ||
}) | ||
|
||
test('onTrack on called on objectSpread', () => { | ||
const onTrackFn = jest.fn() | ||
const shallowArray = shallowReactive([]) | ||
let a | ||
effect( | ||
() => { | ||
a = Array.from(shallowArray) | ||
}, | ||
{ | ||
onTrack: onTrackFn | ||
} | ||
) | ||
|
||
expect(a).toMatchObject([]) | ||
expect(onTrackFn).toHaveBeenCalled() | ||
}) | ||
}) | ||
}) |
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