1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80
|
/**************************************************************************/
/* */
/* OCaml */
/* */
/* Contributed by Sylvain Le Gall for Lexifi */
/* */
/* Copyright 2008 Institut National de Recherche en Informatique et */
/* en Automatique. */
/* */
/* All rights reserved. This file is distributed under the terms of */
/* the GNU Lesser General Public License version 2.1, with the */
/* special exception on linking described in the file LICENSE. */
/* */
/**************************************************************************/
/* Basic list function in C. */
#include "winlist.h"
#include <windows.h>
void caml_win32_list_init (LPLIST lst)
{
lst->lpNext = NULL;
}
void caml_win32_list_cleanup (LPLIST lst)
{
lst->lpNext = NULL;
}
void caml_win32_list_next_set (LPLIST lst, LPLIST next)
{
lst->lpNext = next;
}
LPLIST caml_win32_list_next (LPLIST lst)
{
return lst->lpNext;
}
int caml_win32_list_length (LPLIST lst)
{
int length = 0;
LPLIST iter = lst;
while (iter != NULL)
{
length++;
iter = caml_win32_list_next(iter);
};
return length;
}
LPLIST caml_win32_list_concat (LPLIST lsta, LPLIST lstb)
{
LPLIST res = NULL;
LPLIST iter = NULL;
LPLIST iterPrev = NULL;
if (lsta == NULL)
{
res = lstb;
}
else if (lstb == NULL)
{
res = lsta;
}
else
{
res = lsta;
iter = lsta;
while (iter != NULL)
{
iterPrev = iter;
iter = caml_win32_list_next(iter);
};
iterPrev->lpNext = lstb;
};
return res;
}
|