随笔- 147 文章- 0 评论- 10 阅读- 43万

js对比两个文本的差异并高亮显示差异部分

在线参考demo：

http://incaseofstairs.com/jsdiff/

项目地址：

https://github.com/kpdecker/jsdiff

测试页面html源码：

效果图：

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

<!DOCTYPE html>
<html>
<head>
    <meta charset="utf-8">
    <title>比较文本差异</title>
    <style type="text/css">
        table { width: 100%; height: 600px; }
        tr { flex-direction: row; display: -webkit-flex; display: flex; height: 100%; -webkit-flex-wrap: wrap; flex-wrap: wrap; }
            tr td { width: 33%; border: 1px solid #000000; }
        del { background: #ff0000; }
        ins { background: #00ff21; }
    </style>
</head>
<body>
 
    <div id="settings">
        <h1>比较文本差异（只适合比较纯文本且不带html标签）</h1>
        <label><input type="radio" name="diff_type" value="diffChars" checked> Chars</label>
        <label><input type="radio" name="diff_type" value="diffWords"> Words</label>
        <label><input type="radio" name="diff_type" value="diffLines"> Lines</label>
    </div>
    <a href="https://github.com/kpdecker/jsdiff" class="source">github.com/kpdecker/jsdiff</a>
    <table>
        <tr>
            <td contenteditable="true" id="a">restaurant</td>
            <td contenteditable="true" id="b">aura</td>
            <td><div id="result"></div></td>
        </tr>
    </table>
 
    <script src="diff.js"></script>
    <script defer>
        var a = document.getElementById('a');
        var b = document.getElementById('b');
        var result = document.getElementById('result');
 
        function changed() {
            console.log('***********************************************');
            var oldContent = a.textContent;
            var content1 = b.textContent;
 
            //console.log("content1-----");
            //console.log(content1);
 
            //diffChars以字符显示差异
            //diffWords以整句或段显示对比差异
            //diffLines以行显示差异
            //window.diffType
            var diff = JsDiff[window.diffType](oldContent, content1);
            var arr = new Array();
            for (var i = 0; i < diff.length; i++) {
                if (diff[i].added && diff[i + 1] && diff[i + 1].removed) {
                    var swap = diff[i];
                    diff[i] = diff[i + 1];
                    diff[i + 1] = swap;
                }
                console.log(diff[i]);
                var diffObj = diff[i];
                var content = diffObj.value;
 
                //可以考虑启用，特别是后台清理HTML标签后的文本
                if (content.indexOf("\n") >= 0) {
                    //console.log("有换行符");
                    //替换为<br/>
                    var reg = new RegExp('\n', 'g');
                    content = content.replace(reg, '<br/>');
                }
 
                //var reg2 = new RegExp('##em2', 'g');
                //var reg3 = new RegExp('replace##', 'g');
                //content = content.replace(reg2, '');
                //content = content.replace(reg3, '');
 
                if (diffObj.removed) {
                    arr.push('<del title="删除的部分">' + content + '</del>');
                } else if (diffObj.added) {
                    arr.push('<ins title="新增的部分">' + content + '</ins>');
                } else {
                    //没有改动的部分
                    arr.push('<span title="没有改动的部分">' + content + '</span>');
                }
            }
            var html = arr.join('');
            //var reg = new RegExp('##em2.replace##', 'g');
            //html = html.replace(reg, '<span style="text-indent:2em;display: inline-block;"> </span>');
            //$("#" + newId+"_show").html(html);
            //$("#result").html(html);
            result.innerHTML = html;
        }
        //function changed() {
        //  var diff = JsDiff[window.diffType](a.textContent, b.textContent);
        //  var fragment = document.createDocumentFragment();
        //  for (var i=0; i < diff.length; i++) {
        //      if (diff[i].added && diff[i + 1] && diff[i + 1].removed) {
        //          var swap = diff[i];
        //          diff[i] = diff[i + 1];
        //          diff[i + 1] = swap;
        //      }
        //      var node;
        //      if (diff[i].removed) {
        //          node = document.createElement('del');
        //          node.appendChild(document.createTextNode(diff[i].value));
        //      } else if (diff[i].added) {
        //          node = document.createElement('ins');
        //          node.appendChild(document.createTextNode(diff[i].value));
        //      } else {
        //          node = document.createTextNode(diff[i].value);
        //      }
        //      fragment.appendChild(node);
        //  }
        //  result.textContent = '';
        //  result.appendChild(fragment);
        //}
 
        window.onload = function () {
            onDiffTypeChange(document.querySelector('#settings [name="diff_type"]:checked'));
            changed();
        };
 
        a.onpaste = a.onchange =
            b.onpaste = b.onchange = changed;
 
        if ('oninput' in a) {
            a.oninput = b.oninput = changed;
        } else {
            a.onkeyup = b.onkeyup = changed;
        }
 
        function onDiffTypeChange(radio) {
            window.diffType = radio.value;
            document.title = "Diff " + radio.value.slice(4);
        }
 
        var radio = document.getElementsByName('diff_type');
        for (var i = 0; i < radio.length; i++) {
            radio[i].onchange = function (e) {
                onDiffTypeChange(e.target);
                changed();
            }
        }
    </script>
</body>
</html>

　　核心的处理对比的diff.js文件：

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

332

333

334

335

336

337

338

339

340

341

342

343

344

345

346

347

348

349

350

351

352

353

354

355

356

357

358

359

360

361

362

363

364

365

366

367

368

369

370

371

372

373

374

375

376

377

378

379

380

381

382

383

384

385

386

387

388

389

390

391

392

393

394

395

396

397

398

399

400

401

402

403

404

405

406

407

408

409

410

411

412

413

414

415

416

417

418

419

420

421

422

423

424

425

426

427

428

429

430

431

432

433

434

435

436

437

438

439

440

441

442

443

444

445

446

447

448

449

450

451

452

453

454

455

456

457

458

459

460

461

462

463

464

465

466

467

468

469

470

471

472

473

474

475

476

477

478

479

480

481

482

483

484

485

486

487

488

489

490

491

492

493

494

495

496

497

498

499

500

501

502

503

504

505

506

507

508

509

510

511

512

513

514

515

516

517

518

519

520

521

522

523

524

525

526

527

528

529

530

531

532

533

534

535

536

537

538

539

540

541

542

543

544

545

546

547

548

549

550

551

552

553

554

555

556

557

558

559

560

561

562

563

564

565

566

567

568

569

570

571

572

573

574

575

576

577

578

579

580

581

582

583

584

585

586

587

588

589

590

591

592

593

594

595

596

597

598

599

600

601

602

603

604

605

606

607

608

609

610

611

612

613

614

615

616

617

618

619

620

621

622

623

624

625

626

627

628

629

630

631

632

633

634

635

636

637

638

639

640

641

642

643

644

645

646

647

648

649

650

651

652

653

654

655

656

657

658

659

660

661

662

663

664

665

666

667

668

669

670

671

672

673

674

675

676

677

678

679

680

681

682

683

684

685

686

687

688

689

690

691

692

693

694

695

696

697

698

699

700

701

702

703

704

705

706

707

708

709

710

711

712

713

714

715

716

717

718

719

720

721

722

723

724

725

726

727

728

729

730

731

732

733

734

735

736

737

738

739

740

741

742

743

744

745

746

747

748

749

750

751

752

753

754

755

756

757

758

759

760

761

762

763

764

765

766

767

768

769

770

771

772

773

774

775

776

777

778

779

780

781

782

783

784

785

786

787

788

789

790

791

792

793

794

795

796

797

798

799

800

801

802

803

804

805

806

807

808

809

810

811

812

813

814

815

816

817

818

819

820

821

822

823

824

825

826

827

828

829

830

831

832

833

834

835

836

837

838

839

840

841

842

843

844

845

846

847

848

849

850

851

852

853

854

855

856

857

858

859

860

861

862

863

864

865

866

867

868

869

870

871

872

873

874

875

876

877

878

879

880

881

882

883

884

885

886

887

888

889

890

891

892

893

894

895

896

897

898

899

900

901

902

903

904

905

906

907

908

909

910

911

912

913

914

915

916

917

918

919

920

921

922

923

924

925

926

927

928

929

930

931

932

933

934

935

936

937

938

939

940

941

942

943

944

945

946

947

948

949

950

951

952

953

954

955

956

957

958

959

960

961

962

963

964

965

966

967

968

969

970

971

972

973

974

975

976

977

978

979

980

981

982

983

984

985

986

987

988

989

990

991

992

993

994

995

996

997

998

999

1000

1001

1002

1003

1004

1005

1006

1007

1008

1009

1010

1011

1012

1013

1014

1015

1016

1017

1018

1019

1020

1021

1022

1023

1024

1025

1026

1027

1028

1029

1030

1031

1032

1033

1034

1035

1036

1037

1038

1039

1040

1041

1042

1043

1044

1045

1046

1047

1048

1049

1050

1051

1052

1053

1054

1055

/*!
 
 diff v2.0.1
 
Software License Agreement (BSD License)
 
Copyright (c) 2009-2015, Kevin Decker <kpdecker@gmail.com>
 
All rights reserved.
 
Redistribution and use of this software in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
 
* Redistributions of source code must retain the above
  copyright notice, this list of conditions and the
  following disclaimer.
 
* Redistributions in binary form must reproduce the above
  copyright notice, this list of conditions and the
  following disclaimer in the documentation and/or other
  materials provided with the distribution.
 
* Neither the name of Kevin Decker nor the names of its
  contributors may be used to endorse or promote products
  derived from this software without specific prior
  written permission.
 
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
@license
*/
(function webpackUniversalModuleDefinition(root, factory) {
    if(typeof exports === 'object' && typeof module === 'object')
        module.exports = factory();
    else if(typeof define === 'function' && define.amd)
        define(factory);
    else if(typeof exports === 'object')
        exports["JsDiff"] = factory();
    else
        root["JsDiff"] = factory();
})(this, function() {
return /******/ (function(modules) { // webpackBootstrap
/******/    // The module cache
/******/    var installedModules = {};
 
/******/    // The require function
/******/    function __webpack_require__(moduleId) {
 
/******/        // Check if module is in cache
/******/        if(installedModules[moduleId])
/******/            return installedModules[moduleId].exports;
 
/******/        // Create a new module (and put it into the cache)
/******/        var module = installedModules[moduleId] = {
/******/            exports: {},
/******/            id: moduleId,
/******/            loaded: false
/******/        };
 
/******/        // Execute the module function
/******/        modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);
 
/******/        // Flag the module as loaded
/******/        module.loaded = true;
 
/******/        // Return the exports of the module
/******/        return module.exports;
/******/    }
 
 
/******/    // expose the modules object (__webpack_modules__)
/******/    __webpack_require__.m = modules;
 
/******/    // expose the module cache
/******/    __webpack_require__.c = installedModules;
 
/******/    // __webpack_public_path__
/******/    __webpack_require__.p = "";
 
/******/    // Load entry module and return exports
/******/    return __webpack_require__(0);
/******/ })
/************************************************************************/
/******/ ([
/* 0 */
/***/ function(module, exports, __webpack_require__) {
 
    /* See LICENSE file for terms of use */
 
    /*
     * Text diff implementation.
     *
     * This library supports the following APIS:
     * JsDiff.diffChars: Character by character diff
     * JsDiff.diffWords: Word (as defined by \b regex) diff which ignores whitespace
     * JsDiff.diffLines: Line based diff
     *
     * JsDiff.diffCss: Diff targeted at CSS content
     *
     * These methods are based on the implementation proposed in
     * "An O(ND) Difference Algorithm and its Variations" (Myers, 1986).
     * http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.6927
     */
    'use strict';
 
    exports.__esModule = true;
    // istanbul ignore next
 
    function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { 'default': obj }; }
 
    var _diffBase = __webpack_require__(1);
 
    var _diffBase2 = _interopRequireDefault(_diffBase);
 
    var _diffCharacter = __webpack_require__(3);
 
    var _diffWord = __webpack_require__(4);
 
    var _diffLine = __webpack_require__(5);
 
    var _diffSentence = __webpack_require__(6);
 
    var _diffCss = __webpack_require__(7);
 
    var _diffJson = __webpack_require__(8);
 
    var _patchApply = __webpack_require__(9);
 
    var _patchCreate = __webpack_require__(10);
 
    var _convertDmp = __webpack_require__(12);
 
    var _convertXml = __webpack_require__(13);
 
    exports.Diff = _diffBase2['default'];
    exports.diffChars = _diffCharacter.diffChars;
    exports.diffWords = _diffWord.diffWords;
    exports.diffWordsWithSpace = _diffWord.diffWordsWithSpace;
    exports.diffLines = _diffLine.diffLines;
    exports.diffTrimmedLines = _diffLine.diffTrimmedLines;
    exports.diffSentences = _diffSentence.diffSentences;
    exports.diffCss = _diffCss.diffCss;
    exports.diffJson = _diffJson.diffJson;
    exports.structuredPatch = _patchCreate.structuredPatch;
    exports.createTwoFilesPatch = _patchCreate.createTwoFilesPatch;
    exports.createPatch = _patchCreate.createPatch;
    exports.applyPatch = _patchApply.applyPatch;
    exports.convertChangesToDMP = _convertDmp.convertChangesToDMP;
    exports.convertChangesToXML = _convertXml.convertChangesToXML;
    exports.canonicalize = _diffJson.canonicalize;
 
 
/***/ },
/* 1 */
/***/ function(module, exports, __webpack_require__) {
 
    'use strict';
 
    exports.__esModule = true;
    exports['default'] = Diff;
    // istanbul ignore next
 
    function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { 'default': obj }; }
 
    var _utilMap = __webpack_require__(2);
 
    var _utilMap2 = _interopRequireDefault(_utilMap);
 
    function Diff(ignoreWhitespace) {
      this.ignoreWhitespace = ignoreWhitespace;
    }
 
    Diff.prototype = {
      diff: function diff(oldString, newString, callback) {
        var self = this;
 
        function done(value) {
          if (callback) {
            setTimeout(function () {
              callback(undefined, value);
            }, 0);
            return true;
          } else {
            return value;
          }
        }
 
        // Allow subclasses to massage the input prior to running
        oldString = this.castInput(oldString);
        newString = this.castInput(newString);
 
        // Handle the identity case (this is due to unrolling editLength == 0
        if (newString === oldString) {
          return done([{ value: newString }]);
        }
        if (!newString) {
          return done([{ value: oldString, removed: true }]);
        }
        if (!oldString) {
          return done([{ value: newString, added: true }]);
        }
 
        newString = this.removeEmpty(this.tokenize(newString));
        oldString = this.removeEmpty(this.tokenize(oldString));
 
        var newLen = newString.length,
            oldLen = oldString.length;
        var editLength = 1;
        var maxEditLength = newLen + oldLen;
        var bestPath = [{ newPos: -1, components: [] }];
 
        // Seed editLength = 0, i.e. the content starts with the same values
        var oldPos = this.extractCommon(bestPath[0], newString, oldString, 0);
        if (bestPath[0].newPos + 1 >= newLen && oldPos + 1 >= oldLen) {
          // Identity per the equality and tokenizer
          return done([{ value: newString.join('') }]);
        }
 
        // Main worker method. checks all permutations of a given edit length for acceptance.
        function execEditLength() {
          for (var diagonalPath = -1 * editLength; diagonalPath <= editLength; diagonalPath += 2) {
            var basePath = undefined;
            var addPath = bestPath[diagonalPath - 1],
                removePath = bestPath[diagonalPath + 1],
                _oldPos = (removePath ? removePath.newPos : 0) - diagonalPath;
            if (addPath) {
              // No one else is going to attempt to use this value, clear it
              bestPath[diagonalPath - 1] = undefined;
            }
 
            var canAdd = addPath && addPath.newPos + 1 < newLen,
                canRemove = removePath && 0 <= _oldPos && _oldPos < oldLen;
            if (!canAdd && !canRemove) {
              // If this path is a terminal then prune
              bestPath[diagonalPath] = undefined;
              continue;
            }
 
            // Select the diagonal that we want to branch from. We select the prior
            // path whose position in the new string is the farthest from the origin
            // and does not pass the bounds of the diff graph
            if (!canAdd || canRemove && addPath.newPos < removePath.newPos) {
              basePath = clonePath(removePath);
              self.pushComponent(basePath.components, undefined, true);
            } else {
              basePath = addPath; // No need to clone, we've pulled it from the list
              basePath.newPos++;
              self.pushComponent(basePath.components, true, undefined);
            }
 
            _oldPos = self.extractCommon(basePath, newString, oldString, diagonalPath);
 
            // If we have hit the end of both strings, then we are done
            if (basePath.newPos + 1 >= newLen && _oldPos + 1 >= oldLen) {
              return done(buildValues(basePath.components, newString, oldString, self.useLongestToken));
            } else {
              // Otherwise track this path as a potential candidate and continue.
              bestPath[diagonalPath] = basePath;
            }
          }
 
          editLength++;
        }
 
        // Performs the length of edit iteration. Is a bit fugly as this has to support the
        // sync and async mode which is never fun. Loops over execEditLength until a value
        // is produced.
        if (callback) {
          (function exec() {
            setTimeout(function () {
              // This should not happen, but we want to be safe.
              /* istanbul ignore next */
              if (editLength > maxEditLength) {
                return callback();
              }
 
              if (!execEditLength()) {
                exec();
              }
            }, 0);
          })();
        } else {
          while (editLength <= maxEditLength) {
            var ret = execEditLength();
            if (ret) {
              return ret;
            }
          }
        }
      },
 
      pushComponent: function pushComponent(components, added, removed) {
        var last = components[components.length - 1];
        if (last && last.added === added && last.removed === removed) {
          // We need to clone here as the component clone operation is just
          // as shallow array clone
          components[components.length - 1] = { count: last.count + 1, added: added, removed: removed };
        } else {
          components.push({ count: 1, added: added, removed: removed });
        }
      },
      extractCommon: function extractCommon(basePath, newString, oldString, diagonalPath) {
        var newLen = newString.length,
            oldLen = oldString.length,
            newPos = basePath.newPos,
            oldPos = newPos - diagonalPath,
            commonCount = 0;
        while (newPos + 1 < newLen && oldPos + 1 < oldLen && this.equals(newString[newPos + 1], oldString[oldPos + 1])) {
          newPos++;
          oldPos++;
          commonCount++;
        }
 
        if (commonCount) {
          basePath.components.push({ count: commonCount });
        }
 
        basePath.newPos = newPos;
        return oldPos;
      },
 
      equals: function equals(left, right) {
        var reWhitespace = /\S/;
        return left === right || this.ignoreWhitespace && !reWhitespace.test(left) && !reWhitespace.test(right);
      },
      removeEmpty: function removeEmpty(array) {
        var ret = [];
        for (var i = 0; i < array.length; i++) {
          if (array[i]) {
            ret.push(array[i]);
          }
        }
        return ret;
      },
      castInput: function castInput(value) {
        return value;
      },
      tokenize: function tokenize(value) {
        return value.split('');
      }
    };
 
    function buildValues(components, newString, oldString, useLongestToken) {
      var componentPos = 0,
          componentLen = components.length,
          newPos = 0,
          oldPos = 0;
 
      for (; componentPos < componentLen; componentPos++) {
        var component = components[componentPos];
        if (!component.removed) {
          if (!component.added && useLongestToken) {
            var value = newString.slice(newPos, newPos + component.count);
            value = _utilMap2['default'](value, function (value, i) {
              var oldValue = oldString[oldPos + i];
              return oldValue.length > value.length ? oldValue : value;
            });
 
            component.value = value.join('');
          } else {
            component.value = newString.slice(newPos, newPos + component.count).join('');
          }
          newPos += component.count;
 
          // Common case
          if (!component.added) {
            oldPos += component.count;
          }
        } else {
          component.value = oldString.slice(oldPos, oldPos + component.count).join('');
          oldPos += component.count;
 
          // Reverse add and remove so removes are output first to match common convention
          // The diffing algorithm is tied to add then remove output and this is the simplest
          // route to get the desired output with minimal overhead.
          if (componentPos && components[componentPos - 1].added) {
            var tmp = components[componentPos - 1];
            components[componentPos - 1] = components[componentPos];
            components[componentPos] = tmp;
          }
        }
      }
 
      return components;
    }
 
    function clonePath(path) {
      return { newPos: path.newPos, components: path.components.slice(0) };
    }
    module.exports = exports['default'];
 
 
/***/ },
/* 2 */
/***/ function(module, exports) {
 
    // Following this pattern to make sure the ignore next is in the correct place after babel builds
    "use strict";
 
    exports.__esModule = true;
    exports["default"] = map;
 
    /* istanbul ignore next */
    function map(arr, mapper, that) {
      if (Array.prototype.map) {
        return Array.prototype.map.call(arr, mapper, that);
      }
 
      var other = new Array(arr.length);
 
      for (var i = 0, n = arr.length; i < n; i++) {
        other[i] = mapper.call(that, arr[i], i, arr);
      }
      return other;
    }
    module.exports = exports["default"];
 
 
/***/ },
/* 3 */
/***/ function(module, exports, __webpack_require__) {
 
    'use strict';
 
    exports.__esModule = true;
    exports.diffChars = diffChars;
    // istanbul ignore next
 
    function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { 'default': obj }; }
 
    var _base = __webpack_require__(1);
 
    var _base2 = _interopRequireDefault(_base);
 
    var characterDiff = new _base2['default']();
    exports.characterDiff = characterDiff;
 
    function diffChars(oldStr, newStr, callback) {
      return characterDiff.diff(oldStr, newStr, callback);
    }
 
 
/***/ },
/* 4 */
/***/ function(module, exports, __webpack_require__) {
 
    'use strict';
 
    exports.__esModule = true;
    exports.diffWords = diffWords;
    exports.diffWordsWithSpace = diffWordsWithSpace;
    // istanbul ignore next
 
    function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { 'default': obj }; }
 
    var _base = __webpack_require__(1);
 
    // Based on https://en.wikipedia.org/wiki/Latin_script_in_Unicode
    //
    // Ranges and exceptions:
    // Latin-1 Supplement, 0080–00FF
    //  - U+00D7  × Multiplication sign
    //  - U+00F7  ÷ Division sign
    // Latin Extended-A, 0100–017F
    // Latin Extended-B, 0180–024F
    // IPA Extensions, 0250–02AF
    // Spacing Modifier Letters, 02B0–02FF
    //  - U+02C7  ˇ ˇ  Caron
    //  - U+02D8  ˘ ˘  Breve
    //  - U+02D9  ˙ ˙  Dot Above
    //  - U+02DA  ˚ ˚  Ring Above
    //  - U+02DB  ˛ ˛  Ogonek
    //  - U+02DC  ˜ ˜  Small Tilde
    //  - U+02DD  ˝ ˝  Double Acute Accent
    // Latin Extended Additional, 1E00–1EFF
 
    var _base2 = _interopRequireDefault(_base);
 
    var extendedWordChars = /^[A-Za-z\xC0-\u02C6\u02C8-\u02D7\u02DE-\u02FF\u1E00-\u1EFF]+$/;
 
    var wordDiff = new _base2['default'](true);
    exports.wordDiff = wordDiff;
    var wordWithSpaceDiff = new _base2['default']();
    exports.wordWithSpaceDiff = wordWithSpaceDiff;
    wordDiff.tokenize = wordWithSpaceDiff.tokenize = function (value) {
      var tokens = value.split(/(\s+|\b)/);
 
      // Join the boundary splits that we do not consider to be boundaries. This is primarily the extended Latin character set.
      for (var i = 0; i < tokens.length - 1; i++) {
        // If we have an empty string in the next field and we have only word chars before and after, merge
        if (!tokens[i + 1] && tokens[i + 2] && extendedWordChars.test(tokens[i]) && extendedWordChars.test(tokens[i + 2])) {
          tokens[i] += tokens[i + 2];
          tokens.splice(i + 1, 2);
          i--;
        }
      }
 
      return tokens;
    };
 
    function diffWords(oldStr, newStr, callback) {
      return wordDiff.diff(oldStr, newStr, callback);
    }
 
    function diffWordsWithSpace(oldStr, newStr, callback) {
      return wordWithSpaceDiff.diff(oldStr, newStr, callback);
    }
 
 
/***/ },
/* 5 */
/***/ function(module, exports, __webpack_require__) {
 
    'use strict';
 
    exports.__esModule = true;
    exports.diffLines = diffLines;
    exports.diffTrimmedLines = diffTrimmedLines;
    // istanbul ignore next
 
    function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { 'default': obj }; }
 
    var _base = __webpack_require__(1);
 
    var _base2 = _interopRequireDefault(_base);
 
    var lineDiff = new _base2['default']();
    exports.lineDiff = lineDiff;
    var trimmedLineDiff = new _base2['default']();
    exports.trimmedLineDiff = trimmedLineDiff;
    trimmedLineDiff.ignoreTrim = true;
 
    lineDiff.tokenize = trimmedLineDiff.tokenize = function (value) {
      var retLines = [],
          lines = value.split(/^/m);
      for (var i = 0; i < lines.length; i++) {
        var line = lines[i],
            lastLine = lines[i - 1],
            lastLineLastChar = lastLine && lastLine[lastLine.length - 1];
 
        // Merge lines that may contain windows new lines
        if (line === '\n' && lastLineLastChar === '\r') {
          retLines[retLines.length - 1] = retLines[retLines.length - 1].slice(0, -1) + '\r\n';
        } else {
          if (this.ignoreTrim) {
            line = line.trim();
            // add a newline unless this is the last line.
            if (i < lines.length - 1) {
              line += '\n';
            }
          }
          retLines.push(line);
        }
      }
 
      return retLines;
    };
 
    function diffLines(oldStr, newStr, callback) {
      return lineDiff.diff(oldStr, newStr, callback);
    }
 
    function diffTrimmedLines(oldStr, newStr, callback) {
      return trimmedLineDiff.diff(oldStr, newStr, callback);
    }
 
 
/***/ },
/* 6 */
/***/ function(module, exports, __webpack_require__) {
 
    'use strict';
 
    exports.__esModule = true;
    exports.diffSentences = diffSentences;
    // istanbul ignore next
 
    function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { 'default': obj }; }
 
    var _base = __webpack_require__(1);
 
    var _base2 = _interopRequireDefault(_base);
 
    var sentenceDiff = new _base2['default']();
    exports.sentenceDiff = sentenceDiff;
    sentenceDiff.tokenize = function (value) {
      return value.split(/(\S.+?[.!?])(?=\s+|$)/);
    };
 
    function diffSentences(oldStr, newStr, callback) {
      return sentenceDiff.diff(oldStr, newStr, callback);
    }
 
 
/***/ },
/* 7 */
/***/ function(module, exports, __webpack_require__) {
 
    'use strict';
 
    exports.__esModule = true;
    exports.diffCss = diffCss;
    // istanbul ignore next
 
    function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { 'default': obj }; }
 
    var _base = __webpack_require__(1);
 
    var _base2 = _interopRequireDefault(_base);
 
    var cssDiff = new _base2['default']();
    exports.cssDiff = cssDiff;
    cssDiff.tokenize = function (value) {
      return value.split(/([{}:;,]|\s+)/);
    };
 
    function diffCss(oldStr, newStr, callback) {
      return cssDiff.diff(oldStr, newStr, callback);
    }
 
 
/***/ },
/* 8 */
/***/ function(module, exports, __webpack_require__) {
 
    'use strict';
 
    exports.__esModule = true;
    exports.diffJson = diffJson;
    exports.canonicalize = canonicalize;
    // istanbul ignore next
 
    function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { 'default': obj }; }
 
    var _base = __webpack_require__(1);
 
    var _base2 = _interopRequireDefault(_base);
 
    var _line = __webpack_require__(5);
 
    var objectPrototypeToString = Object.prototype.toString;
 
    var jsonDiff = new _base2['default']();
    // Discriminate between two lines of pretty-printed, serialized JSON where one of them has a
    // dangling comma and the other doesn't. Turns out including the dangling comma yields the nicest output:
    exports.jsonDiff = jsonDiff;
    jsonDiff.useLongestToken = true;
 
    jsonDiff.tokenize = _line.lineDiff.tokenize;
    jsonDiff.castInput = function (value) {
      return typeof value === 'string' ? value : JSON.stringify(canonicalize(value), undefined, '  ');
    };
    jsonDiff.equals = function (left, right) {
      return _base2['default'].prototype.equals(left.replace(/,([\r\n])/g, '$1'), right.replace(/,([\r\n])/g, '$1'));
    };
 
    function diffJson(oldObj, newObj, callback) {
      return jsonDiff.diff(oldObj, newObj, callback);
    }
 
    // This function handles the presence of circular references by bailing out when encountering an
    // object that is already on the "stack" of items being processed.
 
    function canonicalize(obj, stack, replacementStack) {
      stack = stack || [];
      replacementStack = replacementStack || [];
 
      var i = undefined;
 
      for (i = 0; i < stack.length; i += 1) {
        if (stack[i] === obj) {
          return replacementStack[i];
        }
      }
 
      var canonicalizedObj = undefined;
 
      if ('[object Array]' === objectPrototypeToString.call(obj)) {
        stack.push(obj);
        canonicalizedObj = new Array(obj.length);
        replacementStack.push(canonicalizedObj);
        for (i = 0; i < obj.length; i += 1) {
          canonicalizedObj[i] = canonicalize(obj[i], stack, replacementStack);
        }
        stack.pop();
        replacementStack.pop();
      } else if (typeof obj === 'object' && obj !== null) {
        stack.push(obj);
        canonicalizedObj = {};
        replacementStack.push(canonicalizedObj);
        var sortedKeys = [],
            key = undefined;
        for (key in obj) {
          /* istanbul ignore else */
          if (obj.hasOwnProperty(key)) {
            sortedKeys.push(key);
          }
        }
        sortedKeys.sort();
        for (i = 0; i < sortedKeys.length; i += 1) {
          key = sortedKeys[i];
          canonicalizedObj[key] = canonicalize(obj[key], stack, replacementStack);
        }
        stack.pop();
        replacementStack.pop();
      } else {
        canonicalizedObj = obj;
      }
      return canonicalizedObj;
    }
 
 
/***/ },
/* 9 */
/***/ function(module, exports) {
 
    'use strict';
 
    exports.__esModule = true;
    exports.applyPatch = applyPatch;
 
    function applyPatch(oldStr, uniDiff) {
      var diffstr = uniDiff.split('\n'),
          hunks = [],
          i = 0,
          remEOFNL = false,
          addEOFNL = false;
 
      // Skip to the first change hunk
      while (i < diffstr.length && !/^@@/.test(diffstr[i])) {
        i++;
      }
 
      // Parse the unified diff
      for (; i < diffstr.length; i++) {
        if (diffstr[i][0] === '@') {
          var chnukHeader = diffstr[i].split(/@@ -(\d+),(\d+) \+(\d+),(\d+) @@/);
          hunks.unshift({
            start: chnukHeader[3],
            oldlength: +chnukHeader[2],
            removed: [],
            newlength: chnukHeader[4],
            added: []
          });
        } else if (diffstr[i][0] === '+') {
          hunks[0].added.push(diffstr[i].substr(1));
        } else if (diffstr[i][0] === '-') {
          hunks[0].removed.push(diffstr[i].substr(1));
        } else if (diffstr[i][0] === ' ') {
          hunks[0].added.push(diffstr[i].substr(1));
          hunks[0].removed.push(diffstr[i].substr(1));
        } else if (diffstr[i][0] === '\\') {
          if (diffstr[i - 1][0] === '+') {
            remEOFNL = true;
          } else if (diffstr[i - 1][0] === '-') {
            addEOFNL = true;
          }
        }
      }
 
      // Apply the diff to the input
      var lines = oldStr.split('\n');
      for (i = hunks.length - 1; i >= 0; i--) {
        var hunk = hunks[i];
        // Sanity check the input string. Bail if we don't match.
        for (var j = 0; j < hunk.oldlength; j++) {
          if (lines[hunk.start - 1 + j] !== hunk.removed[j]) {
            return false;
          }
        }
        Array.prototype.splice.apply(lines, [hunk.start - 1, hunk.oldlength].concat(hunk.added));
      }
 
      // Handle EOFNL insertion/removal
      if (remEOFNL) {
        while (!lines[lines.length - 1]) {
          lines.pop();
        }
      } else if (addEOFNL) {
        lines.push('');
      }
      return lines.join('\n');
    }
 
 
/***/ },
/* 10 */
/***/ function(module, exports, __webpack_require__) {
 
    'use strict';
 
    exports.__esModule = true;
    exports.structuredPatch = structuredPatch;
    exports.createTwoFilesPatch = createTwoFilesPatch;
    exports.createPatch = createPatch;
    // istanbul ignore next
 
    function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { 'default': obj }; }
 
    var _diffPatch = __webpack_require__(11);
 
    var _utilMap = __webpack_require__(2);
 
    var _utilMap2 = _interopRequireDefault(_utilMap);
 
    function structuredPatch(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader, options) {
      if (!options) {
        options = { context: 4 };
      }
 
      var diff = _diffPatch.patchDiff.diff(oldStr, newStr);
      diff.push({ value: '', lines: [] }); // Append an empty value to make cleanup easier
 
      function contextLines(lines) {
        return _utilMap2['default'](lines, function (entry) {
          return ' ' + entry;
        });
      }
 
      var hunks = [];
      var oldRangeStart = 0,
          newRangeStart = 0,
          curRange = [],
          oldLine = 1,
          newLine = 1;
 
      var _loop = function (i) {
        var current = diff[i],
            lines = current.lines || current.value.replace(/\n$/, '').split('\n');
        current.lines = lines;
 
        if (current.added || current.removed) {
          // If we have previous context, start with that
          if (!oldRangeStart) {
            var prev = diff[i - 1];
            oldRangeStart = oldLine;
            newRangeStart = newLine;
 
            if (prev) {
              curRange = options.context > 0 ? contextLines(prev.lines.slice(-options.context)) : [];
              oldRangeStart -= curRange.length;
              newRangeStart -= curRange.length;
            }
          }
 
          // Output our changes
          curRange.push.apply(curRange, _utilMap2['default'](lines, function (entry) {
            return (current.added ? '+' : '-') + entry;
          }));
 
          // Track the updated file position
          if (current.added) {
            newLine += lines.length;
          } else {
            oldLine += lines.length;
          }
        } else {
          // Identical context lines. Track line changes
          if (oldRangeStart) {
            // Close out any changes that have been output (or join overlapping)
            if (lines.length <= options.context * 2 && i < diff.length - 2) {
              // Overlapping
              curRange.push.apply(curRange, contextLines(lines));
            } else {
              // end the range and output
              var contextSize = Math.min(lines.length, options.context);
              curRange.push.apply(curRange, contextLines(lines.slice(0, contextSize)));
 
              var hunk = {
                oldStart: oldRangeStart,
                oldLines: oldLine - oldRangeStart + contextSize,
                newStart: newRangeStart,
                newLines: newLine - newRangeStart + contextSize,
                lines: curRange
              };
              if (i >= diff.length - 2 && lines.length <= options.context) {
                // EOF is inside this hunk
                var oldEOFNewline = /\n$/.test(oldStr);
                var newEOFNewline = /\n$/.test(newStr);
                if (lines.length == 0 && !oldEOFNewline) {
                  // special case: old has no eol and no trailing context; no-nl can end up before adds
                  curRange.splice(hunk.oldLines, 0, '\\ No newline at end of file');
                } else if (!oldEOFNewline || !newEOFNewline) {
                  curRange.push('\\ No newline at end of file');
                }
              }
              hunks.push(hunk);
 
              oldRangeStart = 0;
              newRangeStart = 0;
              curRange = [];
            }
          }
          oldLine += lines.length;
          newLine += lines.length;
        }
      };
 
      for (var i = 0; i < diff.length; i++) {
        _loop(i);
      }
 
      return {
        oldFileName: oldFileName, newFileName: newFileName,
        oldHeader: oldHeader, newHeader: newHeader,
        hunks: hunks
      };
    }
 
    function createTwoFilesPatch(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader, options) {
      var diff = structuredPatch(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader, options);
 
      var ret = [];
      if (oldFileName == newFileName) {
        ret.push('Index: ' + oldFileName);
      }
      ret.push('===================================================================');
      ret.push('--- ' + diff.oldFileName + (typeof diff.oldHeader === 'undefined' ? '' : '\t' + diff.oldHeader));
      ret.push('+++ ' + diff.newFileName + (typeof diff.newHeader === 'undefined' ? '' : '\t' + diff.newHeader));
 
      for (var i = 0; i < diff.hunks.length; i++) {
        var hunk = diff.hunks[i];
        ret.push('@@ -' + hunk.oldStart + ',' + hunk.oldLines + ' +' + hunk.newStart + ',' + hunk.newLines + ' @@');
        ret.push.apply(ret, hunk.lines);
      }
 
      return ret.join('\n') + '\n';
    }
 
    function createPatch(fileName, oldStr, newStr, oldHeader, newHeader, options) {
      return createTwoFilesPatch(fileName, fileName, oldStr, newStr, oldHeader, newHeader, options);
    }
 
 
/***/ },
/* 11 */
/***/ function(module, exports, __webpack_require__) {
 
    'use strict';
 
    exports.__esModule = true;
    // istanbul ignore next
 
    function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { 'default': obj }; }
 
    var _base = __webpack_require__(1);
 
    var _base2 = _interopRequireDefault(_base);
 
    var patchDiff = new _base2['default']();
    exports.patchDiff = patchDiff;
    patchDiff.tokenize = function (value) {
      var ret = [],
          linesAndNewlines = value.split(/(\n|\r\n)/);
 
      // Ignore the final empty token that occurs if the string ends with a new line
      if (!linesAndNewlines[linesAndNewlines.length - 1]) {
        linesAndNewlines.pop();
      }
 
      // Merge the content and line separators into single tokens
      for (var i = 0; i < linesAndNewlines.length; i++) {
        var line = linesAndNewlines[i];
 
        if (i % 2) {
          ret[ret.length - 1] += line;
        } else {
          ret.push(line);
        }
      }
      return ret;
    };
 
 
/***/ },
/* 12 */
/***/ function(module, exports) {
 
    // See: http://code.google.com/p/google-diff-match-patch/wiki/API
    "use strict";
 
    exports.__esModule = true;
    exports.convertChangesToDMP = convertChangesToDMP;
 
    function convertChangesToDMP(changes) {
      var ret = [],
          change = undefined,
          operation = undefined;
      for (var i = 0; i < changes.length; i++) {
        change = changes[i];
        if (change.added) {
          operation = 1;
        } else if (change.removed) {
          operation = -1;
        } else {
          operation = 0;
        }
 
        ret.push([operation, change.value]);
      }
      return ret;
    }
 
 
/***/ },
/* 13 */
/***/ function(module, exports) {
 
    'use strict';
 
    exports.__esModule = true;
    exports.convertChangesToXML = convertChangesToXML;
 
    function convertChangesToXML(changes) {
      var ret = [];
      for (var i = 0; i < changes.length; i++) {
        var change = changes[i];
        if (change.added) {
          ret.push('<ins>');
        } else if (change.removed) {
          ret.push('<del>');
        }
 
        ret.push(escapeHTML(change.value));
 
        if (change.added) {
          ret.push('</ins>');
        } else if (change.removed) {
          ret.push('</del>');
        }
      }
      return ret.join('');
    }
 
    function escapeHTML(s) {
      var n = s;
      n = n.replace(/&/g, '&');
      n = n.replace(/</g, '<');
      n = n.replace(/>/g, '>');
      n = n.replace(/"/g, '"');
 
      return n;
    }
 
 
/***/ }
/******/ ])
});
;