Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
N
Niflib
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Container Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Grant Kim
Niflib
Commits
96902779
Commit
96902779
authored
13 years ago
by
Amorilia
Browse files
Options
Downloads
Patches
Plain Diff
Small bugfixes and regression test.
parent
1ffc1c9c
No related branches found
No related tags found
No related merge requests found
Changes
3
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
include/niflib.h
+1
-1
1 addition, 1 deletion
include/niflib.h
src/niflib.cpp
+11
-6
11 additions, 6 deletions
src/niflib.cpp
test/missing_link_stack_test.cpp
+16
-1
16 additions, 1 deletion
test/missing_link_stack_test.cpp
with
28 additions
and
8 deletions
include/niflib.h
+
1
−
1
View file @
96902779
...
...
@@ -110,7 +110,7 @@ NIFLIB_API unsigned int GetNifVersion( string const & file_name );
/*!
* Return the missing link stack with objects replaced from nif trees at specified roots.
*/
NIFLIB_API
list
<
Ref
<
NiObject
>
>
Process
MissingLinkStack
(
NIFLIB_API
list
<
Ref
<
NiObject
>
>
Resolve
MissingLinkStack
(
list
<
Ref
<
NiObject
>
>
const
&
roots
,
const
list
<
NiObject
*>
&
missing_link_stack
);
...
...
This diff is collapsed.
Click to expand it.
src/niflib.cpp
+
11
−
6
View file @
96902779
...
...
@@ -407,7 +407,7 @@ vector<NiObjectRef> ReadNifList( istream & in, list<NiObjectRef> & missing_link_
return
obj_list
;
}
NiObjectRef
_
Process
MissingLinkStackHelper
(
NiObjectRef
root
,
NiObject
*
obj
)
{
NiObjectRef
_
Resolve
MissingLinkStackHelper
(
NiObjectRef
root
,
NiObject
*
obj
)
{
// search by name
NiNodeRef
rootnode
=
DynamicCast
<
NiNode
>
(
root
);
NiNodeRef
objnode
=
DynamicCast
<
NiNode
>
(
obj
);
...
...
@@ -415,10 +415,9 @@ NiObjectRef _ProcessMissingLinkStackHelper(NiObjectRef root, NiObject *obj) {
if
(
!
(
rootnode
->
GetName
().
empty
())
&&
rootnode
->
GetName
()
==
objnode
->
GetName
())
{
return
StaticCast
<
NiObject
>
(
rootnode
);
}
}
else
if
(
root
!=
NULL
)
{
list
<
NiObjectRef
>
children
=
root
->
GetRefs
();
for
(
list
<
NiObjectRef
>::
iterator
child
=
children
.
begin
();
child
!=
children
.
end
();
++
child
)
{
NiObjectRef
result
=
_
Process
MissingLinkStackHelper
(
*
child
,
obj
);
NiObjectRef
result
=
_
Resolve
MissingLinkStackHelper
(
*
child
,
obj
);
if
(
result
!=
NULL
)
{
return
result
;
}
...
...
@@ -428,15 +427,21 @@ NiObjectRef _ProcessMissingLinkStackHelper(NiObjectRef root, NiObject *obj) {
return
NiObjectRef
();
}
list
<
NiObjectRef
>
Process
MissingLinkStack
(
list
<
NiObjectRef
>
Resolve
MissingLinkStack
(
list
<
NiObjectRef
>
const
&
roots
,
const
list
<
NiObject
*>
&
missing_link_stack
)
{
list
<
NiObjectRef
>
result
;
for
(
list
<
NiObject
*>::
const_iterator
obj
=
missing_link_stack
.
begin
();
obj
!=
missing_link_stack
.
end
();
++
obj
)
{
for
(
list
<
NiObjectRef
>::
const_iterator
root
=
roots
.
begin
();
root
!=
roots
.
end
();
++
root
)
{
result
.
push_back
(
_ProcessMissingLinkStackHelper
(
*
root
,
*
obj
));
NiObjectRef
resolved
;
if
(
*
obj
!=
NULL
)
{
for
(
list
<
NiObjectRef
>::
const_iterator
root
=
roots
.
begin
();
root
!=
roots
.
end
();
++
root
)
{
resolved
=
_ResolveMissingLinkStackHelper
(
*
root
,
*
obj
);
if
(
resolved
!=
NULL
)
break
;
}
}
result
.
push_back
(
resolved
);
}
return
result
;
}
...
...
This diff is collapsed.
Click to expand it.
test/missing_link_stack_test.cpp
+
16
−
1
View file @
96902779
...
...
@@ -48,7 +48,7 @@ BOOST_AUTO_TEST_CASE(missing_link_stack_simple_test)
BOOST_CHECK_NO_THROW
(
WriteNifTree
(
ss
,
roots
,
missing_link_stack
,
NifInfo
(
VER_20_0_0_5
)));
bool
has_root
=
false
;
bool
has_bone
=
false
;
// check that root and bone are
missing
// check that root and bone are
in the missing link stack
for
(
list
<
NiObject
*>::
iterator
it
=
missing_link_stack
.
begin
();
it
!=
missing_link_stack
.
end
();
it
++
)
{
if
((
*
it
)
!=
NULL
)
{
if
(
!
has_root
&&
(
*
it
)
==
root
)
{
...
...
@@ -62,6 +62,21 @@ BOOST_AUTO_TEST_CASE(missing_link_stack_simple_test)
}
BOOST_CHECK_EQUAL
(
has_root
,
true
);
BOOST_CHECK_EQUAL
(
has_bone
,
true
);
// read it again
roots
.
clear
();
roots
.
push_back
(
StaticCast
<
NiObject
>
(
root
));
list
<
NiObjectRef
>
resolved_link_stack
=
ResolveMissingLinkStack
(
roots
,
missing_link_stack
);
ss
.
seekg
(
0
);
NifInfo
info
;
NiObjectRef
new_root
;
BOOST_CHECK_NO_THROW
(
new_root
=
ReadNifTree
(
ss
,
resolved_link_stack
,
&
info
));
NiTriStripsRef
new_shape
=
DynamicCast
<
NiTriStrips
>
(
new_root
);
// check for references to the old tree
BOOST_CHECK
(
new_shape
!=
NULL
);
BOOST_CHECK
(
new_shape
->
skinInstance
!=
NULL
);
BOOST_CHECK_EQUAL
(
new_shape
->
skinInstance
->
skeletonRoot
,
root
);
BOOST_CHECK_EQUAL
(
new_shape
->
skinInstance
->
bones
.
size
(),
1
);
BOOST_CHECK_EQUAL
(
new_shape
->
skinInstance
->
bones
[
0
],
bone
);
}
BOOST_AUTO_TEST_SUITE_END
()
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment