|
462 | 462 | if (isType !== true || obj.type) {
|
463 | 463 | var res = buildHrefAndPath(obj);
|
464 | 464 | obj.displayPath = pathSplitter(res[0]);
|
465 |
| - obj.fullPath = obj.displayPath + obj.name; |
| 465 | + obj.fullPath = obj.displayPath + obj.n; |
466 | 466 | obj.href = res[1];
|
467 | 467 | out.push(obj);
|
468 | 468 | if (out.length >= MAX_RESULTS) {
|
|
597 | 597 | // match as well.
|
598 | 598 | var lev_distance = MAX_LEV_DISTANCE + 1;
|
599 | 599 | if (val.generics.length > 0) {
|
600 |
| - if (obj.generics && obj.generics.length >= val.generics.length) { |
601 |
| - var elems = obj.generics.slice(0); |
| 600 | + if (obj.g && obj.g.length >= val.generics.length) { |
| 601 | + var elems = obj.g.slice(0); |
602 | 602 | var total = 0;
|
603 | 603 | var done = 0;
|
604 | 604 | // We need to find the type that matches the most to remove it in order
|
|
630 | 630 | // Check for type name and type generics (if any).
|
631 | 631 | function checkType(obj, val, literalSearch) {
|
632 | 632 | var lev_distance = MAX_LEV_DISTANCE + 1;
|
633 |
| - if (obj.name === val.name) { |
| 633 | + if (obj.n === val.name) { |
634 | 634 | if (literalSearch === true) {
|
635 | 635 | if (val.generics && val.generics.length !== 0) {
|
636 |
| - if (obj.generics && obj.length >= val.generics.length) { |
637 |
| - var elems = obj.generics.slice(0); |
| 636 | + if (obj.g && obj.length >= val.generics.length) { |
| 637 | + var elems = obj.g.slice(0); |
638 | 638 | var allFound = true;
|
639 | 639 | var x;
|
640 | 640 |
|
|
658 | 658 | }
|
659 | 659 | // If the type has generics but don't match, then it won't return at this point.
|
660 | 660 | // Otherwise, `checkGenerics` will return 0 and it'll return.
|
661 |
| - if (obj.generics && obj.generics.length !== 0) { |
| 661 | + if (obj.g && obj.g.length !== 0) { |
662 | 662 | var tmp_lev = checkGenerics(obj, val);
|
663 | 663 | if (tmp_lev <= MAX_LEV_DISTANCE) {
|
664 | 664 | return tmp_lev;
|
|
669 | 669 | }
|
670 | 670 | // Names didn't match so let's check if one of the generic types could.
|
671 | 671 | if (literalSearch === true) {
|
672 |
| - if (obj.generics && obj.generics.length > 0) { |
673 |
| - for (var x = 0; x < obj.generics.length; ++x) { |
674 |
| - if (obj.generics[x] === val.name) { |
| 672 | + if (obj.g && obj.g.length > 0) { |
| 673 | + for (var x = 0; x < obj.g.length; ++x) { |
| 674 | + if (obj.g[x] === val.name) { |
675 | 675 | return true;
|
676 | 676 | }
|
677 | 677 | }
|
678 | 678 | }
|
679 | 679 | return false;
|
680 | 680 | }
|
681 |
| - var lev_distance = Math.min(levenshtein(obj.name, val.name), lev_distance); |
| 681 | + var lev_distance = Math.min(levenshtein(obj.n, val.name), lev_distance); |
682 | 682 | if (lev_distance <= MAX_LEV_DISTANCE) {
|
683 | 683 | lev_distance = Math.min(checkGenerics(obj, val), lev_distance);
|
684 |
| - } else if (obj.generics && obj.generics.length > 0) { |
| 684 | + } else if (obj.g && obj.g.length > 0) { |
685 | 685 | // We can check if the type we're looking for is inside the generics!
|
686 |
| - for (var x = 0; x < obj.generics.length; ++x) { |
687 |
| - lev_distance = Math.min(levenshtein(obj.generics[x], val.name), |
| 686 | + for (var x = 0; x < obj.g.length; ++x) { |
| 687 | + lev_distance = Math.min(levenshtein(obj.g[x], val.name), |
688 | 688 | lev_distance);
|
689 | 689 | }
|
690 | 690 | }
|
|
696 | 696 | function findArg(obj, val, literalSearch) {
|
697 | 697 | var lev_distance = MAX_LEV_DISTANCE + 1;
|
698 | 698 |
|
699 |
| - if (obj && obj.type && obj.type.inputs.length > 0) { |
700 |
| - for (var i = 0; i < obj.type.inputs.length; i++) { |
701 |
| - var tmp = checkType(obj.type.inputs[i], val, literalSearch); |
| 699 | + if (obj && obj.type && obj.type.i && obj.type.i.length > 0) { |
| 700 | + for (var i = 0; i < obj.type.i.length; i++) { |
| 701 | + var tmp = checkType(obj.type.i[i], val, literalSearch); |
702 | 702 | if (literalSearch === true && tmp === true) {
|
703 | 703 | return true;
|
704 | 704 | }
|
|
714 | 714 | function checkReturned(obj, val, literalSearch) {
|
715 | 715 | var lev_distance = MAX_LEV_DISTANCE + 1;
|
716 | 716 |
|
717 |
| - if (obj && obj.type && obj.type.output) { |
718 |
| - var tmp = checkType(obj.type.output, val, literalSearch); |
| 717 | + if (obj && obj.type && obj.type.o) { |
| 718 | + var tmp = checkType(obj.type.o, val, literalSearch); |
719 | 719 | if (literalSearch === true && tmp === true) {
|
720 | 720 | return true;
|
721 | 721 | }
|
|
860 | 860 | var fullId = generateId(ty);
|
861 | 861 |
|
862 | 862 | // allow searching for void (no output) functions as well
|
863 |
| - var typeOutput = type.output ? type.output.name : ""; |
| 863 | + var typeOutput = type.o ? type.o.name : ""; |
864 | 864 | var returned = checkReturned(ty, output, true);
|
865 | 865 | if (output.name === "*" || returned === true) {
|
866 | 866 | var in_args = false;
|
|
1029 | 1029 | for (var i = 0; i < aliases.length; ++i) {
|
1030 | 1030 | aliases[i].is_alias = true;
|
1031 | 1031 | aliases[i].alias = query.raw;
|
| 1032 | + aliases[i].path = aliases[i].p; |
1032 | 1033 | var res = buildHrefAndPath(aliases[i]);
|
1033 | 1034 | aliases[i].displayPath = pathSplitter(res[0]);
|
1034 | 1035 | aliases[i].fullPath = aliases[i].displayPath + aliases[i].name;
|
|
0 commit comments