QuestionParser.js now conforms to AirBnb lint tests
This commit is contained in:
Will Webberley
parent
cb4dcbfb95
commit
c22ed513cd
@ -1,12 +1,10 @@
|
||||
|
||||
|
||||
class QuestionParser {
|
||||
|
||||
whereIs(t) {
|
||||
const thing = t.match(/^where (?:is|are)(?: \ban?\b | \bthe\b | )([a-zA-Z0-9 ]*)/i)[1].replace(/\?/g, '');// .replace(/(\bthe\b|\ba\b)/g, '').trim();
|
||||
const instance = this.node.getInstanceByName(thing);
|
||||
let message;
|
||||
if (instance == null) {
|
||||
if (instance === null) {
|
||||
message = `I don't know what ${thing} is.`;
|
||||
return [true, message];
|
||||
}
|
||||
@ -14,25 +12,25 @@ class QuestionParser {
|
||||
const locatableIds = [];
|
||||
const places = {};
|
||||
let placeFound = false;
|
||||
for (let i = 0; i < locatableInstances.length; i++) { locatableIds.push(locatableInstances[i].id); }
|
||||
for (let i = 0; i < locatableInstances.length; i += 1) { locatableIds.push(locatableInstances[i].id); }
|
||||
|
||||
for (let i = 0; i < instance.values.length; i++) {
|
||||
for (let i = 0; i < instance.values.length; i += 1) {
|
||||
if (locatableIds.indexOf(instance.values[i].instance.id) > -1) {
|
||||
const place = `has ${instance.values[i].instance.name} as ${instance.values[i].label}`;
|
||||
if (!(place in places)) {
|
||||
places[place] = 0;
|
||||
}
|
||||
places[place]++;
|
||||
places[place] += 1;
|
||||
placeFound = true;
|
||||
}
|
||||
}
|
||||
for (let i = 0; i < instance.relationships.length; i++) {
|
||||
for (let i = 0; i < instance.relationships.length; i += 1) {
|
||||
if (locatableIds.indexOf(instance.relationships[i].instance.id) > -1) {
|
||||
const place = `${instance.relationships[i].label} ${instance.relationships[i].instance.name}`;
|
||||
if (!(place in places)) {
|
||||
places[place] = 0;
|
||||
}
|
||||
places[place]++;
|
||||
places[place] += 1;
|
||||
placeFound = true;
|
||||
}
|
||||
}
|
||||
@ -41,7 +39,7 @@ class QuestionParser {
|
||||
return [true, message];
|
||||
}
|
||||
message = instance.name;
|
||||
for (const place in places) {
|
||||
for (const place of places) {
|
||||
message += ` ${place}`;
|
||||
if (places[place] > 1) {
|
||||
message += ` (${places[place]} times)`;
|
||||
@ -55,71 +53,68 @@ class QuestionParser {
|
||||
const thing = t.match(/^(?:\bwho\b|\bwhat\b) is(?: \bin?\b | \bon\b | \bat\b)([a-zA-Z0-9 ]*)/i)[1].replace(/\?/g, '').replace(/\bthe\b/g, '').replace(/'/g, '');
|
||||
let instance = null;
|
||||
const locatableInstances = this.node.getInstances('location', true);
|
||||
const locatedInstances = [];
|
||||
for (let i = 0; i < locatableInstances.length; i++) {
|
||||
for (let i = 0; i < locatableInstances.length; i += 1) {
|
||||
if (thing.toLowerCase().indexOf(locatableInstances[i].name.toLowerCase()) > -1) {
|
||||
instance = locatableInstances[i]; break;
|
||||
}
|
||||
}
|
||||
if (instance == null) {
|
||||
message = `${thing} is not an instance of type location.`;
|
||||
return [true, message];
|
||||
if (instance === null) {
|
||||
return [true, `${thing} is not an instance of type location.`];
|
||||
}
|
||||
const things = {};
|
||||
let thingFound = false;
|
||||
for (let i = 0; i < this.node._instances.length; i++) {
|
||||
const vals = this.node._instances[i].values;
|
||||
const rels = this.node._instances[i].relationships;
|
||||
if (vals != null) {
|
||||
for (let j = 0; j < vals.length; j++) {
|
||||
if (vals[j].instance.id == instance.id) {
|
||||
const thing = `the ${this.node._instances[i].type.name} ${this.node._instances[i].name} has the ${instance.type.name} ${instance.name} as ${vals[j].label}`;
|
||||
if (!(thing in things)) {
|
||||
things[thing] = 0;
|
||||
for (let i = 0; i < this.node.instances.length; i += 1) {
|
||||
const vals = this.node.instances[i].values;
|
||||
const rels = this.node.instances[i].relationships;
|
||||
if (vals !== null) {
|
||||
for (let j = 0; j < vals.length; j += 1) {
|
||||
if (vals[j].instance.id === instance.id) {
|
||||
const thing2 = `the ${this.node.instances[i].type.name} ${this.node.instances[i].name} has the ${instance.type.name} ${instance.name} as ${vals[j].label}`;
|
||||
if (!(thing2 in things)) {
|
||||
things[thing2] = 0;
|
||||
}
|
||||
things[thing]++;
|
||||
things[thing2] += 1;
|
||||
thingFound = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (rels != null) {
|
||||
for (let j = 0; j < rels.length; j++) {
|
||||
if (rels[j].instance.id == instance.id) {
|
||||
const thing = `the ${this.node._instances[i].type.name} ${this.node._instances[i].name} ${rels[j].label} the ${instance.type.name} ${instance.name}`;
|
||||
if (!(thing in things)) {
|
||||
things[thing] = 0;
|
||||
if (rels !== null) {
|
||||
for (let j = 0; j < rels.length; j += 1) {
|
||||
if (rels[j].instance.id === instance.id) {
|
||||
const thing2 = `the ${this.node.instances[i].type.name} ${this.node.instances[i].name} ${rels[j].label} the ${instance.type.name} ${instance.name}`;
|
||||
if (!(thing2 in things)) {
|
||||
things[thing2] = 0;
|
||||
}
|
||||
things[thing]++;
|
||||
things[thing2] += 1;
|
||||
thingFound = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
if (!thingFound) {
|
||||
message = `I don't know what is located in/on/at the ${instance.type.name} ${instance.name}.`;
|
||||
return [true, message];
|
||||
return [true, `I don't know what is located in/on/at the ${instance.type.name} ${instance.name}.`];
|
||||
}
|
||||
|
||||
message = '';
|
||||
for (const thing in things) {
|
||||
message += ` ${thing}`;
|
||||
let message = '';
|
||||
for (const thing2 of things) {
|
||||
message += ` ${thing2}`;
|
||||
if (things[thing] > 1) {
|
||||
message += ` (${things[thing]} times)`;
|
||||
message += ` (${things[thing2]} times)`;
|
||||
}
|
||||
message += ' and';
|
||||
}
|
||||
return [true, `${message.substring(0, message.length - 4)}.`];
|
||||
}
|
||||
|
||||
whatIs(t) {
|
||||
t = t.replace(/\?/g, '').replace(/'/g, '').replace(/\./g, '');
|
||||
whatIs(input) {
|
||||
const t = input.replace(/\?/g, '').replace(/'/g, '').replace(/\./g, '');
|
||||
|
||||
// If we have an exact match (i.e. 'who is The Doctor?')
|
||||
let name = t.match(/^(\bwho\b|\bwhat\b) (?:is|are) ([a-zA-Z0-9_ ]*)/i);
|
||||
let instance;
|
||||
if (name) {
|
||||
instance = this.node.getInstanceByName(name[2]);
|
||||
if (instance != null) {
|
||||
if (instance !== null) {
|
||||
return [true, instance.gist];
|
||||
}
|
||||
}
|
||||
@ -127,37 +122,36 @@ class QuestionParser {
|
||||
// Otherwise, try and infer it
|
||||
name = t.match(/^(?:\bwho\b|\bwhat\b) (?:is|are)(?: \ban?\b | \bthe\b | )([a-zA-Z0-9_ ]*)/i)[1].replace(/\?/g, '').replace(/'/g, '');
|
||||
instance = this.node.getInstanceByName(name);
|
||||
if (instance == null) {
|
||||
if (instance === null) {
|
||||
const concept = this.node.getConceptByName(name);
|
||||
if (concept == null) {
|
||||
if (concept === null) {
|
||||
const possibilities = [];
|
||||
for (let i = 0; i < this.node._concepts.length; i++) {
|
||||
for (let j = 0; j < this.node._concepts[i].values.length; j++) {
|
||||
const v = this.node._concepts[i].values[j];
|
||||
if (v.label.toLowerCase() == name.toLowerCase()) {
|
||||
if (v.type == 0) {
|
||||
possibilities.push(`is a possible value of a type of ${this.node._concepts[i].name} (e.g. "the ${this.node._concepts[i].name} '${this.node._concepts[i].name.toUpperCase()} NAME' has 'VALUE' as ${name}")`);
|
||||
for (let i = 0; i < this.node.concepts.length; i += 1) {
|
||||
for (let j = 0; j < this.node.concepts[i].values.length; j += 1) {
|
||||
const v = this.node.concepts[i].values[j];
|
||||
if (v.label.toLowerCase() === name.toLowerCase()) {
|
||||
if (v.type === 0) {
|
||||
possibilities.push(`is a possible value of a type of ${this.node.concepts[i].name} (e.g. "the ${this.node.concepts[i].name} '${this.node.concepts[i].name.toUpperCase()} NAME' has 'VALUE' as ${name}")`);
|
||||
} else {
|
||||
possibilities.push(`is a possible ${v.concept.name} type of a type of ${this.node._concepts[i].name} (e.g. "the ${this.node._concepts[i].name} '${this.node._concepts[i].name.toUpperCase()} NAME' has the ${v.concept.name} '${v.concept.name.toUpperCase()} NAME' as ${name}")`);
|
||||
possibilities.push(`is a possible ${v.concept.name} type of a type of ${this.node.concepts[i].name} (e.g. "the ${this.node.concepts[i].name} '${this.node.concepts[i].name.toUpperCase()} NAME' has the ${v.concept.name} '${v.concept.name.toUpperCase()} NAME' as ${name}")`);
|
||||
}
|
||||
}
|
||||
}
|
||||
for (let j = 0; j < this.node._concepts[i].relationships.length; j++) {
|
||||
const r = this.node._concepts[i].relationships[j];
|
||||
if (r.label.toLowerCase() == name.toLowerCase()) {
|
||||
possibilities.push(`describes the relationship between a type of ${this.node._concepts[i].name} and a type of ${r.concept.name} (e.g. "the ${this.node._concepts[i].name} '${this.node._concepts[i].name.toUpperCase()} NAME' ${name} the ${r.concept.name} '${r.concept.name.toUpperCase()} NAME'")`);
|
||||
for (let j = 0; j < this.node.concepts[i].relationships.length; j += 1) {
|
||||
const r = this.node.concepts[i].relationships[j];
|
||||
if (r.label.toLowerCase() === name.toLowerCase()) {
|
||||
possibilities.push(`describes the relationship between a type of ${this.node.concepts[i].name} and a type of ${r.concept.name} (e.g. "the ${this.node.concepts[i].name} '${this.node.concepts[i].name.toUpperCase()} NAME' ${name} the ${r.concept.name} '${r.concept.name.toUpperCase()} NAME'")`);
|
||||
}
|
||||
}
|
||||
}
|
||||
if (possibilities.length > 0) {
|
||||
return [true, `'${name}' ${possibilities.join(' and ')}.`];
|
||||
} else { return [true, "I don't know who or what that is."]; }
|
||||
} else {
|
||||
return [true, concept.gist];
|
||||
}
|
||||
return [true, "I don't know who or what that is."];
|
||||
}
|
||||
} else {
|
||||
return [true, instance.gist];
|
||||
return [true, concept.gist];
|
||||
}
|
||||
return [true, instance.gist];
|
||||
}
|
||||
|
||||
whatDoes(t) {
|
||||
@ -166,7 +160,7 @@ class QuestionParser {
|
||||
const body = data[2].replace(/\ban\b/gi, '').replace(/\bthe\b/gi, '').replace(/\ba\b/gi, '');
|
||||
const tokens = body.split(' ');
|
||||
let instance;
|
||||
for (let i = 0; i < tokens.length; i++) {
|
||||
for (let i = 0; i < tokens.length; i += 1) {
|
||||
const testString = tokens.slice(0, i).join(' ').trim();
|
||||
if (!instance) {
|
||||
instance = this.node.getInstanceByName(testString);
|
||||
@ -196,6 +190,7 @@ class QuestionParser {
|
||||
} catch (err) {
|
||||
return [false, "Sorry - I can't work out what you're asking."];
|
||||
}
|
||||
return null;
|
||||
}
|
||||
|
||||
whatRelationship(t) {
|
||||
@ -204,12 +199,12 @@ class QuestionParser {
|
||||
const body = data[2].replace(/\ban\b/gi, '').replace(/\bthe\b/gi, '').replace(/\ba\b/gi, '');
|
||||
const tokens = body.split(' ');
|
||||
let instance;
|
||||
for (let i = 0; i < tokens.length; i++) {
|
||||
for (let i = 0; i < tokens.length; i += 1) {
|
||||
const testString = tokens.slice(tokens.length - (i + 1), tokens.length).join(' ').trim();
|
||||
if (!instance) {
|
||||
instance = this.node.getInstanceByName(testString);
|
||||
}
|
||||
if (!instance && testString[testString.length - 1].toLowerCase() == 's') {
|
||||
if (!instance && testString[testString.length - 1].toLowerCase() === 's') {
|
||||
instance = this.node.getInstanceByName(testString.substring(0, testString.length - 1));
|
||||
}
|
||||
if (instance) {
|
||||
@ -218,13 +213,13 @@ class QuestionParser {
|
||||
}
|
||||
if (instance) {
|
||||
const propertyName = tokens.splice(0, tokens.length - instance.name.split(' ').length).join(' ').trim();
|
||||
for (let i = 0; i < this.node._instances.length; i++) {
|
||||
const subject = this.node._instances[i];
|
||||
for (let i = 0; i < this.node.instances.length; i += 1) {
|
||||
const subject = this.node.instances[i];
|
||||
let fixedPropertyName = propertyName;
|
||||
let property = subject.property(propertyName);
|
||||
if (!property) {
|
||||
const propTokens = propertyName.split(' ');
|
||||
if (propTokens[0][propTokens[0].length - 1].toLowerCase() == 's') {
|
||||
if (propTokens[0][propTokens[0].length - 1].toLowerCase() === 's') {
|
||||
propTokens[0] = propTokens[0].substring(0, propTokens[0].length - 1);
|
||||
}
|
||||
fixedPropertyName = propTokens.join(' ').trim();
|
||||
@ -236,38 +231,38 @@ class QuestionParser {
|
||||
fixedPropertyName = propTokens.join(' ').trim();
|
||||
property = subject.property(fixedPropertyName);
|
||||
}
|
||||
if (property && property.name == instance.name) {
|
||||
if (property && property.name === instance.name) {
|
||||
return [true, `${subject.name} ${fixedPropertyName} the ${property.type.name} ${property.name}.`];
|
||||
}
|
||||
}
|
||||
return [true, `Sorry - I don't know that property about the ${instance.type.name} ${instance.name}.`];
|
||||
}
|
||||
} catch (err) {
|
||||
console.log(err);
|
||||
return [false, "Sorry - I can't work out what you're asking."];
|
||||
}
|
||||
return null;
|
||||
}
|
||||
|
||||
listInstances(t) {
|
||||
let ins = [];
|
||||
let s = '';
|
||||
if (t.toLowerCase().indexOf('list instances of type') == 0) {
|
||||
if (t.toLowerCase().indexOf('list instances of type') === 0) {
|
||||
const con = t.toLowerCase().replace('list instances of type', '').trim();
|
||||
ins = this.node.getInstances(con);
|
||||
s = `Instances of type '${con}':`;
|
||||
} else if (t.toLowerCase().indexOf('list all instances of type') == 0) {
|
||||
} else if (t.toLowerCase().indexOf('list all instances of type') === 0) {
|
||||
const con = t.toLowerCase().replace('list all instances of type', '').trim();
|
||||
ins = this.node.getInstances(con, true);
|
||||
s = `All instances of type '${con}':`;
|
||||
} else if (t.toLowerCase() == 'list instances') {
|
||||
ins = this.node._instances;
|
||||
} else if (t.toLowerCase() === 'list instances') {
|
||||
ins = this.node.instances;
|
||||
s = 'All instances:';
|
||||
}
|
||||
if (ins.length == 0) {
|
||||
if (ins.length === 0) {
|
||||
return [true, 'I could not find any instances matching your query.'];
|
||||
}
|
||||
const names = [];
|
||||
for (let i = 0; i < ins.length; i++) {
|
||||
for (let i = 0; i < ins.length; i += 1) {
|
||||
names.push(ins[i].name);
|
||||
}
|
||||
return [true, `${s} ${names.join(', ')}`];
|
||||
|
||||
Loading…
Reference in New Issue
Block a user