Jump to content

haws

Level 1
  • Content Count

    1
  • Joined

  • Last visited

Community Reputation

1 Neutral

About haws

  1. A Bloom filter is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set. Couldn't there be a client-side check for duplicate URLs? Evernote can't be less smart than the bookmarks feature of the browser...
×
×
  • Create New...