1999-09-27 18:44:28 +00:00
|
|
|
// -*- C++ -*-
|
|
|
|
/* This file is part of
|
1999-11-15 12:01:38 +00:00
|
|
|
* ======================================================
|
1999-09-27 18:44:28 +00:00
|
|
|
*
|
|
|
|
* LyX, The Document Processor
|
|
|
|
*
|
2000-03-08 01:45:25 +00:00
|
|
|
* Copyright 1995 Matthias Ettrich
|
|
|
|
* Copyright 1995-2000 The LyX Team.
|
1999-09-27 18:44:28 +00:00
|
|
|
*
|
1999-11-15 12:01:38 +00:00
|
|
|
* ====================================================== */
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
#include <config.h>
|
|
|
|
|
|
|
|
#ifdef __GNUG__
|
|
|
|
#pragma implementation "vspace.h"
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "lyx_main.h"
|
|
|
|
#include "buffer.h"
|
|
|
|
#include "vspace.h"
|
|
|
|
#include "lyxrc.h"
|
|
|
|
#include "lyxtext.h"
|
|
|
|
#include "BufferView.h"
|
1999-10-02 16:21:10 +00:00
|
|
|
#include "support/lstrings.h"
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
|
|
|
|
/* length units
|
|
|
|
*/
|
|
|
|
|
1999-12-16 06:43:25 +00:00
|
|
|
static const int num_units = LyXLength::UNIT_NONE;
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
// I am not sure if "mu" should be possible to select (Lgb)
|
1999-10-02 16:21:10 +00:00
|
|
|
static char const * unit_name[num_units] = { "sp", "pt", "bp", "dd",
|
1999-12-16 06:43:25 +00:00
|
|
|
"mm", "pc", "cc", "cm",
|
|
|
|
"in", "ex", "em", "mu" };
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
|
1999-10-02 16:21:10 +00:00
|
|
|
LyXLength::UNIT unitFromString (string const & data)
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
1999-11-15 12:01:38 +00:00
|
|
|
int i = 0;
|
1999-12-13 00:05:34 +00:00
|
|
|
while ((i < num_units) && (data != unit_name[i])) ++i;
|
|
|
|
return static_cast<LyXLength::UNIT>(i);
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* The following static items form a simple scanner for
|
|
|
|
* length strings, used by isValid[Glue]Length. See comments there.
|
|
|
|
*/
|
|
|
|
static float number[4] = { 0, 0, 0, 0 };
|
|
|
|
static LyXLength::UNIT unit[4] = { LyXLength::UNIT_NONE,
|
|
|
|
LyXLength::UNIT_NONE,
|
|
|
|
LyXLength::UNIT_NONE,
|
|
|
|
LyXLength::UNIT_NONE };
|
|
|
|
//static int number_index, unit_index;
|
|
|
|
int number_index, unit_index;
|
|
|
|
|
2000-03-08 01:45:25 +00:00
|
|
|
|
2000-03-07 01:14:37 +00:00
|
|
|
static inline
|
2000-09-14 17:53:12 +00:00
|
|
|
void lyx_advance(string & data, unsigned int n)
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
1999-10-02 16:21:10 +00:00
|
|
|
data.erase(0, n);
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
2000-03-08 01:45:25 +00:00
|
|
|
|
2000-03-07 01:14:37 +00:00
|
|
|
static inline
|
2000-09-14 17:53:12 +00:00
|
|
|
bool isEndOfData(string const & data)
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
2000-09-14 17:53:12 +00:00
|
|
|
return frontStrip(data).empty();
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
2000-03-08 01:45:25 +00:00
|
|
|
|
2000-03-07 01:14:37 +00:00
|
|
|
static
|
2000-09-14 17:53:12 +00:00
|
|
|
char nextToken(string & data)
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
1999-10-02 16:21:10 +00:00
|
|
|
data = frontStrip(data);
|
1999-09-27 18:44:28 +00:00
|
|
|
if (data.empty())
|
|
|
|
return '\0';
|
|
|
|
else if (data[0] == '+') {
|
2000-09-14 17:53:12 +00:00
|
|
|
lyx_advance(data, 1);
|
1999-09-27 18:44:28 +00:00
|
|
|
return '+';
|
2000-09-14 17:53:12 +00:00
|
|
|
} else if (prefixIs(data, "plus")) {
|
|
|
|
lyx_advance(data, 4);
|
1999-09-27 18:44:28 +00:00
|
|
|
return '+';
|
2000-09-14 17:53:12 +00:00
|
|
|
} else if (data[0] == '-') {
|
|
|
|
lyx_advance(data, 1);
|
1999-09-27 18:44:28 +00:00
|
|
|
return '-';
|
2000-09-14 17:53:12 +00:00
|
|
|
} else if (prefixIs(data, "minus")) {
|
|
|
|
lyx_advance(data, 5);
|
1999-09-27 18:44:28 +00:00
|
|
|
return '-';
|
2000-09-14 17:53:12 +00:00
|
|
|
} else {
|
1999-10-02 16:21:10 +00:00
|
|
|
string::size_type i;
|
1999-09-27 18:44:28 +00:00
|
|
|
|
1999-12-01 10:46:58 +00:00
|
|
|
// I really mean assignment ("=") below, not equality!
|
1999-10-19 14:27:46 +00:00
|
|
|
if ((i = data.find_last_of("0123456789.")) != string::npos) {
|
1999-09-27 18:44:28 +00:00
|
|
|
if (number_index > 3) return 'E'; // Error
|
2000-09-14 17:53:12 +00:00
|
|
|
string buffer = data.substr(0, i + 1);
|
2000-09-26 13:10:34 +00:00
|
|
|
if (isStrDbl(buffer)) {
|
|
|
|
number[number_index] = strToDbl(buffer);
|
2000-09-14 17:53:12 +00:00
|
|
|
lyx_advance(data, i + 1);
|
1999-10-02 16:21:10 +00:00
|
|
|
++number_index;
|
1999-09-27 18:44:28 +00:00
|
|
|
return 'n';
|
|
|
|
} else
|
|
|
|
return 'E'; // Error
|
1999-11-15 12:01:38 +00:00
|
|
|
} else if ((i = data.find_last_of("abcdefghijklmnopqrstuvwxyz"))
|
1999-10-19 14:27:46 +00:00
|
|
|
!= string::npos) {
|
1999-09-27 18:44:28 +00:00
|
|
|
if (unit_index > 3) return 'E'; // Error
|
1999-10-19 20:59:27 +00:00
|
|
|
string buffer = data.substr(0, i + 1);
|
2000-09-14 17:53:12 +00:00
|
|
|
unit[unit_index] = unitFromString(buffer);
|
1999-09-27 18:44:28 +00:00
|
|
|
if (unit[unit_index] != LyXLength::UNIT_NONE) {
|
2000-09-14 17:53:12 +00:00
|
|
|
lyx_advance(data, i + 1);
|
1999-10-02 16:21:10 +00:00
|
|
|
++unit_index;
|
1999-09-27 18:44:28 +00:00
|
|
|
return 'u';
|
|
|
|
} else
|
|
|
|
return 'E'; // Error
|
|
|
|
} else
|
|
|
|
return 'E'; // Error
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-03-08 01:45:25 +00:00
|
|
|
|
|
|
|
struct LaTeXLength {
|
1999-10-02 16:21:10 +00:00
|
|
|
char const * pattern;
|
1999-09-27 18:44:28 +00:00
|
|
|
int plus_val_index, minus_val_index,
|
1999-12-16 06:43:25 +00:00
|
|
|
plus_uni_index, minus_uni_index;
|
1999-09-27 18:44:28 +00:00
|
|
|
};
|
|
|
|
|
2000-03-08 01:45:25 +00:00
|
|
|
|
|
|
|
static
|
|
|
|
LaTeXLength table[] = {
|
|
|
|
{ "nu", 0, 0, 0, 0 },
|
|
|
|
{ "nu+nu", 2, 0, 2, 0 },
|
|
|
|
{ "nu+nu-nu", 2, 3, 2, 3 },
|
|
|
|
{ "nu+-nu", 2, 2, 2, 2 },
|
|
|
|
{ "nu-nu", 0, 2, 0, 2 },
|
|
|
|
{ "nu-nu+nu", 3, 2, 3, 2 },
|
|
|
|
{ "nu-+nu", 2, 2, 2, 2 },
|
|
|
|
{ "n+nu", 2, 0, 1, 0 },
|
|
|
|
{ "n+n-nu", 2, 3, 1, 1 },
|
|
|
|
{ "n+-nu", 2, 2, 1, 1 },
|
|
|
|
{ "n-nu", 0, 2, 0, 1 },
|
|
|
|
{ "n-n+nu", 3, 2, 1, 1 },
|
|
|
|
{ "n-+nu", 2, 2, 1, 1 },
|
|
|
|
{ "", 0, 0, 0, 0 } // sentinel, must be empty
|
|
|
|
};
|
|
|
|
|
|
|
|
|
1999-10-02 16:21:10 +00:00
|
|
|
bool isValidGlueLength (string const & data, LyXGlueLength * result)
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
|
|
|
// This parser is table-driven. First, it constructs a "pattern"
|
|
|
|
// that describes the sequence of tokens in "data". For example,
|
|
|
|
// "n-nu" means: number, minus sign, number, unit. As we go along,
|
|
|
|
// numbers and units are stored into static arrays. Then, "pattern"
|
|
|
|
// is searched in the "table". If it is found, the associated
|
|
|
|
// table entries tell us which number and unit should go where
|
|
|
|
// in the LyXLength structure. Example: if "data" has the "pattern"
|
|
|
|
// "nu+nu-nu", the associated table entries are "2, 3, 2, 3".
|
|
|
|
// That means, "plus_val" is the second number that was seen
|
|
|
|
// in the input, "minus_val" is the third number, and "plus_uni"
|
|
|
|
// and "minus_uni" are the second and third units, respectively.
|
|
|
|
// ("val" and "uni" are always the first items seen in "data".)
|
|
|
|
// This is the most elegant solution I could find -- a straight-
|
|
|
|
// forward approach leads to very long, tedious code that would be
|
|
|
|
// much harder to understand and maintain. (AS)
|
|
|
|
|
1999-10-02 16:21:10 +00:00
|
|
|
if (data.empty())
|
|
|
|
return true;
|
|
|
|
string buffer = frontStrip(data);
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
// To make isValidGlueLength recognize negative values as
|
|
|
|
// the first number this little hack is needed:
|
|
|
|
short val_sign = 1; // positive as default
|
|
|
|
switch(buffer[0]) {
|
|
|
|
case '-':
|
1999-11-04 01:40:20 +00:00
|
|
|
lyx_advance(buffer, 1);
|
1999-09-27 18:44:28 +00:00
|
|
|
val_sign = -1;
|
|
|
|
break;
|
|
|
|
case '+':
|
1999-11-04 01:40:20 +00:00
|
|
|
lyx_advance(buffer, 1);
|
1999-09-27 18:44:28 +00:00
|
|
|
// fall through
|
|
|
|
default:
|
|
|
|
// no action
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
// end of hack
|
|
|
|
|
|
|
|
int pattern_index = 0, table_index = 0;
|
|
|
|
char pattern[20];
|
|
|
|
|
|
|
|
number_index = unit_index = 1; // entries at index 0 are sentinels
|
|
|
|
|
|
|
|
// construct "pattern" from "data"
|
|
|
|
while (!isEndOfData (buffer)) {
|
|
|
|
if (pattern_index > 20) return false;
|
|
|
|
pattern[pattern_index] = nextToken (buffer);
|
|
|
|
if (pattern[pattern_index] == 'E') return false;
|
1999-10-02 16:21:10 +00:00
|
|
|
++pattern_index;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
pattern[pattern_index] = '\0';
|
|
|
|
|
|
|
|
// search "pattern" in "table"
|
|
|
|
table_index = 0;
|
1999-10-02 16:21:10 +00:00
|
|
|
while (compare(pattern, table[table_index].pattern)) {
|
|
|
|
++table_index;
|
1999-09-27 18:44:28 +00:00
|
|
|
if (!*table[table_index].pattern) return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Get the values from the appropriate places. If an index
|
|
|
|
// is zero, the corresponding array value is zero or UNIT_NONE,
|
|
|
|
// so we needn't check this.
|
|
|
|
if (result) {
|
1999-12-16 06:43:25 +00:00
|
|
|
result->val = number[1] * val_sign;
|
|
|
|
result->uni = unit[1];
|
|
|
|
result->plus_val = number[table[table_index].plus_val_index];
|
|
|
|
result->minus_val = number[table[table_index].minus_val_index];
|
|
|
|
result->plus_uni = unit [table[table_index].plus_uni_index];
|
|
|
|
result->minus_uni = unit [table[table_index].minus_uni_index];
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-10-02 16:21:10 +00:00
|
|
|
bool isValidLength(string const & data, LyXLength * result)
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
|
|
|
/// This is a trimmed down version of isValidGlueLength.
|
|
|
|
/// The parser may seem overkill for lengths without
|
|
|
|
/// glue, but since we already have it, using it is
|
|
|
|
/// easier than writing something from scratch.
|
|
|
|
|
2000-09-14 17:53:12 +00:00
|
|
|
string buffer(data);
|
1999-09-27 18:44:28 +00:00
|
|
|
int pattern_index = 0;
|
|
|
|
char pattern[3];
|
|
|
|
|
|
|
|
// To make isValidLength recognize negative values
|
|
|
|
// this little hack is needed:
|
|
|
|
short val_sign = 1; // positive as default
|
|
|
|
switch(buffer[0]) {
|
|
|
|
case '-':
|
1999-11-04 01:40:20 +00:00
|
|
|
lyx_advance(buffer, 1);
|
1999-09-27 18:44:28 +00:00
|
|
|
val_sign = -1;
|
|
|
|
break;
|
|
|
|
case '+':
|
1999-11-04 01:40:20 +00:00
|
|
|
lyx_advance(buffer, 1);
|
1999-09-27 18:44:28 +00:00
|
|
|
// fall through
|
|
|
|
default:
|
|
|
|
// no action
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
// end of hack
|
|
|
|
|
|
|
|
number_index = unit_index = 1; // entries at index 0 are sentinels
|
|
|
|
|
|
|
|
// construct "pattern" from "data"
|
|
|
|
while (!isEndOfData (buffer)) {
|
|
|
|
if (pattern_index > 2) return false;
|
|
|
|
pattern[pattern_index] = nextToken (buffer);
|
|
|
|
if (pattern[pattern_index] == 'E') return false;
|
1999-10-02 16:21:10 +00:00
|
|
|
++pattern_index;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
pattern[pattern_index] = '\0';
|
|
|
|
|
|
|
|
// only the most basic pattern is accepted here
|
1999-10-02 16:21:10 +00:00
|
|
|
if (compare(pattern, "nu") != 0) return false;
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
// It _was_ a correct length string.
|
|
|
|
// Store away the values we found.
|
|
|
|
if (result) {
|
1999-12-16 06:43:25 +00:00
|
|
|
result->val = number[1] * val_sign;
|
|
|
|
result->uni = unit[1];
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2000-03-08 01:45:25 +00:00
|
|
|
|
1999-09-27 18:44:28 +00:00
|
|
|
/// LyXLength class
|
|
|
|
|
1999-10-02 16:21:10 +00:00
|
|
|
LyXLength::LyXLength(string const & data)
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
|
|
|
LyXLength tmp;
|
|
|
|
|
|
|
|
if (!isValidLength (data, &tmp))
|
|
|
|
return; // should raise an exception
|
|
|
|
else {
|
|
|
|
val = tmp.val;
|
|
|
|
uni = tmp.uni;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-03-08 01:45:25 +00:00
|
|
|
|
2000-09-14 17:53:12 +00:00
|
|
|
string const LyXLength::asString() const
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
2000-04-04 00:19:15 +00:00
|
|
|
std::ostringstream buffer;
|
2000-03-08 01:45:25 +00:00
|
|
|
buffer << val << unit_name[uni]; // setw?
|
|
|
|
return buffer.str().c_str();
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* LyXGlueLength class
|
|
|
|
*/
|
|
|
|
|
1999-10-02 16:21:10 +00:00
|
|
|
LyXGlueLength::LyXGlueLength (string const & data)
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
|
|
|
LyXGlueLength tmp(0.0, PT);
|
|
|
|
|
|
|
|
if (!isValidGlueLength (data, &tmp))
|
|
|
|
return; // should raise an exception
|
|
|
|
else {
|
1999-11-15 12:01:38 +00:00
|
|
|
val = tmp.val;
|
|
|
|
uni = tmp.uni;
|
|
|
|
plus_val = tmp.plus_val;
|
|
|
|
plus_uni = tmp.plus_uni;
|
|
|
|
minus_val = tmp.minus_val;
|
|
|
|
minus_uni = tmp.minus_uni;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-09-14 17:53:12 +00:00
|
|
|
string const LyXGlueLength::asString() const
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
2000-04-04 00:19:15 +00:00
|
|
|
std::ostringstream buffer;
|
2000-09-18 17:39:21 +00:00
|
|
|
|
1999-09-27 18:44:28 +00:00
|
|
|
if (plus_val != 0.0)
|
1999-10-02 16:21:10 +00:00
|
|
|
if (minus_val != 0.0)
|
|
|
|
if ((uni == plus_uni) && (uni == minus_uni))
|
|
|
|
if (plus_val == minus_val)
|
2000-03-08 01:45:25 +00:00
|
|
|
buffer << val << "+-"
|
|
|
|
<< plus_val << unit_name[uni];
|
1999-10-02 16:21:10 +00:00
|
|
|
else
|
2000-03-08 01:45:25 +00:00
|
|
|
buffer << val
|
|
|
|
<< '+' << plus_val
|
|
|
|
<< '-' << minus_val
|
|
|
|
<< unit_name[uni];
|
1999-10-02 16:21:10 +00:00
|
|
|
else
|
2000-03-08 01:45:25 +00:00
|
|
|
if (plus_uni == minus_uni
|
|
|
|
&& plus_val == minus_val)
|
|
|
|
buffer << val << unit_name[uni]
|
|
|
|
<< "+-" << plus_val
|
|
|
|
<< unit_name[plus_uni];
|
|
|
|
|
1999-10-02 16:21:10 +00:00
|
|
|
else
|
2000-03-08 01:45:25 +00:00
|
|
|
buffer << val << unit_name[uni]
|
|
|
|
<< '+' << plus_val
|
|
|
|
<< unit_name[plus_uni]
|
|
|
|
<< '-' << minus_val
|
|
|
|
<< unit_name[minus_uni];
|
1999-10-02 16:21:10 +00:00
|
|
|
else
|
|
|
|
if (uni == plus_uni)
|
2000-03-08 01:45:25 +00:00
|
|
|
buffer << val << '+' << plus_val
|
|
|
|
<< unit_name[uni];
|
1999-10-02 16:21:10 +00:00
|
|
|
else
|
2000-03-08 01:45:25 +00:00
|
|
|
buffer << val << unit_name[uni]
|
|
|
|
<< '+' << plus_val
|
|
|
|
<< unit_name[plus_uni];
|
|
|
|
|
1999-09-27 18:44:28 +00:00
|
|
|
else
|
1999-10-02 16:21:10 +00:00
|
|
|
if (minus_val != 0.0)
|
|
|
|
if (uni == minus_uni)
|
2000-03-08 01:45:25 +00:00
|
|
|
buffer << val << '-' << minus_val
|
|
|
|
<< unit_name[uni];
|
|
|
|
|
1999-10-02 16:21:10 +00:00
|
|
|
else
|
2000-03-08 01:45:25 +00:00
|
|
|
buffer << val << unit_name[uni]
|
|
|
|
<< '-' << minus_val
|
|
|
|
<< unit_name[minus_uni];
|
1999-09-27 18:44:28 +00:00
|
|
|
else
|
2000-03-08 01:45:25 +00:00
|
|
|
buffer << val << unit_name[uni];
|
2000-09-18 17:39:21 +00:00
|
|
|
|
2000-03-08 01:45:25 +00:00
|
|
|
return buffer.str().c_str();
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-09-14 17:53:12 +00:00
|
|
|
string const LyXGlueLength::asLatexString() const
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
2000-04-04 00:19:15 +00:00
|
|
|
std::ostringstream buffer;
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
if (plus_val != 0.0)
|
|
|
|
if (minus_val != 0.0)
|
2000-03-08 01:45:25 +00:00
|
|
|
buffer << val << unit_name[uni]
|
|
|
|
<< " plus "
|
|
|
|
<< plus_val << unit_name[plus_uni]
|
|
|
|
<< " minus "
|
|
|
|
<< minus_val << unit_name[minus_uni];
|
1999-09-27 18:44:28 +00:00
|
|
|
else
|
2000-03-08 01:45:25 +00:00
|
|
|
buffer << val << unit_name[uni]
|
|
|
|
<< " plus "
|
|
|
|
<< plus_val << unit_name[plus_uni];
|
1999-09-27 18:44:28 +00:00
|
|
|
else
|
|
|
|
if (minus_val != 0.0)
|
2000-03-08 01:45:25 +00:00
|
|
|
buffer << val << unit_name[uni]
|
|
|
|
<< " minus "
|
|
|
|
<< minus_val << unit_name[minus_uni];
|
1999-09-27 18:44:28 +00:00
|
|
|
else
|
2000-03-08 01:45:25 +00:00
|
|
|
buffer << val << unit_name[uni];
|
2000-09-18 17:39:21 +00:00
|
|
|
|
2000-03-08 01:45:25 +00:00
|
|
|
return buffer.str().c_str();
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* VSpace class
|
|
|
|
*/
|
|
|
|
|
1999-10-02 16:21:10 +00:00
|
|
|
VSpace::VSpace (string const & data)
|
1999-09-27 18:44:28 +00:00
|
|
|
: kin (NONE), len (0.0, LyXLength::PT)
|
|
|
|
{
|
1999-10-02 16:21:10 +00:00
|
|
|
kp = false;
|
|
|
|
if (data.empty())
|
|
|
|
return;
|
1999-09-27 18:44:28 +00:00
|
|
|
float value;
|
1999-10-02 16:21:10 +00:00
|
|
|
string input = strip(data);
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
int length = input.length();
|
|
|
|
|
|
|
|
if (length > 1 && input[length-1] == '*') {
|
|
|
|
kp = true;
|
1999-10-02 16:21:10 +00:00
|
|
|
input.erase(length - 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (prefixIs (input, "defskip")) kin = DEFSKIP;
|
|
|
|
else if (prefixIs (input, "smallskip")) kin = SMALLSKIP;
|
|
|
|
else if (prefixIs (input, "medskip")) kin = MEDSKIP;
|
|
|
|
else if (prefixIs (input, "bigskip")) kin = BIGSKIP;
|
|
|
|
else if (prefixIs (input, "vfill")) kin = VFILL;
|
1999-09-27 18:44:28 +00:00
|
|
|
else if (isValidGlueLength (input, &len))
|
|
|
|
kin = LENGTH;
|
2000-09-26 13:54:57 +00:00
|
|
|
else if (sscanf(input.c_str(), "%f", &value) == 1) {
|
1999-09-27 18:44:28 +00:00
|
|
|
// This last one is for reading old .lyx files
|
|
|
|
// without units in added_space_top/bottom.
|
|
|
|
// Let unit default to centimeters here.
|
|
|
|
kin = LENGTH;
|
|
|
|
len = LyXGlueLength (value, LyXLength::CM);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-11-15 12:01:38 +00:00
|
|
|
bool VSpace::operator==(VSpace const & other) const
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
|
|
|
if (this->kin == other.kin)
|
|
|
|
if (this->kin == LENGTH)
|
|
|
|
if (this->len == other.len)
|
|
|
|
return this->kp == other.kp;
|
|
|
|
else
|
|
|
|
return false;
|
|
|
|
else
|
|
|
|
return this->kp == other.kp;
|
|
|
|
else
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-09-14 17:53:12 +00:00
|
|
|
string const VSpace::asLyXCommand() const
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
1999-10-02 16:21:10 +00:00
|
|
|
string result;
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
switch (kin) {
|
|
|
|
case NONE: break;
|
|
|
|
case DEFSKIP: result = "defskip"; break;
|
|
|
|
case SMALLSKIP: result = "smallskip"; break;
|
|
|
|
case MEDSKIP: result = "medskip"; break;
|
|
|
|
case BIGSKIP: result = "bigskip"; break;
|
|
|
|
case VFILL: result = "vfill"; break;
|
|
|
|
case LENGTH: result = len.asString(); break;
|
|
|
|
}
|
|
|
|
if (kp && (kin != NONE) && (kin != DEFSKIP))
|
|
|
|
return result += '*';
|
|
|
|
else
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-09-14 17:53:12 +00:00
|
|
|
string const VSpace::asLatexCommand(BufferParams const & params) const
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
|
|
|
switch (kin) {
|
1999-10-02 16:21:10 +00:00
|
|
|
case NONE: return string();
|
1999-09-27 18:44:28 +00:00
|
|
|
case DEFSKIP:
|
2000-02-22 00:36:17 +00:00
|
|
|
return params.getDefSkip().asLatexCommand(params);
|
1999-09-27 18:44:28 +00:00
|
|
|
case SMALLSKIP: return kp ? "\\vspace*{\\smallskipamount}"
|
1999-12-16 06:43:25 +00:00
|
|
|
: "\\smallskip{}";
|
1999-09-27 18:44:28 +00:00
|
|
|
case MEDSKIP: return kp ? "\\vspace*{\\medskipamount}"
|
1999-12-16 06:43:25 +00:00
|
|
|
: "\\medskip{}";
|
1999-09-27 18:44:28 +00:00
|
|
|
case BIGSKIP: return kp ? "\\vspace*{\\bigskipamount}"
|
1999-12-16 06:43:25 +00:00
|
|
|
: "\\bigskip{}";
|
1999-09-27 18:44:28 +00:00
|
|
|
case VFILL: return kp ? "\\vspace*{\\fill}"
|
1999-12-16 06:43:25 +00:00
|
|
|
: "\\vfill{}";
|
1999-09-27 18:44:28 +00:00
|
|
|
case LENGTH: return kp ? "\\vspace*{" + len.asLatexString() + '}'
|
1999-12-16 06:43:25 +00:00
|
|
|
: "\\vspace{" + len.asLatexString() + '}';
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
1999-10-02 16:21:10 +00:00
|
|
|
return string(); // should never be reached
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-02-22 00:36:17 +00:00
|
|
|
int VSpace::inPixels(BufferView * bv) const
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
|
|
|
// Height of a normal line in pixels (zoom factor considered)
|
2000-02-22 00:36:17 +00:00
|
|
|
int height = bv->text->DefaultHeight(); // [pixels]
|
2000-05-15 14:49:36 +00:00
|
|
|
int skip = 0;
|
|
|
|
if (kin == DEFSKIP)
|
|
|
|
skip = bv->buffer()->params.getDefSkip().inPixels(bv);
|
1999-09-27 18:44:28 +00:00
|
|
|
|
2000-05-15 14:49:36 +00:00
|
|
|
return inPixels(height, skip);
|
|
|
|
}
|
|
|
|
|
|
|
|
int VSpace::inPixels(int default_height, int default_skip) const
|
|
|
|
{
|
|
|
|
// Height of a normal line in pixels (zoom factor considered)
|
|
|
|
int height = default_height; // [pixels]
|
|
|
|
|
1999-09-27 18:44:28 +00:00
|
|
|
// Zoom factor specified by user in percent
|
2000-03-12 10:35:05 +00:00
|
|
|
float const zoom = lyxrc.zoom / 100.0; // [percent]
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
// DPI setting for monitor: pixels/inch
|
2000-03-12 10:35:05 +00:00
|
|
|
float const dpi = lyxrc.dpi; // screen resolution [pixels/inch]
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
// We want the result in pixels
|
|
|
|
float result, value;
|
|
|
|
|
|
|
|
switch (kin) {
|
|
|
|
case NONE: return 0;
|
|
|
|
|
|
|
|
case DEFSKIP:
|
2000-05-15 14:49:36 +00:00
|
|
|
return default_skip;
|
1999-09-27 18:44:28 +00:00
|
|
|
|
1999-12-16 06:43:25 +00:00
|
|
|
// This is how the skips are normally defined by
|
|
|
|
// LateX. But there should be some way to change
|
|
|
|
// this per document.
|
2000-04-04 00:19:15 +00:00
|
|
|
case SMALLSKIP: return height / 4;
|
|
|
|
case MEDSKIP: return height / 2;
|
1999-09-27 18:44:28 +00:00
|
|
|
case BIGSKIP: return height;
|
2000-04-04 00:19:15 +00:00
|
|
|
case VFILL: return 3 * height;
|
1999-12-16 06:43:25 +00:00
|
|
|
// leave space for the vfill symbol
|
1999-09-27 18:44:28 +00:00
|
|
|
case LENGTH:
|
|
|
|
// Pixel values are scaled so that the ratio
|
|
|
|
// between lengths and font sizes on the screen
|
|
|
|
// is the same as on paper.
|
|
|
|
|
|
|
|
// we don't care about sign of value, we
|
|
|
|
// can't display negative anyway
|
|
|
|
result = 0.0;
|
|
|
|
value = len.value();
|
|
|
|
short val_sign = value < 0.0 ? -1 : 1;
|
|
|
|
|
|
|
|
switch (len.unit()) {
|
|
|
|
case LyXLength::SP:
|
|
|
|
// Scaled point: sp = 1/65536 pt
|
|
|
|
result = zoom * dpi * value
|
|
|
|
/ (72.27 * 65536); // 4736286.7
|
|
|
|
break;
|
|
|
|
case LyXLength::PT:
|
|
|
|
// Point: 1 pt = 1/72.27 inch
|
|
|
|
result = zoom * dpi * value
|
|
|
|
/ 72.27; // 72.27
|
|
|
|
break;
|
|
|
|
case LyXLength::BP:
|
|
|
|
// Big point: 1 bp = 1/72 inch
|
|
|
|
result = zoom * dpi * value
|
|
|
|
/ 72; // 72
|
|
|
|
break;
|
|
|
|
case LyXLength::DD:
|
|
|
|
// Didot: 1157dd = 1238 pt?
|
|
|
|
result = zoom * dpi * value
|
1999-12-16 06:43:25 +00:00
|
|
|
/ (72.27 / (0.376 * 2.845)); // 67.559735
|
1999-09-27 18:44:28 +00:00
|
|
|
break;
|
|
|
|
case LyXLength::MM:
|
|
|
|
// Millimeter: 1 mm = 1/25.4 inch
|
|
|
|
result = zoom * dpi * value
|
|
|
|
/ 25.4; // 25.4
|
|
|
|
break;
|
|
|
|
case LyXLength::PC:
|
|
|
|
// Pica: 1 pc = 12 pt
|
|
|
|
result = zoom * dpi * value
|
1999-12-16 06:43:25 +00:00
|
|
|
/ (72.27 / 12); // 6.0225
|
1999-09-27 18:44:28 +00:00
|
|
|
break;
|
|
|
|
case LyXLength::CC:
|
|
|
|
// Cicero: 1 cc = 12 dd
|
|
|
|
result = zoom * dpi * value
|
1999-12-16 06:43:25 +00:00
|
|
|
/ (72.27 / (12 * 0.376 * 2.845)); // 5.6299779
|
1999-09-27 18:44:28 +00:00
|
|
|
break;
|
|
|
|
case LyXLength::CM:
|
|
|
|
// Centimeter: 1 cm = 1/2.54 inch
|
|
|
|
result = zoom * dpi * value
|
|
|
|
/ 2.54; // 2.54
|
|
|
|
break;
|
|
|
|
case LyXLength::IN:
|
|
|
|
// Inch
|
|
|
|
result = zoom * dpi * value;
|
|
|
|
break;
|
|
|
|
case LyXLength::EX:
|
|
|
|
// Ex: The height of an "x"
|
|
|
|
result = zoom * value * height / 2; // what to / width?
|
|
|
|
break;
|
|
|
|
case LyXLength::EM: // what to / width?
|
|
|
|
// Em: The width of an "m"
|
|
|
|
result = zoom * value * height / 2; // Why 2?
|
|
|
|
break;
|
|
|
|
case LyXLength::MU: // This is probably only allowed in
|
1999-12-16 06:43:25 +00:00
|
|
|
// math mode
|
1999-09-27 18:44:28 +00:00
|
|
|
result = zoom * value * height;
|
|
|
|
break;
|
|
|
|
case LyXLength::UNIT_NONE:
|
|
|
|
result = 0; // this cannot happen
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return int (result * val_sign + 0.5);
|
|
|
|
}
|
|
|
|
return 0; // never reached
|
|
|
|
}
|