Is this the only way to get valid units?

[AFZL210]

Hi I asked this question related to earlier on how to to get all the available units and just wanted to confirm that the solution in this #2805 is the only way to get valid units list?

Thanks!

[dvd101x]

Hi, I wouldn't say it's the only way. There might be many ways, but I would recommend exploring math.Unit.UNITS to find a way to match your specific needs.

I personally think the answer proposed at #3178 (comment) is very complete. Maybe you don't need all prefixes so you can skip some steps.

You could find similar solutions in various places in this project. Which might be useful to your needs.

• mathjs/bin/cli.js

  Lines 123 to 152 in 02f195f

  	const Unit = math.Unit
  	for (const name in Unit.UNITS) {
  	if (hasOwnProperty(Unit.UNITS, name)) {
  	if (name.indexOf(keyword) === 0) {
  	matches.push(name)
  	}
  	}
  	}
  	for (const name in Unit.PREFIXES) {
  	if (hasOwnProperty(Unit.PREFIXES, name)) {
  	const prefixes = Unit.PREFIXES[name]
  	for (const prefix in prefixes) {
  	if (hasOwnProperty(prefixes, prefix)) {
  	if (prefix.indexOf(keyword) === 0) {
  	matches.push(prefix)
  	} else if (keyword.indexOf(prefix) === 0) {
  	const unitKeyword = keyword.substring(prefix.length)
  	for (const n in Unit.UNITS) {
  	if (hasOwnProperty(Unit.UNITS, n)) {
  	if (n.indexOf(unitKeyword) === 0 &&
  	Unit.isValuelessUnit(prefix + n)) {
  	matches.push(prefix + n)
  	}
  	}
  	}
  	}
  	}
  	}
  	}
  	}

• mathjs/js/commandline.js

  Lines 224 to 260 in 9e86a6c

  	// units
  	var Unit = math.Unit;
  	for (name in Unit.UNITS) {
  	if (Unit.UNITS.hasOwnProperty(name)) {
  	if (name.indexOf(keyword) == 0
  	&& !completionMatches.includes(name)) {
  	completionMatches.push(name);
  	}
  	}
  	}
  	for (name in Unit.PREFIXES) {
  	if (Unit.PREFIXES.hasOwnProperty(name)) {
  	var prefixes = Unit.PREFIXES[name];
  	for (var prefix in prefixes) {
  	if (prefixes.hasOwnProperty(prefix)) {
  	if (prefix.indexOf(keyword) == 0
  	&& !completionMatches.includes(prefix)) {
  	completionMatches.push(prefix);
  	}
  	else if (keyword.indexOf(prefix) == 0) {
  	var unitKeyword = keyword.substring(prefix.length);
  	for (var n in Unit.UNITS) {
  	if (Unit.UNITS.hasOwnProperty(n)) {
  	if (n.indexOf(unitKeyword) == 0
  	&& Unit.isValuelessUnit(prefix + n)
  	&& !completionMatches.includes(prefix + n)) {
  	completionMatches.push(prefix + n);
  	}
  	}
  	}
  	}
  	}
  	}
  	}
  	}
  	}

• mathjs/examples/code editor/mathjs-lang.js

  Lines 199 to 231 in 02f195f

  	for (const name in math.Unit.UNITS) {
  	if (hasOwnPropertySafe(math.Unit.UNITS, name)) {
  	if (name.startsWith(word.text)) {
  	options.push({ label: name, type: 'enum' })
  	}
  	}
  	}
  	for (const name in math.Unit.PREFIXES) {
  	if (hasOwnPropertySafe(math.Unit.PREFIXES, name)) {
  	const prefixes = math.Unit.PREFIXES[name]
  	for (const prefix in prefixes) {
  	if (hasOwnPropertySafe(prefixes, prefix)) {
  	if (prefix.startsWith(word.text)) {
  	options.push({ label: prefix, type: 'enum' })
  	} else if (word.text.startsWith(prefix)) {
  	const unitKeyword = word.text.substring(prefix.length)
  	for (const n in math.Unit.UNITS) {
  	const fullUnit = prefix + n
  	if (hasOwnPropertySafe(math.Unit.UNITS, n)) {
  	if (
  	!options.includes(fullUnit) &&
  	n.startsWith(unitKeyword) &&
  	math.Unit.isValuelessUnit(fullUnit)
  	) {
  	options.push({ label: fullUnit, type: 'enum' })
  	}
  	}
  	}
  	}
  	}
  	}
  	}
  	}

[AFZL210]

Thank you @dvd101x