forked from oerkki/voxelands
1505.01
This commit is contained in:
parent
bfaeeebe07
commit
b8481150e8
|
@ -9,8 +9,8 @@ project(voxelands)
|
||||||
|
|
||||||
# Also remember to set PROTOCOL_VERSION in clientserver.h when releasing
|
# Also remember to set PROTOCOL_VERSION in clientserver.h when releasing
|
||||||
set(VERSION_MAJOR 1505)
|
set(VERSION_MAJOR 1505)
|
||||||
set(VERSION_MINOR 00)
|
set(VERSION_MINOR 01)
|
||||||
set(VERSION_EXTRA ":next")
|
set(VERSION_EXTRA "")
|
||||||
set(VERSION_STRING "${VERSION_MAJOR}.${VERSION_MINOR}${VERSION_EXTRA}")
|
set(VERSION_STRING "${VERSION_MAJOR}.${VERSION_MINOR}${VERSION_EXTRA}")
|
||||||
|
|
||||||
MESSAGE(STATUS "*** Will build version ${VERSION_STRING} ***")
|
MESSAGE(STATUS "*** Will build version ${VERSION_STRING} ***")
|
||||||
|
|
|
@ -3,6 +3,13 @@ Voxelands changelog
|
||||||
This should contain all the major changes.
|
This should contain all the major changes.
|
||||||
For minor stuff, refer to the commit log of the repository.
|
For minor stuff, refer to the commit log of the repository.
|
||||||
|
|
||||||
|
1505.01: (release 2015-05-30)
|
||||||
|
- fix dig miss sound not working
|
||||||
|
- fix sunlight propogation
|
||||||
|
- fix tree growth breaking lighting
|
||||||
|
- add hack to unbreak already broken lighting
|
||||||
|
- fix compiling problem with dynamic array
|
||||||
|
|
||||||
1505.00: (release 2015-05-25)
|
1505.00: (release 2015-05-25)
|
||||||
- make wearing a jacket without a shirt also safe from exposure damage
|
- make wearing a jacket without a shirt also safe from exposure damage
|
||||||
- change some crowbar behaviour
|
- change some crowbar behaviour
|
||||||
|
|
|
@ -506,11 +506,11 @@ void MapBlock::deSerialize(std::istream &is, u8 version)
|
||||||
|
|
||||||
// deserialize nodes from buffer
|
// deserialize nodes from buffer
|
||||||
for (u32 i=0; i<nodecount; i++) {
|
for (u32 i=0; i<nodecount; i++) {
|
||||||
u8 buf[sl];
|
SharedBuffer<u8> buf(sl);
|
||||||
for (u32 k=0; k<sl; k++) {
|
for (u32 k=0; k<sl; k++) {
|
||||||
buf[k] = s[i+(nodecount*k)];
|
buf[k] = s[i+(nodecount*k)];
|
||||||
}
|
}
|
||||||
data[i].deSerialize(buf, version);
|
data[i].deSerialize(*buf, version);
|
||||||
}
|
}
|
||||||
|
|
||||||
/*
|
/*
|
||||||
|
|
Loading…
Reference in New Issue