Summary: D22047276 introduced a new way to adding log data column depending on how one sorts by time. This diff adds unit test to test the logic Reviewed By: passy Differential Revision: D22068114 fbshipit-source-id: 3fe01beec69d45d96f2fc2a437c3f408686565a3
86 lines
2.6 KiB
TypeScript
86 lines
2.6 KiB
TypeScript
/**
|
|
* Copyright (c) Facebook, Inc. and its affiliates.
|
|
*
|
|
* This source code is licensed under the MIT license found in the
|
|
* LICENSE file in the root directory of this source tree.
|
|
*
|
|
* @format
|
|
*/
|
|
|
|
import {addEntriesToState, processEntry} from '../index';
|
|
import {DeviceLogEntry} from 'flipper';
|
|
|
|
const entry: DeviceLogEntry = {
|
|
tag: 'OpenGLRenderer',
|
|
pid: 18384,
|
|
tid: 18409,
|
|
message: 'Swap behavior 1',
|
|
date: new Date('Feb 28 2013 19:00:00 EST'),
|
|
type: 'debug',
|
|
};
|
|
|
|
test('processEntry', () => {
|
|
const key = 'key';
|
|
const processedEntry = processEntry(entry, key);
|
|
expect(processedEntry.entry).toEqual(entry);
|
|
expect(processedEntry.row.key).toBe(key);
|
|
expect(typeof processedEntry.row.height).toBe('number');
|
|
});
|
|
|
|
test('addEntriesToState without current state', () => {
|
|
const processedEntry = processEntry(entry, 'key');
|
|
const newState = addEntriesToState([processedEntry]);
|
|
|
|
expect(newState.rows.length).toBe(1);
|
|
expect(newState.entries.length).toBe(1);
|
|
expect(newState.entries[0]).toEqual(processedEntry);
|
|
});
|
|
|
|
test('addEntriesToState with current state', () => {
|
|
const firstProcessedEntry = processEntry(entry, 'key1');
|
|
const currentState = addEntriesToState([firstProcessedEntry]);
|
|
const secondProcessedEntry = processEntry(
|
|
{
|
|
...entry,
|
|
message: 'new message',
|
|
},
|
|
'key2',
|
|
);
|
|
const newState = addEntriesToState([secondProcessedEntry], currentState);
|
|
expect(newState.entries.length).toBe(2);
|
|
expect(newState.rows.length).toBe(2);
|
|
expect(newState.rows[0]).toEqual(firstProcessedEntry.row);
|
|
expect(newState.rows[1]).toEqual(secondProcessedEntry.row);
|
|
});
|
|
|
|
test('addEntriesToState increase counter on duplicate message', () => {
|
|
const currentState = addEntriesToState([processEntry(entry, 'key1')]);
|
|
const processedEntry = processEntry(entry, 'key2');
|
|
const newState = addEntriesToState([processedEntry], currentState);
|
|
expect(newState.rows.length).toBe(1);
|
|
expect(newState.entries.length).toBe(2);
|
|
expect(newState.rows[0].columns.type.value.props.children).toBe(2);
|
|
});
|
|
|
|
test('addEntriesToState with reversed direction (add to front)', () => {
|
|
const firstProcessedEntry = processEntry(entry, 'key1');
|
|
const currentState = addEntriesToState([firstProcessedEntry]);
|
|
expect(currentState.rows.length).toBe(1);
|
|
expect(currentState.entries.length).toBe(1);
|
|
const secondProcessedEntry = processEntry(
|
|
{
|
|
...entry,
|
|
message: 'second message',
|
|
date: new Date('Feb 28 2013 19:01:00 EST'),
|
|
},
|
|
'key2',
|
|
);
|
|
const newState = addEntriesToState(
|
|
[secondProcessedEntry],
|
|
currentState,
|
|
'down',
|
|
);
|
|
expect(newState.entries.length).toBe(2);
|
|
expect(newState.rows.length).toBe(2);
|
|
});
|