jonschlinkert

Strategic control point index

Businesses with high strategic control have more sustainable profitability, stronger competitive advantage, and higher valuations. Many business hit multiple strategic control points, and it's possible for businesses to combine multiple control points, even low control, to achieve a much greater level of strategic control in aggregate.

High strategic control:

• 10 — Monopoly, patent, own the standard
• 9 — Control of value chain
• 8 — Control of supply, string of superdominant positions
• 7 — Control of distribution, owning the customer relationship, owning customer information flow

jonschlinkert

In an effort to improve the quality of search results on sites like https://npmjs.com, there has been more and more discussion about factoring in the ranking/scoring of dependencies to influence search results. The general idea is that a library should be ranked not only on its own merits, but dependencies should weigh into the score as well.

I’m not sure what my opinion is on this yet. I was initially in favor of this, and still might be, but this document is a summary of some things that crossed my mind about the topic.

Should dependencies weigh into the search score for a library?

1. Some very popular libraries on npm are very poorly written, but solve problems that are sufficiently complex that few alternatives exist. From a scoring standpoint, this alone wouldn't matter because the law of averages would even it out. However...
2. It's possible for developers to write high quality, stable code on top of lesser quality libraries.
3. The better quality the code, and more knowledgable the maintainer

jonschlinkert

Quickstart

This guide shows you how to get up and running with breakdance, a HTML-to-markdown converter written in javascript for node.js.

Within 2-3 minutes you'll be converting HTML to markdown like a pro!

• visit the breakdance documtentation
• visit the breakdance GitHub repository

You can also follow @breakdancejs on twitter

jonschlinkert

(This is an excerpt from a much longer paper I'm writing about code quality and maintaining FOSS projects.)

FOSS dependency scoring

In an effort to improve the quality of search results on sites like https://npmjs.com, there has been more and more discussion about factoring in the ranking/scoring of dependencies to influence search results. The general idea is that a library should be ranked not only on its own merits, but dependencies should weigh into the score as well.

I’m not sure what my opinion is on this yet. I was initially in favor of this, and still might be, but this document is a summary of some things that crossed my mind about the topic.

Should dependencies weigh into the search score for a library?

jonschlinkert

const longest = arr => arr.reduce((len, v) => Math.max(v.length, len), 0);

jonschlinkert

const { Suite } = require('benchmark');
const argv = require('minimist')(process.argv.slice(2));

const cycle = (e, newline) => {
  process.stdout.write('\u001b[G');
  process.stdout.write(`  ${e.target}` + (newline ? '\n' : ''));
};

function bench(name) {
  const suite = new Suite()

jonschlinkert

const compile = (input, helpers, thisArg) => {
  return async data => {
    let ctx = { ...thisArg, ...data };
    let keys = [];
    let vals = [];

    if (helpers) {
      for (let key of Object.keys(helpers)) {
        if (ctx[key] === void 0) {
          ctx[key] = (...args) => helpers[key].call(ctx, ...args);

jonschlinkert

curl -s https://api.github.com/users/<USERNAME>/repos?per_page=100 | ruby -rjson -e 'JSON.load(STDIN.read).each {|repo| %x[git clone #{repo["clone_url"]} ]}'

jonschlinkert

Guide to Contributing to Enquirer

Welcome!

Thanks for choosing to contribute to Enquirer! We're so happy that you're contributing to open source projects, and we're even happier that one of those projects is ours!

Teamwork

There is no faster, more effective way to improve a product than from the feedback from the first experience of a new user -- Jon Schlinkert

jonschlinkert

/**
 * This variant takes a max depth as the second argument.
 */

const permutations = (value, max = value.length) => {
  let depth = Math.min(max, value.length);
  let results = [];

  const permute = (queue = []) => {
    if (queue.length === depth) {