Most of them were in documentation and comments.
Signed-off-by: Stefan Weil <sw@weilnetz.de>
We use the following conventions for classiying / ranking bugs:
-Relase:
+Release:
* Bugs which we think must be fixed before a release get their "Release" field set accordingly.
* Bugs which need not be fixed before any particular release, get their "Release" field set to "Future".
* Bugs where we have not get decided are left at "None".
* SYSFILE INFO can now read SPSS/PC+ system files and SPSS portable
files.
- * FREQUENCIES: A bug was fixed where an assertion failure occured
+ * FREQUENCIES: A bug was fixed where an assertion failure occurred
when an empty dataset was presented.
* The GRAPH command is now available. Initially it supports
psppire uses some self defined widgets. To use glade these widgets have
to be announced to glade such that you can view the interface.
The install process will install the psppire glade library, icons and
-psppire.xml files in the appropiate system locations. You cannot override
+psppire.xml files in the appropriate system locations. You cannot override
this with --prefix. After that you can run "glade" and open the ui files.
Building from git on Mac OS
the values of the 3 locales.
However it's important to be aware of the source (destination) locale
when reading (writing) string data.
-When transfering data between a source and a destination, the appropriate
+When transferring data between a source and a destination, the appropriate
recoding must be performed.
@c A copy of the license is included in the section entitled "GNU
@c Free Documentation License".
@c
-@c Use @func when refering to a function.
+@c Use @func when referring to a function.
@c Use @deftypefn for their definitions
@macro func{NAME}
@code{\NAME\}
xpaned->handle_pos_middle.height);
}
- /* Now allocate the childen, making sure, when resizing not to
+ /* Now allocate the children, making sure, when resizing not to
* overlap the windows
*/
if (gtk_widget_get_mapped (widget))
If DISTINCT_CALLBACK is non-null, then it will be called exactly
once for every case containing a distinct value of V. AUX is
- an auxilliary pointer passed to DISTINCT_CALLBACK.
+ an auxiliary pointer passed to DISTINCT_CALLBACK.
After this function is called, SUBREADER must not ever again
be referenced directly. It will be destroyed automatically
{
if (d != NULL)
{
- /* In general, we don't want callbacks occuring, if the dictionary
+ /* In general, we don't want callbacks occurring, if the dictionary
is being destroyed */
d->callbacks = NULL ;
}
/* Closes TEXT, frees its storage, and issues a final warning
- about suppressed warnings if necesary. */
+ about suppressed warnings if necessary. */
static void
close_text_record (struct sfm_reader *r, struct text_record *text)
{
/* Iteration limit. */
int max_pass_count; /* Maximum number of passes (-1=unlimited). */
- int pass; /* Number of passes thru the loop so far. */
+ int pass; /* Number of passes through the loop so far. */
/* a=a TO b [BY c]. */
struct variable *index_var; /* Index variable. */
struct interaction;
/* Parse an interaction.
- If not successfull return false.
+ If not successful return false.
Otherwise, a newly created interaction will be placed in IACT.
It is the caller's responsibility to destroy this interaction.
*/
rank->n += dict_get_case_weight (dict, c, &warn);
/* If this assertion fires, then either the data wasn't sorted or some other
- problem occured */
+ problem occurred */
assert (rerr == 0);
}
work.hessian = NULL;
/* Get the initial estimates of \beta and their standard errors.
- And perform other auxilliary initialisation. */
+ And perform other auxiliary initialisation. */
if (! initial_pass (cmd, &work, input))
goto error;
-/* Calculate the intial cluster centers. */
+/* Calculate the initial cluster centers. */
static void
kmeans_initial_centers (struct Kmeans *kmeans, const struct casereader *reader, const struct qc *qc)
{
}
/* Returns a variable name for storing ranks of a variable named SRC_NAME
- accoring to the rank function F. The name chosen will not be one already in
+ according to the rank function F. The name chosen will not be one already in
DICT or NEW_NAMES.
If successful, adds the new name to NEW_NAMES and returns the name added.
return var;
}
-/* Auxilliary data for transformation when /SAVE is entered */
+/* Auxiliary data for transformation when /SAVE is entered */
struct save_trans_data
{
int n_dep_vars;
/* Some more indeces into case data */
#define N_POS_EQ 1 /* number of positive cases with values equal to n */
-#define N_POS_GT 2 /* number of postive cases with values greater than n */
+#define N_POS_GT 2 /* number of positive cases with values greater than n */
#define N_NEG_EQ 3 /* number of negative cases with values equal to n */
#define N_NEG_LT 4 /* number of negative cases with values less than n */
static size_t
capacity_to_mask (size_t capacity)
{
- /* Calculate the minimum mask necesary to support the given
+ /* Calculate the minimum mask necessary to support the given
capacity. */
size_t mask = 0;
while (hmap_mask_to_capacity__ (mask) < capacity)
/* Attempts to set the encoding from a locale name
- returns true if successfull.
+ returns true if successful.
This function does not (should not!) alter the current locale.
*/
bool
/* Return the system local's idea of the
- decimal seperator character */
+ decimal separator character */
char
get_system_decimal (void)
{
/* Return the zip member in the reader ZR, called MEMBER */
struct zip_member *zip_member_open (struct zip_reader *zr, const char *member);
-/* Read upto N bytes from ZM, storing them in BUF.
+/* Read up to N bytes from ZM, storing them in BUF.
Returns the number of bytes read, or -1 on error */
int zip_member_read (struct zip_member *zm, void *buf, size_t n);
/* An array of integers df_n * df_{n-1} * df_{n-2} ...
These are the products of the degrees of freedom for the current
- variable and all preceeding variables */
+ variable and all preceding variables */
int *df_prod;
double *enc_sum;
- The string may not contain whitespace.
- The first character may not be '$'
- The first character may not be a digit
- - The final charactor may not be '.' or '_'
+ - The final character may not be '.' or '_'
*/
len = snprintf (name, size, _("Var%04d"), d);
if (len + 1 >= size)
GtkListStore *list = gtk_list_store_new (1, G_TYPE_STRING);
GtkTreeIter iter;
gint i;
- const gchar *seperator[3] = {"'\"", "\'", "\""};
+ const gchar *separator[3] = {"'\"", "\'", "\""};
for (i = 0; i < 3; i++)
{
- const gchar *s = seperator[i];
+ const gchar *s = separator[i];
/* Add a new row to the model */
gtk_list_store_append (list, &iter);
params.n_widths = 3;
params.next_value = 1;
- /* Parse comand line. */
+ /* Parse command line. */
parser = argv_parser_create ();
options = mc_options_create ();
mc_options_register_argv_parser (options, parser);
dnl Check that matrices presented are read correctly.
dnl The example below is an unlikely one since all
-dnl covariance/correlation matrices must be symetrical
+dnl covariance/correlation matrices must be symmetrical
dnl but it serves a purpose for this test.
AT_DATA([matrix-reader.pspp], [dnl
matrix data
AT_SETUP([QUICK CLUSTER with pairwise missing])
dnl This test runs two programs, which are identical except that one
-dnl has an extra case with one missing value. Becuase the syntax uses
+dnl has an extra case with one missing value. Because the syntax uses
dnl NOINITIAL and NOUPDATE, the results should be identical except for
dnl the final classification.
20 1 ""
20 1 ""
22 0 "here and"
-22 0 "here is the anomoly"
+22 0 "here is the anomaly"
25 1 ""
25 0 ""
30 1 ""