如何在字符串长度计数中包含非spintax内容?

问题描述 投票:0回答:1

我需要从spintax中提取最长的结果。但我找不到添加非旋转文本的方法。当有可用选项时,我的代码正在提取最长的选项,但它忽略了spintax大括号之外的内容。

var totalcount = 0;
var text = "{This is|Here} a {sample|demo} of a sentence {made with|created using} spintax";

var longtext = "";
var matches, options, random;
var regEx = new RegExp(/{([^{}]+?)}/);

while((matches = regEx.exec(text)) !== null) {  

  options = matches[1].split("|");
  var long1 = matches[1].split("|");
  var longest = long1[0];
  var strcount = 0;

  for (i = 0; i < long1.length; i++) {
    if (long1[i].length > longest.length) {
        longest = long1[i];
        }
       strcount = longest.length;
     }
      totalcount = totalcount + strcount;
      longtext = longtext + ' ' + longest;


  random = Math.floor(Math.random() * options.length);
  text = text.replace(matches[0], options[random]);
}

document.write('Random spin:<br>'+text+'<br><br>');
document.write('Longest spin ('+strcount+' chars):<br>'+longtext);

我用来计算最长选项的循环只计算spintax变量。所以它正在跳过“一个”,“一个句子”和“spintax”

我如何添加这些以便它们也被计算在内?

在此先感谢...并为凌乱的代码感到抱歉!

javascript spintax
1个回答
0
投票

Facebook上的一位朋友为我解答了这个问题:)所以对于任何有相同问题的人来说,这是他的解决方案:

<script>
var matches, options, random;

var spintaxString = "{London|Birmingham|Ely} is a {nice|wonderful|fabulous} place with some great {cafes | bars | restaurants}";
var longestString = spintaxString;
var regEx = new RegExp(/{([^{}]+?)}/);


while((matches = regEx.exec(spintaxString)) !== null) {
    options = matches[1].split("|");
    random = Math.floor(Math.random() * options.length);

    var longest = options[0];
    for (i = 0; i < options.length; i++) {
    if (options[i].length > longest.length) {
        longest = options[i];
        }
     }

    longestString = longestString.replace(matches[0], longest);
    spintaxString = spintaxString.replace(matches[0], options[random]);
}

document.write('Random: '+spintaxString+' ('+spintaxString.length+' chars)<br>');
document.write('Longest: '+longestString+'  ('+longestString.length+' chars)<br>');

</script>
© www.soinside.com 2019 - 2024. All rights reserved.