的Javascript分割阵列

Question

我想写一个自定义字符串划分功能，这是难度比我本来期望。

基本上，我通过在一个字符串，该字符串将分裂的值的阵列，并且它会返回子字符串数组，移除空的，并且包括它分裂上的值。如果字符串可以在同一个地方由两个不同的值进行分割，较长的一个优先。

也就是说，

split("Go ye away, I want some peace && quiet. & Thanks.", ["Go ", ",", "&&", "&", "."]); 

应该返回

["Go ", "ye away", ",", " I want some peace ", "&&", " quiet", ".", " ", "&", " Thanks", "."] 

你能想到一个相当简单的算法，这个的？如果有一个内置的方式在Javascript做到这一点（我不认为有），这将是更好的。

Answer 1

喜欢的东西this？

function mySplit(input, delimiters) { 

    // Sort delimiters array by length to avoid ambiguity 
    delimiters.sort(function(a, b) { 
     if (a.length > b.length) { return -1; } 
     return 0; 
    } 

    var result = []; 

    // Examine input one character at a time 
    for (var i = 0; i < input.length; i++) { 
     for (var j = 0; j < delimiters.length; j++) { 
      if (input.substr(i, delimiters[j].length) == delimiters[j]) { 

       // Add first chunk of input to result 
       if (i > 0) { 
        result.push(input.substr(0, i)); 
       } 
       result.push(delimiters[j]); 

       // Reset input and iteration 
       input = input.substr(i + delimiters[j].length); 
       i = 0; 
       j = 0; 
      } 
     } 
    } 

    return result; 
} 

var input  = "Go ye away, I want some peace && quiet. & Thanks."; 
var delimiters = ["Go ", ",", "&&", "&", "."]; 

console.log(mySplit(input, delimiters)); 
// Output: ["Go ", "ye away", ",", " I want some peace ", 
//   "&&", " quiet", ".", " ", "&", " Thanks", "."] 

Answer 2

精确解问：

function megasplit(toSplit, splitters) { 
    var splitters = splitters.sorted(function(a,b) {return b.length-a.length}); 
                  // sort by length; put here for readability, trivial to separate rest of function into helper function 
    if (!splitters.length) 
     return toSplit; 
    else { 
     var token = splitters[0]; 
     return toSplit 
      .split(token)    // split on token 
      .map(function(segment) { // recurse on segments 
       return megasplit(segment, splitters.slice(1)) 
      }) 
      .intersperse(token)  // re-insert token 
      .flatten()    // rejoin segments 
      .filter(Boolean); 
    } 
} 

演示：

> megasplit(
     "Go ye away, I want some peace && quiet. & Thanks.", 
     ["Go ", ",", "&&", "&", "."] 
) 
["Go ", "ye away", ",", " I want some peace ", "&", "&", " quiet", ".", " ", "&", " Thanks", "."] 

机械（可重复使用！）：

Array.prototype.copy = function() { 
    return this.slice() 
} 
Array.prototype.sorted = function() { 
    var copy = this.copy(); 
    copy.sort.apply(copy, arguments); 
    return copy; 
} 
Array.prototype.flatten = function() { 
    return [].concat.apply([], this) 
} 
Array.prototype.mapFlatten = function() { 
    return this.map.apply(this,arguments).flatten() 
} 
Array.prototype.intersperse = function(token) { 
    // [1,2,3].intersperse('x') -> [1,'x',2,'x',3] 
    return this.mapFlatten(function(x){return [token,x]}).slice(1) 
} 

---

注：

• 这需要研究的一个体面的数额做优雅：
  • (Deep) copying an array using jQuery
  • What is the most efficient way to concatenate N arrays in JavaScript?（创建了自己的丑陋少法）
  • How can I split text on commas not within double quotes, while keeping the quotes? （垃圾的答案，再次创造了我自己的方法）
• 这由事实进一步复杂化要求令牌（虽然他们在字符串中被抛）不应该被分割（否则你会得到"&", "&"）的规范。这使得使用reduce不可能的，必要的递归。
• 我还亲自不会忽视与分裂空字符串。我可以理解不想递归地分割令牌，但我个人简化功能，并使输出像正常.split和["", "Go ", "ye away", ",", " I want some peace ", "&&", " quiet", ".", " ", "&", " Thanks", ".", ""]
• 我应该指出，如果你愿意放松你的要求一点，这正好从一个15/20-衬垫到三分之一衬里：

---

如果一个跟随典型分裂行为1-衬垫：

Array.prototype.mapFlatten = function() { 
    ... 
} 
function megasplit(toSplit, splitters) { 
    return splitters.sorted(...).reduce(function(strings, token) { 
     return strings.mapFlatten(function(s){return s.split(token)}); 
    }, [toSplit]); 
} 

3内胆，如果上面是难以阅读：

Array.prototype.mapFlatten = function() { 
    ... 
} 
function megasplit(toSplit, splitters) { 
    var strings = [toSplit]; 
    splitters.sorted(...).forEach(function(token) { 
     strings = strings.mapFlatten(function(s){return s.split(token)}); 
    }); 
    return strings; 
}