mirror of
https://github.com/HDFGroup/hdf5.git
synced 2025-04-12 17:31:09 +08:00
Fix spelling (#4522)
This commit is contained in:
parent
fcfab6f483
commit
8897e25b00
@ -1,6 +1,6 @@
|
||||
# Ref: https://github.com/codespell-project/codespell#using-a-config-file
|
||||
[codespell]
|
||||
skip = .git,*.svg,.codespellrc,./bin/trace,./hl/tools/h5watch/h5watch.c,./tools/test/h5jam/tellub.c,./config/sanitizer/LICENSE,./config/sanitizer/sanitizers.cmake,./tools/test/h5repack/testfiles/*.dat,./test/API/driver,./configure,./bin/ltmain.sh,./bin/depcomp,./bin/config.guess,./bin/config.sub,./autom4te.cache,./m4/libtool.m4,./c++/src/*.html,./HDF5Examples/depcomp
|
||||
skip = .git,*.svg,.codespellrc,./bin/trace,./hl/tools/h5watch/h5watch.c,./tools/test/h5jam/tellub.c,./config/sanitizer/LICENSE,./config/sanitizer/sanitizers.cmake,./tools/test/h5import/testfiles/*.conf,./tools/test/h5repack/testfiles/*.dat,./test/API/driver,./configure,./bin/ltmain.sh,./bin/depcomp,./bin/config.guess,./bin/config.sub,./autom4te.cache,./m4/libtool.m4,./c++/src/*.html,./HDF5Examples/depcomp
|
||||
check-hidden = true
|
||||
# ignore-regex =
|
||||
ignore-words-list = ot,isnt,inout,nd,parms,parm,ba,offsetP,ser,ois,had,fiter,fo,clude,refere,minnum,offsetp,creat,ans:,eiter,lastr,ans,isn't,ifset,sur,trun,dne,tthe,hda,filname,te,htmp,ake,gord,numer,ro,oce,msdos
|
||||
ignore-words-list = ot,isnt,inout,nd,parms,parm,ba,offsetP,ser,ois,had,fiter,fo,clude,refere,minnum,offsetp,creat,ans:,eiter,lastr,ans,isn't,ifset,sur,trun,dne,tthe,hda,filname,te,htmp,ake,gord,numer,ro,oce,msdos,TEXTIN
|
||||
|
@ -5,7 +5,7 @@
|
||||
We as members, contributors, and leaders pledge to make participation in our
|
||||
community a harassment-free experience for everyone, regardless of age, body
|
||||
size, visible or invisible disability, ethnicity, sex characteristics, gender
|
||||
identity and expression, level of experience, education, socio-economic status,
|
||||
identity and expression, level of experience, education, socioeconomic status,
|
||||
nationality, personal appearance, race, religion, or sexual identity
|
||||
and orientation.
|
||||
|
||||
|
@ -385,7 +385,7 @@ Function un.RemoveFromPath
|
||||
FunctionEnd
|
||||
|
||||
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
||||
; Uninstall sutff
|
||||
; Uninstall stuff
|
||||
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
||||
|
||||
###########################################
|
||||
|
@ -593,7 +593,7 @@ H5TBwrite_fields_index(hid_t loc_id, const char *dset_name, hsize_t nfields, con
|
||||
if ((write_type_id = H5Tcreate(H5T_COMPOUND, type_size)) < 0)
|
||||
goto out;
|
||||
|
||||
/* iterate tru the members */
|
||||
/* iterate through the members */
|
||||
for (i = 0; i < nfields; i++) {
|
||||
unsigned j;
|
||||
|
||||
@ -1032,7 +1032,7 @@ H5TBread_fields_index(hid_t loc_id, const char *dset_name, hsize_t nfields, cons
|
||||
if ((read_type_id = H5Tcreate(H5T_COMPOUND, type_size)) < 0)
|
||||
goto out;
|
||||
|
||||
/* iterate tru the members */
|
||||
/* iterate through the members */
|
||||
for (i = 0; i < nfields; i++) {
|
||||
unsigned j;
|
||||
|
||||
@ -2998,7 +2998,7 @@ H5TBget_field_info(hid_t loc_id, const char *dset_name, char *field_names[], siz
|
||||
if ((nfields = H5Tget_nmembers(tid)) < 0)
|
||||
goto out;
|
||||
|
||||
/* iterate tru the members */
|
||||
/* iterate through the members */
|
||||
for (i = 0; i < nfields; i++) {
|
||||
/* get the member name */
|
||||
if (field_names) {
|
||||
|
@ -1525,7 +1525,7 @@ New Features
|
||||
Support for New Platforms, Languages and Compilers
|
||||
==================================================
|
||||
|
||||
No new platorms, languages, or compilers are supported in this release.
|
||||
No new platforms, languages, or compilers are supported in this release.
|
||||
|
||||
|
||||
Bug Fixes since HDF5-1.6.6 Release
|
||||
|
@ -1134,7 +1134,7 @@ done:
|
||||
*
|
||||
* 2) Apply the candidate entry list.
|
||||
*
|
||||
* 3) Particpate in a closing barrier.
|
||||
* 3) Participate in a closing barrier.
|
||||
*
|
||||
* 4) Remove from the dirty list (d_slist_ptr) and from the
|
||||
* flushed and still clean entries list (c_slist_ptr),
|
||||
@ -1151,7 +1151,7 @@ done:
|
||||
*
|
||||
* 2) Apply the candidate entry list.
|
||||
*
|
||||
* 3) Particpate in a closing barrier.
|
||||
* 3) Participate in a closing barrier.
|
||||
*
|
||||
* Return: Success: non-negative
|
||||
*
|
||||
|
@ -3365,7 +3365,7 @@ done:
|
||||
/*-------------------------------------------------------------------------
|
||||
* Function: H5CX_test_set_mpio_coll_chunk_link_num_true
|
||||
*
|
||||
* Purpose: Sets the instrumented "collective chunk link num tru" value for the current API call context.
|
||||
* Purpose: Sets the instrumented "collective chunk link num true" value for the current API call context.
|
||||
*
|
||||
* Note: Only sets value if property set in DXPL
|
||||
*
|
||||
|
@ -5376,7 +5376,7 @@ H5D__chunk_update_old_edge_chunks(H5D_t *dset, hsize_t old_dim[])
|
||||
const uint32_t *chunk_dim = layout->u.chunk.dim; /* Convenience pointer to chunk dimensions */
|
||||
unsigned space_ndims; /* Dataset's space rank */
|
||||
const hsize_t *space_dim; /* Dataset's dataspace dimensions */
|
||||
unsigned op_dim; /* Current operationg dimension */
|
||||
unsigned op_dim; /* Current operating dimension */
|
||||
H5D_io_info_t chk_io_info; /* Chunked I/O info object */
|
||||
H5D_chunk_ud_t chk_udata; /* User data for locking chunk */
|
||||
H5D_storage_t chk_store; /* Chunk storage information */
|
||||
|
@ -120,7 +120,7 @@ typedef struct H5FA_hdr_t {
|
||||
haddr_t dblk_addr; /* Address of Fixed Array Data block */
|
||||
|
||||
/* Statistics for Fixed Array (stored in header) */
|
||||
H5FA_stat_t stats; /* Statistcs for Fixed Array */
|
||||
H5FA_stat_t stats; /* Statistics for Fixed Array */
|
||||
|
||||
/* Computed/cached values (not stored in header) */
|
||||
size_t rc; /* Reference count of the header */
|
||||
|
@ -164,7 +164,7 @@ do {
|
||||
* into the IOC I/O Queue, and set to true when the entry is dispatched
|
||||
* to the worker thread pool for execution.
|
||||
*
|
||||
* When in_progress is FALS, the entry is said to be pending.
|
||||
* When in_progress is false, the entry is said to be pending.
|
||||
*
|
||||
* counter: uint32_t containing a serial number assigned to this IOC
|
||||
* I/O Queue entry. Note that this will roll over on long
|
||||
|
@ -7722,7 +7722,7 @@ H5S__hyper_clip_spans(H5S_hyper_span_info_t *a_spans, H5S_hyper_span_info_t *b_s
|
||||
/* Keep going, nothing to split off */
|
||||
} /* end else */
|
||||
|
||||
/* Check for overlaps between span 'a' and midle of span 'b' */
|
||||
/* Check for overlaps between span 'a' and middle of span 'b' */
|
||||
|
||||
/* Make certain both spans either have a down span or both don't have one */
|
||||
assert((span_a->down != NULL && span_b->down != NULL) ||
|
||||
|
@ -354,7 +354,7 @@ H5VL__set_def_conn(void)
|
||||
H5P_genclass_t *def_fapclass; /* Default file access property class */
|
||||
const char *env_var; /* Environment variable for default VOL connector */
|
||||
char *buf = NULL; /* Buffer for tokenizing string */
|
||||
hid_t connector_id = -1; /* VOL conntector ID */
|
||||
hid_t connector_id = -1; /* VOL connector ID */
|
||||
void *vol_info = NULL; /* VOL connector info */
|
||||
herr_t ret_value = SUCCEED; /* Return value */
|
||||
|
||||
|
@ -170,7 +170,7 @@ test_copy(void)
|
||||
break;
|
||||
if (size > 0 && j >= (int)sizeof(v2)) {
|
||||
H5_FAILED();
|
||||
puts(" Unabled to find copied region in destination");
|
||||
puts(" Unable to find copied region in destination");
|
||||
goto failed;
|
||||
}
|
||||
if (0 == size && j < (int)sizeof(v2)) {
|
||||
@ -677,7 +677,7 @@ test_set(void)
|
||||
break;
|
||||
if (size > 0 && j >= (int)sizeof(v2)) {
|
||||
H5_FAILED();
|
||||
puts(" Unabled to find set region in buffer");
|
||||
puts(" Unable to find set region in buffer");
|
||||
goto failed;
|
||||
}
|
||||
if (0 == size && j < (int)sizeof(v2)) {
|
||||
@ -792,7 +792,7 @@ test_clear(void)
|
||||
break;
|
||||
if (size > 0 && j >= (int)sizeof(v2)) {
|
||||
H5_FAILED();
|
||||
puts(" Unabled to find cleared region in buffer");
|
||||
puts(" Unable to find cleared region in buffer");
|
||||
goto failed;
|
||||
}
|
||||
if (0 == size && j < (int)sizeof(v2)) {
|
||||
|
@ -16043,7 +16043,7 @@ main(void)
|
||||
if (H5Pset_file_space_strategy(fcpl, H5F_FSPACE_STRATEGY_FSM_AGGR, true, (hsize_t)1) < 0)
|
||||
TEST_ERROR;
|
||||
fapl = def_fapl;
|
||||
/* This is a fix for the daily test failure from the checkin for libver bounds. */
|
||||
/* This is a fix for the daily test failure from the commit for libver bounds. */
|
||||
/*
|
||||
* Many tests failed the file size check when comparing (a) and (b) as below:
|
||||
* --Create a file and close the file. Got the initial file size (a).
|
||||
|
@ -15,7 +15,7 @@
|
||||
* empty "symbol table" group.
|
||||
*
|
||||
* This file is used in the v1.7 branch (after the "compact group"
|
||||
* checkin) to test compatibility. Compile and run this
|
||||
* commit) to test compatibility. Compile and run this
|
||||
* program (with the 1.6.x branch), it will generate a file*
|
||||
* called "group_old.h5". You need to move it to the test
|
||||
* directory in the HDF5 v1.7 source tree. The test/stab.c
|
||||
|
@ -2422,7 +2422,7 @@ test_sohm_size2(int close_reopen)
|
||||
(list_index_small.attrs1 - list_index_small.interleaved))
|
||||
VERIFY(0, 1, "h5_get_file_size");
|
||||
|
||||
/* Give it some overhead (for checkin to move messages into continuation message) */
|
||||
/* Give it some overhead (for commit to move messages into continuation message) */
|
||||
if ((list_index_small.attrs1 - list_index_small.interleaved) >
|
||||
(h5_stat_size_t)((float)(btree_index.attrs1 - btree_index.interleaved) * OVERHEAD_ALLOWED))
|
||||
VERIFY(0, 1, "h5_get_file_size");
|
||||
|
@ -207,7 +207,7 @@ test_many(hid_t file)
|
||||
} /* end for */
|
||||
PASSED();
|
||||
|
||||
/* Create a bunch of names and unlink them from the midle */
|
||||
/* Create a bunch of names and unlink them from the middle */
|
||||
TESTING("outward unlink");
|
||||
for (i = 0; i < how_many; i++) {
|
||||
snprintf(name, sizeof(name), "obj_%05d", i);
|
||||
|
@ -191,7 +191,7 @@ options_add_layout(obj_list_t *obj_list, unsigned n_objs, pack_info_t *pack, pac
|
||||
|
||||
/* search if this object is already in the table; "path" is the key */
|
||||
if (table->nelems > 0) {
|
||||
/* go tru the supplied list of names */
|
||||
/* go through the supplied list of names */
|
||||
for (j = 0; j < n_objs; j++) {
|
||||
/* linear table search */
|
||||
for (i = 0; i < table->nelems; i++) {
|
||||
@ -234,7 +234,7 @@ options_add_layout(obj_list_t *obj_list, unsigned n_objs, pack_info_t *pack, pac
|
||||
}
|
||||
/* first time insertion */
|
||||
else {
|
||||
/* go tru the supplied list of names */
|
||||
/* go through the supplied list of names */
|
||||
for (j = 0; j < n_objs; j++) {
|
||||
I = table->nelems + added;
|
||||
added++;
|
||||
@ -307,7 +307,7 @@ options_add_filter(obj_list_t *obj_list, unsigned n_objs, filter_info_t filt, pa
|
||||
|
||||
/* first time insertion */
|
||||
else {
|
||||
/* go tru the supplied list of names */
|
||||
/* go through the supplied list of names */
|
||||
for (j = 0; j < n_objs; j++) {
|
||||
I = table->nelems + added;
|
||||
added++;
|
||||
|
@ -6599,8 +6599,8 @@ gent_hyperslab(void)
|
||||
/*-------------------------------------------------------------------------
|
||||
* Function: gent_group_creation_order
|
||||
*
|
||||
* Purpose: generate a file with several groups with creation order set and not
|
||||
* set tru its hierarchy
|
||||
* Purpose: generate a file with several groups with creation order set and
|
||||
* not set throughout its hierarchy
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
|
Loading…
x
Reference in New Issue
Block a user