Rev 1483 | Rev 1704 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1483 | Rev 1702 | ||
---|---|---|---|
Line 24... | Line 24... | ||
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
- | 29 | /** @addtogroup genericadt |
|
- | 30 | * @{ |
|
- | 31 | */ |
|
- | 32 | ||
29 | /** |
33 | /** |
30 | * @file btree.c |
34 | * @file btree.c |
31 | * @brief B+tree implementation. |
35 | * @brief B+tree implementation. |
32 | * |
36 | * |
33 | * This file implements B+tree type and operations. |
37 | * This file implements B+tree type and operations. |
Line 991... | Line 995... | ||
991 | printf("%lld%s", node->key[i], i < node->keys - 1 ? "," : ""); |
995 | printf("%lld%s", node->key[i], i < node->keys - 1 ? "," : ""); |
992 | printf(")"); |
996 | printf(")"); |
993 | } |
997 | } |
994 | printf("\n"); |
998 | printf("\n"); |
995 | } |
999 | } |
- | 1000 | ||
- | 1001 | /** @} |
|
- | 1002 | */ |
|
- | 1003 |