• DELETE FROM KEYWORDS WHERE ID_DOMAINE=28763199
    • DoneDoneDone

    URL:raft.github.io

    Connection: keep-alive
Date: Wed, 22 Jan 2025 07:04:22 GMT
Via: 1.1 varnish
Content-Length: 162
Content-Type: text/html
Accept-Ranges: bytes
Age: 0
Location: https://raft.github.io/
Server: GitHub.com
Vary: Accept-Encoding
permissions-policy: interest-cohort=()
X-GitHub-Request-Id: 1A21:BDE57:8AC522:8C94B1:67909875
X-Served-By: cache-cdg-lfpb1150045-CDG
X-Cache: MISS
X-Cache-Hits: 0
X-Timer: S1737529462.198710,VS0,VE92
X-Fastly-Request-ID: 1a4dd404c907a2f7f3e3d4818c5367d494c02a57


    Location => https://raft.github.io/
    Status => 301
    <html>
<head><title>301 Moved Permanently</title></head>

    (vide) Tentative en https

    https://raft.github.io/

    <!DOCTYPE html>
<html lang="en">

  <head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <meta name="description" content="Raft is a consensus algorithm that is designed to be easy to understand.">
    <link rel="icon" type="image/x-icon" href="logo/favicon.ico" >
    <!-- The next line authorizes Diego to use the Google Search Console on this site. -->
    <meta name="google-site-verification" content="aRKNQn2I0UXp0xfA1c6Hz0d_fiWqhhAGfher0aZRL3g" />
    <link rel="stylesheet" href="https://netdna.bootstrapcdn.com/bootstrap/3.0.0/css/bootstrap.min.css" integrity="sha384-dkTxiR4Mv8i0ubTj0fsgTCmhYmOtrc0o6rdrEO6hDZs9cAifak0Y2VVL2cecWHLQ" crossorigin="anonymous" >
    <script src="https://code.jquery.com/jquery-3.5.1.min.js" integrity="sha256-9/aliU8dGd2tb6OSsuzixeV4y/faTqgFtohetphbbj0=" crossorigin="anonymous"></script>
    <script src="https://netdna.bootstrapcdn.com/bootstrap/3.0.0/js/bootstrap.min.js" integrity="sha384-Zzs5x1/YUvlxpCu06c197tRCubLCMA7pCoHbZeoZuz/oEgYD6NVmvLzDSKYBoc3J" crossorigin="anonymous"></script>

    <script>
// Render the implementations table.
$(function() {
  'use strict';
  function display(impls) {
    const tbody = $('#implementations tbody');
    tbody.empty();
    impls.forEach(function (impl) {
      const row = $('<tr>');

      let stars;
      if (impl.stars === undefined || impl.stars < 5 ) {
        stars = '';
      } else {
        stars = impl.stars.toLocaleString() + '★';
      }
      row.append($('<td>').text(stars));

      const name = $('<td>');
      name.append($('<a>').attr('href', impl.repoURL).text(impl.name));
      if (impl.archived === true) {
        name.append(' (archived)');
      }
      row.append(name);

      const authors = $('<td>');
      if (impl.authors !== undefined) {
        impl.authors.forEach(function(author, i) {
          let el;
          if (author.github !== undefined) {
            el = $('<a>').attr('href', 'https://github.com/' + author.github).text(author.name);
          } else if (author.twitter !== undefined) {
            el = $('<a>').attr('href', 'https://twitter.com/' + author.twitter).text(author.name);
          } else {
            el = $('<span>').text(author.name);
          }
          authors.append(el);
          if (i < impl.authors.length - 1) {
            authors.append(', ');
          }
        });
      }
      row.append(authors);

      row.append($('<td>').text(impl.language));

      row.append($('<td>').text(impl.license));

      [
        'basic',
        'persistence',
        'membershipChanges',
        'logCompaction',
      ].forEach(function(feature) {
        let has;
        if (impl.features !== undefined) {
          has = impl.features[feature];
        }
        if (has === true) {
          row.append($('<td>').text('Yes'));
        } else if (has === false) {
          row.append($('<td>').text('No'));
        } else {
          row.append($('<td>'));
        }
      })

      tbody.append(row);
    });
  }

  $.getJSON('implementations.json', function(impls) {
    display(impls);

    $.getScript('https://ongardie.net/static/raft/repos.jsonp',
                    function() {
      const repos = raft_repos();
      impls.forEach(function(impl) {
        const repo = repos[impl.repoURL];
        if (repo === undefined) {
          impl.rank = -1;
        } else {
          impl.rank = repo.rank;
          impl.stars = repo.stars;
          impl.updated = repo.updated;
          impl.archived = repo.archived;
        }
      });
      impls.sort(function(a, b) { return b.rank - a.rank; })
      display(impls);
    });
  });
});
    </script>

    <style>
blockquote p {
  font-size: inherit;
}
a {
  color: #000099;
}
img:-moz-loading {
  /* This is a workaround for flashing alt text in Firefox:
     https://bugzilla.mozilla.org/show_bug.cgi?id=1472637. */
  visibility: hidden;
}
    </style>

    <title>Raft Consensus Algorithm</title>
  </head>

    Raft Consensus Algorithm

    Recherche META Description de la page

    Raft is a consensus algorithm that is designed to be easy to understand.

    Recherche META Keywords de la page

    UPDATE DOMAINES SET server='GitHub.com',redirection='https://raft.github.io/',Status='200',err='',[TITRE]=N'Raft Consensus Algorithm',[DESCRIPTION]=N'Raft is a consensus algorithm that is designed to be easy to understand.',[KEYWORDS]=N'' WHERE id=28763199
  • 0

    Raft Consensus Algorithm Raft is a consensus algorithm that is designed to be easy to understand.

  • 0. Raft (4)
    • --------->0
  • 1. Consensus (9)
    • --------->0
  • 2. Algorithm (9)
    • --------->0
  • 4. is (2)
    • --------->0
  • 5. a (1)
    • --------->0
  • 8. that (4)
    • --------->0
  • 10. designed (8)
    • --------->0
  • 11. to (2)
    • --------->0
  • 12. be (2)
    • --------->0
  • 13. easy (4)
    • --------->0
  • 15. understand (10)
    • --------->0
    INSERT INTO KEYWORDS (keyword,id_domaine) VALUES (N'Raft',28763199),(N'Consensus',28763199),(N'Algorithm',28763199),(N'is',28763199),(N'a',28763199),(N'that',28763199),(N'designed',28763199),(N'to',28763199),(N'be',28763199),(N'easy',28763199),(N'understand',28763199)