Hi,
Hexagon released ECW SDK 5.4 [1] with support for the CXX11 ABI, which
makes it compatible with gcc >= 5.1 with its default ABI.
I've just added support in configure in trunk and 2.2 branch to detect if we
must link against the libNCSEcw with the newabi or the one with the oldabi
Note: I've
Calling datasource.ReleaseResultSet(layer) did the trick.
Thanks!
From: Even Rouault [mailto:even.roua...@spatialys.com]
Sent: Tuesday, March 13, 2018 6:12 PM
To: gdal-dev@lists.osgeo.org
Cc: Stephan Braeuer
Subject: Re: [gdal-dev] Shape datafile locked
On mardi
On mardi 13 mars 2018 10:01:48 CET Stephan Braeuer wrote:
> I am using GDAL with c# and run into a problem deleting datasource files
> after running ExecuteSQL.
> The key here is that a datasource is opened implicitly via the JOIN
> statement. An implicitly opened shapefile (here node3109.shp)
I am using GDAL with c# and run into a problem deleting datasource files
after running ExecuteSQL.
The key here is that a datasource is opened implicitly via the JOIN
statement. An implicitly opened shapefile (here node3109.shp) remains locked
after the datasource has been closed.
Opening the
Even Rouault wrote:
>Jukka,
>>
>> I checked some .gpkg database that is created by FME with the
>> validate_gpkg.py script. It gives this error:
>>
>> __main__.GPKGCheckException: Req 5: table stand has column
>> standnumberextension of unexpected type TEXT ( 2 )
>>
>> Excerpt from the
Hi Robert,
For the context i’m using GDAL 2.1.3 and i download the last stable release
2.2.3 to do my tests.
I was able to gdalwarp a .tif overlapping the anti-meridian with
--config CENTER_LONG 180
I didn’t succeed to use this command with –config CENTER_LON
I have tried:
gdalwarp
On 13.03.2018 09:54, Rutger wrote:
It looks alright to me. The moving average algorithm searches (for each
pixel) for points within the specified radius, and then averages the values
of all those points.
"gdal_grid" also supports inverse distance or linear interpolation if you
want a more
It looks alright to me. The moving average algorithm searches (for each
pixel) for points within the specified radius, and then averages the values
of all those points.
"gdal_grid" also supports inverse distance or linear interpolation if you
want a more smooth result.
It is perhaps surprising