Differential D1169 Diff 3757 source/blender/blenkernel/intern/object.c

Changeset View

Standalone View

source/blender/blenkernel/intern/object.c

Context not available.

	}	}

		bool BKE_object_remove_shape_key(Main bmain, Object ob, KeyBlock *kb)
		{
		KeyBlock *rkb;
		Key *key = BKE_key_from_object(ob);
		int idx;

		if (key == NULL)
		return false;

		idx = BLI_findindex(&key->block, kb);
		for (rkb = key->block.first; rkb; rkb = rkb->next) {
		if (rkb->relative == idx) {
		rkb->relative = 0;
		campbellbartonAuthorUnsubmitted Not Done Inline Actions This makes sense for the UI, but from API we may want a way to remove all keys in one step. campbellbarton: This makes sense for the UI, but from API we may want a way to remove all keys in one step.
		}
		else if (rkb->relative >= idx) {
		/* Fix positional shift of the keys when kb is deleted from the list */
		rkb->relative -= 1;
		}
		}

		BLI_remlink(&key->block, kb);
		key->totkey--;
		if (key->refkey == kb) {
		key->refkey = key->block.first;

		if (key->refkey) {
		/* apply new basis key on original data */
		switch (ob->type) {
		case OB_MESH:
		BKE_keyblock_convert_to_mesh(key->refkey, ob->data);
		break;
		case OB_CURVE:
		case OB_SURF:
		BKE_keyblock_convert_to_curve(key->refkey, ob->data, BKE_curve_nurbs_get(ob->data));
		break;
		case OB_LATTICE:
		BKE_keyblock_convert_to_lattice(key->refkey, ob->data);
		break;
		}
		}
		}

		if (kb->data) MEM_freeN(kb->data);
		MEM_freeN(kb);

		if (ob->shapenr > 1) {
		ob->shapenr--;
		}

		if (key->totkey == 0) {
		switch (GS(key->from->name)) {
		case ID_ME: ((Mesh *)key->from)->key = NULL; break;
		case ID_CU: ((Curve *)key->from)->key = NULL; break;
		case ID_LT: ((Lattice *)key->from)->key = NULL; break;
		}

		BKE_libblock_free_us(bmain, key);
		}

		return true;
		}

	bool BKE_object_flag_test_recursive(const Object *ob, short flag)	bool BKE_object_flag_test_recursive(const Object *ob, short flag)
	{	{
	if (ob->flag & flag) {	if (ob->flag & flag) {
Context not available.