2015-05-01 12:45:59 +02:00
|
|
|
/*
|
|
|
|
This file is part of libcapwap.
|
|
|
|
|
|
|
|
libcapwap is free software: you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
libcapwap is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with Foobar. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
|
|
|
|
*/
|
2022-08-14 12:26:34 +02:00
|
|
|
#include <string.h>
|
2015-05-01 12:45:59 +02:00
|
|
|
|
2015-05-01 09:32:13 +02:00
|
|
|
#include "mavl.h"
|
2022-07-18 01:15:17 +02:00
|
|
|
#include "mavltypes.h"
|
2015-05-01 09:32:13 +02:00
|
|
|
|
2015-05-01 12:45:59 +02:00
|
|
|
/**
|
|
|
|
* @file
|
|
|
|
* @brief Implementation if mavl_merge.
|
|
|
|
* @{
|
|
|
|
*/
|
|
|
|
|
2015-05-01 09:32:13 +02:00
|
|
|
static void mavlnode_move(mavl_t m,mavl_t t, struct mavlnode *n)
|
|
|
|
{
|
2018-03-24 07:56:05 +01:00
|
|
|
struct mavlnode * mn = mavlnode_get(m,mavlnode_dataptr(n));
|
2015-05-01 09:32:13 +02:00
|
|
|
if (mn) {
|
|
|
|
if (m->del) {
|
2018-03-11 00:56:41 +01:00
|
|
|
m->del(mavlnode_dataptr(mn));
|
2015-05-01 09:32:13 +02:00
|
|
|
}
|
2018-03-09 21:27:46 +01:00
|
|
|
/*mn->data=n->data;*/
|
2018-03-11 00:56:41 +01:00
|
|
|
memcpy(mavlnode_dataptr(mn),mavlnode_dataptr(n),t->data_size);
|
2015-05-01 09:32:13 +02:00
|
|
|
}
|
|
|
|
else{
|
2022-07-18 01:15:17 +02:00
|
|
|
/*mavl_insert(m,&n->data);*/
|
|
|
|
mavl_insert(m,mavlnode_dataptr(n),NULL);
|
2015-05-01 09:32:13 +02:00
|
|
|
|
|
|
|
}
|
|
|
|
free(n);
|
|
|
|
t->count--;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static void mavl_merge0(mavl_t m, mavl_t t ,struct mavlnode * n)
|
|
|
|
{
|
|
|
|
if (!n)
|
|
|
|
return;
|
2022-07-18 01:15:17 +02:00
|
|
|
mavl_merge0(m,t,n->s[0]);
|
|
|
|
mavl_merge0(m,t,n->s[1]);
|
2015-05-01 09:32:13 +02:00
|
|
|
mavlnode_move(m,t,n);
|
|
|
|
}
|
|
|
|
|
2015-05-01 12:45:59 +02:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Merge two MAVL Objects
|
|
|
|
*
|
|
|
|
* Move all elements in MAVL object t to MAVL object m. Delete all
|
|
|
|
* elements from MAVL object t. If an element from t already exists
|
|
|
|
* in m, it will be replaced.
|
|
|
|
*
|
|
|
|
* @param m target object
|
|
|
|
* @param t source object
|
|
|
|
*
|
|
|
|
*
|
|
|
|
*/
|
2018-05-22 07:15:52 +02:00
|
|
|
void mavl_merge(mavl_t target, mavl_t source)
|
2015-05-01 09:32:13 +02:00
|
|
|
{
|
2018-05-22 07:15:52 +02:00
|
|
|
mavl_merge0(target,source,source->root);
|
|
|
|
source->root=NULL;
|
2015-05-01 09:32:13 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|