diff options
| author | Daniel Hartmeier <dhartmei@cvs.openbsd.org> | 2002-04-17 17:25:36 +0000 |
|---|---|---|
| committer | Daniel Hartmeier <dhartmei@cvs.openbsd.org> | 2002-04-17 17:25:36 +0000 |
| commit | a93a2b4a47db2d7298248e9b92efa077b72d1fa0 (patch) | |
| tree | 7b5c1f9ac40c845155ab50c733f634bd5781055a | |
| parent | 1348694ccf0abc3893d7392d888c5dfa52a40db0 (diff) | |
50'000 -> 50000 (50,000 is equally wrong ;), from David Krause
| -rw-r--r-- | share/man/man5/pf.conf.5 | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/share/man/man5/pf.conf.5 b/share/man/man5/pf.conf.5 index ff141211036..8ab6e14746b 100644 --- a/share/man/man5/pf.conf.5 +++ b/share/man/man5/pf.conf.5 @@ -1,4 +1,4 @@ -.\" $OpenBSD: pf.conf.5,v 1.37 2002/03/28 02:43:47 mickey Exp $ +.\" $OpenBSD: pf.conf.5,v 1.38 2002/04/17 17:25:35 dhartmei Exp $ .\" .\" Copyright (c) 2001, Daniel Hartmeier .\" All rights reserved. @@ -353,7 +353,7 @@ numbers. .Pp Also, looking up states is usually faster than evaluating rules. If one has 50 rules, all of them are evaluated sequentially in O(n). -Even with 50'000 states, only 16 comparisons are needed to match a +Even with 50000 states, only 16 comparisons are needed to match a state, since states are stored in a binary search tree that allows searches in O(log2 n). .Pp |