ARCHIVE/rippled
1
0
Fork 0
mirror of https://github.com/XRPLF/rippled.git synced 2025-11-24 04:55:52 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix typos/style issues in documentation

Browse Source
This commit is contained in:
S. Matthew English
2016-10-18 21:49:18 +02:00
committed by Brad Chase
parent bbf52056f9
commit d53d5cfc42
3 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
bin/python/jsonpath_rw/jsonpath.py
View File

@@ -52,7 +52,7 @@ class DatumInContext(object):
""" """
Represents a datum along a path from a context. Represents a datum along a path from a context.
Essentially a zipper but with a structure represented by JsonPath, Essentially a zipper but with a structure represented by JSONPath,
and where the context is more of a parent pointer than a proper and where the context is more of a parent pointer than a proper
representation of the context. representation of the context.

2
src/ripple/peerfinder/README.md
View File

@@ -109,7 +109,7 @@ tuned heuristics. The fields are as follows:
fractional part up or down using a uniform random number generated at fractional part up or down using a uniform random number generated at
program startup. This allows the outdegree of the overlay network to be program startup. This allows the outdegree of the overlay network to be
controlled with fractional precision, ensuring that all inbound network controlled with fractional precision, ensuring that all inbound network
connection slots are not consumed (which would it difficult for new connection slots are not consumed (which would make it difficult for new
participants to enter the network). participants to enter the network).
Here's an example of how the network might be structured with a fractional Here's an example of how the network might be structured with a fractional

2
test/declarative-path-test.coffee
View File

@@ -28,7 +28,7 @@ The tests are written in a declarative style:
Each case has an entry in the `path_finding_cases` object Each case has an entry in the `path_finding_cases` object
The key translates to a `suite(key, {...})` The key translates to a `suite(key, {...})`
The `{...}` passed in is compiled into a setup/teardown for the `ledger` and The `{...}` passed in is compiled into a setup/teardown for the `ledger` and
into a bunch of `test` invokations for the `paths_expected` into a bunch of `test` invocations for the `paths_expected`
- aliases are used throughout for easier reading - aliases are used throughout for easier reading