Specs/4/2/a/UnionFind/1.0.1/UnionFind.podspec.json

   1 {
   2   "name": "UnionFind",
   3   "version": "1.0.1",
   4   "summary": "A union find / disjoint set data structure.",
   5   "description": "                   Implements a union find / disjoint set data structure for efficiently\n                   determining if two objects belong to the same set, and combining those\n                   sets together, as part of larger algorithms.\n                   \n                   Instructions:\n                   * #import \"UnionFind.h\"\n                   * Place a 'UFDisjointSetNode *' field on objects you want to put in implicit mergeable sets.\n                   * Initialize the field with '[UFDisjointSetNode new]'.\n                   * Use '[obj1.nodeField unionWith:obj2.nodeField]' to merge sets.\n                   * Use '[obj1.nodeField isInSameSetAs:obj2.nodeField]' to determine if two objects are in the same set.\n",
   6   "homepage": "https://github.com/Strilanc/UnionFind-ObjC",
   7   "license": {
   8     "type": "Unlicense",
   9     "file": "LICENSE"
  10   },
  11   "authors": {
  12     "Craig Gidney": "craig.gidney@gmail.com"
  13   },
  14   "source": {
  15     "git": "https://github.com/Strilanc/UnionFind-ObjC.git",
  16     "tag": "v1.0.1"
  17   },
  18   "source_files": [
  19     "src",
  20     "src/**/*.{h,m}"
  21   ],
  22   "requires_arc": true
  23 }