A little search algorithm for a person's name. It looks only for sequential letters in a name.

decent_search.js

handleChange(event) {
  let value = event.target.value;

  if (!value) {
    this.setState({ value, data: this.props.data });
    return true;
  }

  // Let the search be async
  // The the more the data is filtered the faster it will be
  setTimeout(() => {
    if (!Object.keys(this.state.data).length) {
      this.setState({ value, data: this.props.data });
    }

    let data = Object.keys(this.state.data).reduce((prev, next) => {
      let person = this.state.data[next];
      let match = (person.first_name + person.last_name).match(
        new RegExp(value.replace(/\s/g, ''), "i")
      );
      if (match) {
        prev[next] = person;
      }
      return prev;
    }, {});

    this.setState({ value, data });
  }, 0);

}

super_lazy.js

import { values } from "ramda";

/**
 * Beware.  Use this if you are lazy.  Results might be unexpected if your
 * data values contain ambiguous terms.
 * @param value
 * @param data
 * @returns {{}}
 */
export let defaultFilter = ({value, data = {}}) => {
  return Object.keys(data).reduce((prev, next) => {
    let obj = data[next];
    let search = values(obj).join('');
    let match = (search).match(
      new RegExp(value.replace(/\s/g, ""), "i")
    );
    if (match) {
      prev[next] = obj;
    }
    return prev;
  }, {});
}

trimmed_search.js

let searchFilter = ({ value, data = {} }) => {
  return Object.keys(data).reduce((prev, next) => {
    let person = data[next];
    let match = (person.first_name + person.last_name).match(
      new RegExp(value.replace(/\s/g, ""), "i")
    );
    if (match) {
      prev[next] = person;
    }
    return prev;
  }, {});
};