can-set

can-set is a utility for comparing sets that are represented by the parameters commonly passed to service requests.

For example, the set {type: "critical"} might represent all critical todos. It is a superset of the set {type: "critical", due: "today"} which might represent all critical todos due today.

can-set is useful for building caching and other data-layer optimizations. It can be used in client or server environments. can-connect uses can-set to create data modeling utilities and middleware for the client.

Play around in this JSBin!

• Install
• Use
• API
  • equal
  • subset
  • properSubset
  • intersection
  • difference
  • union
  • count
  • getUnion
  • getSubset
  • Algebra
  • comparators
    • boolean
    • enum
    • rangeInclusive
• Contributing

Install

Use npm to install can-set:

npm install can-set --save

Use

Use require in Node/Browserify workflows to import can-set like:

var set = require('can-set');

Use define, require or import in StealJS workflows to import can-set like:

import set from 'can-set'

Once you've imported set into your project, use it to compare sets. The following example defines a getTodos function that gets todo data from a memory cache or from the server.

var cache = [];

var getTodos = function(params, cb) {

  // check cache
  for(var i = 0 ; i < cache.length; i++) {
    var cacheEntry = cache[i];
    if(set.subset( cacheEntry.params, params ) ) {
      var matchingTodos = cacheEntry.items.filter(function(item){
        return set.subset(item, params);
      })
      return cb(matchingTodos);
    }
  }

  // not in cache, get and save in cache
  $.get("/todos",params, function(todos){
    cache.push({
      params: params,
      items: todos
    });
    cb(todos);
  });
}

API

In can-set a set is a plain JavaScript object like {start: 0, end: 100, filter: "top"}. Often, these are the parameters you pass to the server to retrieve some list of data.

Unlike set mathmatics, these set objects don't contain the items of the set, instead they represent the items within the set.

Special Sets

Unlike in common set mathmatics the set {} represents the superset of all sets. For instance if you load all items represented by set {}, you have loaded every item in that "universe".

set.equal

set.equal(a, b, algebra) -> Boolean

Returns true if the two sets the exact same.

set.equal({type: "critical"}, {type: "critical"}) //-> true

set.subset

Returns true if A is a subset of B or A is equal to B (A ⊆ B).

set.subset(a, b, algebra) -> Boolean

set.subset({type: "critical"}, {}) //-> true
set.subset({}, {}) //-> true

set.properSubset

Returns true if A is a strict subset of B (A ⊂ B).

set.properSubset(a, b, algebra)

set.properSubset({type: "critical"}, {}) //-> true
set.properSubset({}, {}) //-> false

set.intersection

set.intersection(a, b, algebra) -> set

Returns a set that represents the intersection of sets A and B (A ∩ B).

set.intersection(
  {completed: true, due: "tomorrow"},
  {completed: true, type: "critical"},
  {...} ) //-> {completed: true, due: "tomorrow", type: "critical"}

set.difference

set.difference(a, b, algebra) -> set|true|false

Returns a set that represents the difference of sets A and B (A \ B), or returns if a difference exists.

If true is returned, that means that B is a subset of A, but no set object can be returned that represents that set.

If false is returned, that means there is no difference or the sets are not comparable.

// A has all of B
set.difference( {} , {completed: true}, set.boolean("completed") ) //-> {completed: false}

// A has all of B, but we can't figure out how to create a set object
set.difference( {} , {completed: true} ) //-> true

// A is totally inside B
set.difference( {completed: true}, {} )  //-> false

set.union

set.union(a, b, algebra) -> set | undefined

Returns a set that represents the union of A and B (A ∪ B).

set.union(
  {start: 0, end: 99},
  {start: 100, end: 199},
  {...} ) //-> {start: 0, end: 199}

set.count

set.count(a, algebra) -> Number

Returns the number of items that might be loaded by set A. This makes use of set.Algebra's By default, this returns Infinity.

set.Algebra

new set.Algebra(compares...)

Creates an object that can perform binary operations on sets with an awareness of how certain properties represent the set.

compares Object<String: comparator>

An object of property names and comparator functions.

{
  // return `true` if the values should be considered the same:
  lastName: function(aValue, bValue){
    return (""+aValue).toLowerCase() === (""+bValue).toLowerCase();
  }
}

comparator(aValue, bValue, a, b, prop, algebra)

A comparator function returns algebra values for two values for a given property.

params

• aValue - the value of A's property in a set difference A and B (A \ B).
• bValue - the value of A's property in a set difference A and B (A \ B).
• a - the A set in a set difference A and B (A \ B).
• a - the B set in a set difference A and B (A \ B).

returns

A comparator function should either return a Boolean which indicates if aValue and bValue are equal or an AlgebraResult object that details information about the union, intersection, and difference of aValue and bValue.

An AlgebraResult object has the following values:

• [union] - A value the represents the union of A and B.
• [intersection] - A value that represents the intersection of A and B.
• [difference] - A value that represents all items in A that are not in B.
• [count] - The count of the items in A.

For example, if you had a colors property and A is ["Red","Blue"] and B is ["Green","Yellow","Blue"], the AlgebraResult object might look like:

{
  union: ["Red","Blue","Green","Yellow"],
  intersection: ["Blue"],
  difference: ["Red"],
  count: 2000
}

The count is 2000 because there might be 2000 items represented by colors "Red" and "Blue". Often the real number can not be known.

set.comparators

The following functions create compares objects that can be mixed together to create a set Algebra.

For example, the following uses jQuery's extend to mixin two comparator behaviors into a compares object:

var compares = $.extend(
  {
    // ignore this property in set algebra
    sessionId:  function(){ return true }
  },
  set.comparators.boolean("completed"),
  set.comparators.range("start","end") );

var algebra = new set.Algebra( compares )

set.comparators.boolean

set.comparators.boolean(property) -> compare

Makes a compare object with a property function that has the following logic:

A(true) ∪ B(false) = undefined

A(undefined) \ B(true) = false
A(undefined) \ B(false) = true

It understands that true and false are complementary sets that combined to undefined. Another way to think of this is that if you load {complete: false} and {complete: true} you've loaded {}.

set.comparators.rangeInclusive

set.comparators.rangeInclusive(startIndexProperty, endIndexProperty) -> compare

Makes a comparator for two ranged properties that specify a range of items that includes both the startIndex and endIndex. For example, a range of [0,20] loads 21 items.

set.comparators.enum

set.comparators.enum(property, propertyValues) -> compare

Makes a comparator for a set of values.

var compare = set.comparators.enum("type", ["new","accepted","pending","resolved"])

set.getSubset

set.get.subset(a, b, bItems, algebra) //-> aItems

Gets A set's items given a super set B and its items.

set.getUnion

set.getUnion(a, b, aItems, bItems, algebra) //-> unionItems

Unifies items from set A and setB into a single array of items.

set.index

set.index(setItems, items, item, algebra)

Returns where item should be inserted into items which is represented by setItems.

Contributing

To setup your dev environment:

1. Clone and fork this repo.
2. Run npm install.
3. Open test.html in your browser. Everything should pass.
4. Run npm test. Everything should pass.
5. Run npm run-script build. Everything should build ok.

To publish:

1. Update the version number in package.json and commit and push this.
2. Run npm publish. This should generate the dist folder.
3. Create and checkout a "release" branch.
4. Run git add -f dist.
5. Commit the addition and tag it git tag v0.2.0. Push the tag git push origin --tags.