Max 15 children per node.

A btree with only 3 max children per node is like using a vibrator on
the "low" setting: it'll get the job done, but it's not
exactly efficient.

1 files changed, 1 insertions, 1 deletions

diff --git a/src/rope.rs b/src/rope.rs
index 01867f8..cc98422 100644
--- a/src/rope.rs
+++ b/src/rope.rs
@@ -3,7 +3,7 @@ use std::io::{ErrorKind, Read, Write};
 use std::rc::Rc;
 
 const MAX_NODE_SIZE: usize = 1024;
-const MAX_CHILDREN: usize = 5;
+const MAX_CHILDREN: usize = 15;
 
 fn read(r: &mut dyn Read, buf: &mut [u8]) -> Result<usize, std::io::Error> {
     loop {