Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
The table of contents is too big for display.
Diff view
Diff view
  •  
  •  
  •  
4 changes: 2 additions & 2 deletions package.json
Original file line number Diff line number Diff line change
Expand Up @@ -75,8 +75,8 @@
"eslint-plugin-react-internal": "link:./scripts/eslint-rules",
"fbjs-scripts": "^3.0.1",
"filesize": "^6.0.1",
"flow-bin": "^0.307.1",
"flow-remove-types": "^2.307.1",
"flow-bin": "^0.317.0",
"flow-remove-types": "^2.317.0",
"flow-typed": "^4.1.1",
"glob": "^7.1.6",
"glob-stream": "^6.1.0",
Expand Down
16 changes: 8 additions & 8 deletions packages/react-cache/src/LRU.js
Original file line number Diff line number Diff line change
Expand Up @@ -56,21 +56,21 @@ export function createLRU<T>(limit: number): LRU<T> {
function deleteLeastRecentlyUsedEntries(targetSize: number) {
// Delete entries from the cache, starting from the end of the list.
if (first !== null) {
const resolvedFirst: Entry<T> = (first: any);
const resolvedFirst: Entry<T> = first as any;
let last: null | Entry<T> = resolvedFirst.previous;
while (size > targetSize && last !== null) {
const onDelete = last.onDelete;
const previous = last.previous;
last.onDelete = (null: any);
last.onDelete = null as any;

// Remove from the list
last.previous = last.next = (null: any);
last.previous = last.next = null as any;
if (last === first) {
// Reached the head of the list.
first = last = null;
} else {
(first: any).previous = previous;
previous.next = (first: any);
(first as any).previous = previous;
previous.next = first as any;
last = previous;
}

Expand All @@ -88,8 +88,8 @@ export function createLRU<T>(limit: number): LRU<T> {
const entry = {
value,
onDelete,
next: (null: any),
previous: (null: any),
next: null as any,
previous: null as any,
};
if (first === null) {
entry.previous = entry.next = entry;
Expand Down Expand Up @@ -118,7 +118,7 @@ export function createLRU<T>(limit: number): LRU<T> {
// $FlowFixMe[invalid-compare]
if (next !== null) {
// Entry already cached
const resolvedFirst: Entry<T> = (first: any);
const resolvedFirst: Entry<T> = first as any;
if (first !== entry) {
// Remove from current position
const previous = entry.previous;
Expand Down
10 changes: 5 additions & 5 deletions packages/react-cache/src/ReactCacheOld.js
Original file line number Diff line number Diff line change
Expand Up @@ -107,14 +107,14 @@ function accessResult<I, K, V>(
thenable.then(
value => {
if (newResult.status === Pending) {
const resolvedResult: ResolvedResult<V> = (newResult: any);
const resolvedResult: ResolvedResult<V> = newResult as any;
resolvedResult.status = Resolved;
resolvedResult.value = value;
}
},
error => {
if (newResult.status === Pending) {
const rejectedResult: RejectedResult = (newResult: any);
const rejectedResult: RejectedResult = newResult as any;
rejectedResult.status = Rejected;
rejectedResult.value = error;
}
Expand All @@ -128,7 +128,7 @@ function accessResult<I, K, V>(
entriesForResource.set(key, newEntry);
return newResult;
} else {
return (lru.access(entry): any);
return lru.access(entry) as any;
}
}

Expand All @@ -147,7 +147,7 @@ export function unstable_createResource<I, K: string | number, V>(
maybeHashInput?: I => K,
): Resource<I, V> {
const hashInput: I => K =
maybeHashInput !== undefined ? maybeHashInput : (identityHashFn: any);
maybeHashInput !== undefined ? maybeHashInput : (identityHashFn as any);

const resource = {
read(input: I): V {
Expand All @@ -171,7 +171,7 @@ export function unstable_createResource<I, K: string | number, V>(
}
default:
// Should be unreachable
return (undefined: any);
return undefined as any;
}
},

Expand Down
Loading
Loading