text
stringlengths 20
1.01M
| url
stringlengths 14
1.25k
| dump
stringlengths 9
15
⌀ | lang
stringclasses 4
values | source
stringclasses 4
values |
|---|---|---|---|---|
I'm pleased to announce that Denis Bulichenko has translated this article into Russian! It has been published in RSDN. The complete article will soon be available on-line. I'm deeply indebted to you, Denis.
Standard C++ does not have true object-oriented function pointers. This is unfortunate, because object-oriented function pointers, also called 'closures' or 'delegates', have proved their value in similar languages. In Delphi (Object Pascal), they are the basis for Borland's Visual Component Library (VCL). More recently, C# has popularized the delegate concept, contributing to the success of that language. For many applications, delegates simplify the use of elegant design patterns (Observer, Strategy, State[GoF]) composed of very loosely coupled objects. There can be no doubt that such a feature would be useful in standard C++.
Instead of delegates, C++ only provides member function pointers. Most C++ programmers have never used member function pointers, and with good reason. They have their own bizarre syntax (the ->* and .* operators, for example), it's hard to find accurate information about them, and most of the things you can do with them could be done better in some other way. This is a bit scandalous: it's actually easier for a compiler writer to implement proper delegates than it is to implement member function pointers!
->*
.*
In this article, I'll "lift the lid" on member function pointers. After a recap of the syntax and idiosyncrasies of member function pointers, I'll explain how member function pointers are implemented by commonly-used compilers. I'll show how compilers could implement delegates efficiently. Finally, I will show how I used this clandestine knowledge of member function pointers to make an implementation of delegates that is optimally efficient on most C++ compilers. For example, invoking a single-target delegate on Visual C++ (6.0, .NET, and .NET 2003) generates just two lines of assembly code!
We begin with a review of function pointers. In C, and consequently in C++, a function pointer called my_func_ptr that points to a function taking an int and a char * and returning a float, is declared like this:
my_func_ptr
int
char *
float
float (*my_func_ptr)(int, char *);
// To make it more understandable, I strongly recommend that you use a typedef.
// Things can get particularly confusing when
// the function pointer is a parameter to a function.
// The declaration would then look like this:
typedef float (*MyFuncPtrType)(int, char *);
MyFuncPtrType my_func_ptr;
Note that there is a different type of function pointer for each combination of arguments. On MSVC, there is also a different type for each of the three different calling conventions: __cdecl, __stdcall, and __fastcall. You make your function pointer point to a function float some_func(int, char *) like this:
__cdecl
__stdcall
__fastcall
float some_func(int, char *)
my_func_ptr = some_func;
When you want to invoke the function that you stored, you do this:
(*my_func_ptr)(7, "Arbitrary String");
You are allowed to cast from one type of function pointer to another. But you are not allowed to cast a function pointer to a void * data pointer. The other allowable operations are trivial. A function pointer can be set to 0 to mark it as a null pointer. The full range of comparison operators are available (==, !=, <, >, <=, >=), and you can also test for null pointers using ==0 or via an implicit cast to bool. Interestingly, a function pointer can be used as a non-type template parameter. This is fundamentally different from a type parameter, and is also different from an integral non-type parameter. It is instantiated based on name rather than type or value. Name-based template parameters are not supported by all compilers, not even by all those with support for partial template specialization.
void *
==
!=
<
>
<=
>=
==0
bool
In C, the most common uses of function pointers are as parameters to library functions like qsort, and as callbacks for Windows functions, etc. They have many other applications as well. The implementation of function pointers is simple: they are just "code pointers": they hold the starting address of an assembly-language routine. The different types of function pointers exist only to ensure that the correct calling convention is used.
qsort
In C++ programs, most functions are member functions; that is, they are part of a class. You are not allowed to use an ordinary function pointer to point to a member function; instead, you have to use a member function pointer. A member function pointer to a member function of class SomeClass, with the same arguments as before, is declared like this:
SomeClass
float (SomeClass::*my_memfunc_ptr)(int, char *);
// For const member functions, it's declared like this:
float (SomeClass::*my_const_memfunc_ptr)(int, char *) const;
Notice that a special operator (::*) is used, and that SomeClass is part of the declaration. Member function pointers have a horrible restriction: they can only point to member functions of a single class. There is a different type of member function pointer for each combination of arguments, for both types of const-ness, and for each class. On MSVC, there is also a different type for each of the four different calling conventions: __cdecl, __stdcall, __fastcall, and __thiscall. (__thiscall is the default. Interestingly, there is no documented __thiscall keyword, but it sometimes shows up in error messages. If you use it explicitly, you'll get an error message stating that it is reserved for future use.) If you're using member function pointers, you should always use a typedef to avoid confusion.
::*
__thiscall
typedef
You make your function pointer point to a function float SomeClass::some_member_func(int, char *) like this:
float SomeClass::some_member_func(int, char *)
my_memfunc_ptr = &SomeClass::some_member_func;
// This is the syntax for operators:
my_memfunc_ptr = &SomeClass::operator !;
// There is no way to take the address of a constructor or destructor
Some compilers (most notably MSVC 6 and 7) will let you omit the &, even though it is non-standard and confusing. More standard-compliant compilers (e.g., GNU G++ and MSVC 8 (a.k.a. VS 2005)) require it, so you should definitely put it in. To invoke the member function pointer, you need to provide an instance of SomeClass, and you must use the special operator ->*. This operator has a low precedence, so you need to put it in parentheses:
&
SomeClass *x = new SomeClass;
(x->*my_memfunc_ptr)(6, "Another Arbitrary Parameter");
// You can also use the .* operator if your class is on the stack.
SomeClass y;
(y.*my_memfunc_ptr)(15, "Different parameters this time");
Don't blame me for the syntax -- it seems that one of the designers of C++ loved punctuation marks!
C++ added three special operators to the C language specifically to support member pointers. ::* is used in declaring the pointer, and ->* and .* are used in invoking the function that is pointed to. It seems that extraordinary attention was paid to an obscure and seldom-used part of the language. (You're even allowed to overload the ->* operator, though why you want to do such a thing is beyond my comprehension. I only know of one such usage [Meyers].)
A member function pointer can be set to 0, and provides the operators == and !=, but only for member function pointers of the same class. Any member function pointer can be compared with 0 to see if it is null. [Update, March 2005: This doesn't work on all compilers. On Metrowerks MWCC, a pointer to the first virtual function of a simple class will be equal to zero!] Unlike simple function pointers, the inequality comparisons (<, >, <=, >=) are not available. Like function pointers, they can be used as non-type template parameters, but this seems to work on fewer compilers.
There are some weird things about member function pointers. Firstly, you can't use a member function to point to a static member function. You have to use a normal function pointer for that. (So the name "member function pointer" is a bit misleading: they're actually "non-static member function pointers".) Secondly, when dealing with derived classes, there are some surprises. For example, the code below will compile on MSVC if you leave the comments intact:
static
class SomeClass {
public:
virtual void some_member_func(int x, char *p) {
printf("In SomeClass"); };
};
class DerivedClass : public SomeClass {
public:
// If you uncomment the next line, the code at line (*) will fail!
// virtual void some_member_func(int x, char *p) { printf("In DerivedClass"); };
};
int main() {
// Declare a member function pointer for SomeClass
typedef void (SomeClass::*SomeClassMFP)(int, char *);
SomeClassMFP my_memfunc_ptr;
my_memfunc_ptr = &DerivedClass::some_member_func; // ---- line (*)
}
Curiously enough, &DerivedClass::some_member_func is a member function pointer of class SomeClass. It is not a member of DerivedClass! (Some compilers behave slightly differently: e.g., for Digital Mars C++, &DerivedClass::some_member_func is undefined in this case.) But, if DerivedClass overrides some_member_func, the code won't compile, because &DerivedClass::some_member_func has now become a member function pointer of class DerivedClass!
&DerivedClass::some_member_func
DerivedClass
some_member_func
Casting between member function pointers is an extremely murky area. During the standardization of C++, there was a lot of discussion about whether you should be able to cast a member function pointer from one class to a member function pointer of a base or derived class, and whether you could cast between unrelated classes. By the time the standards committee made up their mind, different compiler vendors had already made implementation decisions which had locked them into different answers to these questions..
reinterpret_cast
On some compilers, weird stuff happen even when converting between member function pointers of base and derived classes. When multiple inheritance is involved, using reinterpret_cast to cast from a derived class to a base class may or may not compile, depending on what order the classes are listed in the declaration of the derived class! Here's an example:
class Derived: public Base1, public Base2 // case (a)
class Derived2: public Base2, public Base1 // case (b)
typedef void (Derived::* Derived_mfp)();
typedef void (Derived2::* Derived2_mfp)();
typedef void (Base1::* Base1mfp) ();
typedef void (Base2::* Base2mfp) ();
Derived_mfp x;
For case (a), static_cast<Base1mfp>(x) will work, but static_cast<Base2mfp>(x) will fail. Yet for case (b), the opposite is true. You can safely cast a member function pointer from a derived class to its first base class only! If you try, MSVC will issue warning C4407, while Digital Mars C++ will issue an error. Both will protest if you use reinterpret_cast instead of static_cast, but for different reasons. But, some compilers will be perfectly happy no matter what you do. Beware!
static_cast<Base1mfp>(x)
static_cast<Base2mfp>(x)
static_cast
There's another interesting rule in the standard: you can declare a member function pointer before the class has been defined. You can even invoke a member function of this incomplete type! This will be discussed later in the article. Note that a few compilers can't cope with this (early MSVC, early CodePlay, LVMM).
It's worth noting that, as well as member function pointers, the C++ standard also provides member data pointers. They share the same operators, and some of the same implementation issues. They are used in some implementations of stl::stable_sort, but I'm not aware of many other sensible uses.
stl::stable_sort
By now, I've probably convinced you that member function pointers are somewhat bizarre. But what are they useful for? I did an extensive search of published code on the web to find out. I found two common ways in which member function pointers are used:
They also have trivial uses in one-line function adaptors in the STL and Boost libraries, allowing you to use member functions with the standard algorithms. In such cases, they are used at compile-time; usually, no function pointers actually appear in the compiled code. The most interesting application of member function pointers is in defining complex interfaces. Some impressive things can be done in this way, but I didn't find many examples. Most of the time, these jobs can be performed more elegantly with virtual functions or with a refactoring of the problem. But by far, the most famous uses of member function pointers are in application frameworks of various kinds. They form the core of MFC's messaging system.
When you use MFC's message map macros (e.g., ON_COMMAND), you're actually populating an array containing message IDs and member function pointers (specifically, CCmdTarget::* member function pointers). This is the reason that MFC classes must derive from CCmdTarget if they want to handle messages. But the various message handling functions have different parameter lists (for example, OnDraw handlers have CDC * as the first parameter), so the array must contain member function pointers of various types. How does MFC deal with this? They use a horrible hack, putting all the possible member function pointers into an enormous union, to subvert the normal C++ type checking. (Look up the MessageMapFunctions union in afximpl.h and cmdtarg.cpp for the gory details.) Because MFC is such an important piece of code, in practice, all C++ compilers support this hack.
ON_COMMAND
CCmdTarget::*
CCmdTarget
OnDraw
CDC *
MessageMapFunctions
In my searches, I was unable to find many examples of good usage of member function pointers, other than at compile time. For all their complexity, they don't add much to the language. It's hard to escape the conclusion that C++ member function pointers have a flawed design.
In writing this article, I have one key point to make: It is absurd that the C++ Standard allows you to cast between member function pointers, but doesn't allow you to invoke them once you've done it. It's absurd for three reasons. Firstly, the cast won't always work on many popular compilers (so, casting is standard, but not portable). Secondly, on all compilers, if the cast is successful, invoking the cast member function pointer behaves exactly as you would hope: there is no need for it to be classed as "undefined behavior". (Invocation is portable, but not standard!) Thirdly, allowing the cast without allowing invocation is completely useless; but if both cast and invocation are possible, it's easy to implement efficient delegates, with a huge benefit to the language.
To try to convince you of this controversial assertion, consider a file consisting solely of the following code. This is legal C++.
class SomeClass;
typedef void (SomeClass::* SomeClassFunction)(void);
void Invoke(SomeClass *pClass, SomeClassFunction funcptr) {
(pClass->*funcptr)(); };
Note that the compiler has to produce assembly code to invoke the member function pointer, knowing nothing about the class SomeClass. Clearly, unless the linker does some _extremely_ sophisticated optimization, the code must work correctly regardless of the actual definition of the class. An immediate consequence is that you can safely invoke a member function pointer that's been cast from a completely different class.
To explain the other half of my assertion, that casting doesn't work the way the standard says it should, I need to discuss in detail exactly how compilers implement member function pointers. This will also help to explain why the rules about the use of member function pointers are so restrictive. Accurate documentation about member function pointers is hard to obtain, and misinformation is common, so I've examined the assembly code produced by a large range of compilers. It's time to get our hands dirty.
A member function of a class is a bit different from a standard C function. As well as the declared parameters, it has a hidden parameter called this, which points to the class instance. Depending on the compiler, this might be treated internally as a normal parameter, or it might receive special treatment. (For example, in VC++, this is usually passed using the ECX register). this is fundamentally different to normal parameters. For virtual functions, it controls at runtime which function is executed. Even though a member function is a real function underneath, there is no way in standard C++ to make an ordinary function behave like a member function: there's no thiscall keyword to make it use the correct calling convention. Member functions are from Mars, ordinary functions are from Venus.
this
ECX
thiscall
You'd probably guess that a "member function pointer", like a normal function pointer, just holds a code pointer. You would be wrong. On almost all compilers, a member function pointer is bigger than a function pointer. Most bizarrely, in Visual C++, a member function pointer might be 4, 8, 12, or 16 bytes long, depending on the nature of the class it's associated with, and depending on what compiler settings are used! Member function pointers are more complex than you might expect. But it was not always so.
Let's go back in time to the early 1980's. When the original C++ compiler (CFront) was originally developed, it only had single inheritance. When member function pointers were introduced, they were simple: they were just function pointers that had an extra this parameter as the first argument. When virtual functions were involved, the function pointer pointed to a short bit of 'thunk' code. (Update, Oct 04: A discussion on comp.lang.c++.moderated has established that CFront didn't actually use thunks, it was much less elegant. But it could have used this method, and pretending that it did, makes the following discussion a bit easier to understand.)
This idyllic world was shattered when CFront 2.0 was released. It introduced templates and multiple inheritance. Part of the collateral damage of multiple inheritance was the castration of member function pointers. The problem is, with multiple inheritance, you don't know what this pointer to use until you make the call. For example, suppose you have the four classes defined below:
class A {
public:
virtual int Afunc() { return 2; };
};
class B {
public:
int Bfunc() { return 3; };
};
// C is a single inheritance class, derives only from A
class C: public A {
public:
int Cfunc() { return 4; };
};
// D uses multiple inheritance
class D: public A, public B {
public:
int Dfunc() { return 5; };
};
Suppose we create a member function pointer for class C. In this example, Afunc and Cfunc are both member functions of C, so our member function pointer is allowed to point to Afunc or Cfunc. But Afunc needs a this pointer that points to C::A (which I'll call Athis), while Cfunc needs a this pointer that points to C (which I'll call Cthis). Compiler writers deal with this situation by a trick: they ensure that A is physically stored at the start of C. This means that Athis == Cthis. We only have one this to worry about, and all's well with the world.
C
Afunc
Cfunc
C::A
Athis
Cthis
A
Athis == Cthis
Now, suppose we create a member function pointer for class D. In this case, our member function pointer is allowed to point to Afunc, Bfunc, or Dfunc. But Afunc needs a this pointer that points to D::A, while Bfunc needs a this pointer that points to D::B. This time, the trick doesn't work. We can't put both A and B at the start of D. So, a member function pointer to D needs to specify not only what function to call, but also what this pointer to use. The compiler does know how big A is, so it can convert an Athis pointer into a Bthis just by adding an offset (delta = sizeof(A)) to it.
D
Bfunc
Dfunc
D::A
D::B
B
Bthis
delta = sizeof(A)
If you're using virtual inheritance (i.e., virtual base classes), it's much worse, and you can easily lose your mind trying to understand it. Typically, the compiler uses a virtual function table ('vtable') which stores for each virtual function, the function address, and the virtual_delta: the amount in bytes that needs to be added to the supplied this pointer to convert it into the this pointer that the function requires.
None of this complexity would exist if C++ had defined member function pointers a bit differently. In the code above, the complexity only comes because you are allowed to refer to A::Afunc as D::Afunc. This is probably bad style; normally, you should be using base classes as interfaces. If you were forced to do this, then member function pointers could have been ordinary function pointers with a special calling convention. IMHO, allowing them to point to overridden functions was a tragic mistake. As payment for this rarely-used extra functionality, member function pointers became grotesque. They also caused headaches for the compiler writers who had to implement them.
A::Afunc
D::Afunc
So, how do compilers typically implement member function pointers? Here are some results obtained by applying the sizeof operator to various structures (an int, a void * data pointer, a code pointer (i.e., a pointer to a static function), and a member function pointer to a class with single-, multiple-, virtual- inheritance, or unknown (i.e., forward declared)) for a variety of 32, 64 and 16-bit compilers.
sizeof
# Or 4,8, or 12 if the __single/ __multi/ __virtual_inheritance keyword is used.
__single
__multi
__virtual_inheritance
The compilers are Microsoft Visual C++ 4.0 to 7.1 (.NET 2003), GNU G++ 3.2 (MingW binaries,), Borland BCB 5.1 (), Open Watcom (WCL) 1.2 (), Digital Mars (DMC) 8.38n (), Intel C++ 8.0 for Windows IA-32, Intel C++ 8.0 for Itanium (), IBM XLC for AIX (Power, PowerPC), Metrowerks Code Warrior 9.1 for Windows (), and Comeau C++ 4.3 (). The data for Comeau applies to all their supported 32-bit platforms (x86, Alpha, SPARC, etc.). The 16-bit compilers were also tested in four DOS configurations (tiny, compact, medium, and large) to show the impact of various code and data pointer sizes. MSVC was also tested with an option (/vmg) that gives "full generality for pointers to members". (If you have a compiler from a vendor that is not listed here, please let me know. Results for non-x86 processors are particularly valuable.)
Amazing, isn't it? Looking at this table, you can readily see how easy it is to write code that will work in some circumstances but fail to compile in others. The internal implementations are obviously very different between compilers; in fact, I don't think that any other language feature has such a diversity of implementation. Looking in detail at the implementations reveals some surprising nastiness.
For almost all compilers, two fields I've called delta and vindex are used to adjust the provided this pointer into an adjustedthis which is passed to the function. For example, here is the technique used by Watcom C++ and Borland:
delta
vindex
adjustedthis
struct BorlandMFP { // also used by Watcom
CODEPTR m_func_address;
int delta;
int vindex; // or 0 if no virtual inheritance
};
if (vindex==0) adjustedthis = this + delta;
else adjustedthis = *(this + vindex -1) + delta
CALL funcadr
If virtual functions are used, the function pointer points to a two-instruction 'thunk' to determine the actual function to be called. Borland applies an optimization: if it knows that the class only used single inheritance, it knows that delta and vindex will always be zero, so it can skip the calculation in this most common case. Importantly, it only changes the invocation calculation, it does not change the structure itself.
Many other compilers use the same calculation, often with a minor reordering of the structure.
// Metrowerks CodeWarrior uses a slight variation of this theme.
// It uses this structure even in Embedded C++ mode, in which
// multiple inheritance is disabled!
struct MetrowerksMFP {
int delta;
int vindex; // or -1 if no virtual inheritance
CODEPTR func_address;
};
// An early version of SunCC apparently used yet another ordering:
struct {
int vindex; // or 0 if a non-virtual function
CODEPTR func_address; // or 0 if a virtual function
int delta;
};
Metrowerks doesn't seem to inline the calculation. Instead, it's performed in a short 'member function invoker' routine. This reduces code size a little but makes their member function pointers a bit slower.
Digital Mars C++ (formerly Zortech C++, then Symantec C++) uses a different optimization.. This is easily my favorite implementation.
struct DigitalMarsMFP { // Why doesn't everyone else do it this way?
CODEPTR func_address;
};
Current versions of the GNU compiler use a strange and tricky optimization. It observes that, for virtual inheritance, you have to look up the vtable in order to get the voffset required to calculate the this pointer. While you're doing that, you might as well store the function pointer in the vtable. By doing this, they combine the m_func_address and m_vtable_index fields into one, and they distinguish between them by ensuring that function pointers always point to even addresses but vtable indices are always odd:
voffset
m_func_address
m_vtable_index
// GNU g++ uses a tricky space optimisation, also adopted by IBM's VisualAge and XLC.
struct GnuMFP {
union {
CODEPTR funcadr; // always even
int vtable_index_2; // = vindex*2+1, always odd
};
int delta;
};
adjustedthis = this + delta
if (funcadr & 1) CALL (* ( *delta + (vindex+1)/2) + 4)
else CALL funcadr
The G++ method is well documented, so it has been adopted by many other vendors, including IBM's VisualAge and XLC compilers, recent versions of Open64, Pathscale EKO, and Metrowerks' 64-bit compilers. A simpler scheme used by earlier versions of GCC is also very common. SGI's now discontinued MIPSPro and Pro64 compilers, and Apple's ancient MrCpp compiler used this method. (Note that the Pro64 compiler has become the open source Open64 compiler).
struct Pro64MFP {
short delta;
short vindex;
union {
CODEPTR funcadr; // if vindex==-1
short __delta2;
} __funcadr_or_delta2;
};
// If vindex==0, then it is a null pointer-to-member.
Compilers based on the Edison Design Group front-end (Comeau, Portland Group, Greenhills) use a method that is almost identical. Their calculation is (PGI 32-bit compilers):
// Compilers using the EDG front-end (Comeau, Portland Group, Greenhills, etc)
struct EdisonMFP{
short delta;
short vindex;
union {
CODEPTR funcadr; // if vindex=0
long vtordisp; // if vindex!=0
};
};
if (vindex==0) {
adjustedthis=this + delta;
CALL funcadr;
} else {
adjustedthis = this+delta + *(*(this+delta+vtordisp) + vindex*8);
CALL *(*(this+delta+funcadr)+vindex*8 + 4);
};
Most compilers for embedded systems don't allow multiple inheritance. Thus, these compilers avoid all the quirkiness: a member function pointer is just a normal function pointer with a hidden 'this' parameter.
Microsoft compilers use an optimization that is similar to Borland's. They treat single inheritance with optimum efficiency. But unlike Borland, the default is to discard the entries which will always be zero. This means that single-inheritance pointers are the size of simple function pointers, multiple inheritance pointers are larger, and virtual inheritance pointers are larger still. This saves space. But it's not standard-compliant, and it has some bizarre side-effects.
Firstly, casting a member function pointer between a derived class and a base class can change its size! Consequently, information can be lost. Secondly, when a member function is declared before its class is defined, the compiler has to work out how much space to allocate to it. But it can't do this reliably, because it doesn't know the inheritance nature of the class until it's defined. It has to guess. If it guesses wrongly in one source file, but correctly in another, your program will inexplicably crash at runtime. So, Microsoft added some reserved words to their compiler: __single_inheritance, __multiple_inheritance, and __virtual_inheritance. They also added a compiler switch: /vmg, which makes all MFPs the same size, by retaining the missing zero fields. At this point, the tale gets sordid.
__single_inheritance
__multiple_inheritance
The documentation implies that specifying /vmg is equivalent to declaring every class with the __virtual_inheritance keyword. It isn't. Instead, it uses an even bigger structure which I've called unknown_inheritance. It also uses this whenever it has to make a member function pointer for a class when all it's seen is a forward declaration. They can't use their __virtual_inheritance pointers because they use a really silly optimization. Here's the algorithm they use:
unknown_inheritance
// Microsoft and Intel use this for the 'Unknown' case.
// Microsoft also use it when the /vmg option is used
// In VC1.5 - VC6, this structure is broken! See below.
struct MicrosoftUnknownMFP{
FunctionPointer m_func_address; // 64 bits for Itanium.
int m_delta;
int m_vtordisp;
int m_vtable_index; // or 0 if no virtual inheritance
};
if (vindex=0) adjustedthis = this + delta
else adjustedthis = this + delta + vtordisp + *(*(this + vtordisp) + vindex)
CALL funcadr
In the virtual inheritance case, the vtordisp value is not stored in the __virtual_inheritance pointer! Instead, the compiler hard-codes it into the assembly output when the function is invoked. But to deal with incomplete types, you need to know it. So they ended up with two types of virtual inheritance pointers. But until VC7, the unknown_inheritance case was hopelessly buggy. The vtordisp and vindex fields were always zero! Horrifying consequence: on VC4-VC6, specifying the /vmg option (without /vmm or /vms) can result in the wrong function being called! This would be extremely difficult to track down. In VC4, the IDE had a box for selecting the /vmg option, but it was disabled. I suspect that someone at MS knew about the bug, but it was never listed in their knowledge base. They finally fixed it in VC7.
vtordisp
Intel uses the same calculation as MSVC, but their /vmg option behaves quite differently (it has almost no effect - it only affects the unknown_inheritance case). The release notes for their compiler state that conversions between pointer to member types are not fully supported in the virtual inheritance case, and warns that compiler crashes or incorrect code generation may result if you try. This is a very nasty corner of the language.
And then there's CodePlay. Early versions of Codeplay's VectorC had options for link compatibility with Microsoft VC6, GNU, and Metrowerks. But, they always used the Microsoft method. They reverse-engineered it, just as I have, but they didn't detect the unknown_inheritance case, or the vtordisp value. Their calculations implicitly (and incorrectly) assumed vtordisp=0, so the wrong function could be called in some (obscure) cases. But Codeplay's upcoming release of VectorC 2.2.1 has fixed these problems. The member function pointers are now binary compatible with either Microsoft or GNU. With some high powered optimisations and a massive improvement in standards conformance (partial template specialisation, etc), this is becoming a very impressive compiler.
vtordisp=0
In theory, all of these vendors could radically change their technique for representing MFPs. In practice, this is extremely unlikely, because it would break a lot of existing code. At MSDN, there is a very old article that was published by Microsoft which explains the run-time implementation details of Visual C++ [JanGray]. It's written by Jan Gray, who actually wrote the MS C++ object model in 1990. Although the article dates from 1994, it is still relevant - excluding the bug fix, Microsoft hasn't changed it for 15 years. Similarly, the earliest compiler I have (Borland C++ 3.0, (1990)) generates identical code to Borland's most recent compiler, except of course that 16 bit registers are replaced with 32 bit ones.
By now, you know far too much about member function pointers. What's the point? I've dragged you through this to establish a rule. Although these implementations are very different from one another, they have something useful in common: the assembly code required to invoke a member function pointer is identical, regardless of what class and parameters are involved. Some compilers apply optimizations depending on the inheritance nature of the class, but when the class being invoked is of incomplete type, all such optimizations are impossible. This fact can be exploited to create efficient delegates.
Unlike member function pointers, it's not hard to find uses for delegates. They can be used anywhere you'd use a function pointer in a C program. Perhaps most importantly, it's very easy to implement an improved version of the Subject/Observer design pattern [GoF, p. 293] using delegates. The Observer pattern is most obviously applicable in GUI code, but I've found that it gives even greater benefits in the heart of an application. Delegates also allow elegant implementations of the Strategy [GoF, p. 315] and State [GoF, p. 305] patterns.
Now, here's the scandal. Delegates aren't just far more useful than member function pointers. They are much simpler as well! Since delegates are provided by the .NET languages, you might imagine that they are a high-level concept that is not easily implemented in assembly code. This is emphatically not the case: invoking a delegate is intrinsically a very low-level concept, and can be as low-level (and fast) as an ordinary function call. A C++ delegate just needs to contain a this pointer and a simple function pointer. When you set a delegate, you provide it with the this pointer at the same time that you specify the function to be called. The compiler can work out how the this pointer needs to be adjusted at the time that the delegate is set. There's no work to be done when invoking the delegate. Even better, the compiler can frequently do all the work at compile time, so that even setting the delegate is a trivial operation. The assembly code produced by invoking a delegate on an x86 system should be as simple as:
mov ecx, [this]
call [pfunc]
However, there's no way to generate such efficient code in standard C++. Borland solves this problem by adding a new keyword (__closure) to their C++ compiler, allowing them to use convenient syntax and generate optimal code. The GNU compiler also adds a language extension, but it is incompatible with Borland's. If you use either of these language extensions, you restrict yourself to a single compiler vendor. If instead, you constrain yourself to standard C++, it's still possible to implement delegates, they are just not as efficient.
__closure
Interestingly, in C# and other .NET languages, a delegate is apparently dozens of times slower than a function call (MSDN). I suspect that this is because of the garbage collection and the .NET security requirements. Recently, Microsoft added a "unified event model" to Visual C++, with the keywords __event, __raise, __hook, __unhook, event_source, and event_receiver. Frankly, I think this feature is appalling. It's completely non-standard, the syntax is ugly and doesn't even look like C++, and it generates very inefficient code.
__event
__raise
__hook
__unhook
event_source
event_receiver
There is a plethora of implementations of delegates using standard C++. All of them use the same idea. The basic observation is that member function pointers act as delegates -- but they only work for a single class. To avoid this limitation, you add another level of indirection: you can use templates to create a 'member function invoker' for each class. The delegate holds the this pointer, and a pointer to the invoker. The member function invoker needs to be allocated on the heap.
There are many implementations of this scheme, including several here at CodeProject. They vary in their complexity, their syntax (especially, how similar their syntax is to C#), and in their generality. The definitive implementation is boost::function. Recently, it was adopted into the next version of the C++ standard [Sutter1]. Expect its use to become widespread.
As clever as the traditional implementations are, I find them unsatisfying. Although they provide the desired functionality, they tend to obscure the underlying issue: a low-level construct is missing from the language. It's frustrating that on all platforms, the 'member function invoker' code will be identical for almost all classes. More importantly, the heap is used. For some applications, this is unacceptable.
One of my projects is a discrete event simulator. The core of such a program is an event dispatcher, which calls member functions of the various objects being simulated. Most of these member functions are very simple: they just update the internal state of the object, and sometimes add future events to the event queue. This is a perfect situation to use delegates. However, each delegate is only ever invoked once. Initially, I used boost::function, but I found that the memory allocation for the delegates was consuming over a third of the entire program running time! I wanted real delegates. For crying out loud, it should be just two ASM instructions!
boost::function
I don't always (often?) get what I want, but this time I was lucky. The C++ code I present here generates optimal assembly code in almost all circumstances. Most importantly, invoking a single-target delegate is as fast as a normal function call. There is no overhead whatsoever. The only downside is that, to achieve this, I had to step outside the rules of standard C++. I used the clandestine knowledge of member function pointers to get this to work. Efficient delegates are possible on any C++ compiler, if you are very careful, and if you don't mind some compiler-specific code in a few cases.
The core of my code is a class which converts an arbitrary class pointer and arbitrary member function pointer into a generic class pointer and a generic member function. C++ doesn't have a 'generic member function' type, so I cast to member functions of an undefined CGenericClass.
CGenericClass
Most compilers treat all member function pointers identically, regardless of the class. For most of them, a straightforward reinterpret_cast<> from the given member function pointer to the generic member function pointer would work. In fact, if this doesn't work, the compiler is non-standard. For the remaining compilers (Microsoft Visual C++ and Intel C++), we have to transform multiple- or virtual-inheritance member function pointers into single-inheritance pointers. This requires some template magic and a horrible hack. Note that the hack is only necessary because these compilers are not standards-compliant, but there is a nice reward: the hack gives optimal code.
reinterpret_cast<>
Since we know how the compiler stores member function pointers internally, and because we know how the this pointer needs to be adjusted for the function in question, we can adjust the this pointer ourselves when we are setting the delegate. For single inheritance pointers, no adjustment is required; for multiple inheritance, there's a simple addition; and for virtual inheritance ... it's a mess. But it works, and in most cases, all of the work is done at compile time!
How can we distinguish between the different inheritance types? There's no official way to find out whether a class used multiple inheritance or not. But there's a sneaky way, which you can see if you look at the table I presented earlier -- on MSVC, each inheritance style produces a member function pointer with a different size. So, we use template specialization based on the size of the member function pointer! For multiple inheritance, it's a trivial calculation. A similar, but much nastier calculation is used in the unknown_inheritance (16 byte) case.
For Microsoft's (and Intel's) ugly, non-standard 12 byte virtual_inheritance pointers, yet another trick is used, based on an idea invented by John Dlugosz. The crucial feature of Microsoft/Intel MFPs which we exploit is that the CODEPTR member is always called, regardless of the values of the other members. (This is not true for other compilers, e.g., GCC, which obtain the function address from the vtable if a virtual function is being called.) Dlugosz's trick is to make a fake member function pointer, in which the codeptr points to a probe function which returns the 'this' pointer that was used. When you call this function, the compiler does all the calculation work for you, making use of the secretive vtordisp value.
virtual_inheritance
CODEPTR
codeptr
Once you can cast any class pointer and member function pointer into a standard form, it's easy (albeit tedious) to implement single-target delegates. You just need to make template classes for all of the different numbers of parameters.
A very significant additional benefit of implementing delegates by this non-standard cast is that they can be compared for equality. Most existing delegate implementations can't do this, and this makes it difficult to use them for certain tasks, such as implementing multi-cast delegates [Sutter3].
Ideally, a simple non-member function, or a static member function, could be used as a delegate target. This can be achieved by converting the static function into a member function. I can think of two methods of doing this, in both of which the delegate points to an 'invoker' member function which calls the static function.
The Evil method uses a hack. You can store the function pointer instead of the this pointer, so that when the invoker function is called, it just needs to cast this into a static function pointer and call that. The nice thing about this is that it has absolutely no effect on the code for normal member functions. The problem with it is that it is a hack as it requires casting between code and data pointers. It won't work on systems where code pointers are larger than data pointers (DOS compilers using the medium memory model). It will work on all 32 and 64 bit processors that I know of. But because it's Evil, we need an alternative.
The Safe method is to store the function pointer as an extra member of the delegate. The delegate points to its own member function. Whenever the delegate is copied, these self-references must be transformed, and this complicates the = and == operators. This increases the size of the delegate by four bytes, and increases the complexity of the code, but it has no effect on the invocation speed.
=
I've implemented both methods, because both have merit: the Safe method is guaranteed to work, and the Evil method generates the same ASM code that a compiler would probably generate if it had native support for delegates. The Evil method can be enabled with a #define (FASTDELEGATE_USESTATICFUNCTIONHACK).
#define
FASTDELEGATE_USESTATICFUNCTIONHACK
Footnote: Why does the evil method work at all? If you look closely at the algorithm that is used by each compiler when invoking a member function pointer, you can see that for all those compilers, when a non-virtual function is used with single inheritance (ie delta=vtordisp=vindex=0), the instance pointer doesn't enter into the calculation of what function to call. So, even with a garbage instance pointer, the correct function will be called. Inside that function, the this pointer that is received will be garbage + delta = garbage. (To put it another way -- garbage in, unmodified garbage out!) And at that point we can convert our garbage back into a function pointer. This method would not work if the "static function invoker" was a virtual function.
delta=vtordisp=vindex=0
garbage + delta = garbage
The source code consists of the FastDelegate implementation (FastDelegate.h), and a demo .cpp file to illustrate the syntax. To use with MSVC, create a blank console app, and add these two files to it. For GNU, just type "g++ demo.cpp" on the command line.
The fast delegates will work with any combination of parameters, but to make it work on as many compilers as possible, you have to specify the number of parameters when declaring the delegate. There is a maximum of eight parameters, but it's trivial to increase this limit. The namespace fastdelegate is used. All of the messiness is in an inner namespace called detail.
fastdelegate
detail
Fastdelegates can be bound to a member function or a static (free) function, using the constructor or bind(). They default to 0 (null). They can also be set to null with clear(). They can be tested for null using operator ! or empty().
Fastdelegate
bind()
null
clear()
!
empty()
Unlike most other implementations of delegates, equality operators (==, !=) are provided. They work even when inline functions are involved.
Here's an excerpt from FastDelegateDemo.cpp which shows most of the allowed operations. CBaseClass is a virtual base class of CDerivedClass. A flashy example could easily be devised; this is just to illustrate the syntax.
CBaseClass
CDerivedClass
using namespace fastdelegate;
int main(void)
{
// Delegates with up to 8 parameters are supported.
// Here's the case for a void function.
// We declare a delegate and attach it to SimpleVoidFunction()
printf("-- FastDelegate demo --\nA no-parameter
delegate is declared using FastDelegate0\n\n");
FastDelegate0 noparameterdelegate(&SimpleVoidFunction);
noparameterdelegate();
// invoke the delegate - this calls SimpleVoidFunction()
printf("\n-- Examples using two-parameter delegates (int, char *) --\n\n");
typedef FastDelegate2<int, char *> MyDelegate;
MyDelegate funclist[10]; // delegates are initialized to empty
CBaseClass a("Base A");
CBaseClass b("Base B");
CDerivedClass d;
CDerivedClass c;
// Binding a simple member function
funclist[0].bind(&a, &CBaseClass::SimpleMemberFunction);
// You can also bind static (free) functions
funclist[1].bind(&SimpleStaticFunction);
// and static member functions
funclist[2].bind(&CBaseClass::StaticMemberFunction);
// and const member functions
funclist[3].bind(&a, &CBaseClass::ConstMemberFunction);
// and virtual member functions.
funclist[4].bind(&b, &CBaseClass::SimpleVirtualFunction);
// You can also use the = operator. For static functions,
// a fastdelegate looks identical to a simple function pointer.
funclist[5] = &CBaseClass::StaticMemberFunction;
// The weird rule about the class of derived
// member function pointers is avoided.
// Note that as well as .bind(), you can also use the
// MakeDelegate() global function.
funclist[6] = MakeDelegate(&d, &CBaseClass::SimpleVirtualFunction);
// The worst case is an abstract virtual function of a
// virtually-derived class with at least one non-virtual base class.
// This is a VERY obscure situation, which you're unlikely to encounter
// in the real world, but it's included as an extreme test.
funclist[7].bind(&c, &CDerivedClass::TrickyVirtualFunction);
// ...BUT in such cases you should be using the base class as an
// interface, anyway. The next line calls exactly the same function.
funclist[8].bind(&c, &COtherClass::TrickyVirtualFunction);
// You can also bind directly using the constructor
MyDelegate dg(&b, &CBaseClass::SimpleVirtualFunction);
char *msg = "Looking for equal delegate";
for (int i=0; i<10; i++) {
printf("%d :", i);
// The ==, !=, <=,<,>, and >= operators are provided
// Note that they work even for inline functions.
if (funclist[i]==dg) { msg = "Found equal delegate"; };
// There are several ways to test for an empty delegate
// You can use if (funclist[i])
// or if (!funclist.empty())
// or if (funclist[i]!=0)
// or if (!!funclist[i])
if (funclist[i]) {
// Invocation generates optimal assembly code.
funclist[i](i, msg);
} else {
printf("Delegate is empty\n");
};
}
};
Version 1.3 of the code adds the ability to have non-void return values. Like std::unary_function, the return type is the last parameter. It defaults to void, which preserves backwards compatibility, and also means that the most common case remains simple. I wanted to do this without losing performance on any platform. It turned out to be easy to do this for any compiler except MSVC6. There are two significant limitations of VC6:
std::unary_function
void
I've got around it with two tricks:
DefaultVoid
const void *
EAX
There is one breaking change: all instances of FastDelegate0 must be changed to FastDelegate0<>. This change can be performed with a global search-and-replace through all your files, so I believe it should not be too onerous. I believe this change leads to more intuitive syntax: the declaration of any kind of void FastDelegate is now the same as a function declaration, except that () is replaced with <>. If this change really annoys anyone, you can modify the header file: wrap the FastDelegate0<> definition inside a separate namespace newstyle { and } typedef newstyle::FastDelegate0<> FastDelegate0;. You would need to change the corresponding MakeDelegate function too.
FastDelegate0
FastDelegate0<>
void FastDelegate
()
<>
namespace newstyle {
} typedef newstyle::FastDelegate0<> FastDelegate0;
MakeDelegate
The MakeDelegate template allows you to use a FastDelegate as a drop-in replacement for a function pointer. A typical application is to have a FastDelegate as a private member of a class and use a modifier function to set it (like a Microsoft __event). For example:
FastDelegate
// Accepts any function with a signature like: int func(double, double);
class A {
public:
typedef FastDelegate2<double, double, int> FunctionA;
void setFunction(FunctionA somefunc){ m_HiddenDelegate = somefunc; }
private:
FunctionA m_HiddenDelegate;
};
// To set the delegate, the syntax is:
A a;
a.setFunction( MakeDelegate(&someClass, &someMember) ); // for member functions, or
a.setFunction( &somefreefunction ); // for a non-class or static function
Jody Hagins has enhanced the FastDelegateN classes to allow the same attractive syntax provided by recent versions of Boost.Function and Boost.Signal. On compilers with partial template specialization, you have the option of writing FastDelegate< int (char *, double)> instead of FastDelegate2<char *, double, int>. Fantastic work, Jody! If your code needs to compile on VC6, VC7.0, or Borland, you need to use the old, portable syntax. I've made changes to ensure that the old and new syntax are 100% equivalent and can be used interchangeably.
Boost.Function
Boost.Signal
FastDelegate< int (char *, double)>
FastDelegate2<char *, double, int>
Jody also contributed a helper function, bind, to allow code written for Boost.Function and Boost.Bind to be rapidly converted to FastDelegates. This allows you to quickly determine how much the performance of your existing code would improve if you switched to FastDelegates. It can be found in "FastDelegateBind.h". If we have the code:
bind
Boost.Bind
using boost::bind;
bind(&Foo:func, &foo, _1, _2);
we should be able to replace the "using" with using fastdelegate::bind and everything should work fine. Warning: The arguments to bind are ignored! No actual binding is performed. The behavior is equivalent to boost::bind only in the trivial (but most common) case where only the basic placeholder arguments _1, _2, _3, etc. are used. A future release may support boost::bind properly.
using
using fastdelegate::bind
boost::bind
_1, _2, _3,
FastDelegates of the same type can now be compared with <, >, <=, >=. Member function pointers don't support these operators, but they can be emulated with a simple binary comparison using memcmp(). The resulting strict weak ordering is physically meaningless, and is compiler-dependent, but it allows them to be stored in ordered containers like std:set.
memcmp()
std:set
A new class, DelegateMemento, is provided to allow disparate collections of delegates. Two extra members have been added to each FastDelegate class:
DelegateMemento
const DelegateMemento GetMemento() const;
void SetMemento(const DelegateMemento mem);
DelegegateMementos can be copied and compared to one another (==, !=, >, <, >=, <=), allowing them to be stored in any ordered or unordered container. They can be used as a replacement for a union of function pointers in C. As with a union of disparate types, it is your responsibility to ensure that you are using the same type consistently. For example, if you get a DelegateMemento from a FastDelegate2 and save it into a FastDelegate3, your program will probably crash at runtime when you invoke it. In the future, I may add a debug mode which uses the typeid operator to enforce type safety. DelegateMementos are intended primarily for use in other libraries, rather than in general user code. An important usage is Windows messaging, where a dynamic std::map<MESSAGE, DelegateMemento> can replace the static message maps found in MFC and WTL. But that's another article.
DelegegateMemento
FastDelegate2
FastDelegate3
typeid
std::map<MESSAGE, DelegateMemento>
You can now use the if (dg) {...} syntax (where dg is a fast delegate) as an alternative to if (!dg.empty()), if (dg!=0) or even the ugly but efficient if (!!dg). If you're just using the code, all you need to know is that it works correctly on all compilers, and it does not inadvertently allow other operations.
if (dg) {...}
dg
if (!dg.empty())
if (dg!=0)
if (!!dg)
The implementation was more difficult than expected. Merely supplying an operator bool is dangerous because it lets you write things like int a = dg; when you probably meant int a = dg();. The solution is to use the Safe Bool idiom [Karlsson]: a conversion to a private member data pointer is used instead of bool. Unfortunately, the usual Safe Bool implementation mucks up the if (dg==0) syntax, and some compilers have bugs in their implementations of member data pointers (hmm, another article?), so I had to develop a couple of tricks. One method which others have used in the past is to allow comparisons with integers, and ASSERT if the integer is non-zero. Instead, I use a more verbose method. The only side-effect is that comparisons with function pointers are more optimal! Ordered comparisons with the constant 0 are not supported (but it is valid to compare with a function pointer which happens to be null).
operator bool
int a = dg;
int a = dg();
if (dg==0)
ASSERT
The source code attached to this article is released into the public domain. You may use it for any purpose. Frankly, writing the article was about ten times as much work as writing the code. Of course, if you create great software using the code, I would be interested to hear about it. And submissions are always welcome.
Because it relies on behavior that is not defined by the standard, I've been careful to test the code on many compilers. Ironically, it's more portable than a lot of 'standard' code, because most compilers don't fully conform to the standard. It has also become safer through being widely known. The major compiler vendors and several members of the C++ Standards commitee know about the techniques presented here (in many cases, the lead compiler developers have contacted me about the article). There is negligible risk that vendors will make a change that would irreparably break the code. For example, no changes were required to support Microsoft's first 64 bit compilers. Codeplay has even used FastDelegates for internal testing of their VectorC compiler (it's not quite an endorsement, but very close).
The FastDelegate implementation has been been tested on Windows, DOS, Solaris, BSD, and several flavors of Linux, using x86, AMD64, Itanium, SPARC, MIPS, .NET virtual machines, and some embedded processors. The following compilers have been tested successfully:
Here is the status of all other C++ compilers that I know of which are still in use:
And yet some people are still complaining that the code is not portable! (Sigh).
What started as an explanation of a few lines of code I'd written has turned into a monstrous tutorial on the perils of an obscure part of the language. I also discovered previously unreported bugs and incompatibilities in six popular compilers. It's an awful lot of work for two lines of assembly code!
I hope that I've cleared up some of the misconceptions about the murky world of member function pointers and delegates. We've seen that much of the weirdness of member function pointers arise because they are implemented very differently by various compilers. We've also seen that, contrary to popular opinion, delegates are not a complicated, high-level construct, but are in fact very simple. I hope that I've convinced you that they should be part of the language. There is a reasonable chance that some form of direct compiler support for delegates will be added to C++ when the C++0x standard is released. (Start lobbying the Standards committee!)
To my knowledge, no previous implementation of delegates in C++ is as efficient or easy to use as the FastDelegates I've presented here. It may amuse you to learn that most of it was programmed one-handed while I tried to get my baby daughter to sleep... I hope you find it useful.
I've looked at dozens of websites while researching this article. Here are a few of the most interesting ones:
Boost::signals
operator ->*
std::tr1::function
MakeDelegate()
fastdelegate.clear()
FASTDELEGATEDECLARE
FastDelegate::empty()
dg==0
dg.empty()
dg=0
dg.clear()
true
if (dg)
This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)
void test1() {
cout << "test1 called. ";
}
int _tmain(int argc, _TCHAR* argv[]) {
FastDelegate< void() > mywrapper = &test1;
mywrapper();
cout << ( mywrapper == &test1 ? "Correct" : "Wrong" ) << endl;
return 0;
}
inline bool IsEqualToStaticFuncPtr(StaticFuncPtr funcptr){
if (funcptr==0) return empty();
// For the Evil method, if it doesn't actually contain a static function, this will return an arbitrary
// value that is not equal to any valid function pointer.
else return funcptr==reinterpret_cast<StaticFuncPtr>(GetStaticFunction());
}
else return funcptr==reinterpret_cast<StaticFuncPtr>(m_pthis);
typedef DesiredRetType result_type;
switch(state_variable)
void StateFunction1(void){
// do work pertaining to being in state 1
if (/*need to change state*/)
pStateFunction = StateFunction2;
}
void StateFunction2(void){
// do work pertaining to being in state 2
if (/*need to change state*/)
pStateFunction = StateFunction1;
}
void run(void){ // execute the current state function
if (pStateFunction)
(*pStateFunction)();
}
FastDelegate.h: In copy constructor `
fastdelegate::DelegateMemento::DelegateMemento(const
fastdelegate::DelegateMemento&)':
FastDelegate.h:565: warning: `
fastdelegate::DelegateMemento::m_pFunction' will be initialized after
FastDelegate.h:564: warning: `
fastdelegate::detail::GenericClass*fastdelegate::DelegateMemento::m_pthis'
m_pthis(right.m_pthis), m_pFunction(right.m_pFunction)
pParent
inline void CopyFrom (DerivedClass *, const DelegateMemento &right) {
#include <memory.h>
class BaseClass
{
};
class DerivedClass : public BaseClass
{
};
void myMethod(BaseClass* a)
{
}
int main()
{
FastDelegate1<DerivedClass*, void> myDelegate(&myMethod);
return 0;
}
#define bool int1
TestUnit oUnit;
typedef FastDelegate0<int1> MyDelegate;
MyDelegate noparameterdelegate; noparameterdelegate=MakeDelegate<TestUnit,HFBaseTestUnit<TestData>,int1>(&oUnit,&HFBaseTestUnit<TestData>::test<1>);
TestUnit obj;
typedef int1 (BaseTestUnit::*testmethod)();
testmethod tm=&BaseTestUnit::test<1>;
(obj.*tm)();
struct TestData
{
}
typedef HBaseTestUnit<TestData> BaseTestUnit;
class TestUnit: public BaseTestUnit
{
public:
TestUnit()
{
}
~TestUnit()
{
};
};
template <class Data>
class HBaseTestUnit: public Data
{
public:
/**
* Default do-nothing test.
*/
template <int n>
int1 test()
{
return FALSE;
};
};
}
template<>
template<>
int1 BaseTestUnit::test<1>()
{
return TRUE;
}
//N=0
template <class X, class Y, class RetType>
FastDelegate0<FASTDLGT_RETTYPE> MakeDelegate(Y* x, RetType (X::*func)()) {
return FastDelegate0<FASTDLGT_RETTYPE>(x, func);
}
noparameterdelegate=MakeDelegate<HBaseTestUnit<TestData>,TestUnit,int1>(&oUnit,&HBaseTestUnit<TestData>::test<1>);
General News Suggestion Question Bug Answer Joke Rant Admin
Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.
|
http://www.codeproject.com/Articles/7150/Member-Function-Pointers-and-the-Fastest-Possible?msg=3240087
|
CC-MAIN-2014-52
|
en
|
refinedweb
|
28 January 2010 21:34 [Source: ICIS news]
WASHINGTON (ICIS news)--US chemical, energy and general manufacturing firms on Thursday welcomed President Barack Obama’s new call for expanded domestic energy production and exports, and expressed hope that he has abandoned cap-and-trade climate legislation.
The American Chemistry Council (ACC) noted that in his Wednesday night state of the union speech, the president “recognised the need for expanded domestic energy development in the form of new offshore oil and natural gas production”.
In his address to a joint session of Congress, Obama refocused his administration on jobs creation, putting special emphasis on policies to generate “clean energy jobs”, such as production of solar cells, wind turbines and advanced batteries.
“But to create more of these clean energy jobs,” Obama said, “we need more production, more efficiency, more incentives. And that means building a new generation of safe, clean nuclear power plants in this country”.
“It means making tough decisions about opening new offshore areas for oil and gas development,” Obama added, “And it means passing a comprehensive energy and climate bill with incentives that will finally make clean energy the profitable kind of energy in ?xml:namespace>
Charles Drevna, president of the National Petrochemical & Refiners Association (NPRA), noted that while Obama made reference to the climate change legislation that narrowly passed in the US House last year, “he declined to aggressively promote cap-and-trade climate change legislation, favouring instead incentives for innovation and greater efficiencies”.
“Aside from promoting new ‘green jobs’, we hope that President Obama will focus on preserving and creating red, white and blue jobs,” Drevna added, referring to workers in the US oil, natural gas, refining and petrochemical sectors.
Bill Allmond, vice president for government relations at the Society of Chemical Manufacturers and Affiliates (SOCMA), also welcomed Obama’s call for jobs creation and the president’s goal of doubling US exports in five years.
“But for all the talk about the need to create jobs,” said Allmond, “it was disappointing that the president did not mention how he would specifically assist US manufacturers, who are the drivers behind job creation, innovation and international trade - the things he mentioned as critical to recovery.”
He hailed the president’s declared plan to eliminate capital gains taxes on small businesses that hire new workers, but Allmond also said he was disappointed that Obama did not call for a permanent research and development (R&D) tax credit.
Chris Jahn, president of the National Association of Chemical Distributors (NACD), said he was encouraged by Obama’s pledge to create more jobs.
“We as an industry can only hope that this includes job creation in the domestic manufacturing sector,” Jahn said.
Incentives to revive US manufacturing “would go a long way toward helping our economy recover, as it will result in growth throughout the supply chain, including chemical distribution”, Jahn added.
The American Petroleum Institute (API) also welcomed the president’s renewed attention to offshore oil and gas development, with API president Jack Gerard noting that “Greater access to
“But to create these jobs,” Gerard added, “we will need policies that allow investment and development - policies that are pro-job, pro-consumer and pro-energy.”
Gerard and others in the
The Natural Gas Supply Association (NGSA) was cautious about the president’s call for “tough decisions about opening new offshore area for oil and gas development”.
“We wish he had announced a more clear vision for offshore drilling,” said Skip Horvath, NGSA president.
Thomas Pyle, president of the energy industry think-tank Institute for Energy Research (IER), charged that despite Obama’s call for more domestic energy production, “the president and his administration continue to add layers of red tape and bureaucratic hurdles on access to home-grown energy”.
Pyle noted that according to Department of the Interior (DOI) data, in 2009 “this administration has leased less taxpayer-owned land than any other year on record during its first year in office, while realising only one-tenth the amount of revenue from leasing federal lands in 2008”.
The US Chamber of Commerce also hailed the president's shift to jobs creation and boosting US exports. But chamber president Tom Donohue said that the administration and Congress must act to "ease the uncertainties - in tax, health, environmental, labour, legal and fiscal policies - that are hampering economic
|
http://www.icis.com/Articles/2010/01/28/9329860/US-chemical-energy-sectors-welcome-new-Obama-focus.html
|
CC-MAIN-2014-52
|
en
|
refinedweb
|
06 December 2010 11:20 [Source: ICIS news]
SINGAPORE (ICIS)--BASF and Petronas are considering jointly investing around €1bn ($1.34bn) to produce specialty chemicals in ?xml:namespace>
The German chemicals giant and the Malaysian oil and gas firm have signed a memorandum of understanding to undertake a feasibility study of the project, due to be completed next year, they said in a joint statement.
The study would check on the technical, commercial and economic viability of jointly owning and operating world-scale facilities for the production of specialty chemicals, including non-ionic surfactants, methanesulphonic acid, iso-nonanol as well as other C4-based specialty chemical products.
"The development of a new specialty chemical products portfolio is an important component of Petronas' plan to further grow the downstream petrochemical business as part of its integrated plan to be a key player in the region,” said Datuk Wan Zulkiflee Wan Ariffin, executive vice president for Petronas' downstream business.
He added that this project would also spur domestic investments in the oil, gas and petrochemical industries.
BASF board director Martin Brudermuller said: “By expanding our local production base in
The investment was in line with the German firm’s goal of producing 70% of Asia Pacific sales in the region by 2020, with investments of €2bn between 2009 and 2013.
The companies have an existing joint venture in
“As for the subsequent phase of the collaboration, Petronas Chemicals Group (PCG) and BASF will jointly evaluate the outcome of the joint feasibility study and will adopt it as part of their strategic growth plans, if technically and commercially viable,” the companies’ statement said.
PCG comprises the 22 petrochemical-related businesses of Petronas.
($1 = €0.75)
|
http://www.icis.com/Articles/2010/12/06/9416766/basf-petronas-consider-1bn-malaysia-specialty-chem-investment.html
|
CC-MAIN-2014-52
|
en
|
refinedweb
|
Copy New Files Only in .NET
Recently I had a client that had a need to copy files from one folder to another. However, there was a process that was running that would dump new files into the original folder every minute or so. So, we needed to be able to copy over all the files one time, then also be able to go back a little later and grab just the new files.
After looking into the System.IO namespace, none of the classes within here met my needs exactly. Of course I could build it out of the various File and Directory classes, but then I remembered back to my old DOS days (yes, I am that old!). The XCopy command in DOS (or the command prompt for you pure Windows people) is very powerful. One of the options you can pass to this command is to grab only newer files when copying from one folder to another. So instead of writing a ton of code I decided to simply call the XCopy command using the Process class in .NET.
The command I needed to run at the command prompt looked like this:
XCopy C:\Original\*.* D:\Backup\*.* /q /d /y
What this command does is to copy all files from the Original folder on the C drive to the Backup folder on the D drive. The /q option says to do it quitely without repeating all the file names as it copies them. The /d option says to get any newer files it finds in the Original folder that are not in the Backup folder, or any files that have a newer date/time stamp. The /y option will automatically overwrite any existing files without prompting the user to press the "Y" key to overwrite the file.
To translate this into code that we can call from our .NET programs, you can write the CopyFiles method presented below.
C#
using System.Diagnostics
public void CopyFiles(string source, string destination)
{
ProcessStartInfo si = new ProcessStartInfo();
string args = @"{0}\*.* {1}\*.* /q /d /y";
args = string.Format(args, source, destination);
si.FileName = "xcopy";
si.Arguments = args;
Process.Start(si);
}
VB.NET
Imports System.Diagnostics
Public Sub CopyFiles(source As String, destination As String)
Dim si As New ProcessStartInfo()
Dim args As String = "{0}\*.* {1}\*.* /q /d /y"
args = String.Format(args, source, destination)
si.FileName = "xcopy"
si.Arguments = args
Process.Start(si)
End Sub
The CopyFiles method first creates a ProcessStartInfo object. This object is where you fill in name of the command you wish to run and also the arguments that you wish to pass to the command. I created a string with the arguments then filled in the source and destination folders using the string.Format() method. Finally you call the Start method of the Process class passing in the ProcessStartInfo object. That's all there is to calling any command in the operating system. Very simple, and much less code than it would have taken had I coded it using the various File and Directory classes.
Good Luck with your Coding,
Paul Sheriff
** SPECIAL OFFER FOR MY BLOG READERS **
Visit for a free video on Silverlight entitled Silverlight XAML for the Complete Novice - Part 1.
|
http://weblogs.asp.net/psheriff/copy-new-files-only-in-net
|
CC-MAIN-2014-52
|
en
|
refinedweb
|
25 April 2012 16:07 [Source: ICIS news]
LONDON (ICIS)--Petroplus’s refinery in Coryton in the ?xml:namespace>
PricewaterhouseCoopers (PwC) received bids for the refinery – which is located 28 miles (48km) from central London in Essex – on 2 April and said a deal could involve refinancing, a sale or an extension of its tolling agreement.
PwC partner Steven Pearson, the joint administrator, said: “If we don’t do a deal by mid-May there is a very real risk that the refinery will be closed.”
In February, PwC signed a tolling agreement involving a collaboration of investment firms, including Morgan Stanley Capital Group Inc and AtlasInvest.
Under the tolling agreement, crude oil has been delivered to the 220,000 bbl/day refinery for processing for an initial period of three months, which ends in May.
In March, Petroplus administrators in
Petroplus said in January it was to file for insolvency, after lenders froze about $1bn (€760m) in credit lines in December
|
http://www.icis.com/Articles/2012/04/25/9553715/petroplus-coryton-refinery-needs-deal-by-mid-may-or-risks.html
|
CC-MAIN-2014-52
|
en
|
refinedweb
|
Database Replication with Slony-I
Listing 2. subscribe'; subscribe set (id = 1, provider = 1, receiver = 2, forward = yes);
Much like Listing 1, subscribe.sh starts by defining the cluster namespace and the connection information for the two nodes. Once completed, the subscribe set command causes the first node to start replicating the set containing a single table and sequence to the second node using the slon processes.
Once the subscribe.sh script has been executed, connect to the contactdb_slave database and examine the content of the contact table. At any moment, you should see that the information was replicated correctly:
% psql -U contactuser contactdb_slave contactdb_slave=> select * from contact; cid | name | address | phonenumber -----+--------+--------------+---------------- 1 | Joe | 1 Foo Street | (592) 471-8271 2 | Robert | 4 Bar Roard | (515) 821-3831
Now, connect to the /contactdb/ database and insert a row:
% psql -U contact contactdb contactdb=> begin; insert into contact (cid, name, address, phonenumber) values ((select nextval('contact_seq')), 'William', '81 Zot Street', '(918) 817-6381'); commit;
If you examine the content of the contact table of the contactdb_slave database once more, you will notice that the row was replicated. Now, delete a row from the /contactdb/ database:
contactdb=> begin; delete from contact where cid = 2; commit;
Again, by examining the content of the contact table of the contactdb_slave database, you will notice that the row was removed from the slave node correctly.
Instead of comparing the information for contactdb and contactdb_slave manually, we easily can automate this process with a simple script, as shown in Listing 3. Such a script could be executed regularly to ensure that all nodes are in sync, notifying the administrator if that is no longer the case.
Listing 3. compare.sh
#!/bin/sh CLUSTER=sql_cluster DB1=contactdb DB2=contactdb_slave H1=localhost H2=localhost U=postgres echo -n "Comparing the databases..." psql -U $U -h $H1 $DB1 >dump.tmp.1.$$ <<_EOF_ select 'contact'::text, cid, name, address, phonenumber from contact order by cid; _EOF_ psql -U $U -h $H2 $DB2 >dump.tmp.2.$$ <<_EOF_ select 'contact'::text, cid, name, address, phonenumber from contact order by cid; _EOF_ if diff dump.tmp.1.$$ dump.tmp.2.$$ >dump.diff ; then echo -e "\nSuccess! Databases are identical." rm dump.diff else echo -e "\nFAILED - see dump.diff." fi rm dump.tmp.?.$$
Although replicating a database on the same system isn't of much use, this example shows how easy it is to do. If you want to experiment with a replication system on nodes located on separate computers, you simply would modify the DB2, H1 and H2 environment variables from Listing 1 to 3. Normally, DB2 would be set to the same value as DB1, so an application always refers to the same database name. The host environment variables would need to be set to the fully qualified domain name of the two nodes. You also would need to make sure that the slon processes are running on both computers. Finally, it is good practice to synchronize the clocks of all nodes using ntpd or something similar.
Later, if you want to add more tables or sequences to the initial replication set, you can create a new set and use the merge set slonik command. Alternatively, you can use the set move table and set move sequence commands to split the set. Refer to the Slonik Command summary for more information on this.
In case of a failure from the master node, due to an operating system crash or hardware problem, for example, Slony-I does not provide any automatic capability to promote a slave node to become a master. This is problematic because human intervention is required to promote a node, and applications demanding highly available database services should not depend on this. Luckily, plenty of solutions are available that can be combined with Slony-I to offer automatic failover capabilities. The Linux-HA Heartbeat program is one of them.
Consider Figure 2, which shows a master and slave node connected together using an Ethernet and serial link. In this configuration, the Heartbeat is used to monitor the node's availability through those two links. The application makes use of the database services by connecting to PostgreSQL through an IP alias, which is activated on the master node by the Heartbeat. If the Heartbeat detects that the master node has failed, it brings the IP alias up on the slave node and executes the slonik script to promote the slave as the new master.
The script is relatively simple. Listing 4 shows the content of the script that would be used to promote a slave node, running on slave.example.com, so it starts offering all the database services that master.example.com?
|
http://www.linuxjournal.com/article/7834?page=0,2&quicktabs_1=0
|
CC-MAIN-2014-52
|
en
|
refinedweb
|
Candlestick Charts in Python
How to make interactive candlestick charts in Python with Plotly. Six examples of candlestick charts with Pandas, time series, and yahoo finance data.. called increasing (decreasing). By default, increasing candles are drawn in green whereas decreasing are drawn in red.
Simple Candlestick with Pandas¶
import plotly.graph_objects as go import pandas as pd from datetime import datetime df = pd.read_csv('') fig = go.Figure(data=[go.Candlestick(x=df['Date'], open=df['AAPL.Open'], high=df['AAPL.High'], low=df['AAPL.Low'], close=df['AAPL.Close'])])(xaxis_rangeslider_visible=False) fig.show()
Candlestick( title='The Great Recession', yaxis_title='AAPL Stock', shapes = [dict( x0='2016-12-09', x1='2016-12-09', y0=0, y1=1, xref='x', yref='paper', line_width=2)], annotations=[dict( x='2016-12-09', y=0.05, xref='x', yref='paper', showarrow=False, xanchor='left', text='Increase Period Begins')] )'], increasing_line_color= 'cyan', decreasing_line_color= 'gray' )]) fig.show()
import plotly.graph_objects as go from datetime import datetime open_data = [33.0, 33.3, 33.5, 33.0, 34.1] high_data = [33.1, 33.3, 33.6, 33.2, 34.8] low_data = [32.7, 32.7, 32.8, 32.6, 32.8] close_data = [33.0, 32.9, 33.3, 33.1, 33.1] dates = [datetime(year=2013, month=10, day=10), datetime(year=2013, month=11, day=10), datetime(year=2013, month=12, day=10), datetime(year=2014, month=1, day=10), datetime(year=2014, month=2, day=10)] fig = go.Figure(data=[go.Candlestick(x=dates, open=open_data, high=high_data, low=low_data, close=close_data)]) fig.show()
Reference¶
For more information on candlestick attributes, see:<<
|
https://plotly.com/python/candlestick-charts/
|
CC-MAIN-2021-39
|
en
|
refinedweb
|
On Thu, Nov 10, 2011 at 1:19 PM, Dimitri Fontaine <dimi...@2ndquadrant.fr> wrote: > Now the aim would be to be able to implement the operation you describe > by using the new segment map, which is an index pointing to sequential > ranges of on-disk blocks where the data is known to share a common key > range over the columns you're segmenting on. I would imagine this SQL: > > TRUNCATE foo WHERE year < 2009; > > As the on-disk location of the data that qualify this WHERE clause is > known, it could be possible to (predicate) lock it and bulk remove it, > unlinking whole segments (1GB) at a time when relevant.
I am basically in agreement with you. After wanting better partitioning (Oracle-style) in Postgres for some time just to be free of the mechanically painful table-inheritance version, I have come around to thinking it's basically a bad idea, but one that with a little bit of finessing can be made a good idea. The reason I have started to think this is because of an old feature that works very well: CREATE INDEX. In spite of what people might think, I think it's pretty clear that CREATE INDEX is not DDL: it's actually physical advice to the system. I have seen the fourth-generation-language promise delivered upon quite a few times in production, now: we witness an access pattern that becomes problematic, we run CREATE INDEX CONCURRENTLY, the problem is solved without any change to the application, and the index definition is backported to our application bootstrapping process. It would be hard for me to understate how valuable this has been to avoid both premature optimization and excessive panic when dealing with change. Similar to the overall project stance on query hints, I don't think Postgres should retreat on its ground from being a 4GL system. I think both indexes and a hypothetical partitioning feature should be clearly isolated as directives to the system about how to physically organize and access data, and any partitioning feature that creates new relation namespace entries and expects you to manipulate them to gain the benefits seems like extra, non-desirable surface area to me. I think this becomes especially apparent once one considers on-line repartitioning (I am exposing a bias here, but any feature in Postgres that cannot be done concurrently -- like VACUUM FULL -- is very dangerous to both me and my customers, whereas it may not be useless or dangerous to a build-your-own data warehouse). It feels like it would be desirable to have the physical partitions exist in an inconsistent-state whereby they are being brought into alignment with the newly desired physical description. Finally, I think a legitimate objection to this inclination is that it can be really easy to issue a DELETE that is usually fast, but when any mistake or change creeps in becomes very slow: I have heard from some friends making heavy use of table partitioning via inheritance that one of the problems is not quite exactly matching the table constraint, and then hosing their hardware. As a result, they mangle partitions explicitly in the application to prevent foot-gunning. That's clearly lame (and they know it), but I think may indicate a need to instead allow for some kind of physical-access-method assertion checking quite apart from the logical content of the query that can deliver a clear, crisp error to application developers if a preferred access pattern is not usable. My experience suggests that while solving problems is good, turning problems into flat-out errors is *nearly* as good, and worth some more investigation. -- fdr -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription:
|
https://www.mail-archive.com/pgsql-hackers@postgresql.org/msg187404.html
|
CC-MAIN-2021-39
|
en
|
refinedweb
|
API:
Stores #
Flux stores are where you keep your application's state and handle business logic that reacts to data events. Stores in Fluxible are just classes that adhere to a simple interface. Because we want stores to be able to be completely decoupled from Fluxible, we do not provide any store implementation in our default exports, however you can use the helper utilities for creating your stores.
import {EventEmitter} from 'events'; class ApplicationStore extends EventEmitter { constructor (dispatcher) { super(dispatcher); this.dispatcher = dispatcher; // Provides access to waitFor and getStore methods this.currentPageName = null; } handleReceivePage (payload) { this.currentPageName = payload.pageName; this.emit('change'); } getCurrentPageName () { return this.currentPageName; } // For sending state to the client dehydrate () { return this.getState(); } // For rehydrating server state rehydrate (state) { this.currentPageName = state.currentPageName; } } ApplicationStore.storeName = 'ApplicationStore'; ApplicationStore.handlers = { 'RECEIVE_PAGE': 'handleReceivePage' }; export default ApplicationStore;
Helper Utilities #
Fluxible provides a couple of helpers for building stores with some default behavior and convenience methods.
- BaseStore - Store class that can be extended
- createStore - function for creating a class that extends
BaseStore
Interface #
Constructor #
The store should have a constructor function that will be used to instantiate
your store using
new Store(dispatcher) where the parameters are as
follows:
dispatcher: An object providing access to the following methods:
dispatcher.getContext(): Retrieve the store context
dispatcher.getStore(storeClass)
dispatcher.waitFor(storeClass[], callback)
The constructor is also where the initial state of the store should be set.
class ExampleStore { constructor (dispatcher) { this.dispatcher = dispatcher; if (this.initialize) { this.initialize(); } } }
Notifying clients of changes and subscribing to a store #
A fluxible store must implement the
EventEmitter interface and use it to
.emit('change') whenever the store contents change. Clients can subscribe to updates to the store by adding a listener using
on('change', handler).
class ExampleStore extends EventEmitter { // ... }
Static Properties #
storeName #
The store should define a static property that gives the name of the store. This is used internally and for debugging purposes.
ExampleStore.storeName = 'ExampleStore';
handlers #
The store should define a static property that maps action names to handler functions or method names. These functions will be called in the event that an action has been dispatched by the Dispatchr instance.
ExampleStore.handlers = { 'NAVIGATE': 'handleNavigate', 'default': 'defaultHandler' // Called for any action that has not been otherwise handled };
The handler function will be passed two parameters:
payload: An object containing action information.
actionName: The name of the action. This is primarily useful when using the
defaulthandler
class ExampleStore { handleNavigate (payload, actionName) { this.navigating = true; this.emit('change'); // Component may be listening for changes to state } }
If you prefer to define private methods for handling actions, you can use a static function instead of a method name. This function will be bound to the store instance when it is called:
ExampleStore.handlers = { 'NAVIGATE': function handleNavigate(payload, actionName) { // bound to store instance this.navigating = true; this.emit('change'); } };
Instance Methods #
dehydrate() #
The store should define this function to dehydrate the store if it will be shared between server and client. It should return a serializable data object that will be passed to the client.
class ExampleStore { dehydrate () { return { navigating: this.navigating }; } }
rehydrate(state) #
The store should define this function to rehydrate the store if it will be
shared between server and client. It should restore the store to the original
state using the passed
state.
class ExampleStore { rehydrate (state) { this.navigating = state.navigating; } }
shouldDehydrate() #
The store can optionally define this function to control whether the store state should be dehydrated by the dispatcher. This method should return a boolean. If this function is undefined, the store will always be dehydrated (just as if true was returned from method).
class ExampleStore { shouldDehydrate () { return true; } }
Store Context #
The store context by default contains no methods, but can be modified by plugins.
|
https://fluxible.io/api/stores.html
|
CC-MAIN-2021-39
|
en
|
refinedweb
|
Wind Rose and Polar Bar Charts in Python
How to graph wind rose charts in python. Wind Rose charts display wind speed and direction of a given location..
Wind Rose Chart with Plotly Express¶
A wind rose chart (also known as a polar bar chart) is a graphical tool used to visualize how wind speed and direction are typically distributed at a given location. You can use the
px.bar_polar function from Plotly Express as below, otherwise use
go.Barpolar as explained in the next section.
Plotly Express is the easy-to-use, high-level interface to Plotly, which operates on a variety of types of data and produces easy-to-style figures.
import plotly.express as px df = px.data.wind() fig = px.bar_polar(df, r="frequency", theta="direction", color="strength", template="plotly_dark", color_discrete_sequence= px.colors.sequential.Plasma_r) fig.show()
import plotly.graph_objects as go fig = go.Figure() fig.add_trace(go.Barpolar( r=[77.5, 72.5, 70.0, 45.0, 22.5, 42.5, 40.0, 62.5], name='11-14 m/s', marker_color='rgb(106,81,163)' )) fig.add_trace(go.Barpolar( r=[57.5, 50.0, 45.0, 35.0, 20.0, 22.5, 37.5, 55.0], name='8-11 m/s', marker_color='rgb(158,154,200)' )) fig.add_trace(go.Barpolar( r=[40.0, 30.0, 30.0, 35.0, 7.5, 7.5, 32.5, 40.0], name='5-8 m/s', marker_color='rgb(203,201,226)' )) fig.add_trace(go.Barpolar( r=[20.0, 7.5, 15.0, 22.5, 2.5, 2.5, 12.5, 22.5], name='< 5 m/s', marker_color='rgb(242,240,247)' )) fig.update_traces(text=['North', 'N-E', 'East', 'S-E', 'South', 'S-W', 'West', 'N-W']) fig.update_layout( title='Wind Speed Distribution in Laurel, NE', font_size=16, legend_font_size=16, polar_radialaxis_ticksuffix='%', polar_angularaxis_rotation=90, ) fig.show()
Reference¶
See function reference for
px.(bar_polar)<<
|
https://plotly.com/python/wind-rose-charts/
|
CC-MAIN-2021-39
|
en
|
refinedweb
|
To fetch large data we can use generators in pandas and load data in chunks.
import pandas as pd from sqlalchemy import create_engine from sqlalchemy.engine.url import URL # sqlalchemy engine engine = create_engine(URL( drivername="mysql" username="user", password="password" host="host" database="database" )) conn = engine.connect() generator_df = pd.read_sql(sql=query, # mysql query con=conn, chunksize=chunksize) # size you want to fetch each time for dataframe in generator_df: for row in dataframe: pass # whatever you want to do
|
https://riptutorial.com/pandas/example/30224/to-read-mysql-to-dataframe--in-case-of-large-amount-of-data
|
CC-MAIN-2021-39
|
en
|
refinedweb
|
Terms defined: Visitor pattern, bare object, dynamic scoping, environment, lexical scoping, stack frame, static site generator
Every program needs documentation in order to be usable, and the best place to put that documentation is on the web. Writing and updating pages by hand is time-consuming and error-prone, particularly when many parts are the same, so most documentation sites use some kind of static site generator to create web pages from templates.
At the heart of every static site generator is a page templating system. Thousands of these have been written in the last thirty years in every popular programming language (and one language, PHP, was created for this purpose). Most of these systems use one of three designs ():
Mix commands in a language such as JavaScript with the HTML or Markdown using some kind of marker to indicate which parts are commands and which parts are to be taken as-is. This approach is taken by EJS, which we used to write these lessons.
Create a mini-language with its own commands like Jekyll (which is used by GitHub Pages). Mini-languages are appealing because they are smaller and safer than general-purpose languages, but experience shows that they eventually grow most of the features of a general-purpose language. Again, some kind of marker must be used to show which parts of the page are code and which are ordinary text.
Put directives in specially-named attributes in the HTML. This approach has been the least popular, but since pages are valid HTML, it eliminates the need for a special parser.
In this chapter we will build a simple page templating system using the third strategy. We will process each page independently by parsing the HTML and walking the DOM to find nodes with special attributes. Our program will execute the instructions in those nodes to do the equivalent of loops and if/else statements; other nodes will be copied as-is to create text.
What will our system look like?
Let's start by deciding what "done" looks like. Suppose we want to turn an array of strings into an HTML list. Our page will look like this:
<html> <body> <p>Expect three items</p> <ul z- <li><span z-</li> </ul> </body> </html>
The attribute
z-loop tells the tool to repeat the contents of that node;
the loop variable and the collection being looped over are separated by a colon.
The attribute
z-var tells the tool to fill in the node with the value of the variable.
When our tool processes this page, the output will be standard HTML without any traces of how it was created:
<html> <body> <p>Expect three items</p> <ul> <li><span>Johnson</span></li> <li><span>Vaughan</span></li> <li><span>Jackson</span></li> </ul> </body> </html>
Human-readable vs. machine-readable
The introduction said that mini-languages for page templating quickly start to accumulate extra features. We have already started down that road by putting the loop variable and loop target in a single attribute and splitting that attribute to get them out. Doing this makes loops easy for people to type, but hides important information from standard HTML processing tools. They can't know that this particular attribute of these particular elements contains multiple values or that those values should be extracted by splitting a string on a colon. We could instead require people to use two attributes, as in:
<ul z-
but we have decided to err on the side of minimal typing.
And note that strictly speaking,
we should call our attributes
data-something instead of
z-something
to conform with the HTML5 specification,
but by the time we're finished processing our templates,
there shouldn't be any
z-* attributes left to confuse a browser.
The next step is to define the API for filling in templates. Our tool needs the template itself, somewhere to write its output, and some variables to use in the expansion. These variables might come from a configuration file, from a YAML header in the file itself, or from some mix of the two; for the moment, we will just pass them into the expansion function as an object:
const variables = { names: ['Johnson', 'Vaughan', 'Jackson'] } const dom = readHtml('template.html') // eslint-disable-line const expander = new Expander(dom, variables) // eslint-disable-line expander.walk() console.log(expander.result)
How can we keep track of values?
Speaking of variables, we need a way to keep track of their current values; we say "current" because the value of a loop variable changes each time we go around the loop. We also need to maintain multiple sets of variables so that variables used inside a loop don't conflict with ones used outside it. (We don't actually "need" to do this—we could just have one global set of variables—but experience teaches us that if all our variables are global, all of our programs will be buggy.)
The standard way to manage variables is to create a stack of lookup tables. Each stack frame is an object with names and values; when we need to find a variable, we look through the stack frames in order to find the uppermost definition of that variable..
Scoping rules
Searching the stack frame by frame while the program is running is called is dynamic scoping, since we find variables while the program is running. In contrast, most programming languages used lexical scoping, which figures out what a variable name refers to based on the structure of the program text.
The values in a running program are sometimes called
an environment,
so we have named our stack-handling class
Env.
Its methods let us push and pop new stack frames
and find a variable given its name;
if the variable can't be found,
Env.find returns
undefined instead of throwing an exception
().
class Env { constructor (initial) { this.stack = [] this.push(Object.assign({}, initial)) } push (frame) { this.stack.push(frame) } pop () { this.stack.pop() } find (name) { for (let i = this.stack.length - 1; i >= 0; i--) { if (name in this.stack[i]) { return this.stack[i][name] } } return undefined } toString () { return JSON.stringify(this.stack) } } export default Env
How do we handle nodes?
HTML pages have a nested structure,
so we will process them using
the Visitor design pattern.
Visitor's constructor takes the root node of the DOM tree as an argument and saves it.
When we call
Visitor.walk without a value,
it starts recursing from that saved root;
if
.walk is given a value (as it is during recursive calls),
it uses that instead.
import assert from 'assert' class Visitor { constructor (root) { this.root = root } walk (node = null) { if (node === null) { node = this.root } if (this.open(node)) { node.children.forEach(child => { this.walk(child) }) } this.close(node) } open (node) { assert(false, 'Must implemented "open"') } close (node) { assert(false, 'Must implemented "close"') } } export default Visitor
Visitor defines two methods called
open and
close that are called
when we first arrive at a node and when we are finished with it
().
The default implementations of these methods throw exceptions
to remind the creators of derived classes to implement their own versions.
The
Expander class is specialization of
Visitor
that uses an
Env to keep track of variables.
It imports a handler
for each type of special node we support—we will write those in a moment—and
uses them to process each type of node:
If the node is plain text, copy it to the output.
If there is a handler for the node, call the handler's
openor
closemethod.
Otherwise, open or close a regular tag.
import assert from 'assert' import Visitor from './visitor.js' import Env from './env.js' import z_if from './z-if.js' import z_loop from './z-loop.js' import z_num from './z-num.js' import z_var from './z-var.js' const HANDLERS = { 'z-if': z_if, 'z-loop': z_loop, 'z-num': z_num, 'z-var': z_var } class Expander extends Visitor { constructor (root, vars) { super(root) this.env = new Env(vars) this.handlers = HANDLERS this.result = [] } open (node) { if (node.type === 'text') { this.output(node.data) return false } else if (this.hasHandler(node)) { return this.getHandler(node).open(this, node) } else { this.showTag(node, false) return true } } close (node) { if (node.type === 'text') { return } if (this.hasHandler(node)) { this.getHandler(node).close(this, node) } else { this.showTag(node, true) } } } export default Expander
Checking to see if there is a handler for a particular node and getting that handler are straightforward—we just look at the node's attributes:
hasHandler (node) { for (const name in node.attribs) { if (name in this.handlers) { return true } } return false } getHandler (node) { const possible = Object.keys(node.attribs) .filter(name => name in this.handlers) assert(possible.length === 1, 'Should be exactly one handler') return this.handlers[possible[0]] }
Finally, we need a few helper methods to show tags and generate output:
showTag (node, closing) { if (closing) { this.output(`</${node.name}>`) return } this.output(`<${node.name}`) for (const name in node.attribs) { if (!name.startsWith('z-')) { this.output(` ${name}="${node.attribs[name]}"`) } } this.output('>') } output (text) { this.result.push((text === undefined) ? 'UNDEF' : text) } getResult () { return this.result.join('') }
Notice that this class adds strings to an array and joins them all right at the end rather than concatenating strings repeatedly. Doing this is more efficient and also helps with debugging, since each string in the array corresponds to a single method call.
How do we implement node handlers?
At this point we have built a lot of infrastructure but haven't actually processed any special nodes. To do that, let's write a handler that copies a constant number into the output:
export default { open: (expander, node) => { expander.showTag(node, false) expander.output(node.attribs['z-num']) }, close: (expander, node) => { expander.showTag(node, true) } }
When we enter a node like
<span z-
this handler asks the expander to show an opening tag
followed by the value of the
z-num attribute.
When we exit the node,
the handler asks the expander to close the tag.
The handler doesn't know whether things are printed immediately,
added to an output list,
or something else;
it just knows that whoever called it implements the low-level operations it needs.
Note that this expander is not a class,
but instead an object with two functions stored under the keys
open and
We could use a class for each handler
so that handlers can store any extra state they need,
but bare objects are common and useful in JavaScript
(though we will see below that we should have used classes).
So much for constants; what about variables?
export default { open: (expander, node) => { expander.showTag(node, false) expander.output(expander.env.find(node.attribs['z-var'])) }, close: (expander, node) => { expander.showTag(node, true) } }
This code is almost the same as the previous example. The only difference is that instead of copying the attribute's value directly to the output, we use it as a key to look up a value in the environment.
These two pairs of handlers look plausible, but do they work? To find out, we can build a program that loads variable definitions from a JSON file, reads an HTML template, and does the expansion:
import fs from 'fs' import htmlparser2 from 'htmlparser2' import Expander from './expander.js' const main = () => { const vars = readJSON(process.argv[2]) const doc = readHtml(process.argv[3]) const expander = new Expander(doc, vars) expander.walk() console.log(expander.getResult()) } const readJSON = (filename) => { const text = fs.readFileSync(filename, 'utf-8') return JSON.parse(text) } const readHtml = (filename) => { const text = fs.readFileSync(filename, 'utf-8') return htmlparser2.parseDOM(text)[0] } main()
We added new variables for our test cases one by one as we were writing this chapter. To avoid repeating text repeatedly, we show the entire set once:
{ "firstVariable": "firstValue", "secondVariable": "secondValue", "variableName": "variableValue", "showThis": true, "doNotShowThis": false, "names": ["Johnson", "Vaughan", "Jackson"] }
Our first test: is static text copied over as-is ()?
<html> <body> <h1>Only Static Text</h1> <p>This document only contains:</p> <ul> <li>static</li> <li>text</li> </ul> </body> </html>
node template.js vars.json input-static-text.html
<html> <body> <h1>Only Static Text</h1> <p>This document only contains:</p> <ul> <li>static</li> <li>text</li> </ul> </body> </html>
Good. Now, does the expander handle constants ()?
<html> <body> <p><span z-</p> </body> </html>
<html> <body> <p><span>123</span></p> </body> </html>
What about a single variable ()?
<html> <body> <p><span z-</p> </body> </html>
<html> <body> <p><span>variableValue</span></p> </body> </html>
What about a page containing multiple variables? There's no reason it should fail if the single-variable case works, but we should still check—again, software isn't done until it has been tested ().
<html> <body> <p><span z-</p> <p><span z-</p> </body> </html>
<html> <body> <p><span>firstValue</span></p> <p><span>secondValue</span></p> </body> </html>
How can we implement control flow?
Our tool supports two types of control flow:
conditional expressions and loops.
Since we don't support Boolean expressions like
and and
or,
implementing a conditional is as simple as looking up a variable
(which we know how to do)
and then expanding the node if the value is true:
export default { open: (expander, node) => { const doRest = expander.env.find(node.attribs['z-if']) if (doRest) { expander.showTag(node, false) } return doRest }, close: (expander, node) => { if (expander.env.find(node.attribs['z-if'])) { expander.showTag(node, true) } } }
Let's test it ():
<html> <body> <p z-This should be shown.</p> <p z-This should <em>not</em> be shown.</p> </body> </html>
<html> <body> <p>This should be shown.</p> </body> </html>
Spot the bug
This implementation of
if contains a subtle bug.
The
open and
close functions both check the value of the control variable.
If something inside the body of the
if changes that value,
the result could be an opening tag without a matching closing tag or vice versa.
We haven't implemented an assignment operator,
so right now there's no way for that to happen,
but it's a plausible thing for us to add later,
and tracking down a bug in old code that is revealed by new code
is always a headache.
Finally we come to loops. For these, we need to get the array we're looping over from the environment and do something for each of its elements. That "something" is:
Create a new stack frame holding the current value of the loop variable.
Expand all of the node's children with that stack frame in place.
Pop the stack frame to get rid of the temporary variable.
export default { open: (expander, node) => { const [indexName, targetName] = node.attribs['z-loop'].split(':') delete node.attribs['z-loop'] expander.showTag(node, false) const target = expander.env.find(targetName) for (const index of target) { expander.env.push({ [indexName]: index }) node.children.forEach(child => expander.walk(child)) expander.env.pop() } return false }, close: (expander, node) => { expander.showTag(node, true) } }
Once again, it's not done until we test it ():
<html> <body> <p>Expect three items</p> <ul z- <li><span z-</li> </ul> </body> </html>
<html> <body> <p>Expect three items</p> <ul> <li><span>Johnson</span></li> <li><span>Vaughan</span></li> <li><span>Jackson</span></li> </ul> </body> </html>
Notice how we create the new stack frame using:
{ [indexName]: index }
This is an ugly but useful trick. We can't write:
{ indexName: index }
because that would create an object with the string
indexName as a key,
rather than one with the value of the variable
indexName as its key.
We can't do this either:
{ `${indexName}`: index }
though it seems like we should be able to. Instead, we create an array containing the string we want. Since JavaScript automatically converts arrays to strings by concatenating their elements when it needs to, our expression is a quick way to get the same effect as:
const temp = {} temp[indexName] = index expander.env.push(temp)
Those three lines are much easier to understand, though, so we should probably have been less clever.
How did we know how to do all of this?
We have just implemented a simple programming language. It can't do arithmetic, but if we wanted to add tags like:
<span z-<span z-<span z-num="1"//>
we could.
It's unlikely anyone would use the result—typing all of that
is so much clumsier than typing
width+1 that people wouldn't use it
unless they had no other choice—but the basic design is there.
We didn't invent any of this from scratch, any more than we invented the parsing algorithm of . Instead, we did what you are doing now: we read what other programmers had written and tried to make sense of the key ideas.
The problem is that "making sense" depends on who we are. When we use a low-level language, we incur the cognitive load of assembling micro-steps into something more meaningful. When we use a high-level language, on the other hand, comprehension curve looks like the one on the left of , then an expert's looks like the one on the right. Experts don't just understand more at all levels of abstraction; their preferred level has also shifted so that \(\sqrt{x^2 + y^2}\). In an ideal world our tools would automatically re-represent programs at different levels, so that with a click of a button we could view our code as either:
const. But today's tools don't do that, and I suspect that any IDE smart enough to translate between comprehension levels automatically would also be smart enough to write the code without our help.
Exercises
Tracing execution
Add a directive
<span z-
that prints the current value of a variable using
console.error for debugging.
Unit tests
Write unit tests for template expansion using Mocha.
Trimming text
Modify all of the directives to take an extra optional attribute
z-trim="true"
If this attribute is set,
leading and trailing whitespace is trimmed from the directive's expansion.
Literal text
Add a directive
<div z-…</div> that copies the enclosed text as-is
without interpreting or expanding any contained directives.
(A directive like this would be needed when writing documentation for the template expander.)
Including other files
Add a directive
<div z-that includes another file in the file being processed.
Should included files be processed and the result copied into the including file, or should the text be copied in and then processed? What difference does it make to the way variables are evaluated?
HTML snippets
Add a directive
<div z-…</div> that saves some text in a variable
so that it can be displayed later.
For example:
<html> <body> <div z-<strong>Important:</strong></div> <p>Expect three items</p> <ul> <li z- <span z-<span z- </li> </ul> </body> </html>
would printed the word "Important:" in bold before each item in the list.
YAML headers
Modify the template expander to handle variables defined in a YAML header in the page being processed. For example, if the page is:
--- name: "Dorothy Johnson Vaughan" --- <html> <body> <p><span z-</p> </body> </html>
will create a paragraph containing the given name.
Expanding all files
Write a program
expand-all.js that takes two directory names as command-line arguments
and builds a website in the second directory by expanding all of the HTML files found in the first
or in sub-directories of the first.
Counting loops
Add a directive
<div z-…</div>
that loops from zero to the value in the variable
limitName,
putting the current iteration index in
indexName.
Auxiliary functions
Modify
Expanderso that it takes an extra argument
auxiliariescontaining zero or more named functions:
const expander = new Expander(root, vars, { max: Math.max, trim: (x) => x.trim() })
Add a directive
<span z-that looks up a function in
auxiliariesand calls it with the given variables as arguments.
|
https://stjs.tech/page-templates/
|
CC-MAIN-2021-39
|
en
|
refinedweb
|
How to get object (tag) name, attribute, content, comment and other operations by using the Python crawler beautifulsop
1, Tag object
1. The tag object is the same as the tag in the XML or HTML native document.
from bs4 import BeautifulSoup soup = BeautifulSoup('<b class="boldest">Extremely bold</b>','lxml') tag = soup.b type(tag)
bs4.element.Tag
2. Name property of tag
Each tag has its own name, which is obtained by. Name
tag.name
'b'
tag.name = "blockquote" # Modify the original document tag
<blockquote class="boldest">Extremely bold</blockquote>
3. Attributes attribute of tag
Get single attribute
tag['class']
['boldest']
Get all properties as a dictionary
tag.attrs
{'class': ['boldest']}
Add attribute
tag['class'] = 'verybold' tag['id'] = 1 print(tag)
<blockquote class="verybold" id="1">Extremely bold</blockquote>
Delete attribute
del tag['class'] del tag['id'] tag
<blockquote>Extremely bold</blockquote>
4. Multi value attribute of tag
Multi valued properties return a list
css_soup = BeautifulSoup('<p class="body strikeout"></p>','lxml') print(css_soup.p['class'])
['body', 'strikeout']
rel_soup = BeautifulSoup('<p>Back to the <a rel="index">homepage</a></p>','lxml') print(rel_soup.a['rel']) rel_soup.a['rel'] = ['index', 'contents'] print(rel_soup.p)
['index'] <p>Back to the <a rel="index contents">homepage</a></p>
If the converted document is in XML format, the tag does not contain multi value attributes
xml_soup = BeautifulSoup('<p class="body strikeout"></p>', 'xml') xml_soup.p['class'] ```bash
'body strikeout'
2, Navigable string 1. Strings are often included in tags, and NavigableString class is used to wrap strings in tags ```bash from bs4 import BeautifulSoup soup = BeautifulSoup('<b class="boldest">Extremely bold</b>','lxml') tag = soup.b print(tag.string) print(type(tag.string))
Extremely bold <class 'bs4.element.NavigableString'>
2. A NavigableString string is the same as the str string in Python. The NavigableString object can be directly converted to STR string through str() method
unicode_string = str(tag.string) print(unicode_string) print(type(unicode_string))
Extremely bold <class 'str'>
3. The strings contained in the tag cannot be edited, but can be replaced with other strings. Use the replace with() method
tag.string.replace_with("No longer bold") tag
<b class="boldest">No longer bold</b>
3, Beautifulsop object beautifulsop object represents the whole content of a document.
Most of the time, you can think of it as a Tag object, which supports traversing the document tree and searching most of the methods described in the document tree.
Four. Comment and special string object
markup = "<b><!--Hey, buddy. Want to buy a used parser?--></b>" soup = BeautifulSoup(markup,'lxml') comment = soup.b.string type(comment)
bs4.element.Comment
The Comment object is a special type of NavigableString object
comment
'Hey, buddy. Want to buy a used parser?'
|
https://programmer.ink/think/get-object-tag-name-property-content-comment.html
|
CC-MAIN-2021-39
|
en
|
refinedweb
|
Written by Esteban Herrera✏️
Date formatting is one of the most important aspects when preparing an application to be used in different languages.
Moment.js is one of the most used JavaScript libraries to format and manipulate dates that we can use for this purpose. However, in some cases, some things about this library (like its size or the way it is structured) might make you wonder if there are some alternatives out there.
In this article, I’m going to review four alternatives to moment.js regarding date internationalization:
I’m going to focus on converting dates to strings in different formats for different locales, including relative time.
Let’s start with the JavaScript Internationalization API.
JavaScript Internationalization API
Intl is a global object that acts as the namespace of the ECMAScript Internationalization API. Regarding dates, this object provides the following constructors:
Intl.DateTimeFormat, which provides date and time formatting
Intl.RelativeTimeFormat, which provides language-sensitive easy-to-read phrases for dates and timestamps
These constructors take two optional arguments, the locale and an object with options to customize the output. For example:
let rtf = new Intl.RelativeTimeFormat('en-GB', { style: 'long' }); let dtf = new Intl.DateTimeFormat('de');
The locale argument is a string that represents a BCP 47 language tag, which is composed of the following parts:
- Language code (ISO 639-1/639-2). For example,
el(modern greek)
- Script code (ISO 15924). For example,
Grek(greek)
- Country code (ISO 3166). For example,
GR(Greece)
- Variant (from iana.org), search for “Type: variant”). For example,
polyton(polytonic greek)
- Extensions (from Unicode, more information here). For example,
u-nu-native(native digits)
Here’s an example with all the parts together:
let rtf = new Intl.RelativeTimeFormat('el-Grek-GR-polyton-u-nu-native');
Only the first part (language code) is required, and you can pass an array of strings to define fallback languages:
// Requests Dutch as the primary language and if it is not available, it requests french let dtf = new Intl.DateTimeFormat(['nl', 'fr'])
If a locale is not provided, the locale of the runtime environment is used.
About the second argument, the options object, it varies between constructors.
Intl.DateTimeFormat takes options such as the style of the date (
full,
long,
medium, and
short), whether to use either a 12-hour or 24-hour time or format the representation of parts of the day like the year, month, weekday, etc.
In the documentation page of Intl.DateTimeFormat, you can learn more about all the options you can use to customize this object.
About
Intl.RelativeTimeFormat, the options object only has the following properties:
localeMatcher, the locale matching algorithm to use. The possible values are
lookup(from the more specific to the less specific, if
en-usis not available,
enis chosen) and
best fit(the default value, if
en-usis not available, something like
en-ukcan be chosen)
numeric, to format the output message. The possible values are
always(for example,
2 hours ago) or
auto, which doesn’t always allow numeric values in the output (for example,
yesterday)
style, to format the length of the output message. The possible values are
long,
short, and
narrow
Once you have an object of type
Intl.DateTimeFormat or
Intl.RelativeTimeFormat, you can use the methods
format() or
formatToParts() (that returns an array with the parts of the output) to format a date.
In the case of
Intl.DateTimeFormat, the methods take the
Date object to format:
const date = new Date(Date.UTC(2014, 8, 19, 14, 5, 0)); const options = { dateStyle: 'short', timeStyle: 'full', hour12: true, day: 'numeric', month: 'long', year: '2-digit', minute: '2-digit', second: '2-digit', }; // Sample output: 19 septembre 14 à 05:00 console.log(new Intl.DateTimeFormat("fr", options).format(date)); // Sample output: 19. September 14, 05:00 console.log(new Intl.DateTimeFormat("de-AT", options).format(date)); /* Sample output: [{"type":"day","value":"19"},{"type":"literal","value":" "},{"type":"month","value":"settembre"},{"type":"literal","value":" "},{"type":"year","value":"14"},{"type":"literal","value":", "},{"type":"minute","value":"05"},{"type":"literal","value":":"},{"type":"second","value":"00"}] */ console.log(new Intl.DateTimeFormat("it", options).formatToParts(date));
Notice that if you only specify a few date-time components in the options object, these will be the ones present in the output:
const date = new Date(Date.UTC(2014, 08, 19, 14, 5, 0)); const options = { year: '2-digit', }; // Output: 14 console.log(new Intl.DateTimeFormat("en", options).format(date));
In the case of
Intl.RelativeTimeFormat,
format() takes the numeric value to use in the message and a second argument to indicate the unit of this value (like
year or
second, in either singular or plural forms):
const options = { localeMatcher: 'best fit', numeric: 'auto', style: 'short', }; // Output: last mo. console.log(new Intl.RelativeTimeFormat("en-CA", options).format(-1, 'month')); // Output: la semana pasada console.log(new Intl.RelativeTimeFormat("es-ES", options).format(-1, 'week')); /* Output: [{"type":"integer","value":"60","unit":"minute"},{"type":"literal","value":" 分鐘前"}] */ console.log(new Intl.RelativeTimeFormat("zh-TW", options).formatToParts(-60, 'minutes'));
Also, notice the difference between using the
always and
auto values for the
numeric property:
// Output: in 0 days console.log(new Intl.RelativeTimeFormat("en", {numeric: 'always'}).format(0, 'day')); // Output: today console.log(new Intl.RelativeTimeFormat("en", {numeric: 'auto'}).format(0, 'day'));
You can try and modify all of the above examples here and here, but depending on the browser you’re using, you could get some errors.
Most of the functionality of
Intl.DateTimeFormat is well-supported in modern browsers (more info here), however,
Intl.RelativeTimeFormat is fully supported only from Chrome 71 and Firefox 70 (no support in Safari or Edge at the time of this writing).
You can use a polyfill, but you’ll have to create the object differently:
const myLocale = /* Import JSON file for the choosen locale */; const localeTag = /* Tag for the above locale */; const options = { /* Options object */ }; RelativeTimeFormat.addLocale(myLocale); new RelativeTimeFormat(localeTag, options).format(3, 'day');
You can try this example here.
So as you can see,
Intl.RelativeTimeFormat is similar to
moment.duration().humanize():
moment.duration(-1, 'weeks').humanize(true); // a week ago
If you’re used to calculating relative times from now or calendar times relative to a given reference time the way moment.js does:
moment('20140919', 'YYYYMMDD').fromNow(); // 5 years ago moment().add(5, 'days').calendar(); // Tuesday at 1:15 PM
You’ll need to manually calculate the difference between the two dates.
Nothing beats using native features, but if this can become a problem, there are other options.
Luxon
Luxon is a library created by one of moment’s maintainers, so it borrows many ideas from it while offering improvements in some areas.
For internationalization purposes, you can think of Luxon as a wrapper for
Intl.DateTimeFormat and
Intl.RelativeTimeFormat.
For example, one way to format dates according to a locale is by first setting the locale and then using the method
toFormat(fmt:string, opts: Object) along with date-time tokens from this table:
// Sample output: 2019 сентябрь console.log(DateTime.local().setLocale('ru').toFormat('yyyy MMMM'));
You can also pass the locale in the options object that the method can take as an argument:
// Output: 2019 сентябрь console.log(DateTime.local(2018, 9, 1).toFormat('yyyy MMMM', { locale: "ru" }));
Or if you’re using methods like fromObject, fromISO, fromHTTP, fromFormat, or fromRFC2822, you can set the locale at creation time:
const italianDate = DateTime.fromISO("2014-09-19", { locale: "it" }); // Output: 2014 settembre 19 console.log(italianDate.toFormat("yyyy MMMM dd"));
However, the recommended way is to use the methods
toLocaleString() and
toLocaleParts() that returns a localized string representing the date and an array with the individual parts of the string, respectively.
These methods are equivalent to the methods
format() and
formatToParts() of
Intl.DateTimeFormat, and in fact, they take the same options object (along with some presets, such as
DateTime.DATE_SHORT, among others):
const date = DateTime.utc(2014, 9, 1, 14, 5, 0); const options = { dateStyle: "short", timeStyle: "full", hour12: true, day: "numeric", month: "long", year: "2-digit", minute: "2-digit", second: "2-digit" }; // Output: 1 septembre 14 à 05:00 console.log(date.setLocale("fr").toLocaleString(options)); // Output: 1. September 14, 05:00 console.log(date.setLocale("de-AT").toLocaleString(options)); /* Output: [{"type":"day","value":"1"},{"type":"literal","value":" "},{"type":"month","value":"settembre"},{"type":"literal","value":" "},{"type":"year","value":"14"},{"type":"literal","value":", "},{"type":"minute","value":"05"},{"type":"literal","value":":"},{"type":"second","value":"00"}] */ console.log( JSON.stringify(date.setLocale("it").toLocaleParts(options), null, 3) ); // Output: 2:05 PM console.log(date.toLocaleString(DateTime.TIME_SIMPLE)); // Output: 01/09/2014 console.log(date.toLocaleString({ locale: 'pt' }));
This means that:
- Luxon can be configured using the same BCP 47 locale strings as the
Intlobject
- If the
Intlobject is not available in your target browser, this part of the library won’t work properly (for Node.js applications you might need to take some extra steps to set up the library)
- Regarding internationalization, Luxon acts as a wrapper for the JavaScript Internationalization API, but it sets the locale at the level of the
DateTimeLuxon object (more info here)
On the other hand, the methods toRelative (that returns a string representation of a given time relative to now, by default) and toRelativeCalendar (that returns a string representation of a given date relative to today, by default) are the ones that provide functionality similar to
Intl.RelativeTimeFormat:
// Sample output: in 23 hours console.log(DateTime.local().plus({ days: 1 }).toRelative()); // Sample output: tomorrow console.log(DateTime.local().plus({ days: 1 }).toRelativeCalendar()); // Sample output: in 1 Tag console.log(DateTime.local().plus({ days: 1 }).toRelative({ locale: "de" })); // Sample output: morgen console.log(DateTime.local().plus({ days: 1 }).toRelativeCalendar({ locale: "de" })); // Sample output: il y a 1 semaine console.log(DateTime.local().setLocale("fr").minus({ days: 9 }).toRelative({ unit: "weeks" })); // Sample output: la semaine dernière console.log(DateTime.local().setLocale("fr").minus({ days: 9 }).toRelativeCalendar({ unit: "weeks" }));
Unlike
Intl.RelativeTimeFormat, if your browser doesn’t support this API, the above methods won’t throw an error, the only problem is that they will not be translated to the appropriate language.
You can try all of the above examples here.
Date-fns
Date-fns is another popular JavaScript library for date processing and formatting. Version 2, the latest at the time of this writing, only comes in the form of an NPM package, so if you want to use it directly in a browser, you’ll have to use a bundler like Browserify.
This library contains around sixty different locales (here you can see all of them). To use one or more locales, you need to import them like this:
import { es, enCA, it, ptBR } from 'date-fns/locale'
The functions that accept a locale as argument are the following:
- format, which returns the formatted date, taking as parameters the date, a string representing the pattern to format the date (based on the date fields symbols of the Unicode technical standard #35), and an object with options like the locale and the index of the first day of the week
- formatDistance, which returns the distance between the given dates in words, taking as parameters the dates to compare and an object with options like the locale or whether to include seconds
- formatDistanceToNow is the same as
formatDistancebut only takes one date (that will be compared to now)
- formatDistanceStrict is the same as
formatDistancebut without using helpers like
almost,
over, or
less than. The options object has properties to force a time unit and to specify the way to round partial units
- formatRelative, which represents the date in words relative to a given base date. It can also take an options object as an argument, to set the locale and the index of the first day of the week
Here are some examples:
import { format, formatDistance, formatDistanceToNow, formatDistanceStrict, formatRelative, addDays } from "date-fns"; import { es, enCA, ro, it, ptBR } from "date-fns/locale"; // Output: septiembre / 19 console.log(format(new Date(), "MMMM '/' yy", { locale: es })); // Output: in less than 10 seconds console.log( formatDistance( new Date(2019, 8, 1, 0, 0, 15), new Date(2019, 8, 1, 0, 0, 10), { locale: enCA, includeSeconds: true, addSuffix: true } ) ); // Output: less than 10 seconds ago console.log( formatDistance( new Date(2019, 8, 1, 0, 0, 10), new Date(2019, 8, 1, 0, 0, 15), { locale: enCA, includeSeconds: true, addSuffix: true } ) ); // Output: circa 15 ore (assuming now is 9/20/2019 15:00) console.log(formatDistanceToNow(new Date(2019, 8, 20), { locale: ro })); // Output: 0 minuti console.log( formatDistanceStrict( new Date(2019, 8, 1, 0, 0, 15), new Date(2019, 8, 1, 0, 0, 10), { locale: it, unit: "minute" } ) ); // Output: un minuto console.log( formatDistanceStrict( new Date(2019, 8, 1, 0, 0, 10), new Date(2019, 8, 1, 0, 0, 15), { locale: it, unit: "minute", roundingMethod: "ceil" } ) ); // Output: amanhã às 14:48 console.log(formatRelative(addDays(new Date(), 1), new Date(), { locale: ptBR }));
formatRelative is usually used with helpers to add or subtract different units of time like addWeeks, subMonths, addQuarters, among others.
Also, consider that if the distance between the dates is more than six days,
formatRelative will return the date given as the first argument:
// If today is September 20, 2019 the output will be 27/09/2019 console.log(formatRelative(addDays(new Date(), 7), new Date(), { locale: ptBR }));
You can try all of the above examples here.
Day.js
Day.js is a lightweight library with an API similar to moment.js’.
By default, Day.js comes with the United States English locale. To use other locales, you need to import them like this:
import 'dayjs/locale/pt'; import localeDe from 'dayjs/locale/de'; // With a custom alias for the locale object dayjs.locale('pt') // use Portuguese locale globally // To use the locale just in certain places console.log( dayjs() .locale(localeDe) .format() ); console.log( dayjs('2018-4-28', { locale: 'pt' }) );
Here you can find the list of all supported locales.
In the above example, the format() method returns a string with the formatted date. It can take a string with the tokens to format the date in a specific way:
// Sample output: September 2019, Samstag console.log( dayjs() .locale(localeDe) .format('MMMM YYYY, dddd') );
Here is the list of all available formats.
However, much of the advanced functionality of Day.js comes from plugins that you can load based on your needs. For example, the UTC plugin adds methods to get a date in UTC and local time:
import dayjs from "dayjs"; import utc from "dayjs/plugin/utc"; dayjs.extend(utc); console.log(dayjs.utc().format()); // Sample output: 2019-09-21T11:31:55Z
Regarding internationalization, we can use the AdvancedFormat, LocalizedFormat, RelativeTime, and Calendar plugins.
The AdvancedFormat and LocalizedFormat plugins add more formatting options to the
format() method (you can see all the options in the plugins documentation page):
// ... // Plugins import advancedFormat from "dayjs/plugin/advancedFormat"; import localizedFormat from "dayjs/plugin/localizedFormat"; // Load plugins dayjs.extend(advancedFormat); dayjs.extend(localizedFormat); // Advanced format options // If today is 2019/09/21 at 12:00 PM, the output will be 3 21º 12 12 1569087454 1569087454869 console.log( dayjs() .locale("pt") .format("Q Do k kk X x") ); // Localized format options // If today is 2019/09/21 at 12:00 PM, the output will be Sábado, 21 de Setembro de 2019 às 12:00 console.log( dayjs() .locale("pt") .format("LLLL") );
The
RelativeTime plugin adds methods to format dates to relative time strings:
.fromNow(withoutSuffix?: boolean)returns a string representing the relative time from now
.from(compared: Dayjs, withoutSuffix?: boolean)returns a string representing the relative time from X
.toNow(withoutSuffix?: boolean)returns a string representing the relative time to now
.to(compared: Dayjs, withoutSuffix?: boolean)returns a string representing the relative time to X
Here are some examples:
// ... import relativeTime from "dayjs/plugin/relativeTime"; // Load plugin dayjs.extend(relativeTime); // Assuming now is 2019-09-21 at 12:00 PM // Output: in einem Jahr console.log( dayjs() .locale(localeDe) .from(dayjs("2018-09-21")) ); // Output: einem Jahr console.log( dayjs() .locale(localeDe) .from(dayjs("2018-09-21"), true) ); // Output: vor einem Jahr console.log( dayjs("2018-09-21") .locale(localeDe) .fromNow() ); // Output: vor 2 Jahren console.log( dayjs("2018-09-21") .locale(localeDe) .to(dayjs("2016-09-21")) ); // Output: vor 11 Jahren console.log( dayjs("2030-09-21") .locale(localeDe) .toNow() );
The Calendar plugin adds the
.calendar method to display calendar time (within a distance of seven days). It doesn’t seem to localize the output:
// ... import calendar from "dayjs/plugin/calendar"; // Load plugin dayjs.extend(calendar); // Assuming now is 2019-09-21 at 12:00 PM // Output: Yesterday at 12:00 PM console.log( dayjs() .locale('pt') .calendar(dayjs("2019-09-22")) );
However, it allows you to manually customize the output labels for the same day, next day, last weekend, and next week and everything else using string literals (wrapped in square brackets) and date-time format tokens:
// Assuming now is 2019-09-21 at 12:00 PM // The output is Hoje às 12:00 console.log( dayjs().calendar(dayjs("2019-09-21"), { sameDay: "[Hoje às] h:m", nextDay: "[Amanhã]", nextWeek: "dddd", lastDay: "[Ontem]", lastWeek: "[Último] dddd", sameElse: "DD/MM/YYYY" }) );
You can try all of the above examples here.
Conclusion
Moment.js is a robust and mature library for date processing, however, it may be overkill for some projects. In this article, I have compared the way four popular libraries handle date formatting in the context of internationalization.
The features provided by the JavaScript Internationalization API may be enough for simple use cases, but if you need a higher-level API (e.g, relative times) and other features such as timezones or helper methods for adding or subtracting units of time, you may want to consider one of the other libraries reviewed in this article.
Finally, here are some links that you might find useful:
- BCP 47 Validator
- Intl object
- Intl.RelativeTimeFormat API Specification
- You don’t (may not) need moment.js
- The 7 best JavaScript date libraries
Happy coding! 4 alternatives to moment.js for internationalizing dates appeared first on LogRocket Blog.
Discussion (3)
FYI, you can use a tool like pika.dev to use many npm packages in the browser directly (like ‘date-fns’). E.g. this link works for ‘date-fns’ cdn.pika.dev/date-fans/v2
The only requirement is that the package provide a es6 module export (which, while not universal, is very common).
Another option is unpkg.com. There are likely more which I’m not aware of.
Pika, you say? :)
blog.logrocket.com/building-withou...
Ha! It's got to be a sign of success when strangers start advising you to use your own project! This being said, why didn't you mention it right there in the post 🤔?
|
https://practicaldev-herokuapp-com.global.ssl.fastly.net/bnevilleoneill/4-alternatives-to-moment-js-for-internationalizing-dates-401b
|
CC-MAIN-2021-39
|
en
|
refinedweb
|
GREPPER
SEARCH
SNIPPETS
USAGE DOCS
INSTALL GREPPER
All Languages
>>
Shell/Bash
>>
what is meant by valence shell
“what is meant by valence shell” Code Answer
what is meant by valence shell
shell by
Lively Lynx
on Jul 26 2021
Comment
1
the outermost shell of an atom containing the valence electrons.
Add a Grepper Answer
Shell/Bash answers related to “what is meant by valence shell”
bash special dollar sign shell varaibles
special bash variables
shell script variable
check if variable is a number in bash
what is bin/bash
verify parameter one bash
number compare in bash
echo variable bash
bash calculate the mean of a column
print variable in bash
definition varibale in bash
bash calculate division
bash variable substitution
bash command in variable
bash echo in variable
which shell am i using
bashrc termina,
linux shell echo command with varia ble
how to compare percentage value in shell script
sum variables shell
linux bash export vars between shell instances
how to compare float values in shell script
how to define a variable in bashrc
learn how to use bash (variables)
how to know which shell is specified for linux
shell variables in unix
Shell/Bash queries related to “what is meant by valence shell”
whats in the valence shell
what is valence shell
what is meant by valence shell
More “Kinda” Related Shell/Bash Answers
View All Shell/Bash Answers »
bash: gedit: command not found
loop from array bash
bash use argument from previous command
bash endless loop
bash if then else one line
increment number bash
bash silence output
bash for-schleife 1 bis 10
for i in range bash
bash slurm show running jobs
bash set two variables at once
bash change output color
bash colors
datetime echo shell script
bash random number
list available shells linux
run a command x number of times linux
red color font on script shell
reverse shell bash
bash get current date
how to get a script's directory in bash
cur script location bash
curl measure time
linux loop over all arguments one by one
bash comment
change default shell fish
rick roll terminal command
bash get current path
get current directory shell
current locatiomn bas
current location bash
bashrc termina,
how to change gopath
bash display items in array
for loop in shell script
du -sh ocult files
how to open bash_profile
convert back to sh from zsh
node run shell command
bash hide command output
if argument exists bash
if argument supplied bash
if argument bash
get current timestamp shell
bash send to dev null
verify parameter one bash
sh wait 10 seconds
wait n seconds in shell script
bash print array
shell promt user input
bash echo to stderr
shell hide tab
How to call one shell script from another shell script?
shebang unix
hash bang bash
write a bash program to print a given number in reverse order
wait command bash
sleep command bash
bash sleep milliseconds
command wait bash
convert all files to lowercase using shell script
linux which shell am i running
last return code linux
Which command should I use to display the exit code of the previous command?
Bash add pause prompt in a shell script with bash pause command
assign default value in shell script
bash parameter count
save and quit keys vim
run linux command multiple times
how run command in loop
debug shell script
move files with in bash
adb shell grep command
uppercase first str bash
alternative command to run source linux
bash test boolean
bash check if process is running by name
c++ build system in sublime linux for competetive programming
bash or
bash calculate the mean of a column
how to compare float values in shell script
how to store float values in shell script
get list of directories bash
for each folder in directory bash
percorrer directoria shell script
date format in linux shell script
linux run command in loop
$$ in shell script
bash slurm view jobs from date
bash math expression
datetime calculation in shell
shell open program
bash add chr to beginning of vcf
bobrossquotes terminal
bash limit memory use of a function
zsh stat timefmt Ymd HMS
best shell linux
check bash version
run sh from terminal mac
bash get timestamp
bash substring test
bash string contains
how to open gedit using terminal
exit vim
how to exit vim
bash suppress error code
bash use cat in sed command
bash for stdin
tail access_log
bash script how to show a file by using less
bash find only first answer
bash script to output a specific line of a file
shell variables in unix
what is meant by valence shell
find all variables in server bash
list variables iterm
bash get environment variable
bash tee stdout and stderr
bash sort bed file by chrom start end
Write a Shell Script that makes use of grep to isolate the line in /etc/passwd that contains your login details.
echo linux flags
linux bash export vars between shell instances
bash vlookup function
bash redirect stdout and stderr to the same file
current date bash
shell script current time
bash if greater than
schedule shell script mac
bash array
how to do a repeat until loop in bash
bashrc file location in linux
tic toc commands
tic toc command bash
postgres output to bash variable
bash head command
linux head command
return in shell script
string to array bash
bash append file
bash string to file
bash: /bin/rm: Argument list too long
bash for each line of file
else if statement bash syntax
bash float division
bash bc
bash float operation
calculate float division
bash calculate division
adding alias to for echo
bash message partial match
how to run shell script in linux
command prompt cd back
bash add new line to crontab
how to access bashrc on linux
bash run all commands in a file
bash date variable format
bash add text to file
bash loop over files in file
cmp in linux
bash assign $1 value
vim run shell command
run bash script linux with sudo password
bash rename foldr
while loop bash
bash scripting string comparison
nim hello world
print hello world linux
move faster console unix
move cursor faster in terminal mac
move faster mac command
shell mac move faster
move word shell unix
hello word bash
how to print hello world in c
bash check if variable is a number
run bash script in its directory
show bash history
linux shell echo command with varia ble
execute program in background bash
secure shell
input bash
how to reverse shell
fish shell add to path
sorting output bash
shell script while loop example
meassure time bash
get elapsed time bash
get time diff bash
how to run .run file in linux
bash how to pass shell variables to awk
how to open a file using terminal and exit terminal
connecting sublime to bash command line
bash rename
pass parameters to bash script
bash how to convert text to lowercase or uppercase
bash write
bash write file
bash loop
vim terminal scrollback
linux commands and their equivalents
how to run c file in linux
.run files in ubuntu
bash adding to array
how to take back crtl + z terminal
loop bash
print in bash
linux c++ from console
bash while read line loop from variable
bash for loop string array
how to loop through every value in array bash
bash expr example
bash print output to one line
bash edit prompt display appearance
increment variable bash
ubuntu make sh file executable
how to make a list bash
bash move
bash change to script directory
suspend command for linux
case statement example shell scripting
bash here document to file
Royal Dutch Shell
sh declare variable
print in shell script
how to run verilog files in linux
bash combine output from two commands
linux how to undeo ctrl+z
for loop in bash for files
how to do math in bash
bash wait 3 seconda
comment in shell script
optional argument bash
how to use for loop in linux command line
print environment variables linux
get script directory bash
bash input
pause bash script
grant linux sh script permissions
change shell
zsh list environment variables
bash chmod
bash how do permissions work
pause in bash
bash count number of arguments
how to open vimrc file in linux
store result of command in variable bash
combine strings bash
assign global variable inside loop bash
shell comments
linux run two commands in parallel
unix get epoch in miliseconds shell
how to add alias in linux
read password bash
run bash script on zsh
bash commands
how to install .sh file in ubuntu
get current time curl
how to make a script run on boot linux
bash how to set up aliases
show env in bash
how to run shell script
shell script get arguments
split bash string
bash special dollar sign shell varaibles
save output of command to variable bash
will bash script use alias
test string equality bash
reset bashrc
how to make a .sh file executable
what is T in nm command output in linux
set zsh as default shell
how to put value of one variable into another in bash
bash pass all arguments
if else statement example in shell script
bash get value after equal sign
shell function example
functions in linux
Add the following lines to your $HOME/.bash_profile
linux refresh .bashrc
shell set environment variable
shell foreach line
bash show vim text in color
hello world shell script
bash for loop
shell script sh
bash case statement
terminal commands
number compare in bash
bash add all numbers
bash check if variable is empty
how to run two commands in linux
fi bash meaning
comment line in bash file
how to run exe file with shell
store printed output in variable bash
laravel command not found ubuntu
reload restart bashrc
source .bashrc command ubuntu
pass an array to bash function
bash for i
if and if bash
vi save and exit
how can i save an idle shell and edit it
macos make file executable
while loop shell script
ubuntu make script executable
time in linux command
while bash one line
bash while done
$@ bash
what is vi in linux
echo date in bash
echo variable bash
bash if empty params
how to run a command from history linux
bash script check empty string
shell script variable
bash how to use screen
current year bash
sh increment variable
linux add alias
bash new alias
Shell/BAsh
How do you create a file in shell script?
shell file in linux
get additional parameters linux scripting
exit bash script
.sh file example
for loop iteration in shell script
configure nano bash profile
sum of array elements bash
arithmetic operation in bash
bash function arguments
run.sh minecraft
how to echo to a file in linux
bash if
check if variable is a number in bash
how to execute a bash script in terminal
bash multiline ech
bash else if
shell script:while done
run sh with parameter
translate lower to upper in unix
bash uppercase string
bash lowercase
bash transform uppercase to lowercase
how to read from keyboard in bash and store in a variable
Select the command to read the input from the User in shell scripting?
bash get path of script
bash for loop step
bash if var equals string
assigning variables bash
>> bash
linux alias bashrc
where is tetris in linux terminal
edit text file bash
store ls into array bash
how to append an array in bash
bat turn echo off
bash send email from script
bash script loop
linux script to run commands
bash run a command every x second
save as in vi
echo -n bash
sh is null if
how to check prime number in shell script
how to source bash script path bash
loop over array of strings bash
bash jump to
bash script output and error to file
ash if statment
get users shell
bash break for looop
bash break if
bash for loop break on error
bash string to number
linux list
bash ls
bash write stderr to file
get the path of script bash
shell script linux
wc bash
Cat command in Linux with examples
unix get time
run .bin file command linux
linux vi
bash switch case
for shell
how to edit bashrc
curl and run bash script
how to run a .sh file
ubuntu simple sh script
create script bash ubuntu
shell export
bash counter
using tail command in linux
timestamp zsh terminal
definition varibale in bash
multiply command bash
multiple conditions in if shell
bash size of array
bash try catch
bash variable lowercase
bash sum float numbers
crontab execute shell script
redirect stderr to stdout
stderr to stdout
zsh shell
open command in linux
bash sum variable
bash multiline comment
unix commands
how to add text to promt in linux
bash if is number
linux ping latency print on screen .sh file
bash if statement
new linux terminal shortcut
new terminal in linux
shortcut for new tab in linux terminal
new terminal tab in linux
leap year shell script
add alias fish shell
lien symbolique linux
bash function
ubuntu run a shell script
command line weather
shell profile
bash flags
cat command in linux
how to take array input in shell script
reset bash_profile
bash path ubuntu
run bash command perl
shellpish
how to run c in linux
check string in bash
bash if set variable
bash if argument in file
bash if arguments contains
how to open terminal with terminal linux
command for open new terminal linux
how to open a terminal using shell script
sum of output unix
write in a file linux
ubuntun run .sh\
print variable in bash
bash get width of terminal
store command into array bash
bash stderr null
bash redirect all output
unix set current time in file name
how to time a process in bash
concat strings inside array bash script
how to save a text file with a terminal command
bash for loop list
bash division integer
bash read input
shell if say yes
shell basename
concatenate strings bash
sh concat string
Loop through an array of strings in Bash
bash set -x
bash cd too many arguments
bash "=~" example
change user default shell
unix timestamp bash
bash if larger than
python print sql in shell_plus
shell script
what is bin/bash
bash set environment variable
bash dynamic varibale
linux generate file
bash generate file
code command line options
echo new line in a file bash
how to run script in linux at startup
how to run .sh file in background linux
how to perform mathematical operations in shell script
multiline comment in bash
bash ls exclude file
bash ls exclude substring
bash ls without substring
bash list not
shell save variable
comment in bash
bash alias with parameter
Activate Conda Environment in Bash Script
output to log file bash
bash how to define a path
bash measure execution time
bash get first argument
how to set environment variable using bash
how to print new line in shell script
mv linux command
create a new file in bash script
echo to file
echo to file bash
bash create variable
assign a variable in bash
cat meaning linux
bash store pipe output in variable
shell script store command output in variable
bash store script output in variable
bash do while one line
bash command in variable
bash echo in variable
vi quit
vim quit
echo time bash mac
vi quit and save
bash time
bash date
how to execute an sh file in linux
dialog shell script example
linux commands
bash debugging
execute bash with commands being shown
zsh read user input
shell bash kommentti
wc linux command
r_dwssap.sh
de shell script with administrative priverlages
root check bash script
To set the exit status of a shell script
bash if user exists in a group then add
get last element in an array bash
linux run task in background
cli echo to file
how to run a .bin file in linux
bash use variable in string
bash negate if
function in bash
bash date today plus one day
mac write own sh file
shell for loop parameters
zsh increment variable
timestamp in bash
how to grep curl verbose
curl output to stdout
case shell
how to print output of a command to a file in linux
gobuster command
bash equivalent of /?
how to use nano instead of vi
bash command help
vim insert result of shell command
printf in bash
how to run command in background bash linux
start of .sh file
shell script starting line
bash float
bash float operations
bash uppercase bad substitution
${a,}: bad substitution
bash convert string to uppercase
basename bash
sum variables shell
add bash command
POWERSHELL ENV VARS
bash read value
how to run exe file in linux
linux change user shell /bin/false
terminal command as parameter
bash call another script relative to current script
sh how to not store a command in history
command list all commands found in terminal
check command list
command to check commands
command list
list commands in shell
"set -x " bash
for while bash
for line in output bash
linux execute sh
check alias content linux
how to execute .sh file in linux
how to run tcl script in terminal
bash if with function call
setting environment variables bash
reverse string in shell script
exa ls command
pass awk varible to bash
bash break
bash linux scripting laguage
bash: PROMPT_COMMAND: unbound variable
bash script wget
show output after a keyword in shell script in a file
how to define a variable in bashrc
how to bypass an alias in fish shell
skip an alias in fish shell
how to run power shell script
read from .env file bash
shell script to convert yaml
bash for loop break and continue
bash run last command as sudo
command to run string bash
eval bash
cat in bash shell
eval
run string
linux eval befehl
bash eval variable
run sh file
return boolean bash
scp command in unix
echo variable referenced in variable
bash variable substitution
bash variable in string
bash store string in variable
bash dynamic variable name
bash get variable value by variable name
for in bash
how to add comments in terminal ubuntu
interesting bash scripts
bash echo
shell sort
sed output to file
sed replace with variable
sed with variable
bash generate random number between
bash generate random number between 1 10
bash if else if
how to make a new file in bash
how to make a function in bash
bash script change directory run a command
bash script until loop
bash redirect output to null
shell cd
python run shell command
env variable bash
bash read command examples
if statement in shell script
online shell script compiler
xargs in linux
bash run in background
passwd linux
how to create file in bash script
background script linux
date command in unix
linux tee command
linux bash scripts tutorial
bash script if file exists
linux nano editor
cat command
linux lien symbolique
Enter new UNIX username:
power shell service start
bash add default argument
bash exit code
shell script if input is empty
struct main function c in unix
bash read username and password
shell relatives path
learn how to use bash (variables)
how to make a for in bash
start shell on rosetta 2
catch input bash
the command
bash alias with more than one command
how to change colors in terminal linux outputs
shell_to_meterpreter
source .bashrc
shell use command output as string
Shell:startup nsis
run script on files in folder output to file
assing command to a variable
get my most used command from history
how to save history of commands in linux
quick access in linux terminal
execute multiple commands in linux
bash comment section to a file
bash add help argument
bash check return of command not error
linux output to terminal and file
bash find string in program output
zsh wait for user input
ghost in the shell stand alone complex book quotes
how to take output of command in cp linux
function in shell script returning 0 only
how to get environment in string linux shell
add text with terminal
linux shell system commands
bash for if array together
how to collect values from each iteration of a loop and save them bash
what is shell in linux
bash sum floating point numbers
vite command
shell script or condition
run app bashrc
bash combine Exit command and exit codes to build quick logic
sed with variables in shell script
bash most used history function
shell sh if passwords not equal
how to open a window using linux terminal
shell loop terminating after command
sum column bash
shell script variables not working
bashrc check if interactive
check if command exists bash
pipe shell output to vim
bash script which displays the Factorial of a number N on the monitor
combine commands bash
how to print array bash
how to assign values from a loop in bash to a single variabel
shell script -z
shell script runner software for linux
bash do-while
command line if output of command is equal to string
what is the use of ctrl Z in process in linux
increaments in shell
bash random sleep
compile asm file from terminal
pass all arguments to another function bash
.vimrc comment
bash tab completion cycle
pipe commands into a text file bash
how to change your bash setup
bash printf format
how to open gofer in command prompt
reverse serach linux
if float less than bash
exit loop bash
echo with tee command
bash minimize window
ubuntu command line change line in file
schedule a job bash
FS OFS unix
bash c like for loop
shell script to check the output of a file
from one terminal tab to another linux
bash similiar to choice in cmd
linux poid dossier
bash echo multiline to file
is unix an open source operating system
print statement in bashrc
bash rifare ultimo comando
aexprot bash varible to another script
run specific script with an other user linux
can you speak in linux commands
vimrc comment
shell script multithreaing
case esac bash simple example
bash map lenght
bash
introduce parameters to programs in unix
terminal export answer in txt
what is bash os
ubuntu command change line in file
script linux code
run latex from command line
bash run until success or timeout
bash script for list
two bash coomand in same line
creer un script linux
bash nano search
terminal echo alias
bash maximum running time
bash if number equals
how to reove bash varible from memory
bash .inputrc color tab completion and more
bash here document example
for loop while loop shell functions
zsh while loop example
bash if not
make a join function in bash script arrays
shell Edited By King Deface
bash if in terminal
linux poweroff command
linux terminal write output to file
bash red text
linux bash do something when file changes
special bash variables
Bash colour codes
echo str terminal meaning
linux how to run executable in background $
Create a short command in bash using alias
$@ instead of $* in bash functions
how to print something from the command line
bash convert seconds to date
bash compare numbers
check if bash variable is undefined
ubuntu string variable
preserve bash history
retour chariot avec echo bash
bash storing and getting global variables between shells
sh add
shell programation
bash setting home
until loop bash
bash variable command not found
bash in terminal
bash echo each line
how to define command in bash
shell get given line
list of previous commands
ubuntu run multiple commands in one line and let them run after close shell
how to print output of a command linux
bash rest of arguments
yes/no dialog shell
oepn file in linux shell
how to know which shell is specified for linux
go to last page in less command
how to check date is older than x days in shell script
easter egg bash
linux back cd
bash for add one
view shell variables
linux bash file verification
shell run in background no output
edit alias terminal
select loop bash
sh script options
present working directory in shell script
bash loop local variable
What is bash
bash files open instead of ecxecuting
bash substract varible
bash "read -p"
bash optional arguments
how to define a command bash
bash loop counter
what is echo command in linux
bash continue
running shell script
import local varibles inside .sh file
bash multiplication of arguments
how to check folxder ezist using bash
bc add
bash check if string starts with substring
shorten terminal prompt linux
dos command to print commandline of running pid
export function in shell script
open file in note from command line linux
how to create script inside a script Bash: Scriptception,
bash if string does not start with
shell script red color
bash alias function that accepts arguments
bash script block comments
proxmox pass raw disk
how to define a command in bashrc
sexy bash
how to add program to command line linux
codition in bash
run command on ctrl-c in shell script
bc sum command
/dev/stdin execute remote script with passing args
pup command example
bash forward argv to command
how to open notepad with root using terminal in ubuntu
how to perform an action for each line in bash
Exit bash script if not running as root
reverse shell rubber ducky script
bash base62
watch bash second
execute a scheme program
shell script loop while process running
terminal open vim
to remember all commands typed in multiple terminal
hp ux list shell path like chsh
streams in unix
terminal command to sleep
convert log file with unix timestamp
bash script use variable in ssh command
shell current week
bash open file in text editor
how to execute script and pass a parameterin linux
bash loop with if
terminal rename
telnet in shell script
read input from stdin bash script
bash params
sum decimals bash
subtract 10 minutes from date bash
chmod using find in bash
shell script function read
everytime i open my terminal Command 'ls' is available in '/bin/ls'
bash back to last folder
how to exit vi in linux
bash file works from terminal but not from desktop file
linux run a command every 5 seconds
bash multiply float
cat /etc/passwd
bash if call function
convert shell script to yaml
what is shell scripting
linux write
change shell script to executable
last_ack
pass \l to psql from linux
bash argument parsing
multi line comment in shell script
how to create a bash script
shell
how to make a shell in c for beginners
zsh shell in linux
cat bash
how to change path in linux
which shell am i using
linux command ps -a
bash vs shell
fi bash
how to sort array in shell script
shell commands windows
change bash prompt
bash calculate sum
sum bash
bash adding floats
bash $! command
string in shell script
shell cehck if string is null
shreck
command linux write read and execute values
jenkinfile.sh
how to validate a mobile number in shell script
folding at home bash
show dialog box shell script
bash toggle script
loggy.sh android
intel pinning threads
how to compare percentage value in shell script
bash for interval
bash list of integers
hue run command line arguments
bash mail subject variable
calcul en shell
display used shell
git remove origin
how to remove remote origin from git repo
remove remote origin git
remove remote
how to change git remote origin
git change remote origin
git update remote origin
git push origin master --force
pip remove
git discard local changes
install angular app
git delete branch
rename branch git
get git remote url and bootstrap
install boostrap react
bootstrap react install
react bootstrap
npm install React Bootstrap
install react bootstrap
install react-bootstrap
navigation in react native
react navigation react native
npm install bootstrap
install bootstrap 4 npm
npm bootstrap
install firebase npm
change remote url git
ubuntu remove directory
copy folders linux
git set upstream
how to install tar.gz in ubuntu
how to install pip
angular create a service
git checkout branch from remote to local
react icons delete
python pip install r requirements txt
install react icon
react 3d icon library
react icons
pip install from requirements.txt
java check jre version
check jdk version
java check java
install angular material
responsive grid system angular
add material library angular
ng add @angular/material
install tensorflow
install git debian
how to make a new branch git
how to create branch in github using git bash
ubuntu install git
ubuntu install nginx
create a branch command
how to install git in ubuntu 18.04
install nginx ubuntu 20.04
create new branch git
git create branch
install express globally
express js
ubuntu cat release
check os type linux
ubuntu version command line
linux get distro
check ubuntu version
get linux OS info from os-release
linux show version
how to check version of linux command line
check the linux distribution app at port
kill process on port
manjaro kill port 3000
how to kill a process on a port?
remove all files inside directory linux
conda install tensorflow windows remote origin git
check what ports are open linux
upgrade dart in flutter
update flutter
flutter web run using vscode
export path linux
screen recorder linux
screen recorder ubuntu
linux add to path
best screen capture software for linux u
ubuntu install composer
decompress tar.gz
centos install composer
tar.gz
install composer
unzip stash contnet
git stash
git view stash
install nvm ubuntu
install openjdk8 in ubuntu
install openjdk 8 sdk on ubuntu
Could not find tools.jar debian
java 8 install
fixing a remp commit typo
sed replace with no line
connect mariadb debian
clone specific branch
makefile ifeq or
fsl orient
see saved wifi password ubuntu
How to Install Julia on Ubuntu
add url git
copy code from one repo to another git
Jwt Authentication error Argument 3 passed to Lcobucci\JWT\Signer\Hmac::doVerify()
install heroku mac
install git flow linux
install ngrok
linux bash search history
bokura no kiseki wikipedia
merge child branch to parent git
virtualbox linux manjaro
kill process running on port 80
grep exclude
ubuntu add entry to /etc/apt/sources.list
ubuntu install vboxguest
linux history with time
install node_modules folder
how to convert ui to py pyqt5
how to revert to previous kernel ubuntu
powershell check iso sha256sum
obisidian linux
install cmake ubuntu
install nginix server ubuntu linux
nodejs installation on ubuntu
bash print fields that begin with string
cmd taskkill
git remote add ssh url
remove git
microPY lib
how to stop docker
digital ocean generate ssh key
cat along with line numbers
install tkinter in ubuntu
ubuntu install ssh server
magento bin install
ubuntu uninstall composer
open current folder in terminal linux
git status deleated files
install magento 2.4.2
use xargs multiple times
get public ipv6 linux
ubuntu install mathpix
lxc delete container
how to completely remove apps ubuntu package
pip install upgrade all
check that redis is running
Connection Log connecting to sesman ip l27.0.0.1 port 3350 sesman connect ok sending login info to session manager, please wait... login failed for display 0
uninstall foxit reader
router interface down cisco
git diff.
convert capital letters to lowercase in shell script
git track remote branch
how to access adb globally on mac
remove a file in ubuntu
grub file path
terminal download manager command line
docker: Error response from daemon: Get: dial tcp: lookup registry-1.docker.io on 192.168.65.1:53: no such host. in windows
git stash contnet
awk command
ubuntu auto shutdown
ubuntu install pip
convert jpg to pdf imagemagick
cannot start database server xampp mac os
ubuntu uninstall mosquitto
install sdl2 linux
postgresql user permissions to database
Module not found: Can't resolve '@material-ui/core/Button'
yum webmin reinstall
how to check if tensorflow is working on your pc
bash print last n lines of file
on in get first two digit start with two numbers c#
conda do not activate base
Error: Node Sass does not yet support your current environment: Windows 64-bit with Unsupported runtime
git copy stash entry from one repo to another
remove simbolic link
cosmicjs
untar in specific folder
ssh login
install rclone
github check local branches
aws secrets manager get password
manueldeveloper github
warning: Pulling without specifying how to reconcile divergent branches is discouraged
mongodb get all users
how to search in a directory files in linux
what is my monitor resolution ubuntu
find mtime rm
how to set path openssl@1.1 on mac zsh
Error starting daemon: error while opening volume store metadata database: timeout
deno
Flutter plugin not installed; this adds Flutter specific functionality.
npm install upgrade react version react-scripts
install tor on debian
go to line vscode
php artisan doctrine migrations add all
vim vimrc sudo
install gh
appcenter login
DRIVE LINUX
update bootstrap 4 to 5 version in laravel
access wsl files from windows
git hooks
linux show file line size
install glade pacman
haproxy in centos 7
if else in mac terminal
certbot apache site
Debian restart service
flutter install
linux login to github via git
nuget equivalent of npm install
git override local file with remote
install gitpython
ubuntu 20.04 install google cloud sdk
mongodb install ubuntu 20.04
device or resource busy
see number of documents in mongodb collection
ubuntu macbook camera
react 17 install
use -i to suggest an answer
how to install mysql python
ssh command
install openjdk 8 sdk on ubuntu
ssh find function
how to get description of repositories using pygithub api
resize disk in AWS
alias firebase="npm 'config get prefix'/bin/firebase"
how to change permission of a folder linux
how to stop an application on a port
homebrew restart redis
add credentials to git
how to install mongodb in linux
grep - v
start vagrant
Error: Cannot install in Homebrew on ARM processor in Intel default prefix (/usr/local)!
count the nmber of folder linux command line
unetbootin ubuntu install
redis get all data
git assume unchanged and do not commit
Please install all available updates for your release before upgrading.
open file explorer from cmd
git push existing git repository
xfce ubuntu server disable suspend
raspbian shutdown command
check app installed with brew
ssh-add git
expand aliases
swappiness linux
cp folders
kill port linux
ssh option to send null packets
how to avoid some files changes to not come in git status
wsl2 file location
how to uninstall photos app in windows 10
ubunt server 20.04 dns tuto
Find and Set Local Timezone in Linux
command to install strongswan
WTForms: Install ’email_validator’ for email validation support
save account to git
delete heroku remote
Impossible de trouver le paquet php-gettext
revert uncommitted changes to a single file
Because you can never quite anticipate in which environment your particular zsh will be launched in, it is good practice to reset the options at the beginning of your script with the emulate command:
Command "python setup.py egg_info" failed with error code 1 in /tmp/pip-build-idlotqqi/cryptography/
git push empty folders
redis ubuntu install
taskkill cmd
timeshift
ubuntu tar all .log and .txt
extract tar
how to copy directory to a ssh server
$inc mongodb
copy db from one server to another mysql
install discord in ubunut
how to see our already added users in linux
installing star aligner in macOS
fix no wifi adapter found linux
bash replace multiple patterns
install workbench on ubuntu
debian 9 enable rc.local
github create repository command line
classic doom for linux ubuntu
vim count ocurrences
vmware workstation RHEL
squelize-cli create empty migration
Please tell me who you are. in git
flutter ci cd gitlab
awk match last occurrence
install wp from wp-cli
VSCode bitbucket push
how to close terminal
how to use /dev/urandom
git remove remote
how to denote spaces in path
.
|
https://www.codegrepper.com/code-examples/shell/what+is+meant+by+valence+shell
|
CC-MAIN-2021-39
|
en
|
refinedweb
|
Solution 1
def find_max_char(a_string): max_found = '' for char in a_string: if char > max_found: max_found = char return max_found
Time is over! You can keep submitting you assignments, but they won't compute for the score of this quiz.
Fix the Max Character
The function provided is broken. Your job is to figure out what's going on and fix it.
Use the tests to guide you.
|
https://learn.rmotr.com/python/base-python-track/strings/fix-the-max-character
|
CC-MAIN-2018-47
|
en
|
refinedweb
|
Using your project docs inside the application
The applications I work on have markdown docs. These can be in the docs/ folder for example as
docs/webhooks.md
But some of these docs have value to the user of the UI not just the developer, and when we include these docs inside the application repo it is a TON easier to just update them as you fix and make new features in the codebase.
You can have the best of both worlds with a simple to use library
The Controller
This then allows me, in my controllers to get some content from these docs, for example
<?php namespace App\Http\Controllers; use App\Http\Requests; use Michelf\MarkdownExtra; class HelpController extends Controller { public function api() { $text = file_get_contents(base_path('docs/webhooks.md')); $webhooks = MarkdownExtra::defaultTransform($text); return view('help.api', compact('webhooks')); } }
The Blade Template File
Then in the blade template all I need to do to show those docs are
@extends('layouts.default') @section('content') <div class="page-header"> <h1>API Help</h1> </div> <div class="row"> <div class="col-lg-12"> <div class="wrapper wrapper-content animated fadeInRight"> <div class="ibox-content"> {!! $webhooks !!} </div> </div> </div> </div> @endsection
Being a private repo we review the code so using "{!!" is not so bad. But keep in mind you are trusting what is in these files! Of course a simple
$webhooks = strip_tags($webhooks, "tags you allow here");
Will help out there.
The Markdown
Then just write your file as normal in markdown!
|
https://alfrednutile.info/posts/157
|
CC-MAIN-2018-47
|
en
|
refinedweb
|
public class SimpleThreadScope extends java.lang.Object implements Scope
Scopeimplementation.
NOTE: This thread does not clean up any objects associated with it.
As such, it is typically preferable to use
RequestScope
in web environments.
For an implementation of a thread-based
Scope with support for
destruction callbacks, refer to the
Spring by Example Custom Thread Scope Module.
Thanks to Eugene Kuleshov for submitting the original prototype for a thread scope!
RequestScope
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
public SimpleThreadScope())
@Nullable
@Nullable
|
https://docs.spring.io/spring/docs/current/javadoc-api/org/springframework/context/support/SimpleThreadScope.html
|
CC-MAIN-2018-47
|
en
|
refinedweb
|
F# Async Guide
This is a usage guide for asynchronous programming in F# using the
Async type. The content should be helpful to existing F#
Async users or those approaching F# concurrency from another programming language, and is complementary to existing material such as Asynchronous Programming by Scott Wlaschin, Async in C# and F# by Tomas Petricek and Async Programming in F# on MSDN.
Table of Contents
- Definition — the definition of the F#
Asynctype, its interaction with the thread pool and then, async workflows.
- Hazards — common programming hazards with F#
Asyncand workarounds.
- Related Programming Models — relationship to other programming models.
- Concepts — narrative on general concepts in concurrency used throughout the post.
Definition
The F# Async type represents an asynchronous computation. It is similar in concept to
System.Threading.Tasks.Task in .NET,
java.util.concurrent.Future in Java, a
goroutine in Go,
Control.Concurrent.Async in Haskell,
Event in Concurrent ML, or
promise in JavaScript, with some important differences.
Overall, F# Async serves the following needs:
- It allows for more efficient use of OS threads by preventing the need to block them when waiting.
- It provides constructs for concurrency and parallelism in addition to sequential computation.
- It indicates that a computation is long-running, or may not be expected to terminate.
Programmatically, the Async type is defined as follows:
type Async<'a> = ('a→
unit)→
unit
In other words, a value of type
Async<'a> is a function that accepts a callback function of type
'a → unit and returns
unit.
We can derive the
Async type as follows. Suppose you've an operation that transmits and then waits for a response to an HTTP request:
let download (url:string) : string =
let client = new
WebClient()
let res = client.DownloadString url
res
In this case, the call to
DownloadString is blocking - the OS thread on which the execution is taking place becomes blocked for the duration of the IO operation. When a thread is blocked, it isn't directly consuming CPU resources, however it continues to consume stack space, which it needs to resume when the operation completes. These context switches, as a thread blocks and then unblocks, are costly. We can make more efficient use of threads and processing resources by using the calling thread to invoke the operation, and when the IO operation completes, send a notification to a callback, on another thread. This can be done as follows:
let downloadCallback
(url:string)
(callback:string → unit) : unit =
let client = new
WebClient()
client.DownloadStringCompleted
|> Event.add
(fun args → callback args.Result)
client.DownloadStringAsync url
In this case, the call to
downloadCallback returns immediately, and the provided
callback is subscribed to an event that triggers when the invoked operation completes. This allows the callback to be called from a different thread, and allows the calling thread to continue doing useful work rather than remaining blocked. If you squint a little, you can see that the type of
downloadCallback url is
(string → unit) → unit and if we generalize that to a generic type
'a we end up with the definition of
Async<'a> above.
Using the
Async type, we have the following signature for the operation:
val downloadAsync : string → Async<string>
At this point, it is possible to understand why this computation is asynchronous. It is asynchronous because there are two core steps involved — the invocation of the operation and the receipt of the response. Furthermore, we can see how the async type allows us to manage OS threads more efficiently — rather than blocking the calling thread, the calling thread remains free to do other work. We’ll cover this in more detail below.
The actual implementation of the
Async type, available on the F# repo, is more involved due to the need to support exceptions, cancellations, a growing stack - some of which are discussed later on. The central 'constructor' for an
Async value is the
Async.FromContinuations function:
Async.FromContinuations :
(('a → unit) *
(exn → unit) *
(OperationsCancelledExceptions → unit) → unit) → Async<'a>
In addition to the successful completion callback
'a → unit , it takes callbacks (continuations) for errors and cancellations.
Thread Pool
Rather than managing threads directly, the
Async type works along with the .NET Thread Pool to schedule work. The thread pool maintains a pool of threads, growing and shrinking as needed and provides the following key interface:
ThreadPool.QueueUserWorkItem : (unit → unit) → unit
This operation queues an action
unit → unit to be run on a thread pool thread. The operation of the ThreadPool can be visually depicted as follows:
While it is possible to simply start a new thread whenever an action needs to be scheduled, using a thread pool allows thread creation costs as well as context switching costs to be amortized. Rather than blocking threads, threads are kept busy with a queue of work maintained by the thread pool. In the example above, the
DownloadStringCompleted event might be triggered from a thread pool thread. This approach to scheduling work items is sometimes referred to as green threads. The relationship between
Asynccomputations and OS threads is not one-to-one — more
Async computations does not automatically result in more threads, and in particular, increasing parallelism isn't achieved by increasing the number of threads, but rather, by increasing the number of in-flight computations. In effect, the
Async type encapsulates callbacks and the ThreadPool into a higher-level programming model as described below. With that said, in some cases, tuning the thread count limits on the ThreadPool can improve performance.
Async Workflows
F# async workflows provide a syntax that permits expressing sequential workflows in terms of
Async computations. For example, given the
downloadAsync operation above, we may want to perform another download based on the result of the first and then perform a transformation on both results:
let callApi (url:string) = async {
let! data1 = downloadAsync url
let! data2 = downloadAsync (url + data1)
return
data1,data2 }
While this workflow is expressed sequentially, the underlying computation runs asynchronously and avoids blocking an OS thread during the processing of
downloadAsync. This is achieved by translating the workflow syntax into
Bind and
Return operations defined on the
Async type as follows:
The result of the call to
downloadAsync is passed to
Bind and the portion of the workflow after the call to
downloadAsync is passed to
Bind as the continuation. The
Return operation takes a value, in this case the pair of
data1 and
data2, and lifts it into an
Asyncvalue. The async workflow in F# also defines operations to support other control flow constructs - loops, delayed execution and exception handling.
A chain of bind operations forms a sequential computation. Much of the theory of computation (ie Turing machine, lambda calculus) models sequential computation, where steps happen sequentially, one after another. Of course, things wouldn’t be much fun if we were limited to sequential computation. The F# Async type also allows us to also express parallel computations, using the
Async.Parallel : Async<'a>[] → Async<'a[]> operation, for example. This operation takes an array of async computations and returns a single async computation that will yield their aggregated results, thereby expressing fork-join parallelism. The "fork" part is the starting of the provided computations, and the "join" part is awaiting their results. Another way to express parallelism is with the
Async.StartChild : Async<'a> → Async<Async<'a>> operation. This operation starts a computation and returns a 'handle' to a computation that can be used to rendezvous with the result at a later time. This makes it possible to start multiple computations to be run in parallel, but still cleanly gather their results without any low level threading constructs in play. This in turn can be used to implement an operation such as
Async.Parallel : Async<'a> * Async<'b> → Async<'a * 'b>. This operation can also be implemented using the sequential workflow with the
Bind operation; however the provided computations would run sequentially rather than in parallel, changing the semantics significantly.
Hazards
There are several hazards to programming F# Async. Some are already covered in Tomas Petricek’s excellent Async in C# and F# Asynchronous gotchas in C# article, but we discuss a few more here.
Async.RunSynchronously
The
Async.RunSynchronously : Async<'a> → 'a operation provides a way to commence and then obtain the result from an async computation. The name of the operation is deliberately made cumbersome to type because it must be used judiciously. F# novices or those new to functional programming in general often struggle with as they seek to access the value produced by a computation and end up "cheating" by calling
Async.RunSynchronously. Ideally,
Async.RunSynchronously would only be invoked once for the entire program and passed an async computation representing the program. Most importantly, calls to
Async.RunSynchronously from within loops should be avoided. The reason for this is that
Async.RunSynchronously is implemented by blocking the calling thread until the async computation completes. This in effect undoes much of the benefit of using the
Async type in the first place, but is necessary in order for the async computation to take effect. If the call is made only once for the entire program, only one thread remains blocked waiting for the program to complete, which of course is fine. Frequent calls to
Async.RunSynchronously however don't play well with the .NET ThreadPool. Blocking threads will pressure the ThreadPool to create more threads, eventually causing it to reach its limits, inducing a high number of context switches and wasted stacks. Instead of calling
Async.RunSynchronously, either use async workflows or operations on the
Async type such as
async.Bind to access the produced value.
See also: Asynchronous Everything by Joe Duffy
Summary
- Avoid calling
Async.RunSynchronouslyexcept for at the entry point for the executable.
Async.Start
The
Async.Start : Async<'a> → unit operation starts an async computation without waiting for the result by scheduling the computation on a ThreadPool thread. This operation is what actually puts the async computation chain constructed by calls to operations as defined above into motion. As described, the call to
Async.RunSynchronously is implemented by starting a computation which stores its result in a wait handle on which the calling thread waits. It is akin to forking a thread. The related operations
Async.StartChild : Async<'a> → Async<Async<'a>> and
Async.StartChildAsTask also start an operation without awaiting the result, however they also return a handle making it possible to await the result. Care should be taken with these operations because they can result in overly non-deterministic executions. It may cause too many operations to be running in parallel, potentially degrading performance. Moreover, exceptions raised by computations passed to
Async.Start aren't propagated to the caller and are easily overlooked. In fact, it should rarely be needed to make use of
Async.Start in application code. Instead, favor calls to
Async.Parallel or
Async.ParallelThrottled for expressing parallelism.
For example, suppose you’ve a sequence of async computations that need to be run. One way to run them is to iterate the sequence, starting each computation with
Async.Start. However, this:
- May cause more than the desired number of computations to be run in parallel.
- Doesn’t provide a way to await the completion of the sequence and
- Leaves exceptions thrown by individual computations unhandled.
// a sequence of computations
let comps : Async<unit> seq = ...
// start each computation
// do not await the results
comps |> Seq.iter Async.Start
Instead, it is possible to run the computations in parallel using a call to Async.Parallel which will address the aforementioned issues:
// run computations in parallel,
// await the results, exceptions
// escalated to the caller
do! comps |> Async.Parallel
Another way a need to call
Async.Start may come up is to start a background process of some sort. For example, a program may have a health check or reporting process to be run along the core logic. If however this background process is run using
Async.Start, exceptions raised by the background process may be left unhandled, preventing the program from reporting its health.
val coreProcess : Async<unit>
val backgroundProcess : Async<unit>
Async.Start backgroundProcess
Async.RunSynchronously coreProcess
If this is undesirable, the fate of the background process should be tied to the fate of the core logic of the program using
Async.Parallel : Async<'a> → Async<'b> → Async<'a * 'b> :
Async.Parallel
[coreProcess; backgroundProcess]
With the alternative approach, if exceptions raised by the background process should be discarded without causing the program to crash, this can be done explicitly by catching the exceptions and logging as appropriate.
Summary
- Consider using a higher-level construct before using
Async.Start.
- Determine whether exceptions raised by computations started with
Async.Startshould affect the calling computation.
- Be sure to propagate a
CancellationTokento
Async.Startif applicable.
Async.Parallel
As described above,
Async.Parallel is a way to express fork-join parallelism. However, an important consideration when using this operation is the number of input computations provided. If the number of input computations is too high, then the call to
Async.Parallel may create too much contention for both memory and IO resulting in performance degradation. Additionally, if the sequence of computations is unbounded, the call to
Async.Parallel will run out of memory before starting any of the computations because internally, it allocates an array to store the result of each computation. Instead, consider using either
Async.ParallelThrottled : int → Async<'a>[] → Async<'a[]> or
Async.ParallelThrottledIgnore : int → Async<unit> seq → Async<int>. The former is like
Async.Parallel except it bounds the degree of parallelism, and the latter also bounds parallelism, but doesn't store the result of computations, only the count of the number completed, making it possible to use with unbounded sequences of computations. Care must be taken to tune for the appropriate degree of parallelism, especially for IO bound computations where there aren't rules of thumb such as for CPU bound computations (ie a thread per core). The best value may depend on the nature of the computations and may even change over time. An even more ideal scheduler would automatically control the degree of parallelism with a strategy to either maximize throughput or minimize latency.
The
Async.ParallelThrottledIgnore operation can be implemented as follows:
Summary
- Ensure that the number of input computations passed to
Async.Parallelis bounded.
- Consider using a throttled variant as described above to reduce contention.
- Consider using a non-Async based parallelization mechanism for compute-bound computations which don’t use Async.
Compute-Bound Computations
While it is possible to express parallelism with
Async, as described in the previous section, using this approach for compute-bound computations may not be the most efficient. A compute-bound computation is one where a majority of time is spent on computational tasks rather than awaiting IO operations. In these cases, it is better to use something like Parallel.For or PLinq to take advantage of parallelism. This method avoids the overhead involved in the
Async continuation mechanism. However, it is important to note that if a compute-bound operation does make an IO request, using
Async.RunSynchronously to await it will cause blocking and may reduce performance over using
Async.Parallel.
MailboxProcessor
As described above, the
MailboxProcessor (MBP) provides an actor-based concurrent programing model. However, for most applications, this model is fairly low-level and requires considerable care to avoid common pitfalls. The MBP is best suited for implementing higher-level library constructs, but it should be avoided in domain code for reasons described below. One of the most common hazards with the MBP is that it is easy to overlook exceptions thrown by the processing computations. These exceptions are published on the
Error event, however this event needs to be explicitly subscribed to in order to observe the errors. Even if the error is caught, it may not be clear how to proceed as the context is lost. Next, the
PostWithAsyncReply operation together with the
AsyncReplyChannel type do not provide a way to propagate exceptions, forcing users to express exceptions using an explicit
Result value or by using a
TaskCompletionSource instead.
For example:
let rec proc mbp = async {
let! (data,replyCh) = mbp.Receive ()
let! result = .... // logic
replyCh.Reply result
return! proc mbp }
let mbp =
MailboxProcessor.Start proc
let handle (data:string) : Async<string> =
mbp.PostAndAsyncReply
(fun replyCh -> data,replyCh)
Here, if the processing logic throws an exception, the caller in
handle will be suspended indefinitely and the exception will be swallowed. Moreover, the
MailboxProcessor will halt and be unable to process any additional messages. One might instead expect the exception to be escalated to the caller, and for the
MailboxProcessor to continue processing. This can be done by explicitly catching exceptions inside of the processing loop and then propagating to the caller, either using an explicit
Result value or through a
TaskCompletionSource rather than an
AsyncReplyChannel. For example:
let postAndAwaitResult
(mbp:MailboxProcessor<'a>)
(f:TaskCompletionSource<'b> → 'a) = async {
let ivar = TaskCompletionSource<_>()
mbp.Post (f ivar)
return! ivar.Task |> Async.AwaitTask }
let rec proc mbp = async {
let! (data,ivar) = mbp.Receive ()
try
let! result = ....
ivar.SetResult result
with ex ->
ivar.SetException ex
return! proc mbp }
let mbp = MailboxProcessor.Start proc
// exceptions will be escalated
// to the caller
let handle (data:string) : Async<string> =
(fun ivar → data,ivar)
Another thing to keep in mind with MBP is that the mailbox is unbounded and therefore, has the potential to overflow. In the context of a producer-consumer scenario, the producer may produce messages at a higher rate than the consumer is able to consume them, resulting in an unstable system. An explicit backpressure mechanism is needed to coordinate the consumer and the producer for preventing overflow. One way to do this is using the BoundedMb type which places a bound on the number of messages in the mailbox. If the bound is reached, the
BoundedMb exerts back-pressure on the producer.
Beyond these nuances with exceptions and back-pressure, the
MailboxProcessor programming model can lead to needless layers of indirection. In the example above, if the desired outcome is to invoke the processing logic, it is much more reasonable to simply invoke the logic directly rather than routing through the MBP. Of course the MBP can do more than simply forwarding messages, but if more complex behaviors behaviors are required, it is better to encapsulate these behaviors in a reusable data structure.
Examples of higher-level async structures that can be implemented with MBP are:
- MVar — a serialized variable with lazy initialization, akin to a
refbut with support for serialized, async-based mutation. Beware of deadlocks when mutating!
- SVar — like
MVarbut with an additional tap operation which returns an
AsyncSeqof values stored.
- Channel — synchronizes a producer and a consumer of a message. Similar in spirit to channels in Go and Concurrent ML, however without support for selective communication.
- BoundedMb — a bounded mailbox, similar in functionality to
BlockingCollection, however using
Asyncto represent waiting. This is an effective way to include back-pressure for produce-consumer scenarios.
- BatchProcessingAgent — a buffer which forms and publishes batches of publishes messages.
In many cases, it is better to rely on these data structures rather than implementing a custom MBP for a domain-specific use-case.
Another way to approach this programming model is to turn the processing logic “inside out” using
AsyncSeq. First, we repurpose the MBP to act as solely as a mailbox:
let mbp : MailboxProcessor<'a> =
MailboxProcessor.Start
(fun _ -> async.Return())
Then we represent the incoming messages as a stream using
AsyncSeq:
let stream : AsyncSeq<'a> =
AsyncSeq.replicateInfiniteAsync mbp.Receive
Now we can publish messages to the mailbox asynchronously, and consume the resulting
AsyncSeq explicitly. This allows us to use existing operations on
AsyncSeq to filter, transform and buffer the messages, it allows us to merge the stream with other streams, and represents the process explicitly as an
Async operation such that we can join it with other operations:
let proc : Async<unit> =
stream
|> AsyncSeq.bufferByTimeAndCount 100
100
|> AsyncSeq.iterAsync processBatch
This approach makes the processing logic explicit and provides a more convenient way to handle exceptions.
Summary
- Beware of exceptions raised by processing logic used inside a
MailboxProcessor.
- Consider using
TaskCompletionSourcerather than
AsyncReplyChannelto signal from within a
MailboxProcessor, particularly when exceptions may be raised.
- Consider using or implementing a higher-level component rather than using a
MailboxProcessorfor domain-specific code.
CancellationToken
A
CancellationToken is used to cancel computations in response to cancellation requests that are external to the computation itself. Several of the operations on
Async, such as
Async.Start and
Async.RunSynchronously, are parameterized with an optional
CancellationToken, such that if a cancellation is requested on that token, the computation can be notified, allowing it to terminate. There are many reasons to cancel a computation. One of the most common is to impose a timeout on a computation. More generally, the reason could be as a response to new information, invalidating the inflight computation. Care must be taken to ensure that a computation will actually respond to a cancellation request. In many cases, this is done automatically by machinery inside
Async itself. For example, before each
async.Bind is invoked, the cancellation token is checked. Also, calls to
Async.Sleep will be cancelled as expected. However, if an async computation has a prolonged compute-bound section, the cancellation token must be checked manually.
Each async computation is bound to a
CancellationToken and is accessible with
Async.CancellationToken : Async<CancellationToken>. If a token isn't provided explicitly as described above,
Async.DefaultCancellationToken is used. The default cancellation token can be cancelled by calling
Async.CancelDefaultToken, however this will signal a cancellation for all computations bound to this token. To explicitly bind an async computation to a token, the token can be passed along with the computation to
Async.Start or other operations.
As a convenience:
Note how in this case, the argument
CancellationToken is linked with the ambient
CancellationToken, and the linked token is passed to
Async.Start. As a result, the computation will be cancelled in response to either the argument
CancellationToken or in response to the ambient
CancellationToken. This may not be desired in all cases.
Cancellation tokens are not a first-class concept within the
Async type and require special treatment. In some cases, it is possible to use a first-class selective communication mechanism, or at least a best-effort attempt. What would it mean for cancellation to be first-class? A cancellation token establishes a race between two computations: the core computation at hand and the computation that represents a cancellation. For example, a timeout can be viewed as a race between a computation and a timer.
More generally, we can implement cancellations using the
Async.Choice : Async<'a option> seq → Async<'a option> operation. Given a sequence of input computations, this operation will start all of them, return the result of the first one to complete, and cancel the others. However, cancellation is a best-effort attempt, and therefore, does not represent true selective communication. For example, if we apply
Async.Choice to the
Receive operations on two
MailboxProcessor instances, the message received from the second one of the two to complete will be lost. A more elaborate synchronization mechanism is required to implement true selective communication wherein the message remains in the second mailbox.
Summary
- Be explicit about propagating cancellation tokens when calling
Async.Startand related operations accepting a cancellation token.
- Avoid calling
Async.CancelDefaultTokento avoid interference with unrelated computations.
- Be sure to extract and reference the ambient cancellation token via
Async.CancellationTokenwhen an computation has an extensive compute-bound section to ensure that it is properly cancelled.
- Consider using
Async.Choicein scenarios requiring first-class flow control.
- Take note of the issue when using
Async.AwaitTaskon cancelled
Taskinstances as described in the next section.
Async.AwaitTask
The
Async.AwaitTask : Task<'a> → Async<'a> operation translates a
Task value to an
Async value. Many asynchronous operations in the .NET Framework return
Task and this operation is used to map them to
Async. In versions of F# prior to 4.1, the implementation of
Async.AwaitTask had a bug wherein cancellations to
Task computations would be lost, resulting in indefinitely suspended
Async computations. This would lead to difficult to find bugs in the program. Many have encountered this when using HttpClient from F#. Indefinitely suspended
Async computations are a broader hazard discussed next.
Another hazard involving
Task and
Async is in attempting to use selective communication among them. For example, suppose you've a component such as a
Socket or state representing a node's view of a cluster. We can represent the state of this component using a
TaskCompletionSource which is set to the
Completed state when the component is closed, or to the
Faulted state when the component fails. Suppose also that you've component-dependent
Async operations, such as sends and receives. We'd like to cancel an in-flight operation whenever the component is closed or faulted, so that they can be retried on a new component instance. This calls for selective communication - we'd like to select between awaiting the completion of an operation or the closing of a resource. More precisely, we're looking for a function of type
chooseTaskOrAsync : Task<'a> → Async<'a> → Async<'a> where the first argument would correspond to the component state and the second to the operation. If the component is closed, we'd like to raise an exception, and to do that, we could use
Task.ContinueWith. However, since for each instance of a component we might have a large number of component-dependent operations, we'd add a large number of continuations to the
Task corresponding to the component. If those continuations aren't properly cleaned up, we end up with a memory leak. The
Task.WhenAny operation on the other hand ensures that orphaned continuations are properly cleaned up and allows us to avoid a memory leak.
Summary
- Ensure that you’re using a correct implementation of
Async.AwaitTaskto await
Taskinstances which may be cancelled.
Indefinite Suspension
Nothing in the
Async type ensures that the computation terminates. It is possible to impose a timeout, as described in the previous section, but this isn't done automatically. As a result, it is quite possible to end up with an async computation that never terminates, causing an indefinite suspension in the program. On the one hand, this accurately depicts the nature of asynchrony, but on the other hand, it can lead to some adventurous bug hunting.
A helpful operation to impose timeouts is as follows:
This operation can be applied onto top-level handler functions where it isn’t certain whether internal operations take care of timeouts, but where there is an evident upper bound on the time the operation should require. Of course some computations are deliberately non-terminating, such as a heartbeating process, for example. In this case, timeouts aren’t needed, and it may be helpful to explicitly signal this fact by returning a constructor-less
Void type from the computation.
Summary
- Consider imposing a limit on the duration of an async computation.
- Take care to propagate all forms of completion for an async computation, including errors and cancellations.
Laziness
While F# is, by default, eagerly evaluated,
Async computations are lazy, albeit with important exceptions. Laziness implies that simply having a reference to an
Async computation does not imply that that computation is running. This is in contrast to
Task, for example, which usually represents a computation which is already running. In addition, unlike lazy evaluation in languages like Haskell,
Async computations are not memoized, which means they will be reevaluated each time they are run. This is again in contrast to
Task, which is idempotent - once it completes, the produced value is memoized. The lazy nature of
Async is evident through the
async.Delay : (unit → Async<'a>) → Async<'a> operation which takes a function producing an async value, and represents it as an async value. The function will be evaluated each time the
Async computation is evaluated. The
Delay operation is used as part of a syntactic transformation of an async workflow, making everything inside an async block lazy. However, it is also possible to explicitly memoize an Async computation and it is impossible to determine whether a given async computation is memoized or not. For example, an Async computation can be memoized by using a
TaskCompletionSource to store its result:
Another example where an
Async computation is a already in flight is the result of the
Async.StartChild : Async<'a> → Async<Async<'a>> operation. When the outer
Async computation is bound, the input computation is started, and the inner
Async computation is a handle to the started computation, which when bound, awaits its result. Awaiting the inner computation multiple times does not reevaluate the input computation.
The (mostly) lazy nature of Async can lead to unexpected results. For example, suppose you want to run two Async computations in parallel, and be notified when the first one completes, but also be able to retrieve the result of the second computation once it completes. Using the Async.choose operation as defined above would cause the second computation to be cancelled. If the calling code were to await its result, the computation would be reevaluated. Instead, the following operation might be better suited to this task:
The
Async.race operation explicitly memoized the result of the second computation. We can compare this with the
Task.WhenAny operation which will also returns the first computation to complete, however the other computations are not cancelled and can still be awaited by the caller.
Thread Local Storage
As described in the Thread Pool section, async computations aren’t bound to specific threads, and a given workflow may execute across several thread pool threads throughout its lifecycle. As such, the Thread Local Storage (TLS) mechanism can’t be used to store contextual data for a workflow. However, cross-cutting concerns often require a notion of workflow-local storage, for example to store a tracing context. Even though this mechanism isn’t provided out of the box, it is possible to implement it explicitly by building a workflow for the following type:
type Context = Dictionary<string, obj>
// An async computation explicitly
// depending on a context
type AsyncEnv<'a> = Context → Async<'a>
This type can be treated in the same way as the existing
Async type by implementing a computation workflow, however it can also provide operations for reading and writing into the context. In fact, the existing
Async type already stores the ambient
CancellationToken in its context and it should be possible to extend the implementation to support arbitrary data items. Note that workflow context should be used judiciously as it can lead to unexpected results and leaks.
Summary
- Don’t rely on thread-local storage from within Async computations.
- If you need workflow-local storage, consider implementing a extended Async computation workflow.
Related Programming Models
In this section, we compare the
Async type to similar concepts in .NET and other programming languages.
.NET System.Threading.Tasks.Task
The System.Threading.Tasks.Task type in the .NET Framework serves a very similar purpose to
Async. It also represents a computation that eventually produces a value.
Async has operations to map to and from
Task. However, there are some important differences. First, a
Task is idempotent (monotonic): once it produces a value, the task is completed and will no longer perform additional computation.
Async on the other hand can be evaluated many times. It is possible to cache the result of an
Async computation, however this must be done explicitly. Second, in most cases, a
Task represents an in-progress computation, whereas an
Async represents a computation which must be explicitly evaluated. The
Task.ContinueWith operation is similar to
async.Bind - it binds a continuation to the result of the computation. Since
Task is monotonic and idempotent, it is important to note that
Task.ContinueWith adds the continuations to a list in the target computation, whereas
async.Bind returns a copy of the workflow which will be reevaluated. As a shoutout to the monad people,
Task.ContinueWith is actually the comonadic
extend operation, whereas
async.Bind is the monadic
bind operation.
Task has the additional
Unwrap operation corresponding to the monadic
join. It is possible to map between
Async and
Task using the
Async.StartAsTask and
Async.AwaitTask operations. In F# this is commonly done to interact with existing C# libraries, or to take advantage of
Task in scenarios where it is a better fit.
Java java.util.concurrent.Future
The Future type in Java is essentially the same as the
Task type above.
Akka
Akka is an actor framework for the JVM. It is heavily inspired by Erlang, and in addition to the actor model itself, provides facilities for routing, fault tolerance and distribution. As described in the MailboxProcessor section, the actor model is too low-level for many use-cases, making it easy to make mistakes. To that end, Akka also provides a Future type to express request-reply interactions. The FSharp.Akka library is a wrapper for the Akka.net port of Akka.
Go Goroutine
A Goroutine is very similar to F# Async. The Go concurrency model is heavily inspired by CSP, and in addition to goroutines, it includes channels. A channel is a junction across which goroutines can exchange messages. The select statement provides selective communication amongst channels. Note that selective communication is not an entirely trivial concept.
JavaScript Promise
A JavaScript promise is essentially the same thing as
Task and
Future, and also similar to
Async. NodeJS users are familiar with the pain of callback-style programming, and JavaScript promises adapt it to the more convenient sequential flow control style.
Haskell Control.Concurrent.Async
The Haskell Async type is a thin layer atop the IO monad and is very similar to the F# Async type. There are additional constructs in the Control.Concurrent namespace, such as
MVar,
IVar and
Chan.
IVar is essentially
TaskCompletionSource and
MVar is described above in the
MailboxProcessor section.
Chan is similar to channels in Go and Concurrent ML. In addition, Haskell has other concurrent programming models such as Software Transactional Memory (STM) and Transactional Events. Simon Marlow's book Parallel and Concurrent Programming in Haskell offers a wealth of information on concurrent programming in Haskell.
Concurrent ML
Concurrent ML is a concurrency library for the ML programming language. The
Event construct is very similar to F# Async, however at closer inspection it supports a richer set of operations. In particular, Event and the accompanying Channel construct in ML support selective communication. Selective communication forms a proper disjunction between computations, committing to one and ensuring the other is not committed to. Hopac is an implementation of Concurrent ML in F#, with a vast array of operations and types. In essence, it is an implementation of the pi-calculus.
Joinads
Joinads is a research extension of F# based on the join-calculus programming model. Joinads also include a syntactic construct extending the existing
match syntax in F#, allowing the expression of join patterns among multiple channels. This provides a richer and more convenient set of synchronization mechanisms beyond F# Async - in particular, selective communication. With any luck, the programming model will make it into the core F# language at some point.
Hopac
Hopac is an implementation of Concurrent ML in F#. It provides a much richer set of operations than the F# Async type, in particular for selective communication. It is also more efficient than F# Async or Task for many workloads. In addition, the library is accompanied by a wealth of documentation which is useful for programmers in any language.
Clojure Async
F# Async is similar to and is motivated by many of the same reasons that Clojure Async is.
Concepts
This section is a narrative on concepts of concurrent and parallel programming used throughout the post.
Concurrency & Parallelism
Concurrency refers to the absence of ordering information among events. In other words, given two events, if we don’t know which came first, we call the events concurrent. Furthermore, even if we impose a total order on the events in the system, operations, consisting of an invocation and completion event, are regarded as concurrent when they overlap. Even though one operation may start before the other, overlap in their spans makes the ordering between operations a partial order. Concurrent programming refers to programming in the face of absence of ordering information among some subset of events in the system. Various models of concurrency have been developed in order to better understand the semantics of concurrency and/or to provide a programming model suited to concurrent domains. We shall discuss a few of these models and relate them to F#.
One model of concurrency from the process calculi family is called Communicating Sequential Processes (CSP). CSP models a concurrent system as a collection of independent, sequential processes (i.e. threads) which interact at explicit junctions. An interaction event is a point of synchronization between processes, allowing the exchange of information. Another model of concurrency is the actor model wherein actors, which are sequential threads of control, are a core computational primitive. Both processes in CSP and actors in the actor model interact using explicit message passing, rather than through shared memory, such as in the PRAM model. Note however that this distinction between shared memory and message passing becomes blurred since interactions with shared memory can also be modeled using message passing. Indeed, it takes a non-negligible amount of time to send a read request across the memory bus, and moreover, modern memory systems rely on cache coherence protocols in order to provide consistent guarantees. Both CSP and the actor model are notable because they’ve been very influential in the design of programming models for concurrency. The actor model is well known through the Erlang programming language, or the Akka actor framework on the JVM. CSP influenced the Concurrent ML programming model as well as the concurrency model in Go.
In .NET, we’ve the fundamental synchronization primitives which include locks, synchronization events, wait handles, interlocked operations, etc. A lock or mutex, for example, facilitates interaction among threads by delimiting a section of code — called the critical section — that can only be accessed by one thread at a time, providing mutual exclusion. Multiple threads can execute a critical section, but just one at a time, which makes it much easier to reason about memory access and mutation. Synchronization events also facilitate interaction among threads by allowing one thread to wait on a signal from another thread or process. Interlocked operations are essentially locks at the hardware level. The introduction of concurrent collections in .NET provided access to the higher-level producer-consumer pattern. The TaskCompletionSource type is similar to a synchronization event, however the signal can be accompanied by data, and waiting is expressed using the Task type.
In F# we also have the
MailboxProcessor (MBP) which, as alluded by the name consists of a mailbox and a processor. The mailbox can be posted to and received from, and the processor is a thread of control interacting with the mailbox. Semantically, the
MailboxProcessor can be associated to the actor model of concurrency, though typical actor model implementations (such as Akka.NET) are accompanied by support for distribution as well as a range of facilities for routing and fault-tolerance. The MBP manages concurrency by (FIFO) ordering messages posted to the mailbox. The thread of control processes a single message at a time without any need to consider parallelism in the implementation as only a single message is processed from the queue at any point in time. MBPs are particularly useful for implementing higher-level constructs such as producer-consumer queues, buffers, channels, etc.
Concurrency and parallelism are related notions and are often used interchangeably. However, upon a closer inspection, their relationship is more of a duality. Parallelism is the idea of launching operations to be run in parallel. This in turn results in events, generated by those operations, which are concurrent, because ordering information is absent. Concurrency, on the other hand, typically refers to synchronization among concurrent events. Speaking loosely, parallelism generates disorder and concurrency synchronizes it. As an example, the
Async.Parallel operation involves both - it first parallelizes the input computations, but then it synchronizes the parallel computations into a single converged result.
Asynchronous & Synchronous
The Async type is so called because it enables controlled use of asynchrony by decoupling the invocation of an action from the handing of its result, while retaining sequential flow control. Asynchrony allows for more efficient use of threads, as well as for expression of parallelism and concurrency. A related notion is that of an asynchronous network wherein there is no bound on message transmission delay. The underlying substrate is that of asynchrony — the event that represents a message being transmitted is decoupled from the event representing receipt or completion, resulting in temporal decoupling. However, complete asynchrony wouldn’t be of much use without synchronization. In terms of events, synchronization is the act of combining multiple events into one. For example, an interaction between two processes can be represented by two events, one at each process. In the theory of concurrency this is known as synchronous rendezvous. In .NET,
TaskCompletionSource is a way to implement a form of rendezvous between threads, with one thread waiting for a value and another signaling the value. In Go and Hopac, for example, channels are used as a rendezvous mechanism. It should be noted that synchronization requires coordination among participants. This can be costly in the context of a single process and even more so across network boundaries. As such, systems should be designed to be asynchronous to the extent possible, but with principled use of synchronization where it is required, keeping locality in mind.
Selective Communication
Selective communication is a concept involving channels, as seen in Go, Haskell, Concurrent ML, and F# Hopac. Selective communication is the idea of selecting a message from a set of channels, picking the first one to produce a message, while leaving the others intact. A critical component of selective communication is that only one channel is picked and received from, with the others left intact. Simply invoking a receive operation from multiple channels in parallel doesn’t quite do the trick since it may cause multiple channels to dequeue a message where only one will be received by the caller. F# Async doesn’t provide a selective communication mechanism out of the box. More broadly in .NET, we’ve the
BlockingCollection.TakeFromAny operation, but of course
BlockingCollection uses blocking as its synchronization mechanism. The need for selective communication is quite common. Whenever a choice needs to be made among a set of possible events, there's a need for selective communication. In this sense, selective communication is the dual to parallelism. However, selective communication is typically implemented in ad-hoc ways; in .NET it is usually done using
CancellationToken.
See also: The Hopac Programming Manual.
Acknowledgements
Thanks to Gustavo Leon, Eirik Tsarpalis, Ruben Bartelink and many others at Jet for comments, edits, suggestions.
|
https://medium.com/jettech/f-async-guide-eb3c8a2d180a?source=collection_home---4------11---------------------
|
CC-MAIN-2018-47
|
en
|
refinedweb
|
ReJSON: Redis as a JSON Store
ReJSON: Redis as a JSON Store
We've created ReJSON, a Redis module that provides native JSON capabilities. ReJSON should make any Redis user giddy with JSON joy.
Join the DZone community and get the full member experience.Join For Free
Download "Why Your MySQL Needs Redis" and discover how to extend your current MySQL or relational database to a Redis database.
In this post, we'll check out case, I was shocked when a couple of years ago I learned that the two don’t get along.
Redis isn’t a one-trick pony. It is, in fact, quite the opposite. Unlike general purpose one-size-fits-all databases, Redis (AKA the “Swiss Army Knife of Databases,” “Super Glue of Microservices,” and “Execution context of Functions-as-a-Service”) provides specialized tools for specific tasks. Developers use these tools, which are exposed as abstract data structures and their accompanying operations, to model optimal solutions for problems. And that is exactly the reason why using Redis for managing JSON data is unnatural.
Fact: Despite its multitude of core data structures, Redis has none that fit the requirements of a JSON value. Sure, you can work around that by using other data types; Strings are great for storing raw serialized JSON, and you can represent flat JSON objects with Hashes. But these workaround patterns impose limitations that make them useful only in a handful of use cases, and even then the experience leaves an un-Redis-ish aftertaste. Their awkwardness clashes sharply with the simplicity and elegance of using Redis normally.
But all that changed during the last year after Salvatore Sanfilippo’s @antirez visit to the Tel Aviv office, and with Redis modules becoming a reality. Suddenly, the sky wasn’t the limit anymore. Now that modules let anyone do anything, it turned out that I could be that particular anyone. Picking up on C development after more than a two decades hiatus proved to be less of a nightmare than I had anticipated, and with Dvir Volk’s (@dvirsky) loving guidance, we birthed ReJSON.
While you may not be thrilled about its name (I know that I’m not; suggestions are welcome), ReJSON itself should make any Redis user giddy with JSON joy. The module provides a new data type that is tailored for fast and efficient manipulation of JSON documents. Like any Redis data type, ReJSON’s values are stored in keys that can be accessed with a specialized subset of commands. These commands, or the API that the module exposes," 127.0.0.1:6379> ^C ~$
Like any well-behaved module,.
What happens under the hood is that whenever you call
JSON.SET, the module takes the value through a streaming lexer that parses the input JSON and builds tree data structure from it:
ReJSON stores the data in binary format in the tree’s nodes and supports a subset of JSONPath for easy referencing of subelements. It boasts an arsenal of atomic commands that are tailored for every JSON value type, including
JSON.STRAPPEND for appending strings,
JSON.NUMMULTBY for multiplying numbers, and
JSON.ARRTRIM for trimming arrays… and making pirates happy.
Because ReJSON is implemented as a Redis module, you can use it with any Redis client that: supports modules (ATM none) or allows sending raw commands (ATM most). For example, you can use a ReJSON-enabled Redis server from your Python code with redis-py like so:
import redis import json data = { 'foo': 'bar', 'ans': 42 } r = redis.StrictRedis() r.execute_command('JSON.SET', 'object', '.', json.dumps(data)) reply = json.loads(r.execute_command('JSON.GET', 'object'))
But that’s just half of it. ReJSON isn’t only a pretty API, it also a powerhouse in terms of performance. Initial performance benchmarks already demonstrate that, for example:
The above graphs compare the rate (operations/sec) and average latency of read and write operations performed on a 3.4KB JSON payload that has three nested levels. ReJSON is pitted against two variants that store the data in Strings. Both variants are implemented as Redis server-side Lua scripts with the
json.lua variant storing the raw serialized JSON, and
msgpack.lua using MessagePack encoding.
If you have 21 minutes to spare, here’s the ReJSON presentation from Redis Day TLV.
You can start playing with ReJSON today! Get it from the GitHub repository or read the docs online. There are still many features that we want to add to it, but it’s pretty neat as it is. If you have feature requests or have spotted an issue, feel free to use the repo’s issue tracker. You can always or tweet at me — I’m highly-available. }}
|
https://dzone.com/articles/redis-as-a-json-store
|
CC-MAIN-2018-47
|
en
|
refinedweb
|
The Web Cryptography API
Tim Taubert explores how we can keep secrets with JavaScript
Due to its nature as a dynamic language, it is surprisingly difficult to safely implement cryptographic primitives in JavaScript. To bridge this gap, a W3C working group was formed to design an API that provides these basic building blocks to web pages, apps and workers. Modern browsers already ship with everything that is required to build such an API, as enabling secure connections to servers via HTTPS requires that same functionality.
The Web Cryptography API, at home under the namespace window.crypto, accepts input data in the form of TypedArray objects. As cryptographic
operations can be quite expensive, all its methods return promises resolving to ArrayBuffer objects to not block the browser for the length of the computation. A reliable source of randomness is essential, and thus there exists window.crypto.getRandomValues() to fill a given typed array with
pseudo-random bytes:
var buffer = new Uint8Array(16);
crypto.getRandomValues(buffer);
The majority of the API is exposed through window.crypto.subtle. The word ‘subtle’ indicates that most of the available algorithms have subtle usage requirements that need to be fulfilled to provide the desired security guarantees. Implementing cryptography is hard; the tiniest mistake can
break the security of your application.
Enough warnings! Let’s take a look at another example. When downloading files over the internet, to ensure integrity it is important not only to check for corruptions, but also for malicious modifications. The WebCrypto API makes it easy to provide a checksum computed by a cryptographic hash function along with the file:
crypto.subtle.digest(“SHA-256”, data)
.then(function (digest) {
console.log(digest);
});
The above example will compute an SHA-256 digest over the given data argument and, as soon as the operation finishes, log the resulting ArrayBuffer to the browser console. Encrypting data can be a little more complicated, depending on the algorithm you choose. AES-GCM is a standard that uses a random component, the initialisation vector (IV), to ensure equal plaintexts will never have the same ciphertexts:
var iv = crypto.getRandomValues(new Uint8Array(16));
var alg = {name: “AES-GCM”, iv: iv};
crypto.subtle.encrypt(alg, key, data)
.then(function (ciphertext) {
console.log(ciphertext);
});
A random key and IV are used to encrypt the given data argument. The ciphertext logged to the console can later only be decrypted with the same key and IV.
The current versions of Firefox and Chrome support most algorithms listed in the specification, though both implementations are still works in progress. In the short term, we will most likely see the addition of algorithms such as Curve25519. In the more distant future, the API might be shaped by W3C’s Streams API — encrypting and securing streams of data would be an exciting extension.
Tim works on Firefox and helps implement the WebCrypto API. He enjoys cryptography and running, as well as craft beers and riding things with two wheels
This article originally appeared in issue 268 net magazine.
|
https://medium.com/net-magazine/the-web-cryptography-api-15d052271494
|
CC-MAIN-2018-47
|
en
|
refinedweb
|
Odoo Help
Odoo is the world's easiest all-in-one management software. It includes hundreds of business apps:
CRM | e-Commerce | Accounting | Inventory | PoS | Project management | MRP | etc.
Replace Session Store of odoo/werkzeug
We are running odoo on two dedicated servers with the same database. A load balancer distribute the requests to both servers. The problem is that both servers don't know the user sessions of each other server because the sessions are saved on the filesystem (werkzeug.contrib.sessions.FilesystemSessionStore, see openerp/http.py -> Root -> session_store). So I thought I overwrite this session with an own postgres session store by a new module (which I want to contribute if it's done).
Ok, this is the theory and it works - at least if the module is already installed and the database is known at the start of odoo (e.g. with -d <database>). The problem is that the module file is only loaded if the module is installed (what is good). But if this file is loaded to late then other functions have already fetched the session store. So my overwritings are too late.
Here is an minimized example of my module:
from openerp.http import OpenERPSession, Root
from openerp.tools.func import lazy_property
from werkzeug.contrib.sessions import SessionStore
class PostgresSessionStore(SessionStore):
# some functions which are already implemented
@lazy_property
def session_store(self):
return PostgresSessionStore(session_class=OpenERPSession)
Root.session_store = session_store
Now is my question: Do you know a better way to replace the session store without overwriting the odoo core so that the session store is replaced if the module is installed later or database is given later? I thought about some hacks like in [1] but I think this is not the good way.
[1]
In Odoo this can be implemented as a command and used to run Odoo with the needed calls to the bootstrap code and changes to http.py before been loaded because for commands the modules are loaded ok. The default command is server who bootstrap the Odoo server using the config options. Your command need to do pretty much the same but with changes in the right places
I have two suggestions
1 - Why not use nfs to share session_dir?
2 - Implement a custom start script instead of odoo.py and reassign openerp.http.root to your override.
class NewRoot(openerp.http.Root)
@lazy_property
def session_store(self):
return <your session store instance>
Then in your main method
def main()
import openerp
openerp.http.root = NewRoot() #override here
openerp.cli.main()
Hi, We had some trouble using NFS. It seems that there are locks on the files, resulting to page loading very slowly.
About This Community
Odoo Training Center
Access to our E-learning platform and experience all Odoo Apps through learning videos, exercises and Quizz.Test it now
I'm also very interested in this. I created a simple module that stores the sessions in Redis, but got stuck in the same place as you. I think the proper way would be to create a parameter to Odoo configuration file (eg. session_store = werkzeug.contrib.sessions.FilesystemSessionStore), modify http.py to read the session storage class from the configuration file and file a pull request to Odoo 8.0. I just don't know if Odoo S.A. will accept such pull requests, but maybe we should at least try.
@Miku: This idea sounds good. How is your process? Did you achieved something like this? Or should I try my luck on this?
I created a PR for this:
Hi @Miku Laitinen
I did the same in OpenERP v7. There was no other way to do it when you config workers
|
https://www.odoo.com/forum/help-1/question/replace-session-store-of-odoo-werkzeug-86843
|
CC-MAIN-2018-47
|
en
|
refinedweb
|
Messaging with RabbitMQ and .NET C# part 1: foundations and setup
April 28, 2014 6 Comments
Introduction
Messaging is a technique to solve communication between disparate systems in a reliable and maintainable manner. You can have various platforms that need to communicate with each other: a Windows service, a Java servlet based web service, an MVC web application etc. Messaging aims to integrate these systems so that they can exchange information in a decoupled fashion.
A message bus is probably the most important component in a messaging infrastructure. It is the mechanism that co-ordinates sending and receiving messages in a message queue.
There have been numerous ways to solve messaging in the past: Java Messaging Service, MSMQ, IBM MQ, but they never really became widespread. Messaging systems based on those technologies were complex, expensive, difficult to connect to and in general difficult to work with. Also, they didn’t follow any particular messaging standard; each vendor had their own standards that the customers had to adhere to.
RabbitMQ is a high availability messaging framework which implements the Advanced Message Queue Protocol (AMQP). AMQP is an open standard wire level protocol similar to HTTP. It is also independent of any particular vendor. Here are some key concepts of AMQP:
- Message broker: the messaging server which applications connect to
- Exchange: there will be a number of exchanges on the broker which are message routers. A client submits a message to an exchange which will be routed to one or more queues
- Queue: a store for messages which normally implements the first-in-first-out pattern
- Binding: a rule that connects the exchange to a queue. The rule also determines which queue the message will be routed to
There are 4 different exchange types:
- Direct: a client sends a message to a queue for a particular recipient
- Fan-out: a message is sent to an exchange. The message is then sent to a number of queues which could be bound to that exchange
- Topic: a message is sent to a number of queues based on some rules
- Headers: the message headers are inspected and the message is routed based on those headers.
Installation
RabbitMQ is based on Erlang. There are client libraries for a number of frameworks such as .NET, Java, Ruby etc. We’ll of course be looking at the .NET variant. I’m going to run the installation on Windows 7. By the time you read this post the exact versions of Erlang and RabbitMQ server may be different. Hopefully there won’t be any breaking changes and you’ll be able to complete this tutorial.
Open a web browser and navigate to the RabbitMQ home page. We’ll need to install Erlang first. Click Installation:
…then Windows…:
Look for the following link:
This will get you to the Erlang page. Select either the 32 or 64 bit installation package depending on your system…:
This will download an installation package. Go through the installation process accepting the defaults. Then go back to the Windows installation page on the RabbitMQ page and click the following link:
Again, go through the installation process and accept the defaults.
RabbitMQ is now available among the installed applications:
Run the top item, i.e. the RabbitMQ command prompt.:
As the message says we’ll need to restart the server. The following command will stop the server:
rabbitmqctl stop
…and the following will start it:
rabbitmq-service start
In case the command prompt is complaining that the access was denied then you’ll need to run the command prompt as an administrator: right-click, and Run As Administrator from the context menu.
Open a web browser and navigate to the following URL:
This will open the RabbitMQ management login page. The default username and password is ‘guest’. Click around in the menu a bit. You won’t see much happening yet as there are no queues, no messages, no exchanges etc. Under the Exchanges link you’ll find the 4 exchange types we listed in the introduction.
We’re done with the RabbitMQ server setup.
RabbitMQ in .NET
There are two sets of API to interact with RabbitMQ in .NET: the general .NET library and WCF specific bindings. This binding allows the programmer to interact with the RabbitMQ service as if it were a WCF service.
Open Visual Studio 2012/2013 and create a new Console application. Import the following NuGet package:
Add the following using statement to Program.cs:
using RabbitMQ.Client;
Let’s create a connection to the RabbitMQ server in Main. The ConnectionFactory object will help build an IConnection:
ConnectionFactory connectionFactory = new ConnectionFactory(); connectionFactory.HostName = "localhost"; connectionFactory.UserName = "guest"; connectionFactory.Password = "guest"; IConnection connection = connectionFactory.CreateConnection();
An IModel represents a channel to the AMQP server:
IModel model = connection.CreateModel();
From IModel we can access methods to send and receive messages and much more. As we have no channels yet there’s no point in trying to run the available methods on IModel. Let’s return to RabbitMQ and create some queues!
Back in RabbitMQ
There are a couple of ways to create queues and exchanges in RabbitMQ:
- During run-time: directly in code
- After deploy: through the administration UI or PowerShell
We’ll look at creating queues and exchanges in the UI and in code. I’ll skip PowerShell as I’m not a big fan of writing commands in command prompts.
Let’s look at the RabbitMQ management console first. Navigate to the admin UI we tested above and log in. Click on the Exchanges tab. Below the table of default exchanges click the Add a new exchange link. Insert the following values:
- Name: newexchange
- Type: fanout
- Durability: durable (meaning messages can be recovered)
Keep the rest unchanged and click Add exchange. The new exchange has been added to the table above.
Next go to the Queues link and click on Add a new queue. Add the following values:
- Name: newqueue
- Durability: durable
Keep the rest of the options unchanged and press Add queue. The queue has been added to the list of queues on top. Click on its name in the list, scroll down to “Bindings” and click on it. We’ll bind newexchange to newqueue. Insert ‘newexchange’ in the “From exchange” text box. We’ll keep it as a straight binding so we’ll not provide any routing key. Press ‘Bind’. The new binding will show up in the list of bindings for this queue.
Open a new tab in the web browser and log onto the RabbitMQ management console there as well. Go to the Exchanges tab and click on the name of the exchange we’ve just created, i.e. newexchange. Open the ‘Publish message’ section. We have no routing key, we only want to send a first message. Enter some message in the Payload text box and press Publish message. You should see a popup saying Message published:
Go back to the other window where we set up the queue. You should see that there’s 1 message waiting:
Click on the name of the queue in the table and scroll down to the Get messages section. Open it and press Get Message(s). You should see the message payload you entered in the other browser tab.
Creating queues at runtime
You can achieve all this dynamically in code. Go back to the Console app we started working with. Add the following code to create a new queue:
model.QueueDeclare("queueFromVisualStudio", true, false, false, null);
As you type in the parameters you’ll recognise their names from the form we saw in the management UI.
We create an exchange of type topic:
model.ExchangeDeclare("exchangeFromVisualStudio", ExchangeType.Topic);
…and finally bind them specifying a routing key of “superstars”:
model.QueueBind("queueFromVisualStudio", "exchangeFromVisualStudio", "superstars");
The routing key means that if the message routing key contains the word “superstars” then it will be routed from exchangeFromVisualStudio to queueFromVisualStudio.
Run the Console app. It should run without exceptions. Go back to the admin UI and check if the exchange and queue have been created. I can see them here:
The binding has also succeeded:
Let’s test if this setup works. In the UI navigate to the exchange created through VS and publish a message:
Then go to the queue we set up through VS to check if the message has arrived. And it has indeed:
You can perform the same test with a different routing key, such as “music”. The message should not be delivered. Indeed, the popup message should say that the message has not been routed. This means that there’s no queue listening to messages with that routing key.
This concludes our discussion on the basics of messaging with RabbitMQ. We’ll continue with some C# code in the next installment of the series.
View the list of posts on Messaging here.
Very nice and usefull article for me, Andras.
Pingback: Domain Driven Design with Web API extensions part 6: domain events with RabbitMQ | Dinesh Ram Kali.
Andras, you do a great and helpfull job. Really nice! Thank you!
Wonderful Article! Thanks a lot ! Kindly let me know where I can find remaining series .
Hello, you can find a link to all posts on this page:
//Andras
Wonderful job. Very clear, simple and didactic. Thank you very much, your article is very helpful.
|
https://dotnetcodr.com/2014/04/28/messaging-with-rabbitmq-and-net-c-part-1-foundations-and-setup/
|
CC-MAIN-2018-47
|
en
|
refinedweb
|
ESP8266 Deploying Micropython and Using REPL
ESP8266
The ESP8266 is a low-cost Wi-Fi microchip with full TCP/IP stack and microcontroller capability produced by Espressif Systems. One of the coolest things about this cip is it can run Micropython. If you are new to programming or hardware/embedded systems and want to get into those, ESP8266 is a good way to get started.
Micropython
MicroPython is a lean and efficient implementation of the Python 3 programming language that includes a small subset of the Python standard library and is optimised to run on microcontrollers and in constrained environments. - Source
As Micropython follows Python 3 coding standard. It is very easy for people who know python to get into hardware stuff.
Let’s get started
I’m using NodeMCU for now. If your are not from electronics/embedded systems background, it is better to go with development boards like NodeMCU than using chips and breadboards and if you are from electronics background; these development boards are very useful for prototyping.
Download the firmware.
You can find the stable and nightly builds for micropython for ESP8266 in MicroPython’s Download section
Deploy the firmware on ESP8266
To deploy the Firmware on ESP8266 there is a python tool called
esptool.
You can install it using
pip (this tool is written in python, so if you are
on linux or on mac os you will already have python installed with either
pip
or
easy_install. If you are on windows, you need to install python first to
use this tool.)
or you can install the latest version from it’s github repo
To install
esptool using pip
$ pip install esptool
To install
esptool from github repo
$ git clone $ cd esptool $ python setup.py build $ python setup.py install
Once this tool is installed you first need to erase the flash of ESP8266 modeule using following command.
$ esptool.py --port /dev/ttyUSB0 erase_flash
To deploy the firmware you have just downloaded
$ esptool.py --port /dev/ttyUSB0 --baud 460800 write_flash --flash_size=detect 0 esp8266-20180511-v1.9.4.bin
For some boards with a particular FlashROM configuration (e.g. some variants of a NodeMCU board) you may need to use the following command to deploy the firmware (note the -fm dio option):
$ esptool.py --port /dev/ttyUSB0 --baud 460800 write_flash --flash_size=detect -fm dio 0 esp8266-20180511-v1.9.4.bin
After you successfully deployed the firmware the controller will reset itself and then you are ready to use the REPL.
For those who don't know about REPL, it stands for Read–Eval–Print Loop it is the "language shell". If you have used the python intepreter before; that is REPL.
Using REPL
You can access the MicroPython REPL on ESP8266 in two different ways.
- Over
Serial or tty Port
- Web REPL
REPL Over Serial Port
To access the prompt over USB-serial you need to use a terminal emulator program. There are various good tools available for this purpose.
Windows
- TeraTerm
- Putty
Linux
- Minicom
- PicoCom
- Screen
- GtkTerm
MacOs
- Screen
There are plenty of other tools avalable for each of these platforms you can choose whichever you like.
The default baudrate for the module is
115200.
WebREPL
WebREPL allows you to use the Python prompt over WiFi, connecting through a browser. The latest versions of Firefox and Chrome are supported.
Connect the module using USB Serial and set password for WebREPL
import webrepl_setup
Go to WebREPL client from browser.
Then Connect to the NodeMCU’s accesspoint.
The ESSID is of the form
MicroPython-xxxxxxwhere the
x’s are replaced with part of the MAC address of your device (so will be the same everytime, and most likely different for all ESP8266 chips). The password for the WiFi is
micropythoN
Enter IP:
ws://192.168.4.1:8266/and click connect.
Enter the password you just set in the terminal screen on your browser.
Once this is done you will see the “
>>>” prompt, now you can use your ESP8266 module from your web browser itself.
In the next post I’ll be writing about networking with ESP8266 (connecting 8266 module to a wifi network and making http requests from and to ESP8266).
|
http://girishjoshi.io/post/esp8266-deploying-micropython-and-using-repl/
|
CC-MAIN-2018-47
|
en
|
refinedweb
|
F# is both a parallel and a reactive language. By this we mean that running F# programs can have both multiple active evaluations (e.g. .NET threads actively computing F# results), and multiple pending reactions (e.g. callbacks and agents waiting to react to events and messages).
One simple way to write parallel and reactive programs is with F# async expressions. In this and future posts, I will cover some of the basic ways in which you can use F# async programming – roughly speaking, these are design patterns enabled by F# async programming. I assume you already know the basics of using async, e.g. see this introductory guide.
We’ll start with two easy design patterns: Parallel CPU Asyncs and Parallel I/O Asyncs.
- Part 3 describes lightweight, reactive, isolated agents in F# .
Pattern #1: Parallel CPU Asyncs
Let’s take a look at an example of our first pattern: Parallel CPU Asyncs, that is, running a set of CPU-bound computations in parallel. The code below computes the Fibonacci function, and schedules the computations in parallel:
let rec fib x = if x <= 2 then 1 else fib(x-1) + fib(x-2)
let fibs =
Async.Parallel [ for i in 0..40 -> async { return fib(i) } ]
|> Async.RunSynchronously
Producing:
val fibs : int array =
[|]
The above code sample shows the elements of the Parallel CPU Asyncs pattern:
(a) “async { … }” is used to specify a number of CPU tasks
(b) These are composed in parallel using the fork-join combinator Async.Parallel
In this case the composition is executed using Async.RunSynchronously, which starts an instance of the async and synchronously waits for the overall result.
You can use this pattern for many routine CPU parallelization jobs (e.g. dividing and parallelizing a matrix multiply), and for batch processing jobs.
Pattern #2: Parallel I/O Asyncs
So far we have only seen parallel CPU-bound programming with F#. One key thing about F# async programming is that you can use it for both CPU and I/O computations. This leads to our second pattern: Parallel I/O Asyncs, i.e. doing I/O operations in parallel (also known as overlapped I/O). For example, the following requests multiple web pages in parallel and reacts to the responses for each request, and returns the collected results.
open System
open System.Net
open Microsoft.FSharp.Control.WebExtensions
let http url =
async { let req = WebRequest.Create(Uri url)
use! resp = req.AsyncGetResponse()
use stream = resp.GetResponseStream()
use reader = new StreamReader(stream)
let contents = reader.ReadToEnd()
return contents }
let sites = [“”;
“”;
“”;
“”]
let htmlOfSites =
Async.Parallel [for site in sites -> http site ]
|> Async.RunSynchronously
The above code sample shows the essence of the Parallel I/O Asyncs pattern:
(a) “async { … }” is used to write tasks which include some asynchronous I/O.
(b) These are composed in parallel using the fork-join combinator Async.Parallel
In this case, the composition is executed using Async.RunSynchronously, which synchronously waits for the overall result
Using let! (or its resource-disposing equivalent use!) is one basic way of composing asyncs. A line such as
let! resp = req.AsyncGetResponse()
causes a “reaction” to occur when a response to the HTTP GET occurs. That is, the rest of the async { … } runs when the AsyncGetResponse operation completes. However, no .NET or operating system thread is blocked while waiting for this reaction: only active CPU computations use an underlying .NET or O/S thread. In contrast, pending reactions (for example, callbacks, event handlers and agents) are relatively cheap, often as cheap as a single registered object. As a result you can have thousands or even millions of pending reactions. For example, a typical GUI application has many registered event handlers, and a typical web crawler has a registered handler for each outstanding web request.
In the above, “use!” replaces “let!” and indicates that the resource associated with the web request should be disposed at the end of the lexical scope of the variable.
One of the nice things about I/O parallelization is scaling. With multi-core CPU-bound programming you often see 2x, 4x or 8x speedups if you work hard enough on a many-core machine. With I/O parallel programming you can perform hundreds or thousands of operations in parallel (though actual parallelization depends on your operating system and network connections), giving speedups of 10x, 100x, 1000x or more, even on a single-core machine. For example, see the use of F# asyncs in this nice sample, ultimately called from an Iron Python application.
Many modern applications are I/O bound so it’s important to be able to recognize and apply this design pattern in practice.
Starting on the GUI Thread, finishing on the GUI thread
There is an important variation on both of these design patterns. This is where Async.RunSynchronously is replaced by Async.StartWithContinuations. Here the parallel composition is started and you specify three functions to run when the async completes with success, failure or cancellation.
Whenever you face the problem “I need to get the result of an async but I really don’t want to use RunSynchronously”, then you should consider either:
(a) start the async as part of a larger async by using let! (or use!), or
(b) start the async with Async.StartWithContinuations
Async.StartWithContinuations is very useful when starting asyncs on the GUI thread, since you never want to block the GUI thread, instead you want to schedule some GUI updates to occur when the async completes. For example, this is used in the BingTranslator examples in the F# JAOO Tutorial code. A full version of this sample is shown at the end of this blog post, but the important thing here is to note what happens when the “Translate” button is pressed:
button.Click.Add(fun args ->
let text = textBox.Text
translated.Text <- “Translating…”
let task =
async { let! languages = httpLines languageUri
let! fromLang = detectLanguage text
let! results = Async.Parallel [for lang in languages -> translateText (text, fromLang, lang)]
return (fromLang)))
In the highlighted parts, the async is specified, and this includes a use of Async.Parallel to translate the input text into multiple languages in parallel. The composite async is started with Async.StartWithContinuations. This unblocks as soon as the async hits its first I/O operation, and specifies three functions to run when the async completes with success, failure or cancellation. Here is a screen shot of the operation after the task completes (no guarantees given about the accuracy of the translation…)
Async.StartWithContinuations has the important property that if the async is started on the GUI thread (i.e. a thread with a non-null SynchronizationContext.Current), then the completion function is called on the GUI thread. This makes it safe to update the results. The F# async library allows you to specify composite I/O tasks and use them from the GUI thread without having to marshal your updates from background threads, a topic we’ll explore in later posts.
Some notes on how Async.Parallel works:
Ø When run, asyncs composed with Async.Parallel are initially started through a queue of pending computations. Ultimately this uses QueueUserWorkItem, like most async processing libraries. It is possible to use a separate queue, something we’ll discuss in later posts.
Ø There is nothing particularly magical about Async.Parallel: you can define your own async combinators that coordinate asyncs in different ways by using other primitives in the Microsoft.FSharp.Control.Async library such as Async.StartChild. We’ll return to this topic in a later post.
More Examples
Example uses of these patterns in the F# JAOO Tutorial code are
Ø BingTranslator.fsx and BingTranslatorShort.fsx: calling a REST API using F#. This is similar to any similar web-based HTTP service. A version of this sample is given below.
Ø AsyncImages.fsx: parallel disk I/O and image processing
Ø PeriodicTable.fsx: calling a web service, fetching atomic weights in parallel
Limitations of the Patterns
The two parallel patterns shown here have some limitations. Notably, an async generated by Async.Parallel is not, when run, “chatty” – for example, it doesn’t report progress or partial results. To handle that we need to build a more chatty object that raises events as partial operations complete. We’ll be looking at that design pattern in later posts.
Also, Async.Parallel handles a fixed number of jobs. In later posts we’ll look at many examples where jobs get generated as work progresses. Another way to look at that is that
an async generated by Async.Parallel does not immediately accept incoming messages, i.e. it is not an agent whose progress can be directed, apart from cancellation.
Asyncs generated by Async.Parallel do support cancellation. Cancellation is not effective until all the sub-tasks have completed or been effectively cancelled. This is normally what you want.
Conclusion
The Parallel CPU Asyncs and Parallel I/O Asyncs patterns are probably the two simplest design patterns using F# async programming. As often with simple things, they are important and powerful. Note that the only difference between the patterns is that I/O Parallel uses asyncs which include (and are often dominated by) I/O requests, plus some CPU processing to create request objects and to do post-processing.
In future blog posts we’ll be looking at additional design topics for parallel and reactive programming with F# async, including
Ø starting asyncs from the GUI thread
Ø defining lightweight async agents
Ø defining background worker components using async
Ø authoring .NET tasks using async
Ø authoring the.NET APM patterns using async
Ø cancelling asyncs
BingTranslator Code Sample
Here’s the sample code for the BingTranslator example. You’ll need a Live API 1.1 AppID to run it
(NOTE: the samples would need to be adjusted for the Bing API 2.0, notably the language detection API is not present in 2.0, however the code should still act as a good guide)
open System
open System.Net
open System.IO
open System.Drawing
open System.Windows.Forms
open System.Text
/// A standard helper to read all the lines of a HTTP request. The actual read of the lines is
/// synchronous once the HTTP response has been received.
let httpLines (uri:string) =
async { let request = WebRequest.Create uri
use! response = request.AsyncGetResponse()
use stream = response.GetResponseStream()
use reader = new StreamReader(stream)
let lines = [ while not reader.EndOfStream do yield reader.ReadLine() ]
return lines }
type System.Net.WebRequest with
/// An extension member to write content into an WebRequest.
/// The write of the content is synchronous.
member req.WriteContent (content:string) =
let bytes = Encoding.UTF8.GetBytes content
req.ContentLength <- int64 bytes.Length
use stream = req.GetRequestStream()
stream.Write(bytes,0,bytes.Length)
/// An extension member to read the content from a response to a WebRequest.
/// The read of the content is synchronous once the response has been received.
member req.AsyncReadResponse () =
async { use! response = req.AsyncGetResponse()
use responseStream = response.GetResponseStream()
use reader = new StreamReader(responseStream)
return reader.ReadToEnd() }
#load @”C:\fsharp\staging\docs\presentations\2009-10-04-jaoo-tutorial\BingAppId.fs”
//let myAppId = “please set your Bing AppId here”
/// The URIs for the REST service we are using
let detectUri = “” + myAppId
let translateUri = “” + myAppId + “&”
let languageUri = “” + myAppId
let languageNameUri = “” + myAppId
/// Create the user interface elements
let form = new Form (Visible=true, TopMost=true, Height=500, Width=600)
let textBox = new TextBox (Width=450, Text=“Enter some text”, Font=new Font(“Consolas”, 14.0F))
let button = new Button (Text=“Translate”, Left = 460)
let translated = new TextBox (Width = 590, Height = 400, Top = 50, ScrollBars = ScrollBars.Both, Multiline = true, Font=new Font(“Consolas”, 14.0F))
form.Controls.Add textBox
form.Controls.Add button
form.Controls.Add translated
/// An async method to call the language detection API
let detectLanguage text =
async { let request = WebRequest.Create (detectUri, Method=“Post”, ContentType=“text/plain”)
do request.WriteContent text
return! request.AsyncReadResponse() }
/// An async method to call the text translation API
let translateText (text, fromLang, toLang) =
async { let uri = sprintf “%sfrom=%s&to=%s” translateUri fromLang toLang
let request = WebRequest.Create (uri, Method=“Post”, ContentType=“text/plain”)
request.WriteContent text
let! translatedText = request.AsyncReadResponse()
return (toLang, translatedText) }
button.Click.Add(fun args ->
let text = textBox.Text
translated.Text <- “Translating…”
let task =
async { /// Get the supported languages
let! languages = httpLines languageUri
/// Detect the language of the input text. This could be done in parallel with the previous step.
let! fromLang = detectLanguage text
/// Translate into each language, in parallel
let! results = Async.Parallel [for lang in languages -> translateText (text, fromLang, lang)]
/// Return the results
return (fromLang,results) }
/// Start the task. When it completes, show the)))
It’s not actually all that easy to translate this to the Bing API, since that API seems to only have the Translate function, and not the Detect or GetLanguages functions. Unless I’m missing something in the API docs…
About the: Pattern #1: Parallel CPU Asyncs
In this sample every Fibonacci number is calculated separately? I mean there is no reuse if we have already calculated the 6th Fibonacci number, calculating the 7th starts from the beginning.
I suppose the idea here is to show that calculations can be done in parallel no matter what the function is.
there is some similar post in c# ?
Thanks
|
https://blogs.msdn.microsoft.com/dsyme/2010/01/09/async-and-parallel-design-patterns-in-f-parallelizing-cpu-and-io-computations/
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
acl_set_qualifier()
Set the qualifier for an ACL entry
Synopsis:
#include <sys/acl.h> int acl_set_qualifier( acl_entry_t entry_d, const void *tag_qualifier_p );
Since:
BlackBerry 10.0.0
Arguments:
- entry_d
- The descriptor of the entry whose qualifier you want to set.
- tag_qualifier_p
- A pointer to the qualifier (see below).
Library:
libc
Use the -l c option to qcc to link against this library. This library is usually included automatically.
Description:
The acl_set_qualifier() function sets the qualifier in an ACL entry. The data type of the value refered to by the tag_qualifier_p argument depends on the entry type:
The uid_t and gid_t data types are defined in <sys/types.h>.
Errors:
- EINVAL
- The entry_d argument isn't a valid descriptor for an ACL entry, the value of the tag type in the entry isn't ACL_USER or ACL_GROUP, or the value pointed to by tag_qualifier_p isn't valid.
- ENOMEM
- There wasn't enough memory to create a copy of the qualifier.
Classification:
This function is based on the withdrawn POSIX draft P1003.1e.
Last modified: 2014-11-17
Got questions about leaving a comment? Get answers from our Disqus FAQ.comments powered by Disqus
|
http://developer.blackberry.com/native/reference/core/com.qnx.doc.neutrino.lib_ref/topic/a/acl_set_qualifier.html
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
#include <pthread.h> int pthread_rwlockattr_init(pthread_rwlockattr_t *attr);
pthread_rwlockattr_init(3T).
If successful, pthread_rwlockattr_init() returns zero. Otherwise, an error number is returned to indicate the error.
Insufficient memory exists to initialize the rwlock attributes object. .
|
http://docs.oracle.com/cd/E19620-01/805-5080/sync-54/index.html
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
On Mon, Mar 7, 2011 at 7:41 PM, Mark Brown<broonie@opensource.wolfsonmicro.com> wrote:>>,> the register is referenced. This doesn't seem ideal - it'd be much> nicer to have the register I/O functions work this out without the> callers needing to.I'm afraid it's not easy to do so.>> ?no,it makes the processor work in master mode.and output bit clock andframe clock.>> > completely.this SigmaDSP doesn't support duplex operation,it can choose eitherADCs or serial port as input source.>> > elsewhere mute> function. This looks buggy.the processor has no switchs to mute or unmute ADCS/DACs,only thing wecan do is turning them off or on.>> + - what> exactly?these configurations above loading firmware mainly used to avoid pops/clicksand cleanup some registers in the DSP core.>> +> handled in either the bias management functions or ideally DAPM. It> also appears that the oscillator is an optional feature so it should be> used conditionally.the processor can receive MCLK either from external clock source orcrystal oscillator,currently we use the on board crystal,and it can't be turnedoff,otherwise the whole chip will be in an unpredicted status,only output clocks can be disabled.>> + struct adau1701_priv *adau1701 = snd_soc_codec_get_drvdata(codec);>> +>> + adau1701->codec = codec;>> You don't actually ever seem to reference the codec pointer you're> storing, be> namespaced.> _______________________________________________> Alsa-devel mailing list> Alsa-devel@alsa-project.org>>--To unsubscribe from this list: send the line "unsubscribe linux-kernel" inthe body of a message to majordomo@vger.kernel.orgMore majordomo info at read the FAQ at
|
https://lkml.org/lkml/2011/3/9/22
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
CoffeeKup template engine wrapper providing server-side compiled templates for SocketStream apps
Use pre-compiled CoffeeKup client-side templates in your app.
Add
ss-coffeekup to your application's
package.json file and then add this line to app.js:
ss.client.templateEngine.use(require('ss-coffeekup'));
Restart the server. From now on all templates will be pre-compiled and attached to the
CT window/global variable.
A template placed in
/client/templates/offers/latest.html (note the .html extension)
Can be rendered in your browser with
html = CT['offers-latest']({name: 'Special Offer'})
CoffeeKup templates do not require a VM or any other client-side library as each template is turned into pure JS code. This is great for convenience and performance, but can result in a lot of code being sent to the client vs other template solutions if your app has many templates.
Improvements and forks welcome.
When experimenting with CoffeeKup, or converting an app from one template type to another, you may find it advantageous to use multiple template engines and confine use of CoffeeKup to a sub-directory of
/client/templates.
Directory names can be passed to the second argument as so:
ss.client.templateEngine.use(require('ss-coffeekup'), '/ck-templates');
To specify another global/window variable instead of
CT set the 'namespace' option in the config as so:
ss.client.templateEngine.use(require('ss-coffeekup'), '/', {namespace: 'MyVar'});
|
https://www.npmjs.com/package/ss-coffeekup
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
std::remainder std:.
std::fmod, but not
std::remainder is useful for doing silent wrapping of floating-point types to unsigned integer types: (0.0 <= (y = std::fmod( std::rint(x), 65536.0 )) ? y : 65536.0 + y) is in the range
[-0.0 .. 65535.0], which corresponds to unsigned short, but std::remainder(std::rint(x), 65536.0 is in the range
[-32767.0, +32768.0], which is outside of the range of signed short.
[edit] Example
#include <iostream> #include <cmath> #include <cfenv> #pragma STDC FENV_ACCESS ON int main() { std::cout << "remainder(+5.1, +3.0) = " << std::remainder(5.1,3) << '\n' << "remainder(-5.1, +3.0) = " << std::remainder(-5.1,3) << '\n' << "remainder(+5.1, -3.0) = " << std::remainder(5.1,-3) << '\n' << "remainder(-5.1, -3.0) = " << std::remainder(-5.1,-3) << '\n'; // special values std::cout << "remainder(-0.0, 1.0) = " << std::remainder(-0.0, 1) << '\n' << "remainder(5.1, Inf) = " << std::remainder(5.1, INFINITY) << '\n'; // error handling std::feclearexcept(FE_ALL_EXCEPT); std::cout << "remainder(+5.1, 0) = " << std::remainder(5.1, 0) << '\n'; if(fetestexcept(FE_INVALID)) std::cout << " FE_INVALID raised\n"; }
Possible output:
remainder(+5.1, +3.0) = -0.9 remainder(-5.1, +3.0) = 0.9 remainder(+5.1, -3.0) = -0.9 remainder(-5.1, -3.0) = 0.9 remainder(-0.0, 1.0) = -0 remainder(5.1, Inf) = 5.1 remainder(+5.1, 0) = -nan FE_INVALID raised
|
http://en.cppreference.com/w/cpp/numeric/math/remainder
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
- Author:
- AndrewIngram
- Posted:
- February 6, 2009
- Language:
- Python
- Version:
- 1.0
- soap soaplib wsdl web-services
- Score:
- 1 (after 1 ratings)
This snippet is a replacement views.py for SOAP views with on-demand WSDL generation
It iterates over your installed apps looking for web_service.py in each one, any methods decorated with @soapmethod within web_service.py will automatically be imported into the local namespace making them visible in the WSDL.
It will blindly override local objects of the same name so it's not very safe (could do with some more error checks) but it works very well.
More like this
- Convert django model into soaplib model, to expose webservices by s.federici 7 years, 7 months ago
- SOAP web service with soaplib 0.9+ by wRAR 5 years, 11 months ago
- SOAP web service with soaplib 2.0 by treyh 4 years, 8 months ago
- soaplib service integration 2 by erny 7 years, 5 months ago
- django soaplib test client by erny 7 years, 5 months ago
#
Please login first before commenting.
|
https://djangosnippets.org/snippets/1311/
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
.flow; 20 21 import java.util.Map; 22 23 import javax.faces.component.UIViewRoot; 24 25 import org.apache.myfaces.orchestra.flow.config.FlowAccept; 26 import org.apache.myfaces.orchestra.flow.config.FlowCall; 27 28 /** 29 * Holds information about a specific call to a specific flow. 30 * <p> 31 * A new instance of this type is created for each call to a flow, 32 * and is stored in the ConversationContext created for that flow. 33 */ 34 public class FlowInfo 35 { 36 public static final int STATE_ACTIVE = 1; 37 public static final int STATE_COMMITTED = 2; 38 public static final int STATE_CANCELLED = 3; 39 40 private int state = STATE_ACTIVE; 41 private boolean isModalFlow; 42 43 // caller info 44 private String callerOutcome; 45 private String callerViewId; 46 private UIViewRoot callerViewRoot; 47 private FlowCall flowCall; 48 49 // values being passed from caller to callee 50 private Map<String,Object> argsIn; 51 52 // values being returned from callee to caller 53 private Map<String,Object> argsOut; 54 55 // Javascript to render when closing a flow that was run as 56 // a modal dialog. 57 private String onExitScript; 58 59 // callee info 60 private String flowViewId; 61 private String flowPath; 62 private FlowAccept flowAccept; 63 64 /** 65 * Constructor. 66 * <p> 67 * This creates just a partially-initialised FlowInfo object, as it defines only 68 * information about the caller. It is expected that very soon after this is 69 * created a call to setAcceptInfo will be made to add information about the 70 * called flow. 71 * 72 * @param callerViewId contains the viewId of the view that started the call. This 73 * value must not be null. 74 * 75 * @param callerViewRoot contains the view tree for the view that started the call. 76 * This is optional; when not null then this view state will be restored on return 77 * from the flow. In particular, this allows data entered by the user into input 78 * components to be restored when the flow returns (assumes that the flow call is 79 * triggered by an immediate command component). When this is null, then on return 80 * to the caller a new view tree will be created. The viewRoot should normally not 81 * be saved (this avoids wasting memory). It does need to be saved, however, when 82 * the component triggering the flow has immediate=true and the caller wants 83 * incomplete data to be preserved on return. It may also need to be preserved in 84 * certain scenarios such as when code stores stateful data into the view tree (eg 85 * when the t:saveState tag is used or when JSF2.0 view-scope beans are used). 86 * 87 * @param flowCall is the configuration object that describes the caller of a flow. 88 * 89 * @param argsIn is the set of parameter values being passed to the called flow. See 90 * FlowCall.readSendParams(). 91 */ 92 public FlowInfo( 93 String callerOutcome, 94 String callerViewId, 95 UIViewRoot callerViewRoot, 96 FlowCall flowCall, 97 Map<String, Object> argsIn) 98 { 99 this.callerOutcome = callerOutcome; 100 this.callerViewId = callerViewId; 101 this.callerViewRoot = callerViewRoot; 102 this.flowCall = flowCall; 103 this.argsIn = argsIn; 104 105 // TODO: save the serialized view tree, not just a ref to the viewroot 106 // TODO: determine whether to save the view tree or not (see comments on callerViewRoot property) 107 } 108 109 /** 110 * Return the outcome string that triggered this flowcall. 111 */ 112 public String getCallerOutcome() 113 { 114 return callerOutcome; 115 } 116 117 /** 118 * Return the viewId of the page that initiated the call to a flow (never null). 119 */ 120 public String getCallerViewId() 121 { 122 return callerViewId; 123 } 124 125 /** 126 * Return the view root of the page that initiated the call to a flow (optional, 127 * may be null). 128 */ 129 public UIViewRoot getCallerViewRoot() 130 { 131 return callerViewRoot; 132 } 133 134 /** 135 * Return metadata about the caller of the flow. 136 */ 137 public FlowCall getFlowCall() 138 { 139 return flowCall; 140 } 141 142 /** 143 * Get the (name,value) parameters that the caller is passing to the 144 * called flow. 145 * <p> 146 * These objects are then "accepted" into the called flow when the flow 147 * first starts. These objects are also used if the flow performs a 148 * "restart"; note however that if any of these objects are mutable then 149 * on restart the modified versions are passed to the called flow. 150 */ 151 public Map<String,Object> getArgsIn() 152 { 153 return argsIn; 154 } 155 156 /** 157 * Get the (name,value) parameters that the caller is returning to the 158 * called flow. 159 * <p> 160 * These objects are then "accepted" into the calling flow when the 161 * caller's view is restored. The return value is null until the 162 * flow has committed. 163 */ 164 public Map<String, Object> getArgsOut() 165 { 166 return argsOut; 167 } 168 169 /** Set to true to specify that the flow this object represents is "modal". */ 170 public void setModalFlow(boolean state) 171 { 172 this.isModalFlow = state; 173 } 174 175 /** 176 * Returns true when this flow represents a modal flow. 177 */ 178 public boolean isModalFlow() 179 { 180 return isModalFlow; 181 } 182 183 /** 184 * Finish initialising this object by adding information about the called flow. 185 * <p> 186 * It is assumed that the FlowAccept has been checked for compatibility against 187 * the FlowCall object. 188 * <p> 189 * @param entryViewId 190 * @param flowPath 191 * @param flowAccept 192 */ 193 public void setAcceptInfo(String flowViewId, String flowPath, FlowAccept flowAccept) 194 { 195 this.flowViewId = flowViewId; 196 this.flowPath = flowPath; 197 this.flowAccept = flowAccept; 198 } 199 200 /** 201 * Return the viewId of the entry page of the flow. 202 */ 203 public String getFlowViewId() 204 { 205 return flowViewId; 206 } 207 208 /** 209 * Return the path prefix which is expected to be present on the viewId of every 210 * page that "belongs" to this flow. 211 * <p> 212 * A viewId which does not start with the flowPath is not part of the current flow, 213 * and so immediately triggers cancellation of the flow. 214 */ 215 public String getFlowPath() 216 { 217 return flowPath; 218 } 219 220 /** 221 * Return metadata about the called flow. 222 */ 223 public FlowAccept getFlowAccept() 224 { 225 return flowAccept; 226 } 227 228 public String getOnExitScript() 229 { 230 return onExitScript; 231 } 232 233 public void setOnExitScript(String script) 234 { 235 onExitScript = script; 236 } 237 238 239 public int getState() 240 { 241 return state; 242 } 243 244 public void commit(Map<String, Object> argsOut) 245 { 246 this.argsOut = argsOut; 247 state = STATE_COMMITTED; 248 } 249 250 public void cancel() 251 { 252 state = STATE_CANCELLED; 253 } 254 255 public boolean isComplete() 256 { 257 return (state == STATE_CANCELLED || state == STATE_COMMITTED); 258 } 259 }
|
http://myfaces.apache.org/orchestra/myfaces-orchestra-flow/xref/org/apache/myfaces/orchestra/flow/FlowInfo.html
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
GameWindow Timing IssuePosted Sunday, 8 February, 2009 - 23:12 by flopoloco in
I remember being said that the next OpenTK version will include a new timing mechanism, anyhow, here's a test I made in current 0.9.1 .
using System; using System.Drawing; using System.Diagnostics; using OpenTK; using OpenTK.Graphics; namespace OpenTKTest { class Program : GameWindow { private Random random; private double nextTime, currentTime; private int r, g, b; public Program() : base(640, 480) { random = new Random(); } public override void OnLoad(EventArgs e) { } public override void OnUpdateFrame(UpdateFrameEventArgs e) { currentTime += e.Time; if (currentTime > nextTime) { nextTime =currentTime + 1; r = random.Next(0, 254); g = random.Next(0, 254); b = random.Next(0, 254); Trace.WriteLine(String.Format("Check on:\t {0}", currentTime.ToString())); } } public override void OnRenderFrame(RenderFrameEventArgs e) { GL.ClearColor(Color.FromArgb(255, r, g, b)); GL.Clear(ClearBufferMask.ColorBufferBit); SwapBuffers(); } public static void Main(string[] args) { using (Program program = new Program()) { program.Run(); } } } }
Trace results:
... Check on: 14,8649442999998 Check on: 15,8650569999998 Check on: 16,8651670999993 Check on: 18,2261955999991 Check on: 19,2262548999984 Check on: 20,226323599998 Check on: 21,2263256999972 Check on: 22,502357799997 Check on: 23,502364599998 Check on: 24,502434599999 Check on: 26,3859432999997 Check on: 27,3859854000009 Check on: 28,3860231000013 Check on: 29,3860308000011 Check on: 30,3860916000009
In 16 and 24 I was moving the application window (holding the mouse button) for a couple of seconds resulting a loss of one second (might break the application logic, I think I seen it in AirplaneWars example). So it's good to test it out in the SVN ;)
Re: GameWindow Timing Issue
For some reason, Windows stop sending events when you click & drag an application window. This causes all GameWindow processing to stop - no UpdateFrames, no RenderFrames, nothing gets through, until the window is released.
If anyone happens to know a workaround for this issue, please tell!
Re: GameWindow Timing Issue
Usually it is solved like this - when window recieves WM_ENTERSIZEMOVE message (it is entering window move or resize modal loop), then you create timer. And in timer callback you just do the usual thing when application is idle (update game logic, draw window content). And when window recieves WM_EXITSIZEMOVE message, then you kill this timer.
Read here:...
(ignore Direct3D stuff, search for A Bit of Polish section)
Re: GameWindow Timing Issue
Thanks for the link, I'll try to see how to this can fit in the current system.
Re: GameWindow Timing Issue
Keep up the good work :)
|
http://www.opentk.com/node/650
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
I just started C a few days ago in class and I've been working on a problem for well over 2 hours and still cannot figure it out. I am extremely noobish in this subject, so I was hoping someone can help me with this. I ran searches for about 30 minutes but I still did not understand the programs that some wrote because it is far more advance than I am right now.
The problem states:
Write a program that inputs three different integers from the keyboard, then prints the sum, the product, the average, the smallest and the largest of these numbers. Use only the single-selection form of the if statement.
I've gotten the sum, the product, and average to work but the smallest and the largest is making me go crazy. The teacher wants us to use the IF statements. something like this:
if ( num1 <= num2 ) {
printf( "%d is less than or equal to %d\n", num1, num2 );
This is what I got so far:
#include <stdio.h>
int main()
{
int x, y, z;
int sum;
int average;
int product;
printf( "Input 3 different integers: ");
scanf( "%d%d%d", &x, &y, &z );
sum = x + y + z;
average = (x + y + z)/3;
product = x * y * z;
printf( "Sum is %d\n", sum );
printf( "Average is %d\n", average);
printf( "Product is %d\n", product );
system ("pause");
return 0;
}
PLEASE HELP ME!!! This is one crazy labor day weekend.
|
http://cboard.cprogramming.com/c-programming/82558-find-largest-smallest-number.html
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
----------------------------------------------------------------------------- -- | -- Module : Data.List.LCS.HuntSzymanski -- Copyright : (c) Ian Lynagh 2005 -- License : BSD or GPL v2 -- -- Maintainer : igloo@earth.li -- Stability : provisional -- Portability : non-portable (uses STUArray) -- -- This is an implementation of the Hunt-Szymanski LCS algorithm. -- Derived from the description in \"String searching algorithms\" by -- Graham A Stephen, ISBN 981021829X. ----------------------------------------------------------------------------- module Data.List.LCS.HuntSzymanski ( -- * Algorithm -- $algorithm -- * LCS lcs ) where import System.Environment (getArgs) import Data.Array (listArray, (!)) import Data.Array.MArray (MArray, newArray, newArray_) import Data.Array.Base (unsafeRead, unsafeWrite) import Data.Array.ST (STArray, STUArray) import Control.Monad (when) import Control.Monad.ST (ST, runST) import Data.List (groupBy, sort) {- $algorithm We take two sequences, @xs@ and @ys@, of length @\#xs@ and @\#ys@. First we make an array > matchlist[i=0..(#xs-1)] such that > (matchlist[i] = js) => ((j `elem` js) <=> (xs !! i == ys !! j)) > && sort js == reverse js i.e. @matchlist[i]@ is the indices of elements of @ys@ equal to the ith element of @xs@, in descending order. Let @\#xys@ be the minimum of @\#xs@ and @\#ys@. Trivially this is the maximum possible length of the LCS of @xs@ and @ys@. Then we can imagine an array > k[i=0..#xs][l=0..#xys] such that @k[i][l] = j@ where @j@ is the smallest value such that the LCS of @xs[0..i]@ and @ys[0..j]@ has length @l@. We use @\#ys@ to mean there is no such @j@. We will not need to whole array at once, though. Instead we use an array > kk[l=0..#xys] representing a row of @kk@ for a particular @i@. Initially it is for @i = -1@, so @kk[0] = -1@ and @kk[l] = \#ys@ otherwise. As the algorithm progresses we will increase @i@ by one at the outer level and compute the replacement values for @k@'s elements. But we want more than just the length of the LCS, we also want the LCS itself. Another array > revres[l=0..#xys] stores the list of @xs@ indices an LCS of length @l@, if one is known, at @revres[l]@. Now, suppose @kk@ contains @k[i-1]@. We consider each @j@ in @matchlist[i]@ in turn. We find the @l@ such that @k[l-1] < j <= k[l]@. If @j < k[l]@ then we updated @k[l]@ to be @j@ and set @revres[l]@ to be @i:revres[l-1]@. Finding @l@ is basically binary search, but there are some tricks we can do. First, as the @j@s are decreasing the last @l@ we had for this @i@ is an upper bound on this @l@. Second, we use another array > lastl[j=0..#ys-1] to store the @l@ we got last time for this @j@, initially all @1@. As the values in @kk[j]@ monotonically decrease this is a lower bound for @l@. We also test to see whether this old @l@ is still @l@ before we start the binary search. -} -- |The 'lcs' function takes two lists and returns a list with a longest -- common subsequence of the two. lcs :: Ord a => [a] -> [a] -> [a] -- Start off by returning the common prefix lcs [] _ = [] lcs _ [] = [] lcs (c1:c1s) (c2:c2s) | c1 == c2 = c1 : lcs c1s c2s -- Then reverse everything, get the backwards LCS and reverse it lcs s1 s2 = lcs_tail [] (reverse s1) (reverse s2) -- To get the backwards LCS, we again start off by returning the common -- prefix (or suffix, however you want to think of it :-) ) lcs_tail :: Ord a => [a] -> [a] -> [a] -> [a] lcs_tail acc (c1:c1s) (c2:c2s) | c1 == c2 = lcs_tail (c1:acc) c1s c2s lcs_tail acc [] _ = acc lcs_tail acc _ [] = acc -- Then we begin the real algorithm lcs_tail acc s1 s2 = runST (lcs' acc s1 s2) lcs' :: Ord a => [a] -> [a] -> [a] -> ST s [a] lcs' acc xs ys = do let max_xs = length xs max_ys = length ys minmax = max_xs `min` max_ys -- Initialise all the arrays matchlist <- newArray_ (0, max_xs - 1) mk_matchlist matchlist xs ys kk <- newArray (0, minmax) max_ys unsafeWrite kk 0 (-1) lastl <- newArray (0, max_ys - 1) 1 revres <- newArray_ (0, minmax) unsafeWrite revres 0 [] -- Pass the buck to lcs'' to finish the job off is <- lcs'' matchlist lastl kk revres max_xs max_ys minmax -- Convert the list of i indices into the result sequence let axs = listArray (0, max_xs - 1) xs return $ map (axs !) is ++ acc eqFst :: Eq a => (a, b) -> (a, b) -> Bool eqFst (x, _) (y, _) = x == y -- mk_matchlist fills the matchlist array such that if -- xs !! i == ys !! j then (j+1) `elem` matchlist ! i -- and matchlist ! i is decreasing for all i mk_matchlist :: Ord a => STArray s Int [Int] -> [a] -> [a] -> ST s () mk_matchlist matchlist xs ys = do let -- xs' is a list of (string, ids with that string in xs) xs' = map (\sns -> (fst (head sns), map snd sns)) $ groupBy eqFst $ sort $ zip xs [0..] -- ys' is similar, only the ids are reversed ys' = map (\sns -> (fst (head sns), reverse $ map snd sns)) $ groupBy eqFst $ sort $ zip ys [0..] -- add_to_matchlist does all the hardwork add_to_matchlist all_xs@((sx, idsx):xs'') all_ys@((sy, idsy):ys'') = case compare sx sy of -- If we have the same string in xs'' and ys'' then all -- the indices in xs'' must map to the indices in ys'' EQ -> do sequence_ [ unsafeWrite matchlist i idsy | i <- idsx ] add_to_matchlist xs'' ys'' -- If the string in xs'' is smaller then there are no -- corresponding indices in ys so we assign all the xs'' -- indices the empty list LT -> do sequence_ [ unsafeWrite matchlist i [] | i <- idsx ] add_to_matchlist xs'' all_ys -- Otherwise the string appears in ys only, so we ignore it GT -> do add_to_matchlist all_xs ys'' -- If we run out of ys'' altogether then just go through putting -- in [] for the list of indices of each index remaining in xs'' add_to_matchlist ((_, idsx):xs'') [] = do sequence_ [ unsafeWrite matchlist i [] | i <- idsx ] add_to_matchlist xs'' [] -- When we run out of xs'' we are done add_to_matchlist [] _ = return () -- Finally, actually call add_to_matchlist to populate matchlist add_to_matchlist xs' ys' lcs'' :: STArray s Int [Int] -- matchlist -> STUArray s Int Int -- lastl -> STUArray s Int Int -- kk -> STArray s Int [Int] -- revres -> Int -> Int -> Int -> ST s [Int] lcs'' matchlist lastl kk revres max_xs max_ys minmax = do let -- Out the outermost level we loop over the indices i of xs loop_i = sequence_ [ loop_j i | i <- [0..max_xs - 1] ] -- For each i we loop over the matching indices j of elements of ys loop_j i = do js <- unsafeRead matchlist i with_js i js minmax -- Deal with this i and j with_js i (j:js) max_bound = do x0 <- unsafeRead lastl j l <- find_l j x0 max_bound unsafeWrite lastl j l vl <- unsafeRead kk l when (j < vl) $ do unsafeWrite kk l j rs <- unsafeRead revres (l - 1) unsafeWrite revres l (i:rs) with_js i js l with_js _ [] _ = return () -- find_l returns the l such that kk ! (l-1) < j <= kk ! l find_l j x0 z0 = let f x z | x + 1 == z = return z | otherwise = let y = (x + z) `div` 2 in do vy <- unsafeRead kk y if vy < j then f y z else f x y in j `seq` do q1 <- unsafeRead kk x0 if j <= q1 then return x0 else f x0 z0 -- Do the hard work loop_i -- Find where the result starts succ_l <- find_l max_ys 1 (minmax + 1) -- Get the result unsafeRead revres (succ_l - 1)
|
http://hackage.haskell.org/package/lcs-0.2/docs/src/Data-List-LCS-HuntSzymanski.html
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
Your message dated Tue, 18 Aug 2009 20:56:50 +0100 with message-id <1250625410.755430.4715.nullmailer@kmos.homeip.net> and subject line Package jikes has been removed from Debian has caused the Debian Bug report #170709, regarding jikes has stupid.) -- 170709: Debian Bug Tracking System Contact owner@bugs.debian.org with problems
--- Begin Message ---
- To: <submit@bugs.debian.org>
- Subject: jikes has stupid message
- From: Adam Heath <doogie@brainfood.com>
- Date: Mon, 25 Nov 2002 12:56:12 -0600 (CST)
- Message-id: <Pine.LNX.4.33.0211251251440.2080-100000@gradall.private.brainfood.com>package: jikes version: 1:1.17.impl.JDBCDelegateImpl should be declared abstract; it does not define getType(java.lang.String) in com.brainfood.vfs.jdbc.impl.JDBCDelegateImpl [javac] public class JDBCDelegateImpl [javac] ^ [javac] 1 error -- A better message would.delegates.JDBCDelegateImpl should be declared abstract; it does not define getType(java.lang.String), which is defined in com.brainfood.vfs.jdbc.JDBCDelegate [javac] public class JDBCDelegateImpl [javac] ^ [javac] 1 error -- The first error message given above repeats the enclosing class way too many times(the filename, twice for the full name, and once for the class definition stanza). In this case, JDBCDelegate is an interface. This same error message should also be applied to parent classes. Also, there are probably several other messages, that are equally unhelpful, in their output. I just don't have any examples right now.
--- End Message ---
--- Begin Message ---
- To: 170709-done@bugs.debian.org
- Subject: Package jikes has been removed from Debian
- From: Marco Rodrigues <gothicx@sapo.pt>
- Date: Tue, 18 Aug 2009 20:56:50 +0100
- Message-id: <1250625410.755430.4715 ---
|
https://lists.debian.org/debian-qa-packages/2009/08/msg00342.html
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
Pugs::Doc::Hack::Style - Style guidelines for Pugs code
$EDITOR src
This document describes coding conventions used in Pugs code. Like any style rules, these are meant as recommendations and you should feel free to break them whenever it makes sense to do so.
Avoid punning data type names and data constructors. If you have code like:
data Exp = Val Val | ... data Val = Int Int | String String | ...
Then readers your code may get confused about when you are using Val, Int, and String as concrete types and when you are constructing a value.
The following convention is proposed. It can help against this problem, and also deflect the namespace clashes that occur when two different constructors from different types have the same name:
data Exp = EVal ExpVal -- Variants use the first letter from "Exp" | EVar ExpVar -- Contained types chain the "Exp" ... data ExpVal -- "Val" is the "given name" of "ExpVal" = VNative ValNative -- Use the given name's first letter in variants | VUndef ValUndef -- and the given name in grandchild types | VPure ValPure | VMut ValMut ... data ValMut -- Exp > ExpVal > ValMut = MScalar MutScalar | MArray MutArray | MObject MutObject ...
Since
Val is a common type not clearly a child only of Exp, it is in fact defined as its own top-level type, and any type that uses it defines an alias. So the above is really:
data Val ... -- As ExpVal above type ExpVal = Val -- For use in Exp
Record types are also under convention keyed by dominating types, both in constructor and in field names:
-- Aliases always refer to toplevel name, so not "StorageVal" here type EntryStorage = TVar Val data PadEntry = MkEntry -- Single variant: Mk + given { e_declarator :: EntryDeclarator -- Field name uses lowercase , e_storage :: EntryStorage -- first letter + underscore }
Multiple variant records drop the
Mk prefix and start with the given name:
type MutClass = Class type ObjClass = Class -- Again, refer to toplevel directly type ObjId = Native type ObjSlots = TVar (Map Ident Val) type ObjPayload = Dynamic data MutObject -- Okay to abbreviate given name = ObjInstance -- when its nick is well-known { o_id :: !ObjId , o_meta :: !ObjClass , o_slots :: !ObjSlots } | ObjForeign { o_id :: !ObjId , o_meta :: !ObjClass , o_payload :: !ObjPayload } | ObjPrototype { o_id :: !ObjId , o_meta :: !ObjClass }
It is permissible to use a different prefix in non-shared field names, using the variant name. So "oi_slots" and "of_opaque" are possible alternate names for two of the fields above.
Perl6::Pugs, Pugs::Doc::Hack,
|
http://search.cpan.org/~audreyt/Perl6-Pugs-6.2.13/docs/Pugs/Doc/Hack/Style.pod
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
By the way...
Wow, I'm quite busy these days, haven't been writing (or reading, for that matter!) much...
Mostly, it's to blame on the quest for a place to live in that's going on. I'd like to buy, this time around, so this makes it a couple of notches more complicated than what I'm used to (I've never been an owner, so this is all new to me). The numbers bandied around are making me quite dizzy! Hopefully, we should come out of this with a nice place, but in the meantime, it's time for "let's save up money like crazy for the cash down", so on top of being busy with this stuff, it'll also make me less visible than I usually am (well, uh, it should still be better than the last year!).
In other more geeky news, I think I am succumbing to the coding style of the C++ standard library with regard to naming. For method names, there's more than a few people who are going to think "finally!" (I used to favour a Java-style interCap, like "readUntil", now I tend to prefer "read_until"). This makes a lot of sense, since this is also more common in C and Perl code. But the more controversial part is that the standard library uses all lowercase for class names (it's "unordered_set", not "UnorderedSet"), and I'm getting a crush on those too... Perl, Ruby and Python are using FullyCapitalized style for those, and so are a number of C++ programmers I know, but I'm finding that there is something to be said for adopting the style of the language. I'm also using namespaces and exceptions (mostly in constructors and object-returning methods) more, these days.
So either I'm becoming stylish, or I'm becoming senile. Oh well.
Also, it would seem that the giant jackhammers are following me.
Syndicated 2007-08-24 14:58:03 (Updated 2007-08-24 15:14:07) from Pierre Phaneuf
|
http://www.advogato.org/person/pphaneuf/diary.html?start=323
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
...one of the most highly
regarded and expertly designed C++ library projects in the
world. — Herb Sutter and Andrei
Alexandrescu, C++
Coding Standards
template< typename State , typename Operation > struct inserter { typedef State state; typedef Operation operation; };
A general-purpose model of the Inserter concept.
#include <boost/mpl/inserter.hpp>
The semantics of an expression are defined only where they differ from, or are not defined in Inserter.
For any binary Lambda Expression op and arbitrary type state:
Amortized constant time.
template< typename N > struct is_odd : bool_< ( N::value % 2 ) > {}; typedef copy< range_c<int,0,10> , inserter< // a filtering 'push_back' inserter vector<> , if_< is_odd<_2>, push_back<_1,_2>, _1 > > >::type odds; BOOST_MPL_ASSERT(( equal< odds, vector_c<int,1,3,5,7,9>, equal_to<_,_> > ));
|
http://www.boost.org/doc/libs/1_32_0/libs/mpl/doc/refmanual/inserters-inserter.html
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
Been made to do this task where I need to make an animal guessing game using if-else. I cannot figure out how to make this code so it will add more than four animals. The game is basically
Think of an animal.
Is it a bird? yes
Can it fly? no
Is it an emu? no
Oh. Well, thank you for playing.
This is all the animals I need to include:
TREE.JPG
and this is the code I have to modify to include the new animals in:
public class animalquiz { public static void main(String[] args) { public static void main(String[] args) { Scanner keyboard = new Scanner(System.in); boolean answerIsCorrect; System.out.println("Think of an animal.\n"); if(ask("Is it a bird? ", keyboard)) { if(ask("Can it fly? ", keyboard)) { answerIsCorrect = ask("Is it a kookaburra? ", keyboard); } else { answerIsCorrect = ask("Is it an emu? ", keyboard); } } else { if(ask("Does it lay eggs? ", keyboard)) { answerIsCorrect = ask("Is it a platypus? ", keyboard); } else { answerIsCorrect = ask("Is it a kangaroo? ", keyboard); } } if(answerIsCorrect) { System.out.println("Yes! I am invincible!"); } else { System.out.println("Oh. Well, thank you for playing."); } } /** * A utility method to ask a yes/no question * * @param question the question to ask * @param a scanner for user input * * @return whether the user answered "yes" (actually, whether the user answered anything starting with Y or y) */ private static boolean ask(String question, Scanner keyboard) { System.out.print(question); String answer = keyboard.nextLine().trim(); return answer.charAt(0) == 'Y' || answer.charAt(0) == 'y'; } }
I hope someone can help and explain how I can do this
|
http://www.javaprogrammingforums.com/loops-control-statements/26134-guessing-game-help.html
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
java.lang.Object
oracle.adfinternal.model.adapter.url.SmartURLoracle.adfinternal.model.adapter.url.SmartURL
public class SmartURL
Handles URL connections.
Different adapters and data controls will use this class to access a URL. This class can handle the HTTP and HTTPS protocols. It uses the proxy set by the application that runs it.
public SmartURL(java.lang.String loc)
loc- Source location for the URL.
public SmartURL(java.lang.String loc, java.lang.String servletCtxPath)
loc- Source location for the URL.
servletCtxPath- Context path for the servlet.
public void setTimeout(int timeout)
timeout- Timeout amount in miliseconds.
public java.io.InputStream openStream() throws AdapterException
InputStreamfor a location. If the location points to a http or https file, this method tries to connect to the file. The location can be a file name as well. This method tries to create a URL from the location. If fails it will treat the location as a file name and tries to create a URL for the file. If the file path is not an absolute path defined, It tries to resolve the name as relative to the provider home. If fails it then tries to create a URL from the file path as known to the system.
AdapterException- If the connection failed or no URL can be formed from the location.
public java.net.URL createURL() throws AdapterException
AdapterException- If the connection failed or no URL can be formed from the location.
|
http://docs.oracle.com/cd/E28280_01/apirefs.1111/e10653/oracle/adfinternal/model/adapter/url/SmartURL.html
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
1) Write a Java application that prompts the user for pairs of inputs of a product number (1-5), and then an integer quantity of units sold (this 5 pairs of inputs are completed. You must also display the total after each new pair of input values is entered.
This is what I have so far. Like I said I just need to be pointed in the right direction. I'm about to give up.
/** * @(#)StewartBaxterP3.java * * StewartBaxterP3 application * * @author * @version 1.00 2011/1/20 */ import javax.swing.*; import java.util.Scanner; public class StewartBaxterP3 { public static void main(String[] args) { final int NUMBER_OF_ITEMS = 5; int[] productNum = { 1, 2, 3, 4, 5}; double[] price = { 2.98, 4.50, 9.98, 4.49, 6.87}; double quantity, product, total; Scanner imput = new Scanner(System.in); System.out.print("Enter Product Number (1-5) or -1 to Quit:"); productNum = imput.nextInt(); System.out.print("Enter Quantity:"); quantity = imput.nextDouble(); total = product * quantity; System.out.print(total); } }
|
http://www.dreamincode.net/forums/topic/211165-inventory-program/
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
- NAME
- SYNOPSIS
- DESCRIPTION
- FEATURES AND CONVENTIONS
- JUMP START FOR THE IMPATIENT
- SEE ALSO
- AUTHOR
NAME
Module::Build::WithXSpp - XS++ enhanced flavour of Module::Build
SYNOPSIS
In Build.PL:
use strict; use warnings; use 5.006001; use Module::Build::WithXSpp; my $build = Module::Build::WithXSpp->new( # normal Module::Build arguments... # optional: mix in some extra C typemaps: extra_typemap_modules => { 'ExtUtils::Typemaps::ObjectMap' => '0', }, ); $build->create_build_script;
DESCRIPTION
This subclass of Module::Build adds some tools and processes to make it easier to use for wrapping C++ using XS++ (ExtUtils::XSpp).
There are a few minor differences from using
Module::Build for an ordinary XS module and a few conventions that you should be aware of as an XS++ module author. They are documented in the "FEATURES AND CONVENTIONS" section below. But if you can't be bothered to read all that, you may choose skip it and blindly follow the advice in "JUMP START FOR THE IMPATIENT".
An example of a full distribution based on this build tool can be found in the ExtUtils::XSpp distribution under examples/XSpp-Example. Using that example as the basis for your
Module::Build::WithXSpp-based distribution is probably a good idea.
FEATURES AND CONVENTIONS
XS files
By default,
Module::Build::WithXSpp will automatically generate a main XS file for your module which includes all XS++ files and does the correct incantations to support C++.
If
Module::Build::WithXSpp detects any XS files in your module, it will skip the generation of this default file and assume that you wrote a custom main XS file. If that is not what you want, and wish to simply include plain XS code, then you should put the XS in a verbatim block of an .xsp file. In case you need to use the plain-C part of an XS file for
#include directives and other code, then put your code into a header file and
#include it from an .xsp file:
In src/mystuff.h:
#include <something> using namespace some::thing;
In xsp/MyClass.xsp
#include "mystuff.h" %{ ... verbatim XS here ... %}
Note that there is no guarantee about the order in which the XS++ files are picked up.
Build directory
When building your XS++ based extension, a temporary build directory buildtmp is created for the byproducts. It is automatically cleaned up by
./Build clean.
Source directories
A Perl module distribution typically has the module
.pm files in its lib subdirectory. In a
Module::Build::WithXSpp based distribution, there are two more such conventions about source directories:
If any C++ source files are present in the src directory, they will be compiled to object files and linked automatically.
Any
.xs,
.xsp, and
.xspt files in an xs or xsp subdirectory will be automatically picked up and included by the build system.
For backwards compatibility, files of the above types are also recognized in lib.
Typemaps
In XS++, there are two types of typemaps: The ordinary XS typemaps which conventionally put in a file called typemap, and XS++ typemaps.
The ordinary XS typemaps will be found in the main directory, under lib, and in the XS directories (xs and xsp). They are required to carry the
.map extension or to be called typemap. You may use multiple .map files if the entries do not collide. They will be merged at build time into a complete typemap file in the temporary build directory.
The
extra_typemap_modules option is the preferred way to do XS typemapping. It works like any other
Module::Build argument that declares dependencies except that it loads the listed modules at build time and includes their typemaps into the build.
The XS++ typemaps are required to carry the
.xspt extension or (for backwards compatibility) to be called
typemap.xsp.
Detecting the C++ compiler
Module::Build::WithXSpp uses ExtUtils::CppGuess to detect a C++ compiler on your system that is compatible with the C compiler that was used to compile your perl binary. It sets some additional compiler/linker options.
This is known to work on GCC (Linux, MacOS, Windows, and ?) as well as the MS VC toolchain. Patches to enable other compilers are very welcome.
Automatic dependencies
Module::Build::WithXSpp automatically adds several dependencies (on the currently running versions) to your distribution. You can disable this by setting
auto_configure_requires => 0 in Build.PL.
These are at configure time:
Module::Build,
Module::Build::WithXSpp itself, and
ExtUtils::CppGuess. Additionally there will be a build-time dependency on
ExtUtils::XSpp.
You do not have to set these dependencies yourself unless you need to set the required versions manually.
Include files
Unfortunately, including the perl headers produces quite some pollution and redefinition of common symbols. Therefore, it may be necessary to include some of your headers before including the perl headers. Specifically, this is the case for MSVC compilers and the standard library headers.
Therefore, if you care about that platform in the least, you should use the
early_includes option when creating a
Module::Build::WithXSpp object to list headers to include before the perl headers. If such a supplied header file starts with a double quote,
#include "..." is used, otherwise
#include <...> is the default. Example:
Module::Build::WithXSpp->new( early_includes => [qw( "mylocalheader.h" <mysystemheader.h> )] )
JUMP START FOR THE IMPATIENT
There are as many ways to start a new CPAN distribution as there are CPAN distributions. Choose your favourite (I just do
h2xs -An My::Module), then apply a few changes to your setup:
Obliterate any Makefile.PL.
This is what your Build.PL should look like:
use strict; use warnings; use 5.006001; use Module::Build::WithXSpp; my $build = Module::Build::WithXSpp->new( module_name => 'My::Module', license => 'perl', dist_author => q{John Doe <john_does_mail_address>}, dist_version_from => 'lib/My/Module.pm', build_requires => { 'Test::More' => 0, }, extra_typemap_modules => { 'ExtUtils::Typemaps::ObjectMap' => '0', # ... }, ); $build->create_build_script;
If you need to link against some library
libfoo, add this to the options:
extra_linker_flags => [qw(-lfoo)],
There is
extra_compiler_flags, too, if you need it.
You create two folders in the main distribution folder: src and xsp.
You put any C++ code that you want to build and include in the module into src/. All the typical C(++) file extensions are recognized and will be compiled to object files and linked into the module. And headers in that folder will be accessible for
#include <myheader.h>.
For good measure, move a copy of ppport.h to that directory. See Devel::PPPort.
You do not write normal XS files. Instead, you write XS++ and put it into the xsp/ folder in files with the
.xspextension. Do not worry, you can include verbatim XS blocks in XS++. For details on XS++, see ExtUtils::XSpp.
If you need to do any XS type mapping, put your typemaps into a .map file in the
xspdirectory. Alternatively, search CPAN for an appropriate typemap module (cf. ExtUtils::Typemaps::Default for an explanation). XS++ typemaps belong into .xspt files in the same directory.
In this scheme, lib/ only contains Perl module files (and POD). If you started from a pure-Perl distribution, don't forget to add these magic two lines to your main module:
require XSLoader; XSLoader::load('My::Module', $VERSION);
SEE ALSO
Module::Build upon which this module is based.
ExtUtils::XSpp implements XS++. The
ExtUtils::XSpp distribution contains an examples directory with a usage example of this module.
ExtUtils::Typemaps implements progammatic modification (merging) of C/XS typemaps.
ExtUtils::Typemaps was renamed from
ExtUtils::Typemap since the original name conflicted with the core typemap file on case-insensitive file systems.
ExtUtils::Typemaps::Default explains the concept of having typemaps shipped as modules.
ExtUtils::Typemaps::ObjectMap is such a typemap module and probably very useful for any XS++ module.
ExtUtils::Typemaps::STL::String implements simple typemapping for STL
std::strings.
AUTHOR
Steffen Mueller <smueller@cpan.org>
With input and bug fixes from:
Mattia Barbon
Shmuel Fomberg
Florian Schlichting
This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself.
|
https://metacpan.org/pod/Module::Build::WithXSpp
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
/* _LINE_MAP_H #define GCC_LINE_MAP_H /* Reason for adding a line change with add_line_map (). LC_ENTER is when including a new file, e.g. a #include directive in C. LC_LEAVE is when reaching a file's end. LC_RENAME is when a file name or line number changes for neither of the above reasons (e.g. a #line directive in C). */ enum lc_reason {LC_ENTER = 0, LC_LEAVE, LC_RENAME}; /* The logical line FROM_LINE maps to physical source file TO_FILE at line TO_LINE, and subsequently one-to-one until the next line_map structure in the set. INCLUDED_FROM is an index into the set that gives the line mapping at whose end the current one was included. File(s) at the bottom of the include stack have this set to -1. REASON is the reason for creation of this line map, SYSP is one for a system header, two for a C system header file that therefore needs to be extern "C" protected in C++, and zero otherwise. */ struct line_map { const char *to_file; unsigned int to_line; unsigned int from_line; int included_from; ENUM_BITFIELD (lc_reason) reason : CHAR_BIT; unsigned char sysp; }; /* A set of chronological line_map structures. */ struct line_maps { struct line_map *maps; unsigned int allocated; unsigned int used; /* The most recently listed include stack, if any, starts with LAST_LISTED as the topmost including file. -1 indicates nothing has been listed yet. */ int last_listed; /* Depth of the include stack, including the current file. */ unsigned int depth; /* If true, prints an include trace a la -H. */ bool trace_includes; }; /* Initialize a line map set. */ extern void init_line_maps PARAMS ((struct line_maps *)); /* Free a line map set. */ extern void free_line_maps PARAMS ((struct line_maps *)); /* Add a mapping of logical source line to physical source file and line number. The text pointed to by TO_FILE must have a lifetime at least as long as the line maps. maps, so any stored line_map pointers should not be used. */ extern const struct line_map *add_line_map PARAMS ((struct line_maps *, enum lc_reason, unsigned int sysp, unsigned int from_line, const char *to_file, unsigned int to_line)); /* Given a logical line, returns the map from which the corresponding (source file, line) pair can be deduced. */ extern const struct line_map *lookup_line PARAMS ((struct line_maps *, unsigned int)); /* Print the file names and line numbers of the #include commands which led to the map MAP, if any, to stderr. Nothing is output if the most recently listed stack is the same as the current one. */ extern void print_containing_files PARAMS ((struct line_maps *, const struct line_map *)); /* Converts a map and logical line to source line. */ #define SOURCE_LINE(MAP, LINE) ((LINE) + (MAP)->to_line - (MAP)->from_line) /* Returns the last source line within a map. This is the (last) line of the #include, or other directive, that caused a map change. */ #define LAST_SOURCE_LINE(MAP) SOURCE_LINE ((MAP), (MAP)[1].from_line - 1) /* Returns the map a given map was included from. */ #define INCLUDED_FROM(SET, MAP) (&(SET)->maps[(MAP)->included_from]) /* Nonzero if the map is at the bottom of the include stack. */ #define MAIN_FILE_P(MAP) ((MAP)->included_from < 0) /* The current line map. Saves a call to lookup_line if the caller is sure he is in the scope of the current map. */ #define CURRENT_LINE_MAP(MAPS) ((MAPS)->maps + (MAPS)->used - 1) #endif /* !GCC_LINE_MAP_H */
|
http://opensource.apple.com//source/gcc_os/gcc_os-1666/gcc/line-map.h
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
1993-05-30 Richard Stallman (rms@mole.gnu.ai.mit.edu) * Version 19.10 released. 1993-05-29 Richard Stallman (rms@mole.gnu.ai.mit.edu) * term/bobcat.el: Just load term/keyswap.el. * term/vt200.el: Just load term/vt100.el. * term/apollo.el: Just load term/vt100.el. * term/vt102.el, term/vt125.el, term/vt201.el, term/vt220.el, term/vt240.el, term/vt300.el, term/vt320.el, term/vt400.el, term/vt420.el: New files. Just load vt100.el. * term/lk201.el: New file. * term/vt100.el: Use term/lk201.el. * term/vt100.el (vt100-wide-mode): Add missing arg in set-frame-width. 1993-05-29 Richard Stallman (rms@mole.gnu.ai.mit.edu) * startup.el (command-line-1): Pass arg to other-window. * files.el (find-file-run-dired): Doc fix. (find-file-read-only): Return the buffer. (find-file-read-only-other-window): Likewise. (find-file-read-only-other-frame): Likewise. * timer.el (cancel-function-timers): Renamed from spurious duplicate definition of cancel-timer. * add-log.el (find-change-log): Use file-chase-links. * files.el (file-chase-links): New function. (backup-buffer): Use file-chase-links. (file-chase-links): Handle leading .. in symlink target. * c-mode.el (c-up-conditional): Handle commented-out #-cmds properly. * window.el (split-window-vertically): Return the new window. * paths.el (gnus-local-organization): Initially nil. * isearch.el (isearch-search): Take note of isearch-case-fold-search initial value. * lisp-mode.el (indent-sexp): Even if outer-loop-done is t, still move down one line. * files.el (auto-mode-alist): Fix syntax for sgml mode. * man.el (Man-mode-map): Bind m to manual-entry. (Man-notify-when-ready): Make arg name consistent. Use delete-other-window. (Man-mode): Use buffer-disable-undo, not old name. * faces.el (x-resolve-font-name): Allow symbol as FACE arg. Allow t as FRAME arg. * sendmail.el (send-mail-function): Use defvar. not defconst. * mouse.el (x-fixed-font-alist): Specify field 7, not field 6. 1993-05-28 Richard Stallman (rms@mole.gnu.ai.mit.edu) * iso8859-1.el: File deleted. * superyank.el: File deleted. * vc.el (vc-steal-lock, vc-insert-headers): Fix question whitespace. (vc-finish-logentry): Use delete-windows-on. * add-log.el (find-log-file): Use source file's truename dir. * mh-e.el: Version 3.8.1 from Gildea. * loaddefs.el (-key): repeat-complex-command moved to C-x ESC ESC. * hexl.el: Doc fixes. (hexl-char-after-point): Get rid of mistakenly free variables. * info.el (Info-insert-dir): Ignore duplicate directories. * paths.el (Info-default-directory-list): Take out ../../info. Avoid duplication. (manual-formatted-dirlist, manual-formatted-dir-prefix): Deleted. * subr.el (baud-rate): Doc fix. * add-log.el (find-change-log): Chase symlinks multiple levels. * rmailsum.el (rmail-new-summary): Set rmail-summary-buffer to nil at beginning; set it for real after summary is set up. 1993-05-27 Richard Stallman (rms@mole.gnu.ai.mit.edu) * files.el (find-alternate-file): Hide truename and inode number temporarily, like the visited file name. * iso8859-1.el: Pass just the downcase table to set-case-... 1993-05-28 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * find-dired.el (find-dired-sentinel): Write a line describing death. Set mode-line-process to record exit status. Delete the process. 1993-05-27 Richard Stallman (rms@mole.gnu.ai.mit.edu) * frame.el (frame-initialize): Handle reverseVideo resource. * faces.el (x-create-frame-with-faces): Handle reverseVideo resource. * iso-insert.el, iso-ascii.el, iso-swed.el: Provide same name as file. * ange- (ange-ftp-dired-compress-file): Use dired-compress-file, not dired-compress-filename. * completion.el: Pervasive changes to use Emacs 19 features and conform to Emacs conventions. 1993-05-27 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * Version 19.9 released. 1993-05-27 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * term/x-win.el: Check for a geometry resource, and apply it to the initial frame. 1993-05-26 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * isearch.el (isearch-forward): Remove the claim that isearch-whitespace-chars matches any string of whitespace. 1993-05-26 Richard Stallman (rms@mole.gnu.ai.mit.edu) * completion.el: Comment out handling of shell-send-input. Delete the "local thinking machines" definitions at the end since they caused compilation failure. * cl.el (cl-member): Renamed from member. * time.el (display-time-day-and-date): Use defvar, not defconst. * subr.el (listify-key-sequence): Avoid the constant ?\M-\200. * files.el (find-file-noselect): Expand buffer-file-truename before copying it to anything else. * dired.el (dired-other-frame): New function, with binding. * compile.el: Make C-x ` binding just once. * help.el (finder-by-keyword): Autoload from `finder', not `finder.el'. * nroff-mode.el (nroff-mode): Don't leave nroff-electric-mode void. * byte-opt.el (byte-optimize-divide): Don't optimize to less than two arguments. * hexl.el (hexlify-command, dehexlify-command): Use exec-directory. * rmailsort.el: New version from Umeda. (timezone-make-date-sortable): Make autoload for this. (rmail-sort-by-recipient): Downcase the strings for sorting. (rmail-sort-by-recipient): Likewise. (rmail-sort-by-lines): Renamed from rmail-sort-by-size-lines. Use numbers to sort by. (rmail-summary-...): New functions. Bind in rmail-summary-mode-map. (rmail-sort-from-summary): New function. (rmail-sort-messages): Don't bother checking major mode. Put message bounds in sort list, not its text. Choose string< or < as predicate. Reorder messages by exchanging them, with inhibit-quit bound. (rmail-fetch-field): Start by widening. (rmail-sortable-date-strng): Deleted. (rmail-make-date-sortable): New function, used instead. * paths.el (gnus-local-organization): Renamed from ...-your-... (gnus-local-domain): Likewise. 1993-05-26 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * faces.el (x-resolve-font-name): If PATTERN is nil, return the frame's face. (set-face-font): Only use x-resolve-font-name if FONT is a string. Copying a faces shouldn't resolve the font. * paths.el (Info-default-directory-list): Add configure-info-directory to this list. 1993-05-26 Richard Stallman (rms@mole.gnu.ai.mit.edu) * scroll-bar.el (scroll-bar-mode): Make default value t. * help-macro.el (make-help-screen): Handle mouse events. Be smart about window configurations--when and whether to restore. * info.el (Info-follow-nearest-node): Omit 4th arg to Info-get-token. * sgml-mode.el (sgml-validate): compile1 renamed to compile-internal. (sgml-mode): Add autoload cookie. * files.el (auto-mode-alist): Recognize .sgm, .sgml, .dtd. * files.el (auto-mode-alist): Treat .H and .hh as C++ files. * mouse.el (mouse-set-mark): Activate the mark. Don't bounce the cursor if Transient Mark mode. (mouse-save-then-kill): Pass explicit args to kill-ring-save. (mouse-kill-ring-save): Likewise. * mail-utils.el (mail-strip-quoted-names): Catch errors from forward-sexp. * comint.el (comint-filter): Restore buffer-read-only in proper buffer. * ispell.el: Provide `ispell'. * ange- (ange-ftp-set-buffer-mode): Do nothing unless visited name is an ange ftp magic name. * advice.el: New version from Chalupsky. 1993-05-25 Richard Stallman (rms@mole.gnu.ai.mit.edu) * dired.el (dired-unmark-all-files): Read arg as a string. * rmailsum.el (rmail-summary-mark-deleted): Check for end of buffer. Pass t as NOWARN when calling rmail-summary-goto-msg. * dired-aux.el (dired-compress-file): Test the return value of dired-check-process properly. Fix use of nonexistent var `name'. * info.el (Info-edit, Info-last-search, Info-enable-edit): Correct case in `Info-mode-map'. * rmail.el (rmail-bury): Fix call to set-window-buffer. * loaddefs.el: copy-to-register now on C-x r s. 1993-05-25 Richard Stallman (rms@mole.gnu.ai.mit.edu) * term/x-win.el: Pass x-command-line-resources to x-open-connection. (x-command-line-resources): New variable. (x-handle-rn-switch): New function. (command-switch-alist): Add -rn. 1993-05-25 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * term/x-win.el (command-switch-alist, x-switch-definitions): Treat `-i' like `-itype', as in Emacs 18. 1993-05-25 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * Version 19.8 released. * startup.el (command-line-1): Don't handle `-i'. We're abandoning the `insert file' meaning in favor of the `use a bitmapped icon' meaning. * faces.el (set-face-font): Call x-resolve-font-name on the font before including it in the face. (x-resolve-font-name): New function. * iso-syntax.el: Make downcase into a proper case table before passing it to set-standard-case-table. * disp-table.el (standard-display-european): Doc fix. Make it autoload. Make it respond to prefix arg like a minor mode. 1993-05-24 Richard Stallman (rms@mole.gnu.ai.mit.edu) * term/x-win.el (x-select-text): New arg PUSH. (x-switch-definitions): Represent -r as `reverse' option. 1993-05-24 Richard Stallman (rms@mole.gnu.ai.mit.edu) * files.el (find-file-read-only-other-window): Use find-file-other-window. * paths.el (Info-default-directory-list): Add ../../info. * info.el (Info-suffix-list): Fix duplicate .z to .info.z. * faces.el (x-create-frame-with-faces): Handle `reverse' as parameter. * frame.el (frame-initialize): Likewise. * dired.el (dired-flag-backup-files): Speedup: check explicitly for ~ at end of line. (dired-flag-auto-save-files): Similar change. * register.el (jump-to-register): Don't fail if frame-configuration-p is unbound. * files.el (cd): Set cd-path to a list. * simple.el (kill-new): Pass t as 2nd arg to interprogram-cut-function. * select.el (x-set-cut-buffer): New arg PUSH. 1993-05-24 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * disp-table.el (standard-display-default): New function. (standard-display-european): New command. * loaddefs.el: Bind [?\M-\C-\ ] to mark-sexp. 1993-05-24 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el (shell-command): Don't activate mark even momentarily. 1993-05-24 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * case-table.el, disp-table.el, finder.el, iso-ascii.el, iso-insert.el, iso-swed.el, iso-syntax.el, iso8859-1.el, swedish.el: Change "i14n" keyword to "i18n". * finder.el (finder-compile-keywords): Replacement unnecessary. 1993-05-24 Richard Stallman (rms@mole.gnu.ai.mit.edu) * menu-bar.el (menu-bar-mode): Doc fix. 1993-05-23 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * lucid.el (switch-to-other-buffer): Build the list of acceptable buffers properly. * faces.el (make-face): Change interactive spec to 'S'. 1993-05-23 Richard Stallman (rms@mole.gnu.ai.mit.edu) * ange- (ange-ftp-raw-send-cmd): Allow quitting during accept-process-output. * finder.el (finder-known-keywords): Use i18n, not i14n. (finder-compile-keywords): Substitute i18n for i14n. Turn off undo in *finder-scratch*. Ignore file names starting with =. (finder-mode, finder-current-item): Rename headmark to finder-headmark. (finder-list-matches, finder-list-keywords): Likewise. * iso8859-1.el: Call set-case-..., not standard-case-... 1993-05-23 Paul Eggert (eggert@twinsun.com) * calendar.el (calendar-daylight-savings-starts, calendar-daylight-savings-ends): Default to nil if the locale never has DST. 1993-05-22 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * Version 19.7 released. 1993-05-22 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * vc.el (vc-comment-to-change-log): Don't take FILE argument, since vc-update-change-log doesn't support it anyway. Don't bind default-directory. Instead pass second arg to file-relative-name. (vc-update-change-log): Use find-change-log instead of hardcoding. 1993-05-22 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * cl.el (cl-floor, cl-ceiling, cl-truncate, cl-round): Renamed from floor, ceiling, truncate, and round; the old names conflict with built-in functions. 1993-05-22 Richard Stallman (rms@mole.gnu.ai.mit.edu) * gud.el (gud-def): Fix inclusion of the define-key. (gdb, sdb, dbx): Change bindings from letters to control chars. (gud-common-init): Add save-excursion. (gud-display-line): Don't mess with buffer-read-only. (gud-filter): Set output-after-point *after* deleting old prompt. Likewise for `moving'. * subr.el (event-modifiers): Doc fix. * help.el (describe-key, describe-key-briefly): Discard the click or drag that follows a down event. * levents.el (event-modifiers): Function deleted. (read-command-event): For switch-frame event, call select-frame. 1993-05-22 Noah Friedman (friedman@splode.com) * rlogin.el (rlogin-filter): Yet another rewrite which handles unusual values of scroll-step in a winning way by window-start frobnication. 1993-05-22 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el (pending-undo-list): Var declared. * apropos.el (apropos-print-matches): Bind tem. 1993-05-21 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * holidays.el: Update reference to the papers in S-P&E. (filter-visible-calendar-holidays): Test for nil date. * cal-mayan.el: Update reference to the papers in S-P&E. * cal-french.el: Update reference to the papers in S-P&E. 1993-05-21 Richard Stallman (rms@mole.gnu.ai.mit.edu) * apropos.el (apropos-match-keys): Handle modern keymap structure. * simple.el (transient-mark-mode): Doc fix. * outline.el (outline-minor-mode): Make permanent local in all buffers. Give the command a doc string, and make it autoload. * lisp-mode.el (lisp-body-indent): Add doc. 1993-05-20 Richard Stallman (rms@mole.gnu.ai.mit.edu) * texinfo.el (texinfo-section-types-regexp): Define here. * delsel.el: Provide delsel. (keyboard-quit): Definition deleted. (minibuffer-keyboard-quit): If Delete Selection mode is off, do abort even if mark is active. 1993-05-19 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) Some time-handling patches from Paul Eggert: * calendar.el (calendar-current-time-zone): New function. (calendar-time-zone, calendar-standard-time-zone-name, calendar-daylight-time-zone-name): Use it instead of current-time-zone. * sendmail.el (mail-do-fcc): Use the same absolute time for both current-time-string and current-time-zone. Adjust to new format returned by current-time-zone. * xfaces.el (face-equal): Doc fix. 1993-05-19 Richard Stallman (rms@mole.gnu.ai.mit.edu) * delsel.el: Renamed from pending-del.el. Functions and variables renamed to ...delete-selection... from ...pending-delete... Bind all minibuffer keymaps alike. * outline.el (outline-heading-end-regexp): Fix typo. (outline-minor-mode-map): New variable. (minor-mode-map-alist): Add new entry. (outline-minor-mode): Work with above change. Do not set outline-regexp or outline-header-end-regexp. 1993-05-19 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * calendar.el (hebrew-calendar-yahrzeit): Correct error from S-P&E paper in test for Adar I 30 date of death for yahrzeit in a non-leap year when Shevat 29 must be used. 1993-05-19 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * files.el (set-auto-mode): If the buffer's file name is nil, don't try to compare it against the entries in auto-mode-alist. 1993-05-19 Richard Stallman (rms@mole.gnu.ai.mit.edu) * ispell.el (ispell-command-loop): Make an undo boundary. * isearch.el (isearch-mode-map): Use vector, not string, to bind printing characters. 1993-05-18 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * select.el (xselect-convert-to-class): Just return "Emacs" here. That's what the class will always be. 1993-05-18 Richard Stallman (rms@mole.gnu.ai.mit.edu) * loaddefs.el: Add bindings for C-SPC and C-/, like C-@ and C-_. 1993-05-18 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * startup.el (normal-top-level, command-line, command-line-1): Don't call the frame and face initialization functions unless they're bound. * frame.el (frame-notice-user-settings): Don't make frame-initial-frame unbound; just set it to nil. * startup.el (command-line-1): Call frame-notice-user-settings before displaying the startup message. * server.el (server-switch-hook): New hook. (server-process-filter): Call it. * bibtex.el (bibtex-string): Use \" instead of "" to get a double quote inside a string. * vms-patch.el (print-region-function): Same. 1993-05-18 Richard Stallman (rms@mole.gnu.ai.mit.edu) * sendmail.el (mail-yank-original): In Transient Mark mode, don't get error and don't activate the mark. * isearch.el (isearch-mode-map): Extend the dense keymap to 256 chars. 1993-05-17 Richard Stallman (rms@mole.gnu.ai.mit.edu) * trace.el, advice.el: New files. * bytecomp.el (byte-compile-file): Don't write output if error. * sendmail.el (mail-setup): Leave point before signature, not after. * rmailsort.el (rmail-sortable-date-string): Handle date in format produced by current-time-string. * simple.el (keyboard-quit): Run deactivate-mark-hook. (kill-ring-save): If quit happens while cursor is bounced, make it appear like a command-level quit. * loaddefs.el: Add bindings for C-digits, C-M-digits, C-- and C-M--. * isearch.el (isearch-mode): Set deactivate-mark. * menu-bar.el (fill-region, kill-region, delete-region) (kill-ring-save): Use mark-active as enable condition. (undo): Add an enable condition. 1993-05-16 Richard Stallman (rms@mole.gnu.ai.mit.edu) * texinfo.el (texinfo-chapter-level-regexp): Copied here. 1993-05-17 Roland McGrath (roland@geech.gnu.ai.mit.edu) * gnus.el (gnus-info-directory): Variable removed. (gnus-info-find-node): Don't use it. 1993-05-16 Richard Stallman (rms@geech.gnu.ai.mit.edu) * gnus.el, gnuspost.el, gnusmail.el, gnusmisc.el * nntp.el, nnspool.el, mhspool.el: Version 3.15 from Umeda. * frame.el (toggle-scroll-bar): Renamed from toggle-vertical-scroll... 1993-05-16 Richard Stallman (rms@mole.gnu.ai.mit.edu) * texinfo.el: Don't require tex-mode or texnfo-upd. (texinfo-mode-map): Binding for " deleted. (texinfo-tex-print): Require tex-mode here. (texinfo-tex-region): Likewise. (texinfo-tex-region): Update name of tex-set-buffer-directory. * tex-mode.el (tex-insert-quote): Doc fix. * vc.el: Don't require sendmail, compile, or dired. * simple.el (push-mark): Always activate the mark if not in Transient Mark mode. * c-mode.el (mark-c-function): Activate the mark. * ispell.el (ispell): Deactivate mark before the Ispell run. (ispell-point): Delete the sit-for; it was confusing. (ispell): Don't use save-excursion; just restore current buffer. (ispell-next): Don't save-excursion or save-window-excursion. (ispell-point): Don't save-excursion. (ispell-window-configuration): New variable. (ispell-show-choices): Set it if not nil. (ispell-next): Initialize to nil. Restore at end. * simple.el (yank, yank-pop): Don't activate the mark. * lisp.el (mark-sexp, mark-defun): Activate the mark. * page.el (mark-page): Activate the mark. * paragraphs.el (mark-paragraph, mark-end-of-sentence): Likewise. * simple.el (mark-whole-buffer, mark-word): Activate the mark. (push-mark): Optional arg ACTIVATE. (set-mark-command): Use that. * faces.el (face-initialize): Do make the modeline face. (x-initialize-frame-faces): Explicitly invert `modeline' face. (x-create-frame-with-faces): Simplify; do nothing special with `default' or `modeline' face. 1993-05-15 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * version.el (emacs-version): Alpha release 19.6. 1993-05-15 Richard Stallman (rms@mole.gnu.ai.mit.edu) * faces.el: Rename `primary-selection' to `region'. * mouse.el (mouse-set-region): Call set-mark to activate mark. * isearch.el (isearch-done): Don't activate mark. * simple.el . * bytecomp.el (byte-compile-track-mouse): New function. This is a kludge; track-mouse must be compiled better. * simple.el (transient-mark-mode): New command. * mouse.el (mouse-drag-region): New command, on down-mouse-1. * map-ynp.el (map-y-or-n-p): Show the answers in the echo area. * faces.el (face-initialize): Turn off `modeline' face. Set region-face. (invert-face): Really do use the default colors. (x-initialize-frame-faces): Always try "gray" color for primary-selection; always invert if that fails. Similar changes for highlight, secondary-selection. * menu-bar.el: Fix up the edit commands. Add fill-region. 1993-05-14 Richard Stallman (rms@mole.gnu.ai.mit.edu) * menu-bar.el (menu-bar-mode): New command. Use for initialization. * faces.el (make-face): Add interactive spec. (set-default-font): Deleted. * isearch.el (isearch-mode-map): Handle any length vector in keymap. (isearch-char-to-string): Handle non-character events properly. 1993-05-14 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * subr.el (overlay-start, overlay-end, overlay-buffer): Removed. * vc.el (vc-version-diff): Match parens. 1993-05-14 Paul Eggert (eggert@twinsun.com) * vc.el (vc-revert-buffer1): Don't assume that compilation-error-list is a list; it might be t. 1993-05-13 Richard Stallman (rms@mole.gnu.ai.mit.edu) * emerge.el: Installed version 5 from drw. Merged in previous FSF changes, plus new changes: (emerge-count-matches-string): Renamed from count-matches-string. (emerge-command-prefix): Now C-c C-c. (emerge-shadow-key-definition): Deleted. Callers use substitute-key-definition. (emerge-recursively-substitute-key-definition): Deleted. Callers use substitute-key-definition. (emerge-unselect-hook): Renamed from emerge-unselect-hooks. (emerge-files-internal): Use file-local-copy to handle remote files. (emerge-files-with-ancestor-internal): Likewise. (emerge-remote-file-p): Deleted. (emerge-abort): New command. (describe-mode): Deleted. (emerge-hash-string-into-string): Renamed from hash-string-into-string. (emerge-unslashify-name): Renamed from unslashify-name. (emerge-write-and-delete): Don't write-file if file-out is nil. (emerge-setup-fixed-keymaps): Put emerge-abort on C-]. (emerge-find-difference-diff): Renamed from emerge-find-difference. (emerge-find-difference): New command. Now on `.'. (emerge-diff-ok-lines-regexp): Renamed from emerge-diff-ok-lines. (emerge-diff3-ok-lines-regexp): Renamed from emerge-diff3-ok-lines. 1993-05-13 Paul Eggert (eggert@twinsun.com) * vc.el (vc-version-diff): Don't move point in current buffer. 1993-05-13 Roland McGrath (roland@geech.gnu.ai.mit.edu) * etags.el (tags-table-including): Take new third arg CORE-ONLY. If non-nil, ignore files without extant buffers. (visit-tags-table-buffer): Call tags-table-including first with CORE-ONLY set, and then afterwards with it clear. 1993-05-12 Richard Stallman (rms@mole.gnu.ai.mit.edu) * term/x-win.el: Require menu-bar.el. * menu-bar.el: Provide 'menu-bar. * compile.el (Setting minor-mode-map-alist): Put the map directly in the alist, not a variable name. * vc.el: Likewise. * macros.el (kbd-macro-query): Fix prompt string. * loadup.el: Preload mouse, scroll-bar and select if have multi-frames. * vc.el: Improve doc strings and prompt strings. (vc-cancel-version): Ask whether to revert buffer. * lmenu.el (default-menubar): Make initial value nil. (kill-this-buffer, x-new-frame) (sensitize-file-and-edit-menus-hook, format-buffers-menu-line) (buffers-menu-max-size, complex-buffers-menu-p) (buffers-menu-switch-to-buffer-function, buffer-menu-save-buffer) (buffer-menu-write-file, build-buffers-menu-internal) (build-buffers-menu-hook): Functions and variables deleted. * faces.el (face-initialize): New function. All initialization code moved into it. Call at end of file, if using X frames already. (x-create-frame-with-faces): Don't use faces if not initialized. * startup.el (command-line): Call frame-initialize explicitly. Call face-initialize. (normal-top-level): Call frame-notice-user-settings explicitly. * frame.el: Do not put those functions on hooks. * terminal.el (te-pass-through): Handle meta chars and non-char events. (terminal-map, etc.): Use default bindings, not fillarray. Make the maps sparse. (terminal-meta-map): New map; lets us make ESC a prefix key. (terminal-map): Bind ESC to terminal-meta-map. (te-more-break-unread): Handle non-char as last-input-char. (te-filter): Delete code that worked with meta-flag. (terminal-emulator): Don't look at meta-flag. (terminal-mode): Don't make meta-flag local. (te-stty-string): Quote the args that have ^. Add pass8. 1993-05-08 Paul Eggert (eggert@twinsun.com) * vc.el (vc-diff): Report an error if the buffer isn't registered. (vc-registration-error): New function. (vc-next-action, vc-diff, vc-print-log, vc-backend-diff): Use it to make VC's error messages more uniform. * vc.el (vc-directory, vc-revert-buffer1): Quote lambdas with (function ...) for Emacs 18. (compilation-old-error-list): Set if undefined, for Emacs 18. 1993-05-11 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * faces.el: Re-arranged to put accessors at the top. 1993-05-10 Richard Stallman (rms@mole.gnu.ai.mit.edu) * buff-menu.el (Buffer-menu-quit): New function, now on q. (buffer-menu): Update list of options. Don't save a window config. (Buffer-menu-select): Don't call Buffer-menu-execute. Don't restore a window config. (Buffer-menu-mode-map): Buffer-menu-select now on v. 1993-05-10 Roland McGrath (roland@geech.gnu.ai.mit.edu) * bytecomp.el (byte-recompile-directory): If ARG is non-nil, set it to its prefix numeric value. Test for ARG being zero with eq, not zerop. 1993-05-09 Richard Stallman (rms@mole.gnu.ai.mit.edu) * rmailout.el (rmail-output): Undo June 11 1992 change: Don't try to use Date field in the From. * faces.el: Rename all references to try-face-font to internal-try-face-font, so we don't need lucid.el. * faces.el (read-face-name): Call face-list, not list-faces. Fail more gracefully if we can't build bold, italic, etc, versions of the default font. * faces.el (make-face-bold, make-face-italic, make-face-bold-italic, make-face-unbold, make-face-unitalic): Implement NOERROR argument. (x-initialize-frame-faces): Use the NOERROR argument to the font manipulation functions to avoid errors while starting up. Remove initialization of isearch font. * xfaces.c (internal-x-complain-about-font): Add new frame argument, so we can check the frame parameters to find the default font. Callers changed. * faces.el (x-create-frame-with-faces): Fix typo. Dyke out code to fully qualify the modeline font; we may not be able to do that correctly. 1993-05-09 Richard Stallman (rms@mole.gnu.ai.mit.edu) * dabbrev.el (dabbrev-expand): Delete a search-forward call after the second replace-match. 1993-05-09 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * add-log.el (find-change-log): If there is a buffer-local value of change-log-default-name, just return it with no searching. Previously if it was set to a nonexistent file name, we would loop forever. 1993-05-09 Richard Stallman (rms@mole.gnu.ai.mit.edu) * replace.el (query-replace-map): Bind [escape] like "\e". * macros.el (kbd-macro-query): Use query-replace-map to define answers. * vc.el (diff-switches): Define var here as well as in diff.el. (vc-backend-diff): Handle either string or list. * comint.el (comint-filter): Increment opoint only if after insertion point. 1993-05-08 Jim Blandy (jimb@totoro.cs.oberlin.edu) * faces.el: Call internal-set-face-1, not internat-set-face-1. * faces.el: Don't set frame-creation-function here; term/x-win.el is the appropriate place to set it. * faces.el: Only apply x-initialize-frame-faces to X frames; pass over terminal frames. * faces.el: Provide 'faces. 1993-05-08 Jim Blandy (jimb@totoro.cs.oberlin.edu) * term/x-win.el: Since we require faces.el, there's no point in setting frame-creation-function to x-create-frame - just set it directly to x-create-frame-with-faces. 1993-05-08 Richard Stallman (rms@mole.gnu.ai.mit.edu) * sendmail.el (mail-do-fcc): Don't output a newline before From... * rmail.el (rmail-convert-to-babyl-format): Delete 1 char if we see a newline instead of what we expect. * register.el (jump-to-register): Allow file name "in" a register. * scroll-bar.el (scroll-bar-drag, scroll-bar-drag-1): New functions. Put scroll-bar-drag on down-mouse-2 in scroll bar. Leave up-events on mouse-2 unbound. * help-macro.el: Provide help-macro, not help-screen. * help.el: Require help-macro, not help-screen. * menu-bar.el: Don't add menu bar to minibuffer-only frames. 1993-05-07 Paul Eggert (eggert@twinsun.com) * vc.el (vc-directory-18): New function. If Emacs 18, make vc-directory alias to this. 1993-05-07 Richard Stallman (rms@mole.gnu.ai.mit.edu) * loaddefs.el: Bind M-right and M-left to forward-word, backward-word. Unbind M-up and M-down. * calendar.el (calendar-mode-map): Add arrow key bindings. * rmail.el (rmail-resend): Add `resent' attribute. (rmail-forward): With prefix arg, run rmail-resend. 1993-05-07 Jim Blandy (jimb@totoro.cs.oberlin.edu) * term/x-win.el: (require 'faces), too. Move (require 'select) to top, with the other requires. 1993-05-06 Jim Blandy (jimb@totoro.cs.oberlin.edu) * finder.el: Bind finder-exit to 'q', not 'x'; the former is the conventional way to get out of such a package. (finder-summary): Use substitute-command-keys. (finder-mode): Use \\<...> to make sure we get the right keymap. 1993-05-06 Richard Stallman (rms@mole.gnu.ai.mit.edu) * replace.el (flush-lines, keep-lines, how-many): Delete spurious `s' from prompt arg to read-from-minibuffer. * comint.el (comint-filter): New function. (comint-exec): Install the filter. * simple.el (previous-matching-history-element): If minibuf is empty, use the last regexp specified a the default. (next-matching-history-element): Likewise. * comint.el (comint-previous-matching-input): New command, on M-r. (comint-next-matching-input): New command, on M-s. (comint-previous-similar-input): Commented out. (comint-next-similar-input): Likewise. (comint-previous-input-matching): Deleted. (comint-last-input-match): Var commented out. (comint-mode): Don't make comint-last-input-match local. 1993-05-05 Richard Stallman (rms@mole.gnu.ai.mit.edu) * files.el (auto-mode-alist): Delete the entries for makefile-mode. * asm-mode.el: Doc fix. * man.el: Rename functions and variables `man-*' to `Man-*'. (manual-entry): Make prompt string clearer. * simple.el (blink-matching-paren-distance): Change default to 12,000. 1993-05-04 Richard Stallman (rms@mole.gnu.ai.mit.edu) * vc.el (minor-mode-map-alist): Don't use it if it's void. (vc-cancel-version): Doc fix. (vc-backend-diff): Use diff-switches, not vc-diff-options. (vc-diff-options): Variable deleted. 1993-05-03 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * calendar.el: Update reference to the papers in S-P&E. (calendar-print-astro-day-number): Correct spelling error in message string. 1993-05-03 Richard Stallman (rms@mole.gnu.ai.mit.edu) * help.el (help-for-help): Use lower case letters for help options. * rect.el (string-rectangle): Renamed from fill-rectangle. (string-rectangle-line): Renamed from fill-rectangle-line. 1993-05-01 Richard Stallman (rms@mole.gnu.ai.mit.edu) * vc.el (vc-dired-prefix-map): New keymap. Use it in minor-mode-map-alist for vc-dired-mode. * vc-hooks.el (vc-mode-line): Don't alter key bindings. (vc-toggle-read-only): Put on C-x C-q unconditionally. (vc-mode): Add permanent-local property. 1993-04-30 Richard Stallman (rms@mole.gnu.ai.mit.edu) * files.el (find-file-noselect): On VMS, always set buffer-file-name to the truename. * vc.el (vc-revert-buffer1): Fix format of compilation-error-list. * files.el (find-file-noselect): Do set buffer-file-name to the truename, when find-file-visit-truename. 1993-04-29 Jim Blandy (jimb@totoro.cs.oberlin.edu) * yow.el (yow): Fix interactive spec. * files.el (insert-directory): Undo change of March 23; dereferencing links is inappropriate for dired. * edebug.el (edebug-display): Call the `mark' function with. 1993-04-29 Richard Stallman (rms@mole.gnu.ai.mit.edu) * complete.el: New file. * vc.el (vc-match-substring): Renamed from match-substring. (vc-parse-buffer): Use new name. * shell.el (shell-prompt-pattern): Undo last change. * files.el (file-truename): Redo esr's change. * loaddefs.el: Put arrow key bindings back to the ordinary Emacs cmds. * simple.el (up-arrow, down-arrow, left-arrow, right-arrow): Deleted. * simple.el (kill-line, next-line-add-newlines): Doc fix. (kill-whole-line): Doc fix. (kill-forward-chars, kill-forward-chars): Reinsert as before. * simple.el: Change defalias to define-function. 1993-04-28 Roland McGrath (roland@geech.gnu.ai.mit.edu) * vc.el (vc-revert-buffer1): Ignore non-marker elts of compilation-error-list. * compile.el: Add compilation-minor-mode to minor-mode-alist and minor-mode-map-alist. . 1993-04-28 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * bibtex.el: Installed Aaron Larson's new bibtex.el. See the header comment for details. 1993-04-28 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * gnuspost.el (gnus-inews-organization): If ORGANIZATION is "", set it to nil. 1993-04-28 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * files.el (file-truename): Undo last change. 1993-04-27 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * files.el (file-truename): Do the right thing when $HOME = "". * simple.el (hscroll-step): New variable. (hscroll-point-visible): New function. (left-arrow, right-arrow): These use hscroll-point-visible for better auto- scrolling behavior. * picture.el: Completed the package entry point's name change from edit-picture to picture-mode. (move-to-column-force, picture-end-of-line): When movement is completed, scroll horizontally if necessary to make point visible. (picture-beginning-of-line): New function. (picture-mode-map): Use substitute-key-definition. * gud.el (gud-format-command): Fix %f expansion to send ondly the basename of files to gdb. 1993-04-27 Jim Blandy (jimb@totoro.cs.oberlin.edu) * disp-table.el (describe-display-table): Don't use the term "rope"; we're using vectors of characters now. (standard-display-8bit, standard-display-ascii): Set the element of the display table to a vector, not an integer; the latter doesn't mean anything. * mouse.el (mouse-buffer-menu): Don't right-justify the buffer name; this doesn't look nice if we use a proportional font. * sendmail.el (mail-setup): Don't insert "--\n" before the signature. If they want it, they can put it in their .signature file. * lucid.el: Comment out fset of set-screen-width properly. * lucid.el: (provide 'lucid). * lucid.el: (switch-to-other-buffer): Avoid buffers whose names start with a space. 1993-04-26 Roland McGrath (roland@geech.gnu.ai.mit.edu) * etags.el (find-tag-interactive): New function to read args. . 1993-04-26 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * cmacexp.el: Installed Francesco Potorti's enhanced and cleaned-up version, see its commentary for details. * tex-mode.el: Doc fixes. Also a few teaks to pacify the byte-compiler. * terminal.el: Some defvars moved. Defvars added for many variables. (te-stty-string): Specify the characters explicitly--not `stty dec'. 1993-04-26 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * files.el (cd): Handle leading "~" like an absolute filename. * dired.el: Changed fsets to defaliases. 1993-04-25 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * comint.el (comint-mod): Nuked. A call to ring-mod replaces it. (comint-mem): Nuked. A call to member replaces it. * ring.el: Rewritten. A poor choice of representation made the old code excessively complex. The new version is smaller and faster. The interface is unchanged, except that ring-remove now accepts an optional numeric argument specifying the element to remove. * gud.el: Set no-byte-compile local variable t to work around a byte-compiler bug. (gud-def, global-map): Move C-x C-a commands to global map. Restore original C-x SPC global binding. * vc.el (vc-diff): Get proper error message when you run this with no prefix arg on an empty buffer. (vc-directory): Better directory format --- replace the user and group IDs with locking-user (if any). (vc-finish-logentry, vc-next-comment, vc-previous-comment): Replace *VC-comment-buffer* with a ring vector. 1993-04-25 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * simple.el (down-arrow): New function. Uses next-line-add-newlines to suppress addition of new lines at end of buffer. (up-arrow): Alias of previous-line, added for consistency. These changes complete terminal-type-independent support for arrow keys. * tex-mode.el (tex-compilation-parse-errors): Added. At the moment, this would have to be applied manually. It's not worth trying to integrate this with the rest of the mode more tightly until we decide whether and how compile's interface is going to change away from a closed subsystem. * files.el (cd): Changed to use to resolve relative cd calls. (cd-absolute): Added. This is actually the old cd code with a changed doc string. (parse-colon-path): Added. Path-to-string exploder --- may be useful elsewhere. * ring.el: Added and fixed documentation. (ring-rotate): Nuked. It was (a) unused, and (b) totally broken (as in, any attempt to use it died with a type error, and when I patched it to fix that I found its algorithm was broken). (ring-ref): Added doc string. 1993-04-25 Jim Blandy (jimb@totoro.cs.oberlin.edu) * bytecomp.el (meta-flag): Declare this an obsolete variable. * subr.el (listify-key-sequence): Use a character constant to decide which bits to flip, not an integer constant. 1993-04-24 Noah Friedman (friedman@splode.com) * shell.el (shell-prompt-pattern): Add `;' as potential prompt delimiter (for `es' and `rc' shells most particularly). 1993-04-23 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * isearch.el: Replaced all fsets with defaliases. 1993-04-23 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * bytecomp.el (define-function): Changed name back to defaliases to get things in a known-good state. The unload patch had been half-applied, leading to lossage. * register.el, gnuspost.el, find-dired.el, cust-print.el, two-column.el, tar-mode.el, shell.el, lselect.el, select.el, ispell.el, life.el, picture.el, rmail.el, mim-mode.el, replace.el, tex-mode.el, frame.el, lucid.el, subr.el: All fsets changed to defaliases. * edt.el: Some fsets changed to defaliases. * telnet.el: Commentary added. (telnet): Doc fix. (rsh): Added entry point for rsh to remote host, per suggestion by Michael McNamara <mac@ardent.com>. No change to any other code. * info.el (Info-find-node, Info-insert-subfile): Do the right thing if info files have been compressed or gzipped. This is saving me lots of disk space. * simple.el: All fsets changed to defaliases. (kill-forward-chars, kill-backward-chars): Deleted. These were internal subroutines used by delete-char and delete-backward-char before those functions were moved into the C kernel. Now nothing uses them. (kill-line): Added kill-whole-line variable. Defaults to nil; a non-nil value causes a kill-line at the beginning of a line to kill the newline as well as the line. I find it very convenient. Emulates Unipress' &kill-lines-magic variable. (next-line): Added next-line-add-newlines variable. If nil, next-line will not insert newlines when invoked at the end of a buffer. This obviates three LCD packages. (left-arrow, right-arrow): New functions. These do backward-char and forward-char first. If line truncation is on, they then scroll left or right as necessary to make sure point is visible. * loaddefs.el: All fsets changes to defaliases. (global-map): Changed bindings of [left] and [right] to left-arrow and right-arrow respectively. 1993-04-22 Roland McGrath (roland@mole.gnu.ai.mit.edu) * ange- (ange-ftp-binary-file-name-regexp): Match .z and .z-part-?? files. 1993-04-21 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * makefile.el: Rewritten and simplified, commentary added. It now will usually detect when the makefile target or macro lists need to be rebuilt and do it automatically; in particular, this means you no longer have to deal with an annoying wait at find-time. 1993-04-19 Roland McGrath (roland@mole.gnu.ai.mit.edu) * vc.el (vc-revert-buffer1): Typo fix in last change. * shell.el (shell-mode): isation/ization (doc fix). * shell.el (shell-mode): Capitalize mode name. * vc.el (vc-comment-to-change-log): Restored interactive spec. Why was it removed? Why does the only log entry mentioning this function contain no actual information? * vc.el (vc-revert-buffer1): Completely rewrote compilation reparsing code. * files.el (find-file-noselect): Never set SAME-TRUENAME to a buffer whose buffer-file-name is nil. * files.el (set-auto-mode): If the buffer begins with "#!", look for -*- in the first two lines, not just the first one. 1993-04-17 Richard Stallman (rms@mole.gnu.ai.mit.edu) * sendmail.el (mail-do-fcc): Make a numeric time zone indicator with current-time-zone--don't run `date'. 1993-04-16 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * bytecomp.el (byte-compile, byte-compile-keep-pending) (byte-compile-file-form-defmumble): Generate define-function rather than fset, to install definitions for defun, defmacro, etc. * loadhist.el: New file. * tar-mode.el: Add defvars to pacify the byte compiler, at RMS's request. * diff.el (diff-parse-differences): Small robustification --- don't lose if we call this with compilation-parsing-end nil 1993-04-16 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * electric.el (shrink-window-if-larger-than-buffer): Moved to window.el. 1993-04-16 Jim Blandy (jimb@totoro.cs.oberlin.edu) * comint.el (comint-match-partial-pathname): Move "---" range in character class in regular expressions to the end of the character class; this way, it meets the POSIX regexp specs. * files.el (abbreviate-file-name): If abbreviated-home-dir ends with a slash, don't remove the corresponding slash from filename when we collapse the home directory to ~. 1993-04-16 Noah Friedman (friedman@splode.com) * rlogin.el: Add autoload cookies for all defvars. (rlogin-process-connection-type): New variable. (rlogin): Use it to determine process-connection-type. (rlogin): Set process mark to point-max, not point-min. (rlogin-with-args): Put `+' inside \(\) pair in string-match. (rlogin-password): Take optional arg `proc' for use by rlogin-filter. Write docstring. Call new winning version of comint-read-noecho instead of doing reading by hand. (rlogin-mode): Wrote docstring. (rlogin-filter): Completely rewritten to be more efficient. 1993-04-14 Richard Stallman (rms@mole.gnu.ai.mit.edu) * resume.el (resume-suspend-hook): Renamed from empty-args-file. Add autoload cookie. (resume-emacs-args-buffer): Renamed. (resume-write-buffer-to-file): Renamed. * two-column.el (tc-dissociate): Renamed from tc-kill-association. Move binding to C-x 6 d. 1993-04-14 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * autoload.el (update-file-autoloads, update-directory-autoloads): If called interactively, save generated-autoload-file when done. 1993-04-14 Richard Stallman (rms@mole.gnu.ai.mit.edu) * makefile.el (makefile-mode): Fix typo in autoload cookie. * isearch.el: Doc fixes. 1993-04-14 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * gud.el (gud-mode): Created C-c synonym bindings in the GUD buffer's local map. (gud-key-prefix): Changed to C-x C-a. 1993-04-14 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * help-macro.el: Name changed from help-screen.el to fit in a 14-character limit. * sun-curs.el: Name changed from sun-cursors.el to protect the innocents. 1993-04-14 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * finder.el: Rewritten. The Finder is now a major mode with the ability to browse package commentary sections and a completely point-and-shoot interface similar to Dired's. * window.el (shrink-window-if-larger-than-buffer): Moved from electric.el to windows.el, minor bug fix. This is to avoid code duplication between vc.el, electric.el, and finder.el. (ctl-x-map): Added C-x - and C-x + as experimental bindings for shrink-window-if-larger-than-buffer and balance-windows respectively. Since shrink-window-if-larger-than-buffer has to live here anyhow, let users use it to manage screen space. * lisp-mnt.el (lm-commentary-region): Gone. (lm-commentary): New function, replacing lm-commentary-region. 1993-04-12 Jim Blandy (jimb@totoro.cs.oberlin.edu) * bytecomp.el: The `suspend-hooks' variable is obsolete now, and `suspend-hook' is the right name. 1993-04-12 Jim Blandy (jimb@totoro.cs.oberlin.edu) * term/sun-mouse.el (suspend-emacstool): Run suspend-hook, not suspend-hooks. 1993-04-12 Richard Stallman (rms@mole.gnu.ai.mit.edu) * rot13.el (rot13-display-table): Use `vector', not `make-rope'. * disp-table.el: Use `vector', not `make-rope'. * rot13.el (rot13-other-window): Add autoload. 1993-04-12 Noah Friedman (friedman@splode.com) * comint.el (comint-process-echoes): New variable. (comint-mode): Make it buffer-local. (comint-send-input): Delete text from process mark to point if variable `comint-process-echoes' is non-`nil', since it is assumed process will re-echo the text. 1993-04-12 Richard Stallman (rms@mole.gnu.ai.mit.edu) * disp-table.el: Use `vector', not `make-rope'. * rot13.el (rot13-other-window): Add autoload. (rot13-display-table): Use `vector', not `make-rope'. 1993-04-10 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * gud.el (gdb, sdb, dbx): Improved prompting a la grep. * comint.el: Clean up cmu* uses in header comments. 1993-04-10 Jim Blandy (jimb@mole.gnu.ai.mit.edu) * subr.el (overlay-start, overlay-end, overlay-buffer): New defsubsts. 1993-04-10 Jim Blandy (jimb@totoro.cs.oberlin.edu) * paragraphs.el (sentence-end, forward-sentence): Doc fixes. *-10 Jim Blandy (jimb@totoro.cs.oberlin.edu) * paragraphs.el (sentence-end, forward-sentence): Doc fixes. 1993-04-09 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * emerge.el (emerge-with-ancestor): Applied Donald Erway's fix patch, which included the following explanatory comment: "D.Erway - This used to just do emerge-get-diff3-group on 2, then on 3. This was incorrect, since the file 3 info for a diff can preceed the file 2 info for that same diff. So we save and restore point to overcome this." 1993-04-09 Jim Blandy (jimb@totoro.cs.oberlin.edu) * subr.el (overlay-start, overlay-end, overlay-buffer): New defsubsts. *-08 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * autoload.el (generate-file-autoloads): Doc fix. 1993-04-08 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * gud.el: Massive changes, amounting nearly to a rewrite. The new features include auto-configuring support for SVr4, more commands, and a full minor-mode implementation that binds all GUD commands not just in the GUD interaction mode, but in C buffers visited by GUD. The common prefix of GUD commands is now C-x X, like electric-debug mode. * vc-hooks.el (vc-mode): name change. This looks better in keymap listings and conforms to the naming conventions used by other packages. * vc.el (vc-directory. vc-start-entry, vc-next-action, vc-next-action-on-file): The vc-directory listing is now in an augmented Dired mode that supports vc-next-action on all marked files. * dired.el (dired-noselect, dired-internal-noselect, dired-insert-directory): Enhancements to support passing dired a DIRNAME argument consisting of a directory-name car and a list-of-files cdr. This is needed to support VC's augmented dired, which wants a filtered file display that recurses (showing all version-controlled files in subdirectories as well as the top-level ones). * menu-bar.el: Added and corrected library headers. 1993-04-08 Richard Stallman (rms@geech.gnu.ai.mit.edu) * menu-bar.el: entered into RCS * lucid.el: Add copyright notice. 1993-04-07 Roland McGrath (roland@geech.gnu.ai.mit.edu) * compile.el (compile-internal): Initialize the process-mark. * compile.el (compilation-error-regexp-alist): Tighten first regexp so that it requires a colon or open-paren before the line number, not just whitespace. * compile.el (compilation-parse-errors): Remove debugging set) * menu-bar.el: New file. * fill.el (fill-nonuniform-paragraphs): New command. 1993-04-07 Roland McGrath (roland@geech.gnu.ai.mit.edu) * compile.el (compile-internal): Initialize the process-mark. 1993-04-07 Roland McGrath (roland@geech.gnu.ai.mit.edu) * compile.el (compilation-error-regexp-alist): Tighten first regexp so that it requires a colon or open-paren before the line number, not just whitespace. 1993-04-07 Richard Stallman (rms@mole.gnu.ai.mit.edu) * files.el (find-file-noselect): Verify other buffers' file numbers are still valid. 1993-04-07 Roland McGrath (roland@geech.gnu.ai.mit.ed) * tabify.el (untabify): Don't really change where restriction starts. 1993-04-06 Richard Stallman (rms@mole.gnu.ai.mit.edu) * dired.el (dired-pop-to-buffer): Adjust count-lines val for last line. 1993-04-05 Roland McGrath (roland@wookumz.gnu.ai.mit.edu) * add-log.el (find-change-log): New function. (add-change-log-entry): FILE-NAME frobnicating code moved there; call it. * vc.el (vc-comment-to-change-log): Renamed from vc-comment-to-changelog. Take optional arg and pass it to find-change-log. Added docstring and interactive spec. 1993-04-05 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * compile.el (compilation-error-regexp-alist): Merged HP-UX 7.0 fc regexp with the GNU format regexp: just allowing blanks to terminate the line number makes that one handle the HP case. Merged MIPS RISC CC regexp with Apollo cc regexp: make "s optional, and don't anchor to bol. * compile.el (compilation-error-regexp-alist): Changed MIPS RISC CC regexp (last one) to be anchored at bol, and to never match multiple lines. 1993-04-03 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * man.el, assoc.el: Installed Barry Warsaw's new and much more featureful man page browser. * finder.el, help-screen.el, faces.el: Added or corrected documentation headers 1993-04-03 Noah Friedman (friedman@splode.com) * comint.el: New comint-read-noecho. 1993-04-02 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * chistory.el (repeat-history-command): Bug fix. Someone forgot a car. 1993-04-02 Richard Stallman (rms@wookumz.gnu.ai.mit.edu) * mpuz.el (mpuz-try-letter): Use read-char to read digit. Use message directly also. Use downcase. (mpuz-read-map): Deleted. * dired.el (dired-unmark-all-files): Read the arg as just a char. 1993-04-01 Richard Stallman (rms@wookumz.gnu.ai.mit.edu) * lisp-mode.el (eval-defun): Rename argument to avoid collision. (eval-last-sexp): Likewise. 1993-03-31 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * etags.el (etags-tags-completion-table): Rewritten with a mondo regexp. 1993-03-31 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * timer.el (timer-program): New defconst. (run-at-time): Use timer-program as the name of the program the subprocess should run, and search for it in exec-directory, rather than checking the entire exec path. 1993-03-31 Roland McGrath (roland@geech.gnu.ai.mit.edu) * simple.el (indent-for-comment): Use skip-syntax-backward in place of skip-chars-backward. Correctly set INDENT to the return value of comment-indent-function. * etags.el (etags-tags-completion-table): Use skip-syntax-backward instead of skip-chars-backward. * view.el (view-exit): Use local map view-old-local-map, not (current-local-map). (view-buffer-other-window): Remove spurious backslashes from interactive spec. * map-ynp.el (map-y-or-n-p): Make bindings of user-defined keys be each a vector containing the user's binding, rather than 'user. Check (vectorp DEF) and call the vector's elt, rather than checking (eq 'user DEF) and calling something completely random. * novice.el (enable-command): Remove spurious assignment of free variable `foo'. * help.el (describe-function): For Lisp functions, write a prototype call before the docstring, instead of an argument description after it. 1993-03-30 Noah Friedman (friedman@splode.com) * files.el (find-backup-file-name): Delete nothing if overflow in number of versions to keep. 1993-03-30 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * subr.el (int-to-string): Make this an alias for the subr number-to-string. 1993-03-30 Richard Stallman (rms@mole.gnu.ai.mit.edu) * isearch.el (isearch-mode-map): Delete the binding for C-h. (isearch-done): Customize the message about mark. 1993-03-30 Noah Friedman (friedman@splode.com) * comint.el (comint-read-noecho): Rewritten to provide some simple editing ability and be able to abort when called from a process filter. Re-arranged and updated docstring. 1993-03-30 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * ring.el: Changed summary line. 1993-03-30 Richard Stallman (rms@mole.gnu.ai.mit.edu) * faces.el: New file. 1993-03-29 Richard Stallman (rms@mole.gnu.ai.mit.edu) * rmail.el (rmail): Don't use mbox as inbox by default. * simple.el (count-lines): Use save-match-data. * buff-menu.el: Put back removed years in copyright notice. 1993-03-29 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * vc.el (vc-next-action, vc-print-log, vc-diff, vc-revert-buffer): Improved logic for parent buffer finding. (vc-cancel-version): bug fix. 1993-03-29 Richard Stallman (rms@mole.gnu.ai.mit.edu) * mailabbrev.el: Provide mailabbrev, not mail-abbrevs. 1993-03-28 Richard Stallman (rms@mole.gnu.ai.mit.edu) * fill.el (fill-individual-paragraphs): When skipping mail headers, skip to a blank line. * env.el (setenv): Renamed back from putenv. * replace.el (regexp-history): New history list. (occur, flush-lines, keep-lines, how-many): Use it. (occur): Don't insert previous string in minibuffer gratuitously. Just use it if input is empty. Use save-match-data around count-lines. 1993-03-28 Noah Friedman (friedman@splode.com) * setenv.el: Renamed to env.el. Provide `env', not `setenv'. (setenv): Renamed to `putenv', which is the more proper complement of `getenv'. `setenv' retained as an alias. Make VALUE parameter optional; if not set, remove VARIABLE from process-environment. * rlogin.el (rlogin): If given a prefix argument and an rlogin session for HOST is already running, start a new rlogin process rather than switching to the existing one. Added docstring. Bound `proc' in let*. (rlogin-explicit-args, rlogin-password-paranoia): New variables. (rlogin-filter): Prompt for passwords in minibuffer if rlogin-password-paranoia is set. (rlogin-with-args, rlogin-password): New functions. 1993-03-28 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * vc.el (vc-comment-to-changelog): A useful vc-checkin hook, added. (vc-checkout): Now rejects attempts to check out files via FTP. * vc.el: The `derived buffers' in the mode (the VC log buffer, status buffers, and most buffer output commands) now know which file buffer was their parent, and most commands will try to find such a parent buffer when executed from within a special buffer. * makefile.el: Added autoload cookie for entry point. * files.el (auto-mode-alist): added pairs for .ms, .man, .mk, [Mm]akefile, .lex. * electric.el: (shrink-window-if-larger-than-buffer) Added doc string. Made argument optional, because window-buffer does the right thing with nil. * ebuff-menu.el (electric-buffer-menu-mode-map): fillarray isn't a valid operation on maps any more. 1993-03-27 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * refer.el: Installed. 1993-03-27 Richard Stallman (rms@wookumz.gnu.ai.mit.edu) * lucid.el (try-face-font, find-face, get-face): New aliases. 1993-03-27 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * abbrevlist.el, old-inf-lisp.el, old-screen.el old-shell.el, oshell.el: Removed. 1993-03-27 Noah Friedman (friedman@splode.com) * rlogin.el: Updated copyright year and added autoload cookies. (rlogin): Set process marker to beginning of buffer. (rlogin-filter): Use unwind-protect to restore match-data. Use insert-before-markers instead of insert to keep input and output from getting garbled. Delete spurious ?\C-m chars in output instead of replacing them with ?\ . 1993-03-27 Richard Stallman (rms@wookumz.gnu.ai.mit.edu) * case-table.el: Add autoloads. (set-case-syntax-delims, set-case-syntax-pair, set-case-syntax): Rename arg STRING to TABLE. Do not set the standard case table. 1993-03-26 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * loaddefs.el: Commented out function-key-error definition and uses in the global keymaps. RMS and jimb objected to the amount of space these took up in the keybinding listings. 1993-03-27 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * lpr.el (printify-buffer): Added, debugged from Roland McGrath's printify-buffer code in LCD. * cookie.el (cookie): Enhanced it to handle both LINS files and UNIX fortune files. * rect.el (fill-rectangle): Added. Inspired by Lynn Slater's insert-box package in LCD, but the interface and implementation are different. * loaddefs.el (ctl-x-map): Added binding for fill-rectangle. * buff-menu.el (Buffer-menu-toggle-read-only): Added, per Rob Austein's suggestion in the LCD package bm-toggle.el. * subr.el (add-hook): Added optional arg to cause hook to be appended rather than prepended to the hook list. This obviates the 23 different hook-bashing packages in LCD. * subr.el (current-word): Added. Lots of help and default-generator functions in LCD use it, and it's remarkably difficult to get right, especially given the new syntax primitives. 1993-03-26 Richard Stallman (rms@geech.gnu.ai.mit.edu) * files.el (local-write-file-hooks): New variable. (set-visited-file-name): Kill local-write-file-hooks as local var. (basic-save-buffer): Use local-write-file-hooks. 1993-03-26 Richard Stallman (rms@wookumz.gnu.ai.mit.edu) * files.el (local-write-file-hooks): New variable. (set-visited-file-name): Kill local-write-file-hooks as local var. (basic-save-buffer): Use local-write-file-hooks. 1993-03-26 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * yow.el (psychoanalyze-pinhead): Needed a prefrontal lobotomy. I gave it one. * two-column.el: Added Commentary. 1993-03-25 Richard Stallman (rms@geech.gnu.ai.mit.edu) * help.el (describe-function): Add blank line above doc string. * uncompress.el: Add provide call. 1993-03-25 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * lisp-mnt.el (lm-last-modified-date): Fixed return bug. (lm-author, lm-maintainer): These now return cons pairs, not strings. * shell.el: Brent Benson's patch to support `cd -'. * mh-e.el (mh-unshar): Added. * emacsbug.el: Added a (provide 'emacsbug); lisp-mnt.el needs this. 1993-03-24 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * term/x-win.el (x-defined-colors): Use x-color-defined-p instead of x-defined-color. (x-handle-geometry): Use x-parse-geometry instead of x-geometry. 1993-03-24 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * calendar.el (calendar-standard-time-zone-name, calendar-daylight-time-zone-name): Initialize these at load-time, as well as calendar-time-zone. * calendar.el (calendar-time-zone): Fix code which initializes this. 1993-03-24 Richard Stallman (rms@wookumz.gnu.ai.mit.edu) * term/x-win.el: Bind M-next to an alias scroll-other-window-1 to get better doc string output. 1993-03-23 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * compile.el: Fix library headers. 1993-03-23 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * files.el (insert-directory): Do chase symlinks before passing the directory name to ls. 1993-03-23 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * buff-menu.el: Incorporated changes from Bob Weiner's enhanced buff-menu from the LCD archive. 1993-03-23 Richard Stallman (rms@geech.gnu.ai.mit.edu) * replace.el (query-replace-map): Define backspace like delete. 1993-03-22 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * cookie.el: Created. This file contains what was formerly the guts of spook.el, lightly hacked to support more than one simultaneous cookie database. * spook.el, yow.el: Modified to use cookie.el. Total code in the three files cookie.el, yow.el and spook.el is less than the old spook.el + yow.el. * time.el, timer.el, uncompress.el, underline.el, view.el, vip.el, xscheme.el: Added or corrected Commentary section. This finishes my pass over the lisp libraries; I'll teach the finder about these commentary sections soon. 1993-03-22 Richard Stallman (rms@wookumz.gnu.ai.mit.edu) * term/x-win.el (x-win-suspend-error): suspend-hook renamed from suspend-hooks. 1993-03-22 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * help.el, register.el, replace.el, reposition.el, rfc822.el, rlogin.el, rot13.el, scribe.el, scroll-bar.el, sendmail.el, setenv.el, sgml-mode.el, simple.el, simula.el, sort.el, spell.el, spook.el, studly.el, tabify.el, text-mode.el: Added or corrected Commentary headers. 1993-03-22 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * diary-insert.el: Change the name to diary-ins.el. * calendar.el: Change all autoload references to diary-ins. 1993-03-22 Richard Stallman (rms@geech.gnu.ai.mit.edu) * help.el: Don't load help-screen at run time if compiled. 1993-03-22 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * man.el, mlconvert.el, mlsupport.el, modula2.el, mouse.el, mpuz.el, netunam.el, novice.el, nroff-mode.el, options.el, outline.el, page.el, paragraphs.el, picture.el, prolog.el, rect.el: Added or corrected Commentary sections. 1993-03-22 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * abbrev.el, ada.el, add-log.el, array.el, autoinsert.el, autoload.el, awk-mode.el, bib-mode.el, bibtex.el, buff-menu.el, bytecomp.el, c++-mode.el, c-mode.el, cl-indent.el, cmacexp.el, cmulisp.el, cmuscheme.el, comint.el, compare-w.el, compile.el, debug.el, diff.el, dired-aux.el, dired.el, disass.el, dissociate.el, doctor.el, ebuff-menu.el, edebug.el, ehelp.el, emacsbug.el, emerge.el, files.el, fill.el, fortran.el, gosmacs.el, hanoi.el, hexl.el, hideif.el, icon.el, indent.el, iso-insert.el, iso-swed.el, iso-syntax.el, iso8859-1.el, ispell.el, kermit.el, ledit.el, life.el, lisp-mode.el, lisp.el, lpr.el, macros.el, mail-utils.el, mailalias.el, makefile.el, makesum.el, mim-mode.el, modula2.el, nroff-mode.el, perl-mode.el, prolog.el, scheme.el, sgml-mode.el, tex-mode.el: Added or corrected Commentary sections. There's more of this coming; soon, the package finder will be able to browse Commentary sections, and I want almost all packages to have useful ones. 1993-03-21 Richard Stallman (rms@mole.gnu.ai.mit.edu) * help.el: Don't load help-screen at run time if compiled. * simple.el (line-number-mode): New function and variable. * loaddefs.el (default-mode-line-format-default): Use %l. 1993-03-21 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * time.el (display-time): Doc fix. * isearch.el (isearch-switch-frame-handler): Call handle-switch-frame instead of select-frame; it has been renamed. * simple.el (comment-indent-function): New variable, intended to replace comment-indent-hook. (comment-indent-hook): Make this default to nil now. (indent-for-comment): If comment-indent-hook is non-nil, call it for backward compatibility; otherwise, call comment-indent-function. * bytecomp.el: Declare comment-indent-hook an obsolete variable. 1993-03-20 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * time.el (display-time): Doc fix. * lucid.el: Alias lower-screen and raise-screen to lower-frame and raise-frame, the new names for those functions. 1993-03-19 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * bush.el: Deleted. * finder.el: Make sure that when new keywords are compiled, we see them immediately. 1993-03-19 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * tex-mode.el (tex-send-command): Fix the command sent so that no blank is inserted when replacing the asterisk with the file name. 1993-03-19 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * vt100-led.el, bg-mouse.el, sup-mouse.el, sun-mouse.el: moved to term directory. 1993-03-18 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * Makefile: created. This exists mainly so developers elsewhere can unlock the lisp files to accept an update tar, then relock them without locking the few that should stay writeable. * solar.el, ange-: Corrected Keywords header *: Nuked (actually, moved to =). ange- replaces this. 1993-03-18 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * solar.el (solar-time-string): Round the time properly. 1993-03-18 Eric S. Raymond (eric@geech.gnu.ai.mit.edu) * abbrev.el, abbrevlist.el, add-log.el, apropos.el, array.el, autoload.el, awk-mode.el, cal-french.el, cal-mayan.el, calendar.el, cmulisp.el, cmuscheme.el, comint.el, compile.el, completion.el, cust-print.el, dabbrev.el, debug.el, diary.el, diff.el, disass.el, edebug.el, edmacro.el, emacsbug.el, finder.el, inf-lisp.el, ispell.el, life.el, lisp.el, lunar.el, macros.el, netunam.el, old-shell.el, scribe.el, spell.el, sun-cursors.el, terminal.el, unrmail.el, vms-pmail.el: Add or correct Keywords headers for finder. 1993-03-18 Richard Stallman (rms@geech.gnu.ai.mit.edu) * frame.el (make-frame): Renamed from new-frame. (new-frame): Alias for make-frame. 1993-03-18 Richard Stallman (rms@wookumz.gnu.ai.mit.edu) * frame.el (make-frame): Renamed from new-frame. (new-frame): Alias for make-frame. 1993-03-18 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * tex-mode.el (tex-send-command): Fix the command sent so that no blank is inserted when replacing the asterisk with the file name. 1993-03-18 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * term/wyse50.el: (function-key-map) Nuke code no longer bound to keys. * term/tvi970.el: (function-key-map) As many key cookies as possible renamed to fit the new conventions documented in lisp/term/README. * term/vt100.el, term/news.el: (function-key-map) Fix things so that bindings are added to the keymap already created by terminal initialization. 1993-03-17 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * help-screen.el: Installed, following release. Now package writers can easily implement help screens resembling Emacs's own on-line help system. * help.el: help-for-help now uses make-help-screen from help-screen.el. 1993-03-17 Richard Stallman (rms@mole.gnu.ai.mit.edu) * finder-inf.el: Deleted the RCS file. 1993-03-17 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * isearch.el, lselect.el, select.el, scroll-bar.el, texinfo.el, pending-del.el, profile.el, texinfmt.el, ls-lisp.el, meese.el, isearch.el, tmenu.el, lmenu.el, rmailsum.el, unrmail.el, hippie.el, lmenu.el, rmailmsc.el, rlogin.el, mhspool.el, lisp-mode.el, novice.el, mouse.el, vms-pmail.el, vc-hooks.el, levents.el, iso8859-1.el, isearch.el, hippie.el, find-gc.el, cust-print.el, find-dired.el, etags.el, electric.el, dired.el, dired-aux.el, cust-print.el, cmuscheme.el, cmulisp.el, cl.el, case-table.el, byte-run.el, ange-, backquote.el: Added or corrected library header comments. 1993-03-17 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * finder.el (finder-compile-keywords): Treat nil in a path argument as $PWD. (finder-by-keyword): Handle LFD as input gracefully. 1993-03-17 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * vc-hooks.el: Increment version number to match vc.el's. * vc.el (vc-header-strings): Name changed to vc-header-alist, to match the docs. (vc-finish-logentry, vc-next-comment, vc-previous-comment, vc-comment-search-forward, vc-comment-search-backward) The VC comment ring is now a separate buffer from *VC-log*; editing of old comments is no longer destructive. 1993-03-16 Paul Eggert (eggert@twinsun.com) * vc.el (vc-version-diff): Use (message ...), not (message (format ...)). (vc-backend-checkout, vc-backend-assign-name): Correct bogus messages. * vc-hooks.el: Merge today's change by eric with everybody else's change (from 1992/08/04 through 1993/02/24). 1993-03-16 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * bytecomp.el (byte-compile-from-buffer): Put buffer containing compiled code in binary overwrite mode. * simple.el (quoted-insert): In overwrite mode, don't read digits'. 1993-03-16 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * vc.el, vc-hooks.el: the macro vc-error-occurred has to move from vc.el to vc-hooks.el for C-x C-f of a nonexistent file to work. 1993-03-16 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * calendar.el (calendar-time-zone): Initialize this when calendar.el loads, not in the defvar. 1993-03-15 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * register.el (view-register): Neglect not to avoid failing to properly display all the possible sorts of things one might find in a buffer. Make frame configurations start with a distinctive symbol. *. * indent.el (indent-region, indent-region-function): Doc fix. * indent.el (indent-line-function): Doc fix. 1993-03-14 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * sort.el (sort-float-fields, sort-numeric-fields): Use string-to-number, not string-to-float or string-to-int. * sort.el (sort-float-fields): Make this autoloaded. * sort.el (sort-numeric-fields): Doc fix. 1993-03-14 Richard Stallman (rms@mole.gnu.ai.mit.edu) * lselect.el, select.el: New files. * term/x-win.el: Require select.el. (x-select-text): Update call to x-set-cut-buffer. Put `PRIMARY' and `CLIPBOARD' in upper case. (x-cut-buffer-or-selection-value): Put `PRIMARY' in upper case. * lucid.el, lmenu.el, levents.el: New files. Much of lmenu.el comes from Lucid. 1993-03-13 Richard Stallman (rms@mole.gnu.ai.mit.edu) * rmailsum.el (rmail-summary-next-msg): Call display-buffer. (rmail-summary-previous-all, rmail-summary-next-all): Likewise. (rmail-summary-rmail-update): Do nothing if rmail buffer not visible. (rmail-summary-mode-map): Don't bind C-n, C-p. Use ordinary move cmds. 1993-03-12 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * term/x-win.el: Added library headers. 1993-03-12 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * loaddefs.el (global-map): Fixed a typo in the binding of [kp-backtab]. * term/x-win.el: Added library headers back in. Didn't touch any key bindings or code, and won't without making sure there won't be any repeat of the bad-patch brouhaha. 1993-03-11 Richard Stallman (rms@mole.gnu.ai.mit.edu) * term/x-win.el: Cancel previous change, since it discarded earlier necessary changes. 1993-03-11 Richard Stallman (rms@mole.gnu.ai.mit.edu) * term/x-win.el: Cancel previous change, since it discarded earlier necessary changes. 1993-03-11 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * term/vt100.el: Added headers, commented out code the duplicates startup effects. * term/x-win.el: Added headers, removed function bindings. * term/wyse50.el: Added headers, changed some keycap names. * term/tvi970.el: Added headers, changes some keycap names. * term/sun.el: Added headers, removed function-key bindings. * term/news.el: Added headers, changed a few cookie names. * term/keyswap.el: Initial revision 1993-03-11 Jim Blandy (jimb@mole.gnu.ai.mit.edu) * term/x-win.el: Disable suspending under X windows by setting suspend-hooks, not suspend-hook. The latter is an obsolete name. Use add-hook instead of setting suspend-hooks directly. 1993-03-11 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) A boatload of changes to terminal support and terminal capability initialization that make it a lot smarter, with a more uniform and featureful interface across many different keyboard types. * term.c (fkey_table): has been expanded to handle the entire intersection of the capability sets defined by X keysyms and terminfo. That is, every keysym for which there is a natural equivalent in terminfo is now bound to that by the startup code. * loaddefs.el (global-map): Natural default keybindings set up for almost all supported keysyms other than function keys. All other keysyms are now default-bound to a function which explains that the key is not bound to anything, then raises an error. * term/README: terminal package conventions and standard keysym cookies are now documented here. * term/AT386.el: new package installed. Handles IBM-AT style console keyboards with style and flair. * term/new-at386.el: removed, it was obsolescent. * term/apollo.el: nuked and linked to vt100.el. All it formerly did was load vt100.el. * term/bobcat.el: copied and linked to `keyswap.el'. * term/keyswap.el: the old bobcat.el with headers and docs. This is available for other terminal packages to call. * term/news.el: cleaned up, headers added. * term/sun.el: headers added, [again] changed to [redo]. This package is a hairball and should probably be scrapped if we can find or built abetter one. * term/tvi970.el: headers added, [enter] changed to [kp-enter]. * term/vt100.el: headers added, cleanup, explicit function-key enable is no longer necessary. * term/vt200.el: nuked. It's now a link to vt100.el. This is possible because all the things handled differently on the vt200 are mined out of termcap by 19's initialization before either package is loaded. * term/wyse50.el: cleaned up, headers added, various cookie names changed, function bindings removed. * term/x-win.el: cleaned up, headers added. Some bindings of keycap cookies to functions were removed; all that stuff is handled terminal-independently in loaddefs now. Other changes: * help.el: added binding and menu line for new `P' package-finder command. Won't actually take effect till the next Emacs build. * vc.el (vc-backend-checkin): Fixed bizarre POM-dependent bug introduced into VC by a bad patch. This was one for the books....badly corrupted vc-checkin code somehow mostly functioned for three days. The Code That Would Not Die... 1993-03-11 Richard Stallman (rms@mole.gnu.ai.mit.edu) * startup.el (command-line-1): Fix copyright year. 1993-03-10 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * diary-insert.el (insert-anniversary-diary-entry, insert-block-diary-entry): Fix calendar-date-display-form used. 1993-03-10 Jim Blandy (jimb@totoro.cs.oberlin.edu) * files.el (basic-save-buffer): If file-precious-flag is set, and we write the buffer to a temp file and then rename it, don't neglect to set the new file's modes properly. 1993-03-10 Richard Stallman (rms@mole.gnu.ai.mit.edu) * term/x-win.el (function-key-map): Map key symbols backspace, return... into ASCII chars. Likewise their Meta versions. Also add `ascii-character' properties. 1993-03-09 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * term/at386.el: Removed. The new terminal initialization stuff makes it superfluous. I wrote it, so I should know. :-) * vc.el: Installed version 5, the new baseline. This version merges my changes with Paul Eggert's. 1993-03-09 Richard Stallman (rms@mole.gnu.ai.mit.edu) * timer.el (run-at-time): Allow an integer as TIME. (cancel-timer): New function. * c-mode.el (c-beginning-of-statement): If next to a comment, use sentence motion. * map-ynp.el (map-y-or-n-p): Use query-replace-map. * replace.el (query-replace-map): New keymap. (perform-replace): Use query-replace-map. (query-replace, query-replace-regexp, map-query-replace-regexp): (replace-string, replace-regexp): Don't print `done' if unread chars. * help.el (command-apropos): Print echo area message iff found symbols. * rmailsum.el (rmail-update-summary): New function. (rmail-new-summary): New arg redo-form. Considerable rewrite of how and when buffers are selected. (rmail-summary-mode): New local vars rmail-summary-redo, revert-buffer-function, post-command-hook, rmail-current-message. (rmail-summary-expunge): Use rmail-update-summary. (rmail-summary-get-new-mail): Likewise. (rmail-summary-expunge-and-save): Likewise. (rmail-summary-input): Don't update summary at all. (rmail-summary-reply): Do the work inside save-window-excursion, then switch to the mail buffer. (rmail-summary-retry-failure): Likewise. (rmail-summary-edit-current-message): Delete spurious autoload. (rmail-summary-summary): Function deleted. Use plain rmail-summary on h and C-M-h. (rmail-summary-rmail-update): New function. * rmail.el (rmail-delete-forward): Go to summary buf to change D mark. Always do the motion in the rmail buffer; let that handle summary. (rmail-undelete-previous-message): Likewise. (rmail-select-summary): New macro. (rmail-show-message): Use rmail-select-summary. (rmail-get-new-mail): Likewise. (rmail-expunge): Likewise. * pending-del.el: New file. 1993-03-08 Richard Stallman (rms@mole.gnu.ai.mit.edu) * subr.el (posn-timestamp, posn-col-row, posn-point, posn-window): (event-end, event-start, mouse-movement-p): Moved from mouse.el. * mouse.el: Functions moved to subr.el. 1993-03-07 Richard Stallman (rms@mole.gnu.ai.mit.edu) * subr.el (event-basic-type): New function. * isearch.el: Renamed from isearch-mode.el. * isearch-mode.el (isearch-other-meta-char): Call listify-key-sequence. (isearch-unread): Don't call it here. (isearch-mode-map): Bind the ASCII-equivalent function keys. 1993-03-07 Paul Eggert (eggert@twinsun.com) * vc.el (vc-update-change-log): Check that ChangeLog is writable before starting the expensive rcs2log process. Use call-process instead of shell-command to invoke rcs2log; this avoids undesired shell escapes and is more robust about errors. Put mark at point-min, so that the new insertion is in the region. (vc-checkin-hook): Fix `runs-hooks' typo. (vc-checkout-writeable-buffer-hook): New var. (vc-next-action): Fix bug: initial checkin was botched when C-x v v was applied to a new file while vc-initial-comment was non-nil. (vc-register): Don't barf when registering a new, empty buffer. (vc-directory): The `No files are currently registered' message was wrongly worded, because sometimes the message talks about locked files, not registered files. (vc-file-tree-walk): Change (apply 'funcall ...) to (apply ...), since the 'funcall is redundant. When traversing a directory tree, message "Traversing directory XXX" so that the user can see what progress is being made. Traversal can take a long time. Omit first argument, since it is always the current directory. All callers changed. (vc-file-tree-walk-internal): New function. (vc-do-command, vc-diff, vc-version-diff, vc-backend-diff): Remove redundant calls to `format'. (vc-diff): Remove unused variable `old'. (vc-version-diff): When recursively generating a difference listing, don't append the latest output unless diff was actually run; otherwise, you'll get the output from the previous file by mistake. 1993-03-07 Richard Stallman (rms@mole.gnu.ai.mit.edu) * term/x-win.el (function-key-map): Map key symbols backspace, return... into ASCII chars. 1993-03-07 Richard Stallman (rms@mole.gnu.ai.mit.edu) * isearch-mode.el (isearch-mode): Don't make a pre-command-hook. * vc.el (vc-revert-buffer1): Use mark-marker; don't alter mark-active. * subr.el (event-modifiers): New function. (eventp): New function. 1993-03-06 Richard Stallman (rms@mole.gnu.ai.mit.edu) * isearch-mode.el (isearch-unread): Find last list element by hand. * info.el (Info-forward-node): Properly go to first menu item. (Info-insert-dir): Bind temp wider, around use. * term/x-win.el (function-key-map): Map key symbols backspace, return... into ASCII chars. Likewise their Meta versions. Also add `ascii-character' properties. * simple.el (set-mark): Activate the mark. (mark): Handle region-active. New optional arg FORCE. (exchange-point-and-mark, push_mark): Pass FORCE. (set-mark-command): Likewise. * terminal.el (te-escape-extended-command-unread): Handle any key seq. * emerge.el (emerge-show-file-name): Handle any kind of event. * fortran.el (fortran-abbrev-start): Handle any kind of event. (fortran-window-create-momentarily): Likewise. * ehelp.el (electric-help-command-loop): Handle any kind of event. * ebuff-menu.el (electric-buffer-list): Handle any kind of event. (Electric-buffer-menu-exit): Handle any key sequence. * info.el (Info-summary): Handle any event when flushing the display. * simula.el (simula-electric-label): Handle any event when flushing the display. * subr.el (momentary-string-display): Handle any event when flushing the display. * comint.el (comint-dynamic-list-completions): Handle any event when flushing the display. * subr.el (listify-key-sequence): New function. * simple.el (prefix-arg-internal): Use listify-key-sequence. * isearch-mode.el (isearch-unread): Handle multiple args. For Emacs 19, use listify-key-sequence. If not Emacs 19, assume they are a meta sequence. (isearch-other-meta-char): Pass the whole key sequence. (isearch-other-control-char): Make this alias for ...-meta-char. * rmail.el (rmail-bury): Record Rmail buffer to bury it later. 1993-03-05 Richard Stallman (rms@mole.gnu.ai.mit.edu) * disp-table.el: Add autoload comments. (rope-to-vector): Deleted. (describe-display-table): Don't use rope-to-vector. * compare-w.el (compare-windows): Use compare-buffer-substrings. 1993-03-05 Jim Blandy (jimb@totoro.cs.oberlin.edu) * term/x-win.el: Disable suspending under X windows by setting suspend-hooks, not suspend-hook. The latter is an obsolete name. Use add-hook instead of setting suspend-hooks directly. * bytecomp.el: Declare suspend-hook to be an obsolete variable. 1993-03-05 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * calendar.el (hebrew-calendar-yahrzeit): Change reference to nonexistent function last-month-of-hebrew-year to the correct function hebrew-calendar-last-month-of-year. * cal-mayan.el (calendar-mayan-haab-on-or-before, calendar-mayan-tzolkin-on-or-before): Change `mod' to `%'. * cal-mayan.el (calendar-next-tzolkin-date): Delete bogus second defun. 1993-03-04 Jim Blandy (jimb@totoro.cs.oberlin.edu) * simple.el (kill-ring-save): Doc fix. * sun-mouse.el (suspend-emacstool): Run suspend-hooks, not suspend-hook. * resume.el: Doc fix. * simple.el (yank, yank-pop): Always return nil; don't rely on exchange-point-and-mark to return nil. * fill.el (justify-current-line): Return nil, to be sure to conform with documentation. 1993-03-03 Richard Stallman (rms@mole.gnu.ai.mit.edu) * files.el (write-file): Handle directory name as arg. * rmail.el: Major changes from Bob Weiner <weiner@pts.mot.com> Handle some Emacs 18 function names to run in 18. This is to facilitate working with Weiner. (rmail-reply-prefix): New variable. (rmail-reply): Use that variable to add to subject. (rmail-retry-failure): Change binding to M-m. (rmail-forward): Look for >From as well as for From. Handle case where neither is found. (rmail-last-regexp): New variable. (rmail-mode): Make rmail-last-regexp local. (rmail): Don't update rmail-mode data for old buffer if it's not in rmail mode. Error if in Rmail Edit mode. (rmail-bury): New command, plus key binding. (rmail-summary-by-topic): New key binding. (rmail-insert-inbox-text): Check for pop case earlier. (rmail-convert-to-babyl-format): Handle Content-Length field. (rmail-maybe-display-summary): New function. (rmail-redisplay-summary): New user option. (rmail-undelete-previous-message, rmail-delete-forward): (rmail-get-new-mail, rmail-show-message): Update summary buffer if any. Call rmail-maybe-display-summary to put it back on screen. (rmail-only-expunge): Renamed from rmail-expunge. (rmail-expunge): New function. (rmail-message-recipients-p, rmail-message-regexp-p): New functions. (rmail-summary-exists, rmail-summary-displayed): New functions. 1993-03-02 Richard Stallman (rms@mole.gnu.ai.mit.edu) * cl.el (defsetf): Use eval-and-compile for self-update-fn. * add-log.el (add-change-log-entry): Never move past second hdr line. 1993-03-02 Jim Blandy (jimb@mole.gnu.ai.mit.edu) * term/x-win.el (x-switch-definitions): Use the proper names for the scroll bar parameters. Use the term `scroll bar', instead of `scrollbar'. * term/x-win.el, frame.el, mouse.el: Terminology changed. * scrollbar.el: Renamed to scroll-bar.el. * term/x-win.el: Require `scroll-bar', not `scrollbar'. 1993-03-02 Jim Blandy (jimb@totoro.cs.oberlin.edu) * frame.el (new-frame): Doc fix. * info.el (Info-directory-list): Doc fix; it is set according to INFOPATH, not INFODIR. * info.el (Info-find-node): Don't try to set the info buffer's directory according to Info-directory; that variable doesn't exist any more. Instead, let Info-insert-dir set the current directory. (Info-insert-dir): Properly check for upper- and lower-case forms of "dir", with and without ".info" extension. Set the buffer's default-directory to the directory containing the first dir file we find, and cache it in Info-dir-contents-directory. (Info-dir-contents-directory): New variable, to cache the directory we decided to use as the merged directory's default-directory. * term/x-win.el (x-switch-definitions): Use the proper names for the scroll bar parameters. 1993-03-01 Richard Stallman (rms@mole.gnu.ai.mit.edu) * frame.el: Doc fixes. (set-pointer-color): Renamed to set-mouse-color. (set-border-color): New function. * info.el (Info-insert-dir): Make menu items in Top node pointing each of the other nodes. * rmail.el (rmail-get-new-mail): Reset read-only after find-file. 1993-03-01 Jim Blandy (jimb@totoro.cs.oberlin.edu) * simple.el (kill-region): If the buffer is read-only, call `barf-if-buffer-read-only' instead of just `ding', to get the appropriate error condition and message. * hexl.el (hexl-mode-map): When initializing, remember that the argument to key-binding is a key sequence, not a single key. * mouse.el (mouse-split-window-vertically): If the user clicks too close to the top or bottom of a window, split at the closest reasonable line. Give a helpful error message if the window is too small to be split anywhere. (mouse-split-window-horizontally): Similar changes. 1993-02-28 Jim Blandy (jimb@totoro.cs.oberlin.edu) * simple.el (insert-buffer): Make sure this returns nil. * simple.el (quoted-insert): Use insert-char, instead of writing out the loop. * etags.el (find-tag-other-window): If another window is already displaying the tag's buffer, explicitly set that window's point to the tag's position. Use the term `scroll bar', instead of `scrollbar'. * term/x-win.el, frame.el, mouse.el: Terminology changed. * scrollbar.el: Renamed to scroll-bar.el. 1993-02-26 Richard Stallman (rms@mole.gnu.ai.mit.edu) * frame.el (auto-raise-mode): Renamed from toggle-auto-raise. (auto-lower-mode): Renamed from toggle-auto-lower. 1993-02-26 Jim Blandy (jimb@totoro.cs.oberlin.edu) * timer.el (run-at-time): Doc fix. * autoload.el (generate-file-autoloads): Add another save-excursion so that point is before the generated autoloads after we scan the file. 1993-02-25 Richard Stallman (rms@mole.gnu.ai.mit.edu) * add-log.el (add-change-log-entry): Find end of first paragraph from after the header line. * subr.el (walk-windows): Doc fix. * register.el (point-to-register): Make arg ARG optional. (window-configuration-to-register): Likewise. (frame-configuration-to-register): Likewise. 1993-02-24 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * term/x-win.el (scroll-bar-mode, scroll-bar-mode): Move these functions to scrolbar.el. * scrollbar.el (scroll-bar-mode, scroll-bar-mode): Here they are. Make scroll-bar-mode set the {vertical,horizontal}-scrollbars parameters in default-frame-alist, and modify all extant screens using the correct parameter names. 1993-02-24 Richard Stallman (rms@mole.gnu.ai.mit.edu) * vc-hooks.el (vc-find-file-hook): Discard vc status of file if we will actually have to create the buffer. 1993-02-22 Jim Blandy (jimb@totoro.cs.oberlin.edu) * gud.el (gud-break): With a prefix argument, set a temporary breakpoint. (gud-apply-from-source): New argument ARGS, to pass to FUNC. Now it's really like `apply'. (gud-set-break): Add another argument to this method. Document it in the section describing how the methods are supposed to be used. (gud-gdb-set-break): New argument TEMP; if non-nil, set a temporary breakpoint. (gud-sdb-set-break, gud-dbx-set-break): New argument TEMP. Ignore it, since I don't know how to set a temporary breakpoint in these debuggers. * subr.el (string-to-int): Make this an alias for string-to-number. 1993-02-21 Jim Blandy (jimb@totoro.cs.oberlin.edu) * two-column.el: Add autoloads for the functions defined in tc-mode-map. 1993-02-21 Richard Stallman (rms@wookumz.gnu.ai.mit.edu) * info.el (Info-insert-dir): New function. (Info-find-node): Use Info-insert-dir to visit dir file. * mlsupport.el (esc-map, ctl-x-map): Define as functions. 1993-02-20 Richard Stallman (rms@wookumz.gnu.ai.mit.edu) * apropos.el (super-apropos-check-doc-file): Look for DOC file in proper directory. * files.el (insert-directory): Doc fix. 1993-02-19 Richard Stallman (rms@mole.gnu.ai.mit.edu) * help.el (describe-function): Print the arglist if the function is bytecode or a list. 1993-02-17 Jim Blandy (jimb@totoro.cs.oberlin.edu) *. 1993-02-17 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * autoload.el (generate-file-autoloads): If no buffer was visiting FILE when we started, kill the buffer we create. 1993-02-17 Richard Stallman (rms@mole.gnu.ai.mit.edu) * isearch-mode.el (isearch-backward-regexp): New arg no-recursive-edit, always non-nil for interactive call. Rename first arg, and set it right in interactive call. (isearch-forward-regexp): Likewise. (isearch-forward, isearch-backward): Likewise no-recursive-edit. 1993-02-16 Richard Stallman (rms@mole.gnu.ai.mit.edu) * frame.el (frame-initialize): Fix error syntax. (toggle-horizontal-scroll-bar): Likewise. (toggle-horizontal-scroll-bar): Renamed from set-horizontal-bar (toggle-vertical-scroll-bar): Likewise. (toggle-auto-lower, toggle-auto-raise): Likewise. (set-foreground-color, set-background-color): Renamed from set-frame-{fore,back}ground. 1993-02-15 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * informat.el (Info-tagify): Change the regular expression which recognizes node names to work properly with Emacs 19's regexp semantics. 1993-02-15 Richard Stallman (rms@mole.gnu.ai.mit.edu) * files.el (find-file-hooks): Delete permanent-local property. (find-file-not-found-hooks): Likewise. * bytecomp.el (byte-compile-lambda): Test of byte-compile-compatibility was backwards. 1993-02-12 Jim Blandy (jimb@totoro.cs.oberlin.edu) * gosmacs.el: Bind M-h to delete-previous-word, not backward-kill-word; the latter has different prefix semantics. * frame.el: Clean up initialization code. (initial-frame-alist): Doc fix. (minibuffer-frame-alist): New default value, with a reasonable height. (filtered-frame-list, minibuffer-frame-list): New functions. (frame-initialize): Use minibuffer-frame-list, instead of writing it out. (frame-notice-user-settings): Thoroughly rearranged. Notice changes to default-frame-alist as well as initial-frame-alist. Properly handle requests to make the initial frame into a minibufferless or minibuffer-only frame. Create a minibuffer-only frame if the initial frame should lack a minibuffer and there are no other minibuffer frames created by the user's initialization file. Fix any frames using the initial frame as a surrogate minibuffer frame. Restore the current buffer after creating and deleting all these frames. * frame.el (set-default-font, set-frame-background, set-frame-foreground, set-cursor-color, set-pointer-color, set-auto-raise, set-auto-lower, set-vertical-bar, set-horizontal-bar): Give these docstrings. (set-auto-raise, set-auto-lower, set-vertical-bar, set-horizontal-bar): Make these toggle or look at the prefix argument, like minor modes. * frame.el (set-vertical-bar): Use the proper parameter symbol. (set-horizontal-bar): Signal an error indicating that horizontal scrollbars are not implemented. * lisp-mode.el (lisp-fill-paragraph): New function. (shared-lisp-mode-map): Bind M-q to lisp-fill-paragraph. 1993-02-11 Richard Stallman (rms@mole.gnu.ai.mit.edu) * flow-ctrl.el (enable-flow-control...): Renamed from evade... (enable-flow-control): Add autoload. 1993-02-10 Richard Stallman (rms@mole.gnu.ai.mit.edu) * gosmacs.el (set-gosmacs-bindings): Fix binding of \eh. 1993-02-10 Jim Blandy (jimb@totoro.cs.oberlin.edu) * gosmacs.el: Require 'mlsupport, to get definition of backward-kill-word. 1993-02-10 Stephen A. Wood (saw@cebaf.gov) * fortran.el (fortran-prepare-abbrev-list-buffer): Put quote in front of first argument to `insert-abbrev-table-description'. * fortran.el (fortran-is-in-string-p): Fixed incorrect behaviour when in first statement of a buffer. 1993-02-08 Roland McGrath (roland@geech.gnu.ai.mit.edu) * add-log.el (add-change-log-entry): Undo Jan 25 change. It worked for buffers in indented-text-mode, but lost for change-log-mode, which is what matters. 1993-02-08 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * compile.el (compilation-forget-errors): Just set compilation-directory-stack to nil; no need to loop through it. (next-error): For a non-numeric prefix arg, pass nil for compile-reinitialize-errors's FIND-AT-LEAST arg. (next-error): When getting marker for error source location, be sure to examine buffer local value of compilation-old-error-list before switching to source file buffer. 1993-02-08 Jim Blandy (jimb@totoro.cs.oberlin.edu) * rmailout.el (rmail-output, rmail-output-to-mail-file): Reverse the order of the arguments and make COUNT optional, for backward compatibility's sake. * cl.el (cl-version): Mark as no longer in beta test. 1993-02-07 Jim Blandy (jimb@totoro.cs.oberlin.edu) * subr.el (mod): Add back this alias for %. 1993-02-07 Richard Stallman (rms@mole.gnu.ai.mit.edu) * sort.el (sort-build-lists): Record the key as pair of positions; don't copy string from buffer. (sort-subr): Use compare-buffer-substrings. 1993-02-06 Richard Stallman (rms@mole.gnu.ai.mit.edu) * sendmail.el (mail-setup): Use fill-region-as-paragraph for To field; handle the CC just like the To. * rmailsum.el: Big rewrite from weiner@pts.mot.com. 1993-02-05 Roland McGrath (roland@geech.gnu.ai.mit.edu) * comint.el (make-comint): Added docstring. 1993-02-05 Roland McGrath (roland@geech.gnu.ai.mit.edu) * simple.el: Restore nuked information in minibuffer history bindings. Use intelligent method of disabling completion-oriented bindings. 1993-02-04 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el: Once again, go back to ordinary next-history-element for M-n in minibuf, even for completion. 1993-02-02 Richard Stallman (rms@mole.gnu.ai.mit.edu) * sort.el (sort-subr): Doc fixes. * sendmail.el (mail-do-fcc): Allow dash in timezone name. 1993-02-01 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * texinfo.el (texinfo-mode): Make page-delimiter buffer-local, and set it according to texinfo-chapter-level-regexp. * simple.el (kill-region): If the buffer is read-only, do beep, but also put the region in the kill ring. Doc fix. 1993-01-31 Roland McGrath (roland@geech.gnu.ai.mit.edu) * mailabbrev.el (mail-abbrev-end-of-buffer): Changed interactive spec from "P" to "p". 1993-01-29 Richard Stallman (rms@mole.gnu.ai.mit.edu) * cmacexp.el (c-macro-expand): Use expanded name to write or delete. Send two eofs. 1993-01-28 Roland McGrath (roland@wookumz.gnu.ai.mit.edu) * simple.el (next-complete-history-element): Restore point after replacing the buffer text with the appropriate history element. 1993-01-28 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el: Don't use the completion-oriented history commands. * paths.el (sendmail-program): Try /usr/ucblib/sendmail. 1993-01-26 Jim Blandy (jimb@mole.gnu.ai.mit.edu) * term/x-win.el:. * term/x-win.el: Doc fix. 1993-01-25 Jim Blandy (jimb@totoro.cs.oberlin.edu) * frame.el (frame-notice-user-settings): Use new name frame-live-p, instead of live-frame-p.. * disass.el (disassemble): Add autoload cookie for this. * bytecomp.el (byte-decompile-bytecode): Add an autoload for this. compiled-function-p has been renamed to byte-code-function-p. * subr.el: Define compiled-function-p as an alias for it. * bytecomp.el: Register compiled-function-p as obsolete. * bytecomp.el, byte-opt.el, disass.el, help.el, map-ynp.el: Change uses. * subr.el (numberp): Remove fset which made this an alias for integerp; now numberp also recognizes floats. 1993-01-25 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * etags.el (tags-query-replace): C-t. * add-log.el (add-change-log-entry): Restrict PARAGRAPH-END to being on the first page. * simple.el (next-complete-history-element): Use only buffer contents before point to match history elements. 1993-01-25 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * simple.el ({next,previous}-complete-history-element): New functions. Bind them to M-n/M-p and next/prior in minibuffer completion maps. 1993-01-24 Jim Blandy (jimb@totoro.cs.oberlin.edu) unread-command-event has been replaced by unread-command-events. * simple.el (prefix-arg-internal): Use this to push back all key sequences for processing by the main command loop, instead of trying to simulate its behavior ourselves. * bytecomp.el: Document unread-command-event as an obsolete variable, although nothing but the GNU Emacs 19 sources use it. Adjust obsolescence message for unread-command-char. * comint.el (comint-dynamic-list-completions): Change uses of unread-command-event to work with unread-command-events. * ebuff-menu.el (electric-buffer-list, Electric-buffer-menu-exit): Same. * edebug.el (edebug-outside-excursion):. * simula.el (simula-electric-label): Same. * subr.el (read-quoted-char, momentary-string-display): Same. * sun-mouse.el (mouse-second-hit): Same. * terminal.el (te-escape-extended-command-unread): Same. * vip.el (vip-escape-to-emacs, vip-prefix-arg-value, vip-prefix-arg-com): Same. * simple.el (quoted-insert): Doc fix. 1993-01-23 Jim Blandy (jimb@totoro.cs.oberlin.edu) * mouse.el (mouse-save-then-kill): Instead of deleting the text whenever the text of the region happens to be the same as the front of the kill-ring, delete it only when the front of the kill ring is identical to the last text we put there, and point and the mouse click are at the same position. * mouse.el (mouse-save-then-kill): If the undo list is disabled, don't build an undo record. * mouse.el (mouse-save-then-kill): If we're deleting the text, kill from point to the mouse click, not from point to mark; mark and the mouse click may not be the same. If they're not, this screws up the undo record we create, corrupting the undo list pretty nastily. 1993-01-22 Jim Blandy (jimb@totoro.cs.oberlin.edu) * term/x-win.el: Doc fix. * mouse.el (mouse-set-font): Account for the fact that x-popup-menu returns nil if no selection is made. * mouse.el (mouse-buffer-menu, mouse-set-font): Bind these to the down-going events. (mouse-split-window-vertically): Move the binding for this down out of the commented-out scrollbar section, so it is on S-mouse-2 on the mode line. 1993-01-21 Jim Blandy (jimb@totoro.cs.oberlin.edu) * c-mode.el (c-fill-paragraph): Fix the regular expressions used for finding paragraph beginnings and endings so that they think lines containing only whitespace and asterisks are paragraph separators/starters. * add-log.el (add-change-log-entry): If we've just started a new date, limit the searches to within the current date, not the first paragraph; the latter extends into the previous date. 1993-01-21 Roland McGrath (roland@geech.gnu.ai.mit.edu) * etags.el (tags-loop-scan): Set default value to an error form. * etags.el (visit-tags-table-buffer): When propagating a change of name after file-find-noselect, refer to tags-file-name, not the undefined var FILE. 1993-01-20 Jim Blandy (jimb@totoro.cs.oberlin.edu) * c-mode.el (c-fill-paragraph): When modifying the paragraph-separate regexp, don't let it match paragraph starts. 1993-01-19 Roland McGrath (roland@geech.gnu.ai.mit.edu) * etags.el (visit-tags-table-buffer): Error if called with 'same and no current table. 1993-01-19 Jim Blandy (jimb@totoro.cs.oberlin.edu) * mouse.el (event-end): Work on click events, too. (mouse-split-window-vertically): Use event-end and posn-col-row, instead of mouse-coords, which is obsolete. * mouse.el: Comment out the scrollbar commands until we make them work. * mouse.el: Comment out jla's experimental things. What are these doing in the distribution source anyway? * mouse.el: Bind the help menu to C-down-mouse-2, instead of C-mouse-2; this way, you can use the mouse-up event to make the menu selection. (help-apropos-map, help-keys-map, help-manual-map, help-misc-map, help-modes-map, help-admin-map): Give the menu names for these keymaps using make-sparse-keymap's optional argument, rather than constructing them by hand. * scrollbar.el: (require 'mouse) (scrollbar-set-window-start, scrollbar-scroll-down, scrollbar-scroll-up): Use event-end, from mouse.el. 1993-01-19 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * x-mouse.el: Deleted; it was the interface to the Emacs 18-style mouse interface, which doesn't exist anymore. 1993-01-15 Jim Blandy (jimb@totoro.cs.oberlin.edu) * c-mode.el (c-switch-label-regexp): New constant. (electric-c-terminator, c-indent-line, indent-c-exp): Use it to correctly recognize default labels in switch statements. 1993-01-15 Richard Stallman (rms@mole.gnu.ai.mit.edu) * shell.el (shell): Doc fix. 1993-01-14 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * files.el (switch-to-buffer-other-frame): Pass t to pop-to-buffer. 1993-01-14 Jim Blandy (jimb@totoro.cs.oberlin.edu) * scrollbar.el: New file. * term/x-win.el: Require 'scrollbar. 1993-01-13 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * solar.el (solar-time-string): Round the time properly. 1993-01-12 Richard Stallman (rms@mole.gnu.ai.mit.edu) * mouse.el (mouse-save-then-kill): When deleting, avoid delay and don't set the mark. Replace obsolete fn event-point. (mouse-kill): Replace obsolete fn event-point. 1993-01-11 Jim Blandy (jimb@totoro.cs.oberlin.edu) * page-ext.el (next-page): Correctly handle negative page count. 1993-01-11 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el (kill-append): Doc fix. 1993-01-09 Jim Blandy (jimb@totoro.cs.oberlin.edu) * frame.el (frame-notice-user-settings): Don't try to delete the initial frame if the user took care of that. 1993-01-09 Richard Stallman (rms@mole.gnu.ai.mit.edu) * rmail.el (mail-unsent-separator): Add `-- begin message --'. * dired.el (dired-regexp-history): New history list. (dired-read-regexp): Use that history list. Take just one arg. * dired-aux.el (dired-mark-read-regexp): Give dired-read-regexp 1 arg. 1993-01-08 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * upd-copyr.el (update-copyright): Doc fix. 1993-01-08 Richard Stallman (rms@mole.gnu.ai.mit.edu) * add-log.el (add-change-log-entry): Search for existing ChangeLog in parent dir and its parents. 1993-01-08 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * timer.el (run-at-time): Use a pipe to talk to the timer process. 1993-01-07 Jim Blandy (jimb@totoro.cs.oberlin.edu) * simple.el (set-goal-column): Make this disabled by default. 1993-01-07 Richard Stallman (rms@mole.gnu.ai.mit.edu) * sendmail.el (mail-send): Don't clear modified or delete autosave if visiting a file. 1993-01-05 Richard Stallman (rms@mole.gnu.ai.mit.edu) * hippie.el: New file. 1993-01-04 Richard Stallman (rms@mole.gnu.ai.mit.edu) * apropos.el (apropos-match-keys): Handle non-chars as keys. 1993-01-02 Richard Stallman (rms@mole.gnu.ai.mit.edu) * compile.el (compilation-sentinel): Change buffer-read-only with let. 1992-12-29 Richard Stallman (rms@mole.gnu.ai.mit.edu) * mouse.el (mouse-buffer-menu): Select the window clicked on. 1992-12-28 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * add-log.el (add-change-log-entry): Notice when ENTRY is equal to FILE-NAME, not the hard-wired string "ChangeLog". Added missing regexp-quote's in same-day entry search. Search only in the first paragraph for a similar entry to add to. 1992-12-26 Richard Stallman (rms@mole.gnu.ai.mit.edu) * files.el (abbreviated-home-dir): New variable. (abbreviate-file-name): Properly convert abbreviated homedir to ~. 1992-12-24 Roland McGrath (roland@albert.gnu.ai.mit.edu) * etags.el (visit-tags-table-buffer): When picking a table and using tags-table-list, skip over nonexistent files in the list. * etags.el (etags-verify-tags-table): Use eq instead of = in case char-after returns nil. 1992-12-21 Roland McGrath (roland@geech.gnu.ai.mit.edu) * etags.el (visit-tags-table-buffer): Don't look in list for tags-file-name if nil. * etags.el: Many comments added and docstrings fixed. (tags-table-list): Elt of nil is not special. (tags-expand-table-name): Value of nil is not special. (tags-next-table): Removed arg RESET; no caller used it. (visit-tags-table-buffer): Don't need to do tags-expand-table-name in or form. When table is invalid, only set tags-file-name to nil globally if its global value contained the losing table file name. (find-tag-tag): Return a string, not a list. (find-tag-noselect, find-tag, find-tag-other-window, find-tag-other-frame): Changed callers. (etags-recognize-tags-table): Call etags-verify-tags-table, rather than duplicating its functionality. (visit-tags-table-buffer): When CONT is 'same, set it to nil after the cond. We want the normal list frobbing to take place in this case. (find-tag-other-window): Save and restore window-point around call to find-tag-noselect. 1992-12-21 Roland McGrath (roland@geech.gnu.ai.mit.edu) * subr.el (ignore): Use defun instead of fset to define; the byte compiler is smart enough now not to compile this trivial function into slow byte code. 1992-12-21 Jim Blandy (jimb@totoro.cs.oberlin.edu) * c-mode.el (c-fill-paragraph): Calculating the proper fill-prefix shouldn't change the buffer text. Make it not. If we're in the blank space before another comment, fill that one as a comment, not as normal text. 1992-12-20 Jim Blandy (jimb@totoro.cs.oberlin.edu) * simple.el (kill-region): Change interactive spec to signal an error if the buffer is read-only, and remove the code to do a copy-region-as-kill if the buffer is read-only. 1992-12-19 Richard Stallman (rms@mole.gnu.ai.mit.edu) * loadup.el: Display load-path at start. 1992-12-19 Jim Blandy (jimb@totoro.cs.oberlin.edu) * sendmail.el (mail-position-on-field): `end' is guaranteed to be at the beginning of the header separator; don't skip back to the end of the previous line. * loadup.el: Dump under the name `emacs', not `xemacs'. * compile.el (compilation-error-regexp-alist): Tightened up BSD/GNU regexp to insist that line number end with a colon or close-paren. 1992-12-17 Jim Blandy (jimb@totoro.cs.oberlin.edu) * rmail.el (rmail-unix-mail-delimiter): Not all time zone names end with "T". Accept any sequence of three or four alphabetic characters. * simple.el (set-mark-command): Clarify doc string. * simple.el (prefix-arg-internal): Don't apply string-to-char to get the first element of the key sequence - it might be a vector. 1992-12-15 Jim Blandy (jimb@totoro.cs.oberlin.edu) * c-mode.el (c-fill-paragraph): When guessing the fill prefix, don't ever grab any actual text. 1992-12-14 Jim Blandy (jimb@totoro.cs.oberlin.edu) * compile.el (compilation-error-regexp-alist): Add regexp for the MIPS CC distributed with Ultrix. 1992-12-12 Jim Blandy (jimb@totoro.cs.oberlin.edu) * paths.el (Info-default-directory-list): The info files are supposed to be in /usr/local/info these days. Add it to the list of directories to search. 1992-12-11 Jim Blandy (jimb@totoro.cs.oberlin.edu) * vc.el (vc-do-command): Set the default directory of the *vc* buffer to the directory containing FILE. 1992-12-09 Roland McGrath (roland@wookumz.gnu.ai.mit.edu) * info.el (Info-{first,second,third,fourth,fifth}-menu-item): Removed. (Info-nth-menu-item): New function; bound to 1..9. 1992-12-08 Jim Blandy (jimb@totoro.cs.oberlin.edu). * ange- (ange-ftp-unhandled-file-name-directory): New function. Set ange-ftp's `unhandled-file-name-property' to its name. 1992-12-07 Jim Blandy (jimb@totoro.cs.oberlin.edu) * lpr.el (lpr-switches, lpr-command): Make these defvars, not defconsts. 1992-12-04 Jim Blandy (jimb@totoro.cs.oberlin.edu) * c-mode.el (c-fill-paragraph): When trying to make sure that the comment ender isn't on its own line, don't signal an error if there is no comment ender. 1992-12-03 Jim Blandy (jimb@totoro.cs.oberlin.edu) * sendmail.el (mail-self-blind, mail-interactive, mail-yank-ignored-headers): Make these defvars, not defconsts. Otherwise, they wipe out the user's customizations when we autoload sendmail.el. 1992-12-01 Jim Blandy (jimb@totoro.cs.oberlin.edu) * hanoi.el (hanoi): If pole-spacing is odd, round down, not up. To see if the window is wide enough, just check if one half of a ring will fit inside pole-spacing. 1992-11-27 Richard Stallman (rms@mole.gnu.ai.mit.edu) * add-log.el (add-change-log-entry): Expand file-name again after chasing links. 1992-11-20 Richard Stallman (rms@mole.gnu.ai.mit.edu) * vc.el (vc-next-action): Undo previous change. 1992-11-19 Jim Blandy (jimb@totoro.cs.oberlin.edu) * vc.el (vc-next-action): Pass t as NOQUERY argument to vc-resynch-window here too. This means that all uses of vc-resynch-window pass t; I'm going to wait until I understand the situation better before I rip out the NOQUERY argument altogether. * vc.el (vc-revert-buffer1): Try to preserve the position of mark as well as point. (vc-position-context, vc-find-position-by-context): New functions to help with that, made out of the old innards of vc-revert-buffer1. 1992-11-18 Jim Blandy (jimb@totoro.cs.oberlin.edu) * fortran.el: New version of version 1.30 (!) from Stephen A. Wood <saw@hallc1.cebaf.gov> 1992-11-17 Jim Blandy (jimb@totoro.cs.oberlin.edu) * fortran.el: New version (1.30) from "Stephen A. Wood" <saw@hallc1.cebaf.gov> * subr.el (lambda): Doc fix. 1992-11-15 Jim Blandy (jimb@totoro.cs.oberlin.edu) * simple.el (comment-column): Doc fix. 1992-11-13 Jim Blandy (jimb@totoro.cs.oberlin.edu) * paths.el (rmail-spool-directory): Add dgux-unix to the list of systems which put their mail in "/usr/mail". * lpr.el (lpr-command, lpr-switches): Removed strings starting with \newline; this file is loaded in loaddefs.el, and doesn't need to follow that convention. * lpr.el (lpr-command): Add dgux-unix to the list of systems which want "lp". 1992-11-12 Jim Blandy (jimb@totoro.cs.oberlin.edu) * bytecomp.el: Declare unread-command-char an obsolete variable. * vip.el (vip-escape-to-emacs, vip-prefix-arg-value, vip-prefix-arg-com): Use unread-command-event instead of unread-command-char; respect its new semantics. * simula.el (simula-electric-label): Same. * comint.el (comint-dynamic-list-completions): Same. * ebuff-menu.el (electric-buffer-list, Electric-buffer-menu-exit):. * simple.el (prefix-arg-internal): Same. * subr.el (read-quoted-char, momentary-string-display): Same. * sun-mouse.el (mouse-second-hit): Same. * terminal.el (te-escape-extended-command-unread): Same. * emerge.el (emerge-file-names): Use `temp-buffer-show-function', not `temp-buffer-show-hook'. (emerge-combine-versions-edit): Fix misarranged cond expression; the t is an `else' clause, not a function call in the preceeding clause. * simula.el (simula-calculate-indent): Call backward-word with the appropriate argument. * vip.el (vip-delete-char, vip-delete-backward-char, ex-delete): Don't pass nil as a fourth argument to vip-append-to-register; it takes only three. (vip-mark-point, ex-mark): Pass required second argument to point-to-register. * bytecomp.el: (require 'backquote). * subr.el (lambda): Don't use backquotes in lambda's definition. * disass.el (byte-compile): Specify that the 'byte-compile feature is provided in the file "bytecomp". 1992-11-11 Jim Blandy (jimb@totoro.cs.oberlin.edu) * ange- (ange-ftp-repaint-buffer): Give this a non-hacky definition using (message nil). (ange-ftp-read-passwd, ange-ftp-process-filter): Uncomment out the calls to ange-ftp-repaint-buffer. 1992-11-11 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * c-mode.el (c-style-alist): Add quotes around C++ style name. 1992-11-10 Jim Blandy (jimb@totoro.cs.oberlin.edu) *. 1992-11-08 Richard Stallman (rms@mole.gnu.ai.mit.edu) * vc.el (vc-cancel-version): Use yes-or-no-p. 1992-11-06 Richard Stallman (rms@mole.gnu.ai.mit.edu) * startup.el (after-init-hook): Doc fix. 1992-11-05 Jim Blandy (jimb@totoro.cs.oberlin.edu) * isearch.el (isearch-frames-exist): This isn't what we want - replaced by... (isearch-gnu-emacs-events): non-nil if should expect events in the style generated by GNU Emacs 19. Set if set-frame-height is fboundp; this is true on any GNU Emacs 19, whether or not it was compiled with multiple frame support. (isearch-mode-map): Test isearch-gnu-emacs-events instead of isearch-frames-exist to see if we should bind switch-frame events. (isearch-update): Test isearch-gnu-emacs-events instead of isearch-frames-exist to see if unread-command-char's quiescent value is nil or -1. * simple.el (previous-line): Doc fix. 1992-11-05 Stephen A. Wood (saw@cebaf.gov) * fortran.el: version 1.28.8 (fortran-indent-to-column): Make turning of lines that begin with `fortran-continuation-string' into properly formated continuation lines work for fortran TAB mode. * fortran.el: version 1.28.7a Cleaned up some doc strings. (fortran-abbrev-help, fortran-prepare-abbrev-list-buffer): Use `insert-abbrev-table-description' and make buffer in abbrevs-mode. * fortran.el: version 1.28.7 Many changes since version 1.28.3. Added auto-fill-mode, support for some Fortran 90 statements. Adjust comments to conform to new gnu conventions. (fortran-mode): Fix `comment-line-start-skip' by changing \\1 to \\2 and include cpp statements in matching. Changes for auto fill. (fortran-auto-fill-mode, fortran-do-auto-fill, fortran-break-line): New functions to implement auto fill. (fortran-indent-line, fortran-reindent-then-newline-and-indent): Added auto fill support. (find-comment-start-skip, is-in-fortran-string-p): New functions. (fortran-electric-line-number): Works better in overwrite mode. (fortran-indent-comment, fortran-indent-line, fortran-indent-to-column): Use find-comment-start-skip instead of searching for `comment-start-skip'. (fortran-mode, calculate-fortran-indent): Added indentation for fortran 90 statements. (fortran-next-statement, fortran-previous-statement): Bug fixes. (fortran-mode, calculate-fortran-indent, fortran-setup-tab-format-style, fortran-setup-fixed-format-style): `fortran-comment-line-column' meaning changed. Now defaults to 0. 1992-11-05 Richard Stallman (rms@mole.gnu.ai.mit.edu) * term/x-win.el: (command-switch-alist, x-switch-definitions): -ib was used for two things. Use -itype for icon type. 1992-11-04 Richard Stallman (rms@mole.gnu.ai.mit.edu) * term/x-win.el (command-switch-alist, x-switch-definitions): -ib was used for two things. Use -itype for icon type. 1992-11-04 Jim Blandy (jimb@totoro.cs.oberlin.edu) * term/x-win.el: Moved functions to support selections and cut buffers out from amidst the X initialization code. * simple.el (kill-line): Don't shift point before doing the delete. * startup.el (normal-top-level): Don't worry about setting default-directory to PWD if PWD is shorter. And, if PWD isn't accurate, delete it. 1992-11-03 Jim Blandy (jimb@totoro.cs.oberlin.edu) * compile.el (compile-internal): Use NAME-OF-MODE in the prompt when offering to kill an existing process. * autoload.el (make-autoload): When creating an autoload invocation for a macro, pass (list 'quote 'macro) as the sixth argument, not just t. autoload's sixth argument is now a type instead of just a boolean value, so we should use a value which reflects that. * cl.el: New version - 3.0 - from Cesar Quiroz. * etags.el (find-tag-noselect): Doc fix. 1992-11-03 Richard Stallman (rms@mole.gnu.ai.mit.edu) * rect.el (insert-rectangle): Put mark at upper left corner. * dired-aux.el (dired-mark-confirm): For `compress', say `Compress or uncompress'. (dired-map-over-marks-check): Likewise. 1992-11-01 Richard Stallman (rms@mole.gnu.ai.mit.edu) * isearch-mode.el (isearch-search): Handle all sorts of errors from regexp search. 1992-10-31 Richard Stallman (rms@mole.gnu.ai.mit.edu) * files.el (make-directory): Renamed from make-directory-path. Optional argument says whether to create parent dirs. Invoke file-name handler here. (after-find-file): Delete code that offers to create dir. Instead, just print a message. * bytecomp.el (byte-compile-lambda): Don't compile the interactive spec if it is a call to `list'. 1992-10-30 Jim Blandy (jimb@totoro.cs.oberlin.edu) * ange-: Tighten the regular expression used in file-name-handler-alist to recognized ange-ftp filenames; the slash, username and hostname must be at the start of the filename, not just anywhere in the filename. 1992-10-30 Richard Stallman (rms@mole.gnu.ai.mit.edu) * tabify.el: Doc fix. 1992-10-28 Richard Stallman (rms@mole.gnu.ai.mit.edu) * vc.el (vc-admin): Pass t as noquery arg to vc-resynch-window. * paths.el (manual-program): Always use /usr/ucb/man if that exists. 1992-10-27 Richard Stallman (rms@mole.gnu.ai.mit.edu) * fortran.el (fortran-tab-mode): Add defvar. (fortran-analyze-file-format): Bind i. (fortran-tab-mode-string): Add defvar. (fortran-tab-mode): Use `arg' as variable, not as function. (fortran-prepare-abbrev-list-buffer): New function. (fortran-abbrev-help): Call that. (fortran-window-create): Use screen-width, not frame-width. * info.el: Rename buffer-flush-undo to buffer-disable-undo. (Info-goto-emacs-key-command-node): Fix typo. (Info-menu-item-sequence): Commented out. (Info-follow-nearest-node): Use new event format. Select the window clicked on. * vc.el (vc-log-file, vc-log-version): Declared. * simple.el (shell-command-on-region): Use region-beginning and region-end, in interactive spec. 1992-10-26 Richard Stallman (rms@mole.gnu.ai.mit.edu) * isearch-mode.el (isearch-edit-string): Bind cursor-in-echo-area only around read-char/allocate-event. 1992-10-24 Richard Stallman (rms@mole.gnu.ai.mit.edu) * vc-hooks.el (vc-prefix-map): Put vc-diff on = and vc-directory on d. * vc.el (vc-resynch-window): New arg NOQUERY. Pass it to vc-revert-buffer1. (vc-checkout, vc-finish-logentry, vc-revert-buffer, vc-finish-steal): Supply t as NOQUERY arg for vc-resynch-window. (vc-next-action): Don't revert workfile from master if buffer is modified. 1992-10-23 Richard Stallman (rms@mole.gnu.ai.mit.edu) * files.el (set-visited-file-name): Change the auto save file name. * macros.el (insert-kbd-macro): Replace nonprinting chars with escapes. If arg is empty, use last macro as default. * sendmail.el (mail-aliases): Doc fix. * help.el (describe-function): Print `an autoloaded', not `a ...'. * simple.el (goal-column): Don't put the defvar inside the make-variable-buffer-local. 1992-10-21 Richard Stallman (rms@mole.gnu.ai.mit.edu) * dired.el (dired-chown-program): Treat silicon-graphics-unix like usg-unix-v. * rmail.el (rmail-mode-map): Delete binding of M-r (use global one). * lpr.el (lpr-command): Treat hpux and silicon-graphics-unix like usg-unix-v. * rmailout.el (rmail-output-to-rmail-file): Call abbreviate-file-name. * files.el: Doc fixes. 1992-10-20 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el (comment-region): Do move to next line, in neg arg case. * isearch-mode.el (isearch-mode-map): Make the top-level keymap dense. Explicitly bind control characters at that level. * files.el (file-truename): Check for root by seeing if directory-file-name returns same as DIR. Look for a file-truename handler for the file name. * vc-hooks.el (vc-registered): Look for a vc-registered handler. But only if file-name-handler-alist is bound. * ange-: Add dummy handlers for file-truename and vc-registered. (ange-ftp-add-vms-host, ange-ftp-add-dl-dir, ange-ftp-add-mts-host): (ange-ftp-add-dumb-unix-host): Use default-directory, not dired-directory. (ange-ftp-allow-child-lookup): Eliminate dired-local-variables-file. * mailalias.el (mail-aliases): Add definition here. 1992-10-19 Richard Stallman (rms@mole.gnu.ai.mit.edu) * add-log.el (add-log-current-defun): Add condition-case around the body, so at worst we return nil. 1992-10-18 Richard Stallman (rms@mole.gnu.ai.mit.edu) * paragraphs.el (kill-sentence, backward-kill-sentence): (kill-paragraph, backward-kill-paragraph): Don't change point before calling kill-region. * sendmail.el (mail-setup): Call build-mail-aliases, not mail-abbrev-setup. (sendmail-send-it): Call expand-mail-aliases. * mailalias.el: Doc fixes. * mailabbrev.el: Delete version 18 compatibility stuff. (mail-abbrevs, build-mail-abbrevs, rebuild-mail-abbrevs): (merge-mail-abbrevs): Renamed `mail-aliases' to `mail-abbrevs'. (mail-abbrev-end-of-buffer): Renamed from abbrev-hacking-end-of-buffer. (mail-abbrev-next-line): Renamed from abbrev-hacking-next-line. * isearch-mode.el (isearch-mode-map): Use sparse keymaps. Start printing-char loop at SPC. * rmailsort.el (rmail-sort-messages): Give up right away if not Rmail mode. 1992-10-17 Richard Stallman (rms@mole.gnu.ai.mit.edu) * replace.el (occur): Always search entire buffer. 1992-10-17 Jim Blandy (jimb@totoro.cs.oberlin.edu) * mouse.el (mouse-tear-off-window): New function. 1992-10-17 Richard Stallman (rms@mole.gnu.ai.mit.edu) * mouse.el (mouse-set-region): New command. Bind drag-mouse-1 to it. 1992-10-15 Richard Stallman (rms@mole.gnu.ai.mit.edu) * telnet.el (telnet): Wait for telnet output before sending `open'. 1992-10-14 Jim Blandy (jimb@totoro.cs.oberlin.edu) * files.el (file-truename): The variable ~ should be considered an absolute pathname; handle it correctly. Concatenate the directory onto the filename in the correct order. 1992-10-13 Richard Stallman (rms@mole.gnu.ai.mit.edu) * isearch-mode.el (isearch-mode-map): Bind t in top-level map and in the submap for meta keys. Don't bind the individual chars. 1992-10-12 Roland McGrath (roland@geech.gnu.ai.mit.edu) * etags.el (visit-tags-table-buffer): When trying to pick table, call tags-expand-table-name on alternatives that might be nil. (tags-table-files): Don't call visit-tags-table-buffer; assume we are there. 1992-10-12 Richard Stallman (rms@mole.gnu.ai.mit.edu) * picture.el (edit-picture): Run picture-mode-hook. 1992-10-10 Jim Blandy (jimb@totoro.cs.oberlin.edu) * dired-aux.el (dired-compress-file): Change references to `from-file' to use `file'; the former only works because dired-compress-file is only called by dired-compress, which binds from-file. * rmail.el (rmail-mode): Make this autoload; we might find a file whose first line local variables want to put it in RMAIL mode; that ought to work. 1992-10-10 Richard Stallman (rms@mole.gnu.ai.mit.edu) * comint.el (comint-last-input-match): defvar moved up. * files.el (buffer-file-number): New variable. . 1992-10-09 Richard Stallman (rms@mole.gnu.ai.mit.edu) * rmail.el (mail-unsent-separator): Handle "Message text follows". * files.el (hack-one-local-variables): New subroutine. (hack-local-variables-prop-line): New function. (hack-local-variables): Use them both. (ignored-local-variables): New variable. * files.el (file-truename): New function. (find-file-noselect): Look for buffer with same truename. Warn about it; optionally find it. Set buffer-file-truename. (set-visited-file-name): Set buffer-file-truename. (buffer-file-truename): New var, permanent local in all buffers. (find-file-visit-truename, find-file-compare-truenames): New options. 1992-10-08 Richard Stallman (rms@mole.gnu.ai.mit.edu) * rmail.el (mail-unsent-separator): Allow "original message" as alternative. Allow extra dashes and spaces. (rmail-retry-failure): Ignore case while searching for unsent sep. * add-log.el (add-log-current-defun): In normal C case, start with beginning-of-line. In last (fallback) case, start with end-of-line. (add-log-current-defun-header-regexp): In first alternative within the parens, don't allow space as last character. * cust-print.el (custom-prin1-chars): Var defined, and renamed from prin1-chars. (circle-tree, circle-table): Define vars. (cust-print-vector, cust-print-list): Rename level to circle-level. (cust-print-top-level): Likewise. (circle-level): Var defined. * cmuscheme.el (inferior-scheme-filter-regexp): Move definition of this var up before first use. (scheme-buffer): Define variable. * cmulisp.el (cmulisp-mode): Eliminate compatibility code calling lisp-mode-variables with no arg. (cmulisp-mode-map): Use shared-lisp-mode-map as tail. (cmulisp-args-to-list): Fix typo in recursive call. (cmulisp-buffer): Define variable. * files.el (hack-local-variables): Ignore attempts to bind enable-local-eval. 1992-10-07 Richard Stallman (rms@mole.gnu.ai.mit.edu) * cust-print.el: CP:: changed to cust-print- in all names. Lots of doc fixes. 1992-10-06 Richard Stallman (rms@mole.gnu.ai.mit.edu) * add-log.el (add-log-current-defun): Catch errors checking for DEFUN. 1992-10-05 Richard Stallman (rms@mole.gnu.ai.mit.edu) * vc.el (vc-steal-lock): Use mail-setup, and do like `mail'. Supply vc-finish-steal as an action on sending. (vc-finish-steal): Delete the code to send the message. (vc-backend-steal): Put filename after options in rcs commands. Delete the workfile after the rcs -M -u. 1992-10-05 Joseph Arceneaux (jla@churchy.gnu.ai.mit.edu) * rmail.el (rmail-first-unseen-message): Don't show the message, just return its number, if there was an unseen message. (rmail): Check for unseen messages before calling rmail-get-new-mail. After getting the new mail, call rmail-show-message to show the pre-existing unseen message, or if that is nil, the current message, which rmail-get-new-mail sets to the first new message. 1992-10-05 Richard Stallman (rms@mole.gnu.ai.mit.edu) * isearch-mode.el (isearch-ring-advance-edit): Delete spurious `)'. * info.el (Info-restore-point): Delete duplicate definition. 1992-10-05 Roland McGrath (roland@albert.gnu.ai.mit.edu) * vc.el (vc-backend-checkin): Change buffers to get local value of vc-checkin-switches. * vc.el (vc-backend-checkin): Use apply on vc-do-command: vc-checkin-switches is a list. 1992-10-05 Roland McGrath (roland@albert.gnu.ai.mit.edu) * vc.el (vc-checkin-switches): New defvar. (vc-backend-checkin): Pass vc-checkin-switches to prog. 1992-10-05 Richard Stallman (rms@mole.gnu.ai.mit.edu) * ls-lisp.el (insert-directory): Renamed from dired-ls. All other functions renamed to start with ls-lisp. * ls-lisp.el: New file from Kremer. 1992-10-04 Richard Stallman (rms@mole.gnu.ai.mit.edu) * fill.el (fill-paragraph): Don't actually change point before calling fill-region-as-paragraph. (fill-region-as-paragraph): Save point on undo list at start. 1992-10-03 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el (insert-buffer): Before reading arg, barf if read-only. 1992-10-03 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * mouse.el: Begin adapting this to the new event format. (event-window, event-point, mouse-coords, mouse-timestamp): Removed. (event-start, event-end, posn-window, posn-point, posn-col-row, posn-timestamp): New accessors; these are defsubsts. (mouse-delete-window, mouse-delete-other-windows, mouse-split-window-vertically, mouse-set-point): Rewritten to use the new accessors. * mouse.el: Remove hack of binding down-mouse-1. * mouse.el (mouse-movement-p): Add docstring for this. 1992-10-02 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el (open-line): Shield undo from the hack to insert at pt-1. 1992-10-01 Richard Stallman (rms@mole.gnu.ai.mit.edu) * man.el (nuke-nroff-bs): 4 lines after header was 1 too many. Likewise for 10 before the header. 1992-10-01 Roland McGrath (roland@geech.gnu.ai.mit.edu) * compile.el (compilation-parse-errors): Save (match-beginning 0) in a variable, so the looking-at call doesn't clobber its value when we want to use it to back up before the error we discard. Make sure compilation-error-list is at least two elts long before checking its first two elts for being in the same file. 1992-09-30 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el (kill-word): Don't change point before calling kill-region. (delete-indentation): Don't go beyond eob, comparing with fill-prefix. 1992-09-30 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * gud.el (gud-last-frame): Added defvar for this. 1992-09-29 Richard Stallman (rms@mole.gnu.ai.mit.edu) * info.el (Info-follow-nearest-node): Handle line breaks after *note. Fix interactive spec. Doc fix. Put on mouse-3. 1992-09-30 Roland McGrath (roland@geech.gnu.ai.mit.edu) * compile.el (compilation-parse-errors): After we get enough errors to stop early, toss the last one (which is for a different file), so we don't lose the same way on the next run. 1992-09-29 Roland McGrath (roland@geech.gnu.ai.mit.edu) * compile.el (compilation-parse-errors): When we reach FIND-AT-LEAST errors, keep going until we have seen all the consecutive errors in the same file. 1992-09-29 Richard Stallman (rms@mole.gnu.ai.mit.edu) * sendmail.el (mail-send-and-exit): Do other-buffer before bury-buffer. * rmail.el (mail-unsent-separator): Add another alternative. 1992-09-29 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * term/x-win.el (x-select-text, x-cut-buffer-or-selection-value): Use x-get-cut-buffer and x-set-cut-buffer, instead of expecting x-selection-value to manipulate the cut buffers. * term/x-win.el (x-cut-buffer-or-selection-value): Treat selections whose value is the empty string like unset selections. This allows us to truncate cut buffers to the empty string (if the text is too large, say) without causing interprogram-paste-function to wipe out the latest kill. * gud.el: When we send a command to the debugger via gud-call,.el (gud-def): Doc fix. . 1992-09-28 Richard Stallman (rms@mole.gnu.ai.mit.edu) * ange- (ange-ftp-kill-ftp-process): Delete spurious ". * files.el (file-relative-name-1): New function split out. (file-relative-name): Use it. * timer.el (timer-process-sentinel): Don't set timer-scratch. * ws-mode.el (ws-mark-word): Use forward-word, with an arg, instead of backward-word. (wordstar-mode): Move after definition of keymap. (ws-move-block): Just two args for kill-region. * vc.el (vc-rename-file): Use OLD, not FILE which is unbound. * two-column.el: Use frame-width instead of screen-width. 1992-09-28 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * map-ynp.el: Use (function ...) around lambdas, so it works in v18. 1992-09-27 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * vc.el (vc-update-change-log): Use file-relative-name. 1992-09-27 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * files.el (file-relative-name): Rewritten so unrelativizable file names win. 1992-09-27 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * files.el (file-relative-name): Don't lose when DIRECTORY is nil. * files.el (file-relative-name): New function. 1992-09-27 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * vc.el (vc-checkin-hook): New user hook variable. (vc-log-after-operation-hook): New internal defvar. (vc-checkin): Set vc-log-after-operation-hook to 'vc-checkin-hook. (vc-finish-logentry): (run-hooks vc-log-after-operation-hook) at end. (vc-update-change-log): When doing all visited files, remove directory names from file names that are in default-directory. * vc.el (vc-update-change-log): Use shell-command, not shell-command-on-region. Take optional args to pass to script. Add fancy interactive spec: C-u for current file only; M-0 for all visited. 1992-09-27 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * find-dired.el: New version from sk. Changed copyright owner to FSF, and updated year. (find-grep-dired): Use ! -type d, not -type f. 1992-09-27 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * vc-hooks.el (vc-toggle-read-only): Doc fix. (vc-mode-line): Add interactive spec. 1992-09-26 Richard Stallman (rms@mole.gnu.ai.mit.edu) * two-column.el (tc-window-width, tc-separator, tc-other): Add permanent-local property. (tc-two-columns): Renamed from tc-split. (tc-split): Renamed from tc-unmerge. Put it on C-x 6 s. Use make-local-variable on tc-separator. * spook.el (spook): Make it autoload. * gomoku.el (gomoku): Make it autoload. * mpuz.el: Fix setup of mpuz-read-map not to depend on keymap format. (mpuz): Renamed from mult-puzzle. Make it autoload. * setenv.el (setenv): Doc fix. Make it autoload. * diff.el (diff): Don't print echo area message. (diff-parse-differences): Always add `done' to message, at end. New local num-loci-found counts the loci. * mouse.el (mouse-split-window-vertically): Use @. (mouse-split-window-horizontally): New command. Use S-mouse-2 for them. (mouse-delete-window): Put on mode-line mouse-3. (mouse-save-then-kill): New command, on mouse-3. (mouse-delete-other-windows): Use @. Now on mode-line mouse-1. (mouse-scroll-down, mouse-scroll-up): Use e, get line from event. (mouse-scroll-move-cursor): Likewise. (mouse-scroll-left, mouse-scroll-right): Likewise for column. (mouse-scroll-move-cursor-horizontally): Likewise. 1992-09-24 Richard Stallman (rms@mole.gnu.ai.mit.edu) * files.el (after-find-file): New arg NOAUTO. (revert-buffer, recover-file): Pass t for that arg. 1992-09-23 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * cal-mayan.el (calendar-print-mayan-date): Fix conversion in output message. 1992-09-23 Richard Stallman (rms@mole.gnu.ai.mit.edu) * c-mode.el (calculate-c-indent): When testing for function-start line, always match the first paren if have more than one. 1992-09-21 Richard Stallman (rms@mole.gnu.ai.mit.edu) * vms-pmail.el: New file. * texinfo.el (texinfo-mode): Capitalize the mode name string. * mail-extr.el (mail-undo-backslash-quoting): Renamed from undo-... (mail-safe-move-sexp): Renamed from safe-... (mail-variant-method): Renamed from variant-method. * tq.el: Doc fixes. Make tq-create autoload. * keypad.el: File deleted (obsolete). * setenv.el (setenv): Add interactive spec. Use \\` for string beg. Improve error message. * isearch-mode.el (isearch-other-meta-char): Use isearch-unread. Support `edit' as search-exit-option. * recompile-startup.el: File deleted. * at386.el: Deleted from here; latest version moved into term. * c-mode.el (calculate-c-indent): When checking for DEFUN macro, stop moving down if reach eob. 1992-09-20 Richard Stallman (rms@mole.gnu.ai.mit.edu) * prompt.el: File deleted. * find-dired.el (start-process-shell-command): Deleted. * diff.el (diff-switches): Default is now -c. (diff-parse-differences): Use line beg as location of message. * c-mode.el (calculate-c-indent): When checking for DEFUN macro, stop moving down at line with # or /. (c-fill-paragraph): Set first-line whenever we find a comment start on the current line. Protect text before the comment start by excluding it from the region and adding spaces to bring back proper indentation of that point. 1992-09-19 Richard Stallman (rms@mole.gnu.ai.mit.edu) * ange- (ange-ftp-generate-anonymous-password): Default now t. ??? This file is waiting for papers from several people. * vms-patch.el (vms-command-line-again): New function. (vms-pmail-setup): Autoload added here. (vms-suspend-resume-hook): Handle envvars EMACS_COMMAND_ARGS and EMACS_FILE_LINE. * dired.el (dired-view-file, dired-up-directory): Test that dired-subdir-alist has more than one element, to use dired-goto-subdir. (dired-goto-file, dired-clean-up-after-deletion): Likewise. (dired-mark): Likewise, before dired-get-subdir. (dired-subdir-max): Likewise, before dired-next-subdir. * isearch-mode.el (isearch-done): Do push on ring if ring is empty. (isearch-edit-string): Get default from search ring. Don't set the default here. (search-last-string, search-last-regexp): Vars deleted. (search-highlight): No longer a user option. * subr.el (baud-rate): Defined. (substitute-key-definition): Understand today's keymap format. New arg OLDMAP. Operate recursively on prefix keys. * rmail.el (rmail-insert-inbox-text): Make the inbox file empty here if we rename it with rename-file here. (rmail-get-new-mail): Always try deleting the files in delete-files. 1992-09-18 Richard Stallman (rms@mole.gnu.ai.mit.edu) * lisp-mode.el (eval-last-sexp): Narrow before reading so don't read past point. * isearch-mode.el (isearch-mode): Change back to (baud-rate). * rmail.el (rmail-get-new-mail): Truncate inbox file if we fail to delete it, or if it's not in the ordinary mail spool dir. 1992-09-17 Richard Stallman (rms@mole.gnu.ai.mit.edu) * c-mode.el (calculate-c-indent): When checking for DEFUN macro, stop moving down at line with open-brace or close-brace. * ange- (ange-ftp-file-name-as-directory): Fix typo. 1992-09-17 Jim Blandy (jimb@pogo.cs.oberlin.edu) * gud.el (gud-mode-map): Bind gud-refresh to C-c C-l, not C-c l; the latter is reserved for the user's purposes. 1992-09-16 Joseph Arceneaux (jla@churchy.gnu.ai.mit.edu) * isearch-mode.el (isearch-ring-advance-edit): added missing closing paren to end of this function. 1992-09-16 Roland McGrath (roland@geech.gnu.ai.mit.edu) * rmail.el (rmail-insert-inbox-text): Avoid "Getting mail from" message for zero-length files. 1992-09-15 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * term/x-win.el: Bind M-next to scroll-other-window. * etags.el (visit-tags-table-buffer): Only return nil if (null tags-table-list-pointer) when CONT is t, not anything non-nil. * etags.el (tags-apropos): Pass arg to tags-apropos-function. * mailabbrev.el: Delete comment about needing papers. We have them. * etags.el (tags-apropos): Start FIRST-TIME as t, not nil. Set it to nil inside the loop. 1992-09-15 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el (previous-history-element): Doc fix. * isearch-mode.el (isearch-event-data-type): Renamed from isearch-events-exist. (isearch-frames-exist): Set properly in Emacs 18. (isearch-mode): Use baud-rate as variable, not function. (isearch-abort): Use nil as 2nd arg to `signal'. (isearch-ring-advance-edit, isearch-ring-retreat-edit): Fns deleted. (isearch-ring-adjust-edit): Fns deleted. (isearch-done): Add new string to ring unless matches newest elt. Don't update the yank pointers. (isearch-repeat): Always use newest elt of ring. (isearch-mode): Set *search-ring-yank-pointer to nil. (isearch-edit-string): Set cursor-in-echo-area to nil after read-char. Use read-from-minibuffer and specify a ring as history. (*search-ring-yank-pointer): Value now integer or nil. (isearch-ring-adjust1): Modify yank pointer usage accordingly. 1992-09-14 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * dabbrev.el: Change provide to 'dabbrev from 'dabbrevs. * etags.el (find-tag-noselect, next-file, list-tags, tags-apropos): Call visit-tags-table-buffer with nil, not 'reset. (tags-expand-table-name): New function. (tags-table-list-member): New function. (tags-next-table): New function. (visit-tags-file): Folded into visit-tags-table-buffer. (tags-table-list-started-at): New defvar. (visit-tags-table-buffer): Rewritten. No longer groks 'reset arg. For 'same, just expand tags-file-name. For t, use tags-next-table, and skip over nonexistent files. Use tags-table-list-member to search lists. Set tags-table-list-started-at. (visit-tags-table): Use (visit-tags-table-buffer 'same) in place of visit-tags-file. (tags-table-parent-pointer-list): Doc fix. (tags-table-including): New function, subr of visit-tags-table-buffer. 1992-09-14 Jim Blandy (jimb@pogo.cs.oberlin.edu) *. 1992-09-14 Richard Stallman (rms@mole.gnu.ai.mit.edu) * isearch-mode.el: Add global key bindings. (isearch-mode-map): Use only define-key, not aset. Don't try using length of keymap. (isearch-update): Handle unread-command-char properly for Emacs 19. (isearch-switch-frame-handler): Use select-frame to switch frames. (isearch-pre-command-hook): Commented out. (search-upper-case): Renamed from search-caps-disable-folding. 1992-09-14 Roland McGrath (roland@geech.gnu.ai.mit.edu) * etags.el (visit-tags-file): Return t iff tags file exists. (visit-tags-table): Error if file doesn't exist. (tags-next-table): New function, code broken out from visit-tags-table-buffer. (visit-tags-table-buffer): Use it. Skip over nonexistent files in the tags-table-list. (find-tag-in-order): When (not FIRST-SEARCH), call visit-tags-table-buffer with 'same, not nil. * etags.el (visit-tags-file): Check for file being a directory here. (visit-tags-table-buffer): Not here. (visit-tags-table): Or here. 1992-09-14 Richard Stallman (rms@mole.gnu.ai.mit.edu) * rmail.el (rmail-retry-failure): Bind off mail-signature and mail-setup-hook. (rmail-forward): Likewise. * loaddefs.el: Added autoloads for dabbrev. (That section got lost.) * simple.el (repeat-complex-command): Get rid of strings added to command-history by read-from-minibuffer. Don't bind minibuffer-history-variable here. (previous-matching-history-element): Read argument manually, with a special history list. Delete this command from command-history. Fix arithmetic for counting N. (next-matching-history-element): Likewise. (minibuffer-history-search-history): New variable. * simple.el (read-expression-map): New keymap, w/ lisp-complete-symbol. (eval-expression, edit-and-eval-command): Use read-expression-map. (repeat-complex-command): Likewise. 1992-09-13 Richard Stallman (rms@mole.gnu.ai.mit.edu) * compile.el: Fix first lines of doc strings. (compilation-sentinel): Use local value of compilation-finish-function. (compilation-num-errors-found): New variable. (compilation-parse-errors): Use that, not `nfound'. * diff.el (diff-parse-differences): Likewise. * lisp-mode.el (save-match-data): Define indentation. * files.el (file-local-copy): New function, replaces diff-prepare. * subr.el (save-match-data): New macro. * files.el (insert-directory): Use that macro. (file-name-sans-versions): Likewise. * dired-aux.el (dired-compress-file): Likewise. * diff.el (diff-old-file, diff-new-file): Vars declared. (diff-old-temp-file, diff-new-temp-file): Vars declared. (dired-add-entry): Pass t as wildcard arg to insert-directory. (diff): Use compilation-finish-function to delete temp files. * comint.el (comint-mode): Reinsert kill-all-local-variables. Delete kludges to preserve comint-ptyp and comint-input-ring. (comint-ptyp): Move declaration before uses. Make permanent. (comint-input-ring): Make permanent. (comint-input-ring-index): Declare it. * bytecomp.el (byte-compile-report-error): Set byte-compiler-have-errors. (byte-compile-file): Don't kill ` *Compiler Input*' buffer if error. Put input and output buffers in local vars when made. Make two separate save-excursion forms, excluding the call to byte-compile-from-buffer. * dired.el (dired-uncache): New function. (dired-revert, dired-insert-old-subdirs): Use it. (dired-view-file): Undo previous change. 1992-09-13 Jim Blandy (jimb@pogo.cs.oberlin.edu) * mouse.el: Change uses of 'K' interactive spec to 'e'. 1992-09-13 Richard Stallman (rms@mole.gnu.ai.mit.edu) * diff.el (diff): Call diff-prepare. If we do have temporary files, tell diff to override their names in the listing; delete them at end. (diff-prepare): New function. * files.el (file-name-sans-versions): Support file-name-handler-alist. New arg KEEP-BACKUP-VERSION means don't delete backup versions. * dired.el (dired-display-file, dired-find-file-other-window): (dired-view-file, dired-find-file): Call file-name-sans-versions to remove non-backup version numbers. * dired-aux.el (dired-compress-file): New function. (dired-compress): Call that, to compress and determine new name. * files.el (insert-directory): New function; based on dired-ls. Supports file-name-handler-alist. (insert-directory-program): New variable. * dired-aux.el (dired-add-entry, dired-insert-subdir-doinsert): Use insert-directory. * dired.el (dired-readin-insert): Use insert-directory. (dired-ls, dired-ls-program): Deleted. 1992-09-12 Richard Stallman (rms@mole.gnu.ai.mit.edu) * autoload.el (update-file-autoloads): Use beginning of specified line. * loaddefs.el: Sort alphabetically by file name. * files.el (backup-buffer): If backup file to copy into exists and is not writable, try deleting it. * ange-: New version from Andrew Norman. Modified to use file-name-handler-alist. Get rid of the dummy shell mode. Rename many variables used free to start with ange-ftp. Don't do anything special for revert-buffer. 1992-09-11 Richard Stallman (rms@mole.gnu.ai.mit.edu) * mouse.el (x-fixed-font-alist): New variable. (mouse-set-font): New function, now on C-mouse-3. * term/x-win.el (scroll-bar-mode): New function (and variable too). * dired.el (dired-next-subdir, dired-subdir-index): Moved here * dired-aux.el: From here. * dired.el (dired-build-subdir-alist): Don't print msg after each dir. Clarify final message. * files.el (auto-mode-alist): Recognize ChangeLog.N as change-log-mode. Move *.N pattern for nroff mode after ChangeLog.N. 1992-09-10 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * add-log.el (add-log-current-defun): Use eq instead of = when one side might be nil. 1992-09-09 Jim Blandy (jimb@pogo.cs.oberlin.edu) * frame.el (frame-notice-user-settings): In situations where we have to delete the existing frame and create a new one, redirect the dying frame's focus to the new frame, so that characters typed ahead won't get lost. * frame.el (frame-notice-user-settings): Explicitly include default-frame-alist in the frame parameter lists; it was nil before the .emacs file was loaded, and now we have to make sure it takes effect. * subr.el (keyboard-translate): keyboard-translate-table is a C variable; it's never unbound. Assume it's bound, and create a new string if its current value is a non-array, or if the current array is too short to handle FROM or TO. 1992-09-08 Joseph Arceneaux (jla@geech.gnu.ai.mit.edu) * mailabbrev.el (sendmail-pre-abbrev-expand-hook): Changed the structure of this function: Don't check to call mail-resolve-all-aliases unless we are actually in a header field where an abbrev should be expanded. 1992-09-05 Richard Stallman (rms@mole.gnu.ai.mit.edu) * c-mode.el (c-fill-paragraph): Fix the cases where point is before or after the comment. This uses new var comment-start-place. 1992-09-04 Jim Blandy (jimb@pogo.cs.oberlin.edu) * rmail.el (rmail-unix-mail-delimiter): Expand this to recognize time zones after the date too. Re-arranged some of the whitespace matching, to facilitate factoring out the time zone regexp. (rmail-nuke-pinhead-header): Deal with the timezone matched in either position. 1992-09-04 Roland McGrath (roland@albert.gnu.ai.mit.edu) * server.el: Add provide. 1992-09-04 Richard Stallman (rms@mole.gnu.ai.mit.edu) * c-mode.el (calculate-c-indent): Delete stray setq of tem. (c-fill-paragraph): If line contains any comment, treat as comment. * add-log.el (change-log-mode): Match start of word at start of line. * page.el (forward-page): Handle page delim that matches null string. * rmail.el (rmail-mode): Doc fix. * shell.el (shell): Doc fix. * sendmail.el (mail-do-fcc): Copy code from Emacs 18 to add time zone. 1992-09-03 Jim Blandy (jimb@pogo.cs.oberlin.edu) * rmail.el (rmail-unix-mail-delimiter): Split this up and comment its various components so it looks a bit less like three lines of garbage. 1992-09-02 Roland McGrath (roland@geech.gnu.ai.mit.edu) * compile.el (compile-goto-error): Move to bol before looking for the error. 1992-09-02 Jim Blandy (jimb@pogo.cs.oberlin.edu) * c-mode.el (c-auto-newline): Added backslashed before quotes in docstring. 1992-09-01 Richard Stallman (rms@mole.gnu.ai.mit.edu) * lpr.el (lpr-command): Make this autoload. * fill.el (justify-current-line): Fix escape syntax of regexp constant. 1992-08-31 Richard Stallman (rms@mole.gnu.ai.mit.edu) * files.el (enable-local-eval): Default value is `maybe'. (hack-local-variables): Ask just once about `eval:', not each time. 1992-08-31 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * loadup.el: Don't delete old DOC-M.N.O file if it doesn't exist. 1992-08-31 Richard Stallman (rms@mole.gnu.ai.mit.edu) * loadup.el: Delete old DOC-M.N.O file before copying to it. * c-mode.el (calculate-c-indent): Recognize the Emacs DEFUN macro. Do condition-case around sexp functions when checking for function arg decls. (c-fill-paragraph): Detect comment starting after code on current line. Exclude everything before line where comment starts. * add-log.el (add-log-current-defun): Fix test for LOCATION in range, for instace of DEFUN macro. * simple.el (open-line): Fix fill-prefix case. * loaddefs.el: Swap bindings of C-x a i l and C-x a i g. The former is now for mode abbrevs and the latter for global. 1992-08-30 Richard Stallman (rms@mole.gnu.ai.mit.edu) * mouse.el: Add bindings for down-mouse-1, drag-mouse-1, S-mouse-3, C-mouse-1. Add real keybindings for scroll bar commands. (help-menu-map): New tree of menu-maps, on C-mouse-2. (mouse-buffer-menu): New function. 1992-08-29 Richard Stallman (rms@mole.gnu.ai.mit.edu) * c-mode.el (calculate-c-indent): If taking indent from prev stmt and it starts with an {, subtract c-brace-offset. 1992-08-27 Richard Stallman (rms@mole.gnu.ai.mit.edu) * add-log.el (add-log-current-defun): Recognize Emacs DEFUN properly. 1992-08-24 Jim Blandy (jimb@pogo.cs.oberlin.edu) * rnewspost.el (news-setup): Don't use kill-line; that puts trash in the kill ring; instead, use delete-region. * mouse.el (mouse-kill, mouse-set-point): Remember that event-point does not always return a number; it may return `mode-line' or `vertical-line'. * simple.el (prefix-arg-internal): Make sure that the key sequence is a string before comparing it against "0" and "9". 1992-08-24 Richard Stallman (rms@mole.gnu.ai.mit.edu) * etags.el (etags-recognize-tags-table): Don't print message. 1992-08-21 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el: Doc fixes. 1992-08-19 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * sendmail.el (mail-signature-file): Undo the previous change - replace this with mail-signature. The manual has already gone to the printer. (mail-setup): Use mail-signature, rather than mail-signature-file. (mail-signature): Use "~/.signature", rather than mail-signature-file. (mail): Doc fix. 1992-08-19 Richard Stallman (rms@mole.gnu.ai.mit.edu) * rmail.el (rmail): Bind enable-local-variables, not inhibit... * sendmail.el (mail-setup): Don't use mail-signature-file if nonexistent. Insert just one newline if no signature. 1992-08-18 Richard Stallman (rms@mole.gnu.ai.mit.edu) * rmail.el (rmail-next-undeleted-message): No error at eob, just message. (This reverses the previous change.) 1992-08-17 Jim Blandy (jimb@pogo.cs.oberlin.edu) * sendmail.el (mail-signature): Variable replaced with... (mail-signature-file): This, since this is the way all the other lisp packages do it, and it's how people always say they want it on the mailing lists. (mail-setup, mail-signature): Adjusted accordingly. (mail): Doc fix. 1992-08-17 Richard Stallman (rms@mole.gnu.ai.mit.edu) * sort.el (sort-subr): No progress messages if sorting less than 50k. 1992-08-17 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * solar.el (sunrise-sunset): Get various values set properly when there is (or isn't) a double prefix arg. 1992-08-14 Jim Blandy (jimb@pogo.cs.oberlin.edu) * timer.el (run-at-time, timer-process-filter): The character used to separate the time from the token in input to the timer subprocess used to be ?\001, which is not human-readable. Make it ?@, which is. 1992-08-14 Richard Stallman (rms@mole.gnu.ai.mit.edu) * info.el (Info-find-node): Be more flexible about format of tags table. 1992-08-13 Richard Stallman (rms@mole.gnu.ai.mit.edu) * unrmail.el: New file. 1992-08-13 Jim Blandy (jimb@pogo.cs.oberlin.edu) * hideif.el (hide-ifdef-mode): Made this function autoload. (hide-ifdef-initially, hide-ifdef-read-only, hide-ifdef-lines): Make these variables autoload. 1992-08-12 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * compile.el (grep-regexp-alist): New defvar. (grep): Pass grep-regexp-alist to compile-internal. * etags.el (find-tag-noselect): If NEXT-P, (visit-tags-table-buffer 'same) first. * add-log.el: Add (provide 'add-log). 1992-08-12 Richard Stallman (rms@mole.gnu.ai.mit.edu) * add-log.el (change-log-mode): Make it autoload. 1992-08-12 Jim Blandy (jimb@pogo.cs.oberlin.edu) * frame.el (initial-frame-alist): Change the initial frame alist from ((minibuffer . nil)), which asks for no minibuffer, to ((minibuffer . t)), which asks for a minibuffer. * term/x-win.el: Don't call set-input-mode from here; it's already taken care of in x_term_init, which is called from Fx_open_connection. Rah. 1992-08-11 Jim Blandy (jimb@pogo.cs.oberlin.edu) * calendar.el, diary.el, diary-insert.el, holidays.el, cal-french.el cal-mayan.el, solar.el, lunar.el: Installed the latest update of this calendar stuff from that calendar guy, Ed Reingold. Entries for his changes have been inserted in this file, ordered by date amongst the rest of the changes. * diary-add.el: This has become diary-insert.el. * calendar.el (generate-calendar-window, update-calendar-mode-line, calendar-set-mode-line): Replace uses of screen-width with frame-width. * diary.el (simple-diary-entry, fancy-diary-entry): Same. 1992-08-11 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el (eval-expression): Doc fix. 1992-08-10 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * add-log.el (add-log-current-defun): Protect against "Unbalanced parens" error from down-list. 1992-08-10 Jim Blandy (jimb@pogo.cs.oberlin.edu) * frame.el (set-screen-width, set-screen-height): Make the docstring say that these are obsolete. (screen-width, screen-height, set-screen-width, set-screen-height): Apply make-obsolete to these. 1992-08-10 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * calendar.el (calendar-mode): Update mode line. * calendar.el (calendar-read-date): New function. (calendar-goto-date): Use it. * holidays.el (holidays): Optional prefix arg causes prompting for month and year. * calendar.el (calendar-interval): Fix doc string. * calendar.el (calendar): Changed use of prefix arg--now it causes prompting for the month and year. (regenerate-calendar-window): Renamed generate-calendar-window. Changed optional argument from an offset from the current month to a month, year pair. (redraw-calendar, calendar-current-month, scroll-calendar-left, calendar-other-month): Change calls from regenerate-calendar-window to generate-calendar-window. 1992-08-08 Richard Stallman (rms@mole.gnu.ai.mit.edu) * vc.el (vc-revert-buffer): Use yes-or-no-p. Doc fix. * Reinstalled a loaddefs.el backup dated Aug 4. The installed copy seems to be a very old version. 1992-08-08 Jim Blandy (jimb@pogo.cs.oberlin.edu) * frame.el (set-screen-width, set-screen-height): Changed these from fset aliases to actual functions, since they aren't supposed to take a frame argument, while set-frame-{width,height} do. 1992-08-07 Roland McGrath (roland@geech.gnu.ai.mit.edu) * add-log.el (add-log-current-defun): Handle ansidecl DEFUN macros. (change-log-mode): Doc fix. * add-log.el (add-log-current-defun): Use an intelligent regexps instead of many looking-at calls. Use memq instead of (or (eq x a) (eq x b)). Stupidity reigns. 1992-08-07 Jim Blandy (jimb@pogo.cs.oberlin.edu) * frame.el (set-frame-width, set-frame-height): Functions deleted *again*. Where did these come from? * bytecomp.el: Merged changes up to version 2.08 of the Zawinski-Furuseth compiler. Added a comment above the declaration of byte-compile-version indicating this, to assist future patchers. (byte-compile-warnings): Doc fix. (byte-recompile-directory): Ignore CVS subdirectories, as well as RCS dirs. * byte-opt.el: Correctly extract the components of a compiled function object. * bytecomp.el (byte-compile-warnings): Have this default to t, since Zawinski says everyone likes the warnings about unbound variables. * appt.el (appt-issue-message, appt-message-warning-time, appt-audible, appt-visible, appt-display-mode-line, appt-msg-window, appt-display-duration, appt-display-diary): Added ;;;###autoload cookies for these variables, since they are options for the user to set. * tex-mode.el (tex-shell-file-name, tex-directory, tex-offer-save, tex-run-command, latex-run-command, latex-block-names, slitex-run-command, tex-bibtex-command, tex-dvi-print-command, tex-alt-dvi-print-command, tex-dvi-view-command, tex-show-queue-command, tex-default-mode, tex-open-quote, tex-close-quote): Same. 1992-08-06 Roland McGrath (roland@geech.gnu.ai.mit.edu) * add-log.el (add-log-current-defun): Use eq instead of = when one side might be nil. * compile.el (compilation-mode-map): Change compilation-previous/next-file bindings to M-{ and M-}. 1992-08-05 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * cl.el (*cl-valid-named-list-accessors*, *cl-valid-nth-offsets*, byte-compile-named-accessors): Deleted. (first, second, ... tenth, rest): Define these with defsubst, to get the same effect. (byte-compile-ca*d*r): Deleted. (caar, cadr, ..., cddddr): Define these using defsubst. Installed changes from Zawinski-Furuseth 2.04 to 2.07: * byte-run.el (dont-compile): Doc fix. (make-obsolete-variable): New function. * bytecomp.el (byte-compile-log-1): Added new optional argument, FILL; if it is non-nil, reformat the error message. (byte-compile-warn): Use that flag. (byte-recompile-directory): Offer to recompile subdirectories. If prefix argument is zero, create .elc files for those .el files which lack them, without asking. (byte-compile-output-form, byte-compile-output-docform): Disable print-gensym while writing the form. (byte-compile-form): Warn if t or nil are called as functions. (byte-compile-variable-ref): Check for, and warn about, obsolete variable uses. (byte-set-marker, byte-string=, byte-string<, byte-setcar, byte-setcdr, byte-rem): Define these with byte-defop-compiler19, not plain byte-defop-compiler. (auto-fill-hook, blink-paren-hook, lisp-indent-hook, temp-buffer-show-hook, inhibit-local-variables): Declare these variables to be obsolete. * byte-opt.el (byte-optimize-apply): If the last argument to apply is a constant list, and we therefore decide to turn this into a funcall, then don't forget to quote all the elements of the constant list. * inf-lisp.el (inferior-lisp-filter-regexp, inferior-lisp-program, inferior-lisp-load-command, inferior-lisp-prompt, inferior-lisp-mode-hook, inferior-lisp): Added ;;;###autoload cookies for these. * bytecomp.el (byte-compile-warnings): When choosing the default value for this variable, don't forget to apply delq to a COPY of byte-compile-warning-types, so we don't nuke the `free-vars' flag altogether. 1992-08-04 Richard Stallman (rms@mole.gnu.ai.mit.edu) * rmail.el (rmail-search): Fix typo (premature ref to reversep). Choice of amount to increment n by was backwards. (rmail-search-backwards): Setting of reversep was backwards. 1992-08-04 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * compile.el (compilation-next-file): Use FILE instead of "This" in error for moving too far. 1992-08-04 Richard Stallman (rms@mole.gnu.ai.mit.edu) * comint.el (comint-mode-map): Set to nil at load time. * lint.el: File deleted. 1992-08-04 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * compile.el (compilation-parse-errors): Write progress messages on all regexp matches, not just errors. 1992-08-04 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * view.el (view-mode): teach this how to use help-char. * info.el (Info-mode): scroll-up, scroll-down now do the right thing for preorder browsing when the beginning/end of the node is visible. RET now goes to the next preorder node. These changes make sequential reading of info subtrees easier. 1992-08-04 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * appt.el (appt-make-list): Add ;;;###autoload cookie for this function. * vc-hooks.el: Removed autoloads; this task is better performed by the autoload cookies. * vc.el (vc-next-action, vc-register, vc-diff, vc-insert-headers, vc-directory, vc-create-snapshot, vc-retrieve-snapshot, vc-print-log, vc-revert-buffer, vc-cancel-version, vc-update-change-log): Added the ;;;###autoload cookies to these functions, since they get bound to keys in the global keymap. * loadup.el: Load vc-hooks.el. 1992-08-03 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * compile.el (compile-error-at-point): New function. (compilation-next-error): Use it. (compile-file-of-error): New function. (compilation-next-file, compilation-previous-file): New functions. (compilation-mode-map): Bind C-x [ and C-x ] to them. 1992-08-03 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * compile.el (next-error): Call compile-reinitialize-errors with 3rd arg of ARGP-1, not ARGP. (compile-reinitialize-errors): Don't need to parse if compilation-parsing-end is past LIMIT-SEARCH. (compilation-next-error): Rewritten to use compile-reinitialize-errors limiting args. (compile-reinitialize-errors): Don't parse at all if compilation-parsing-end is at (point-max). * loaddefs.el (complete-tag): Define here to always error; loading etags will redefine it. * etags.el (complete-tag): Error if no tags table loaded. 1992-08-03 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * ebuff-menu.el, echistory.el, help.el, hexl.el: teach these packages to use help-char, and add the appropriate magic to doc strings. 1992-08-03 Richard Stallman (rms@mole.gnu.ai.mit.edu) * gud.el (gud-def): If KEY is nil, don't make a binding. 1992-08-03 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * diary.el (print-diary-entries): Rewrote to work for either simple or fancy diary display. (add-diary-heading): Deleted--incorporated into print-diary-entries. * calendar.el (print-diary-entries-hook): Change default value. 1992-08-03 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * add-log.el (change-log-mode): Doc fix. * map-ynp.el (map-y-or-n-p): Use key-description for USER-KEYS. 1992-08-03 Jim Blandy (jimb@pogo.cs.oberlin.edu) * simple.el (current-kill): Reinstate interprogram-paste feature. It doesn't seem to be wedged for me, and I can't find out how it is wedged unless it's enabled. * terminal.el (terminal-map, terminal-escape-map, terminal-more-break-map): Apply fillarray to the cadr of the map, not to the map itself; dense keymaps are no longer vectors. * ehelp.el (electric-help-map): Same here. * bytecomp.el (byte-compile-file): Don't catch errors here. (displaying-byte-compile-warnings): Catch them here. This way, errors get caught no matter which compilation entry point we use; anyplace that can report warnings, also catches errors. * sun-cursors.el: Require 'cl, for the sake of the push macro. (sc::pic-ins-at-mouse): Call move-to-column with the FORCE argument true, instead of calling an unknown function named `move-to-column-force'. * medit.el (medit-zap-define-to-mdl): Fix interactive spec. (medit-zap-define-to-mdl): Change `medit-save-defun' to `medit-save-define'. (medit-save-region, medit-save-buffer, medit-zap-define-to-mdl): Changed `medit-go-to-mdl' to `medit-goto-mdl'. Did anyone ever try this code? 1992-08-02 Richard Stallman (rms@mole.gnu.ai.mit.edu) * comint.el: Fix message syntax. (comint-previous-similar-input): Use error, not message. * files.el (save-some-buffers): Use C-r, not v, to look at a buffer. Use view-buffer and a recursive edit to do it. * view.el: Delete key bindings for C-x v and C-x 4 v. (View-scroll-lines-forward, view-helpful-message): Use view-exit, not exit-recursive-edit. * map-ynp.el: Fix prompt. * dired.el (dired-why): Don't use save-excursion. (dired-change-marks): New command. (dired-mode-map): Put dired-change-marks on c. Put dired-do-kill-lines on k. * dired-aux.el: Require dired.el for compilation. (dired-bunch-files): Was duplicating PENDING in apply calls. Fixed. (dired-do-shell-command, dired-run-shell-command): Delete arg IN-BACKGROUND; rely on including & at end of command. (dired-run-shell-command): Return nil. (dired-do-shell-command): Accept COMMAND as arg; use minibuf within `interactive'. (dired-create-files, dired-handle-overwrite): Rename overwrite-confirmed to dired-overwrite-confirmed. (dired-do-kill-lines): Handle prefix arg as number of lines to kill. (dired-kill-line-or-subdir): Deleted. 1992-08-01 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * mailabbrev.el [from jwz] (mail-interactive-insert-alias): Do mail-aliases-setup if necessary before completing for interactive. (build-mail-aliases): Changed parsing regexp. * compile.el (compilation-parse-errors): Take 2nd arg FIND-AT-LEAST. If non-nil, stop after parsing that many new errors. (compilation-parse-errors-function): Document 2nd arg. (compile-reinitialize-errors): Take optional 3rd arg; pass to parser. (next-error): Pass repeat count to compile-reinitialize-errors. * diff.el (diff-parse-differences): Take same new arg. * reposition.el (C-l): Fix typo. 1992-08-01 Richard Stallman (rms@mole.gnu.ai.mit.edu) * comint.el: ring-* functions deleted--get them from ring.el. * ring.el (ring-mod): Renamed from comint-mod. Provide `ring', not history'. (make-ring, ring-p): Add autoloads. * history.el: Link deleted. * c-mode.el (c-up-conditional): New function. * add-log.el (add-log-current-defun): In C and Lisp, verify the defun really starts at or before the original point. 1992-08-01 Jim Blandy (jimb@pogo.cs.oberlin.edu) * mailalias.el: Provide 'mailalias. * mailpost.el: Require 'mailalias and 'sendmail, since we use expand-mail-aliases and mail-do-fcc. * mail-extr.el (mail-extract-address-components, variant-method): Use buffer-disable-undo instead of buffer-flush-undo; the latter is obsolete. * lpr.el (print-region-new-buffer): Added arguments START and END; this used to use dynamic scope, but it makes things less readable. (print-region-1): Always call this with two arguments, not sometimes two and sometimes none. * lint.el: Require 'compile. (compilation-convert-lint): Call set-buffer with only one argument. * life.el: Move the definitions of the macros out of the require clause; the new compiler seems to handle the macros correctly. (life): Add an autoload cookie for this. (life-display-generation): If the sit-for returns before the timeout has elapsed, exit the life loop. * ledit.el (ledit-setup): Use shared-lisp-mode-map, instead of lisp-mode-commands. * kermit.el (kermit-send-input-cr): comint-send-input doesn't accept any arguments. Instead of applying comint-send-input to "\r", call comint-send-input on no arguments, and then use comint-send-string to send the carriage return. (kermit-clean-filter): Call re-search-backward, not re-search-backware. (kermit-clean-on): Remove extra quote from doc string. * informat.el (batch-info-validate): Don't pass any arguments to Info-tagify; it doesn't want any. * hideif.el (hif-endif-to-ifdef): Fix munged comment which was interfering with parsing. * hexl.el (hexl-next-line): Fixed up malformed let binding. * bytecomp.el (byte-compile-file): Catch errors that occur during compilation, and record them in the compilation log. This allows us to find the name of the guilty file when we get a "invalid read syntax" error or some such. * gud.el: Require `etags', not `tags'. (sdb): Move interactive spec to top of function, just under doc string. (gud-read-address, send-gud-command): Use the point and point-max function instead of dot and dot-max; the latter two are obsolete. * gnus.el (gnus-Group-mode, gnus-Subject-mode, gnus-Subject-rmail-digest, gnus-Article-mode, gnus-output-to-rmail, gnus-output-to-file): Use buffer-disable-undo, instead of buffer-flush-undo; the latter is an obsolete name. * simple.el: Bind the `next' and `prior' function keys to next-history-element and previous-history-element in the minibuffer maps. Clean up binding code. * two-column.el: Doc fixes. * loaddefs.el (function-keymap): Definition deleted; this has been superceded by function-key-map. * gomoku.el (gomoku-mode-map): Use function key symbols, instead of the keypad.el facilities. * edt.el: Converted to use the new function key events instead of keypad.el. Don't require keypad. Change global key bindings. (advance-direction, backup-direction): Bind the function key symbols directly in the global map, not in function-keymap. (edt-emulation-on): Doc fix. This function will now work when called simply from .emacs; it doesn't need to be run after the terminal-dependent file has been loaded. * cl.el (byte-compile-named-list-accessors, byte-compile-ca*d*r): Change these to work correctly with the Zawinski-Furuseth byte compiler. 1992-07-31 Robert J. Chassell (bob@churchy.gnu.ai.mit.edu) * loaddefs.el: New keybinding, `C-x r y', for `yank-rectangle'. 1992-07-31 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * calendar.el (calendar-string-spread): New function. (calendar-mode-line-format): Redefine it. (calendar-set-mode-line): Rewrite using new function. (update-calendar-mode-line): Rewrite using new function. 1992-07-31 Richard Stallman (rms@mole.gnu.ai.mit.edu) * startup.el (command-line-1): Mention info in startup message. 1992-07-30 Richard Stallman (rms@mole.gnu.ai.mit.edu) * byte-opt.el (byte-optimize-plus): Don't entirely eliminate the call. (byte-optimize-minus): Likewise. (byte-optimize-multiply,(byte-optimize-divide): Likewise. 1992-07-30 Roland McGrath (roland@geech.gnu.ai.mit.edu) * compile.el (compile-goto-error): Set compilation-error-list to the one we want, not the one before it. (next-error): Use the ARGP-1th, not ARGPth cdr of compilation-error-list. 1992-07-30 Jim Blandy (jimb@pogo.cs.oberlin.edu) * bytecomp.el (byte-compile-warnings): By default, do not display warnings about references free variables. 1992-07-30 Richard Stallman (rms@mole.gnu.ai.mit.edu) * sendmail.el (mail): Get rid of the multiple mail buffer feature. 1992-07-29 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * calendar.el (general-holidays, hebrew-holidays, local-holidays, christian-holidays, islamic-holidays, solar-holidays, other-holidays): New variables. (calendar-holidays): Use them to define the default value. 1992-07-29 Richard Stallman (rms@mole.gnu.ai.mit.edu) * comint.el (comint-mode-map): comint-previous-similar-input now M-r. (comint-previous-similar-input): Initialize comint-input-ring-index if nil. (comint-previous-input-matching): Report ordinary error if fail. Initialize comint-input-ring-index if nil. (comint-next-similar-input): New command, on M-s. (comint-previous-input): Always delete what was already given for the next input. Initialize comint-input-ring-index if nil. (comint-send-input): Set comint-input-ring-index to nil. * field.el, cmushell.el: Files deleted. * co-isearch.el: File deleted; comint should have M-r and M-s like the minibuffer, instead. 1992-07-29 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * diff.el: Everything but diff and diff-backup removed. (diff-regexp-alist): New defvar. (diff-parse-differences): New defun. (diff): Use compile-internal. Take optional arg SWITCHES; interactively, prompt if prefix arg. (diff-backup): Take same new arg. Make this autoload. * compile.el (compilation-parse-errors): No message when we stop at LIMIT-SEARCH. (compile-reinitialize-errors): Don't short-circuit if passed a non-nil LIMIT-SEARCH. (compilation-next-error): New; bound to M-n. (compilation-previous-error): New; bound to M-p. 1992-07-28 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * compile.el (compilation-mode-map): Bind SPC, DEL, M-n, M-p. 1992-07-28 Richard Stallman (rms@mole.gnu.ai.mit.edu) * texinfo.el (texinfo-mode-map): Move M-} and M-{ to C-c prefix. * simple.el (delete-indentation): Delete fill prefix from after join. 1992-07-28 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * map-ynp.el (map-y-or-n-p-help): Remove. (map-y-or-n-p): Take new arg ACTION-ALIST. Compute help string fully instead of using map-y-or-n-p-help. * files.el (save-some-buffers): Pass new arg to map-y-or-n-p, so `v' displays the buffer. Change save-excursion to save-window-excursion; it was only there to restore the current buffer, and now display-buffer might change windows. * compile.el (compilation-parse-errors): Fix M-t-o on `found-desired'. (compilation-error-list): Doc fix. (compile-internal): Document to return the buffer. (next-error): Simplify code to set NEXT-ERRORS from compilation-error-list and ARGP. (compile-goto-error): Rewrote searching so it finds the error that point is in or after; the error need not start at bol. Restore current buffer after calling other-window. 1992-07-28 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * holidays.el (calendar-holiday-function-sexp): New function. *calendar.el (calendar-holidays): Describe it and use it for daylight saving. * calendar.el, cal-mayan.el, cal-french.el: Change names of all calendar-goto-next- or calendar-goto-previous- commands to eliminate the word "goto". Change names of all cursor-to-***-calendar-date commands to calendar-print-***-date. * diary.el (sort-diary-entries): New function. 1992-07-28 Richard Stallman (rms@mole.gnu.ai.mit.edu) * files.el (backup-extract-version): Copied from Emacs 18. (find-backup-file-name): Use that. * dired-aux.el (dired-clean-directory): Moved here. (dired-map-dired-file-lines, dired-collect-file-versions): (dired-trample-file-versions): Likewise. * dired.el: Moved from here. (dired-clean-directory): Auto load added. * add-log.el (add-change-log-entry): Chase symlinks. 1992-07-27 Richard Stallman (rms@mole.gnu.ai.mit.edu) * gud.el (gdb, dbx, sdb): Change C-c LETTER commands to C-c C-LETTER. * add-log.el (add-log-current-defun): Handle C macros. Handle the DEFUN macro used in Emacs C sources. 1992-07-27 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * compile.el (compilation-parse-errors): Take arg LIMIT-SEARCH; if non-nil stop parsing when we pass that location. (compilation-parse-errors-function): Document arg. (compile-reinitialize-errors): Take optional 2nd arg; pass to parser. (compile-goto-error): Pass (point) to compile-reinitialize-errors. * compile.el (compile-goto-error): Doc fix. * etags.el (find-tag): Fixed prompt. (tag-exact-match-p): Rewritten (again). * startup.el (command-line): Load site-start here. (normal-top-level): Not here. * etags.el: Remove M-? binding; move M-TAB binding to after defun. 1992-07-27 Richard Stallman (rms@mole.gnu.ai.mit.edu) * completion.el: Moved to external-lisp. * diff.el (diff-rcs, diff-sccs): Deleted. 1992-07-27 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * tar-mode.el (tar-subfile-save-buffer): whoever changed current-time forgot to check for breakage. Added code to print the seconds parts of a (current-time) value as 11 octal digits (yes, this is nontrivial). 1992-07-26 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el (next-history-element): Fix error messages. (previous-matching-history-element): Likewise. * help.el (describe-function): Don't give the file name in the case of an autoloaded function. * lisp-mode.el (emacs-lisp-mode-map, lisp-interaction-mode-map): Add M-TAB as lisp-complete-symbol. * loaddefs.el: Delete binding of M-TAB. * etags.el: Add binding of M-TAB. 1992-07-26 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * etags.el (tags-exact-match-p): Rewritten. (tags-with-syntax): New macro. 1992-07-26 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * calendar.el (calendar-cursor-to-date): Change `current-day' to `starred-day'. (calendar-star-date): Create and set buffer local var `starred-day'. (calendar-mode): Don't create buffer local vars current-month, current-day, current-year. (regenerate-calendar-window, calendar-current-date): Don't set buffer local vars current-month, current-day, current-year. (calendar, redraw-calendar, scroll-calendar-left, calendar-other-month, calendar-goto-date, calendar-goto-hebrew-date, calendar-goto-julian-date, calendar-goto-islamic-date, calendar-goto-iso-date): Use `calendar-current-date' instead of buffer local vars current-month, current-day, current-year. 1992-07-26 Richard Stallman (rms@mole.gnu.ai.mit.edu) * diff.el (diff-backup): New function. (diff-last-backup-file): Renamed from dired-last-backup-file. * dired-aux.el (dired-backup-diff): Use diff-backup. (dired-last-backup-file): Moved and renamed. * dired.el, dired-aux.el (dired-diff, dired-backup-diff): Doc fixes. * help.el (command-apropos): Fix call to apropos for new arg. * finder.el (finder-by-keyword): Rewrite to read args in `interactive' and use with-output-to-temp-buffer. * startup.el (normal-top-level): Load site-start if it exists. * add-log.el (add-log-current-defun): In C, when moving back over arg decls, stop at beg of buffer. (add-change-log-entry): Likewise for blank lines at end of buffer. * picture.el (picture-mode-old-major-mode): Declared. (picture-mode-old-mode-name, picture-mode-old-local-map): Likewise. (picture-mode-map): Don't use aset directly; use define-key. * saveconf.el: File deleted. * rmail.el (rmail-search): Accept repeat count. (rmail-search-backwards): New command, on M-r. * simple.el (previous-matching-history-element): New command. On M-r. (next-matching-history-element): New command. On M-s. 1992-07-24 Richard Stallman (rms@mole.gnu.ai.mit.edu) * c-mode.el (c-beginning-of-statement): If in string or comment, move by sentences. * compile.el (compile-history): New variable. (compile): Specify history list copile-history, with compile-command as initial contents. (grep): Specify constant "grep -n" as initial input, and history list grep-history. (grep-command): Variable deleted. * replace.el (query-replace-read-args): New function. It reads two args using query-replace-history. (query-replace, query-replace-regexp, replace-string): (replace-regexp): Use query-replace-read-args. (map-query-replace-regexp): Read args using query-replace-history. (perform-replace): Add local binding for `char'. * dired.el: Don't check for version 18. (dired-file-version-alist): New defvar. Use this instead of file-version-assoc-list. (dired-shrink-to-fit): Default is always t. (dired-internal-do-deletions): remove-directory => delete-directory. * abbrev.el (define-abbrevs): Bind name, hook, exp, count. * replace.el (perform-replace): Fix typo: match-after => match-again. (map-query-replace-regexp): Delete duplicate definition. * subr.el (defun-inline): Commented out. * comint.el (comint-input-ring*): Renamed from input-ring*. (ring-remove, ring-rotate): use setcar, not set-car. * co-isearch.el: input-ring* renamed to comint-input-ring*. * tex-mode.el: Don't require comint. * comint.el (make-comint): Make this autoload. * case-table.el (describe-buffer-case-table): Move the describe-vector inside the let. * c++-mode.el (indent-c++-exp): Fix typo "innerloop-done". Make last-depth local. 1992-07-23 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * flow-ctrl.el: fixed set-input-mode call broken by new third arg for meta control. 1992-07-23 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * calendar.el (cursor-to-islamic-calendar-date, cursor-to-hebrew-calendar-date): Add phrase "until sunset" to message. * calendar.el (calendar-goto-astro-day-number, calendar-print-astro-day-number): New functions. (calendar-mode): Put them on keys and describe them. * diary.el (diary-astro-day-number): New function. * diary.el (diary-julian-date): New function. 1992-07-23 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el (current-kill): Ignore the interprogram paste feature; it is wedged. * paths.el (mh-lib, mh-prog): Add more alternatives. 1992-07-22 Richard Stallman (rms@mole.gnu.ai.mit.edu) * emerge.el (emerge-startup-hook, emerge-quit-hook): Renamed from ...-hooks. * dired.el (dired-display-file): New command, on C-o. * files.el (ctl-x-4-map): display-buffer is now C-x 4 C-o. 1992-07-22 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * etags.el (visit-tags-table-buffer): Look for a tags table containing buffer-file-name's tags. 1992-07-22 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * etags.el (last-tag): New defvar. (find-tag-noselect): Set and use it. 1992-07-22 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * edebug.el, gnus.el, gnusmail.el, gnusmisc.el, gnuspost.el, hideif.el, isearch-mode.el, mh-e.el, mhspool.el, netunam.el, nnspool.el, nntp.el, scheme.el, xscheme.el: Removed RCS "$Header" and "$Log" files; K. Richard Pixley <rich@cygnus.com> says they cause trouble with patches. 1992-07-22 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * etags.el (find-tag-noselect): Properly return find-tag-in-order's value. 1992-07-22 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * bytecomp.el: Removed relative jump instructions. (byte-rel-goto-ops): Variable deleted. (byte-compile-lapcode): Code to recognize potential relative jumps and patch the PC into relative jumps removed. * byte-opt.el (disassemble-offset, byte-decompile-bytecode-1): Support for relative jumps removed. 1992-07-22 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * Removed all Last-Modified headers. 1992-07-21 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * files.el (trim-versions-without-asking): Non-nil, non-t value suppresses all trimming of excess backups. This is so we can make the @!%$@ question at save time go away.... 1992-07-21 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el (kill-ring-save): Display only if interactive-p. * c-mode.el (c-backslash-region): New command. (c-append-backslash, c-delete-backslash): New functions. * c++-mode.el (c++-macroize-region, backslashify-current-line): Deleted. (c++-comment-region, c++-uncomment-region): Deleted. comment-region works just fine. (c++-beginning-of-defun, c++-end-defun, c++-indent-defun): Deleted. (c++-point-bol): Renamed from point-bol. (c++-within-string-p): Renamed from within-string-p. (c++-count-char-in-string): Renamed from count-char-in-string. (fill-c++-comment): Renamed from fill-C-comment. (c++-insert-header): Deleted. 1992-07-21 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * inf-lisp.el: When creating inferior-lisp-mode-map, use shared-lisp-mode-map, instead of calling the function lisp-mode-commands; that doesn't exist any more. (inferior-lisp-args-to-list): Recurse, rather than calling tea-args-to-list, which doesn't exist. (inferior-lisp-mode): Always call lisp-mode-variables with one argument; there's no longer any need to adapt to different versions of Emacs. 1992-07-21 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * calendar.el (calendar-set-mode-line): New function. (list-yahrzeit-dates): Use it for mode line. * diary.el (simple-diary-display, fancy-diary-display): Use it for mode line. * diary.el (show-all-diary-entries): Use default mode line. * lunar.el (calendar-phases-of-moon): Use it for mode line. * holiday.el (list-calendar-holidays, calendar-cursor-holidays): Use it for mode line. 1992-07-21 Richard Stallman (rms@mole.gnu.ai.mit.edu) * dired.el (dired-remember-hidden): Fix typo in `following-char'. * add-log.el (add-change-log-entry): Avoid spurious whitespace when making new entry. Delete excess blank lines. Really don't use "ChangeLog" as the file name in the entry. Always put a space after the colon. (add-log-current-defun): Verify the defun actually contains point. Handle the lines of a C function before the open brace. * rmail.el (rmail-undelete-previous-message): Don't catch errors. * simple.el (end-of-buffer): If buffer end is on screen, don't scroll. * c-mode.el (set-c-style): Deleted the first version of this function. It was badly written. Modified the remaining version by adding new argument GLOBAL and setting the parameters locally if GLOBAL is nil. 1992-07-21 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * Turfed r2bibtex.el. Refbib.el turns out to be a newer version of the same package. * Installed co-isearch.el, new gud.el (1.19) 1992-07-21 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * frame.el (get-frame): Renamed to get-other-frame; get-frame sounds like a parallel to get-buffer or get-process. * c-mode.el (set-c-style): Remove the extraneous copy of this function. * c++-mode.el (within-string-p): Use `%', not `mod', as the name of the modulus function. * frame.el (frame-height, frame-width): Fixed several confusions here. * blackbox.el: When building blackbox-mode-map, locally rebind all keys to which the movement commands are bound to blackbox's movement functions. Define the insert and kp-enter keys. 1992-07-20 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * blackbox.el (blackbox): Doc fix. (bb-outside-box): For some reason, this function was replaced by the comment ";; blackbox.el ends here" * dired.el (dired): Doc fix. 1992-07-20 Richard Stallman (rms@mole.gnu.ai.mit.edu) * sendmail.el (mail-send-and-exit): Just switch windows if the next window is in Rmail mode. 1992-07-20 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * simple.el (set-variable): If VAR has a `variable-interactive' property, use it as an interactive spec to prompt for VAL. * etags.el (tags-file-name): Give it a variable-interactive property. * etags.el (tags-table-format-hooks): Remove ctags-recognize-tags-table * ctags.el: Removed. (visit-tags-table): Don't call abbreviate-file-name. (visit-tags-file): If find-file-noselect changed the file name, propagate the change to tags-file-name and tags-table-list. * startup.el (command-line): Fixed typo in comment. 1992-07-20 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * bytecomp.el (byte-compile-warnings): Include the full documentation given in the comments at the top of the file in this variable's docstring. 1992-07-19 Richard Stallman (rms@mole.gnu.ai.mit.edu) * dired.el (dired-mark): Use prefix-numeric-value. * simple.el (kill-ring-save): Say "saved", not "killed", in messages. Let message do the formatting. * fill.el (fill-individual-paragraphs): If MAILP, skip indented headers and blank lines. * register.el (window-configuration-to-register): New function. (frame-configuration-to-register): New function. * loaddefs.el: Put them on C-x r w, C-x r f. * window.el (window-config-to-register, register-to-window-config): Deleted, along with keybindings C-x 6 and C-x 7. 1992-07-19 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * cal-mayan.el: New file. The only functions visible to the outside world are calendar-goto-mayan-date, calendar-next-haab-date, calendar-previous-haab-date, calendar-next-tzolkin-date, calendar-previous-tzolkin-date, calendar-next-calendar-round-date, calendar-previous-calendar-round-date, diary-mayan-date, and cursor-to-mayan-calendar-date. * diary.el: Autoload diary-mayan-date. * calendar.el: Autoload the 7 "goto" functions. (calendar-mode-map): Put them on keys. (calendar-mode): Describe them. * cal-french.el (french-calendar-month-name-array): Add accents to month names. (cursor-to-french-calendar-date): Add accents. * cal-french.el (calendar-goto-french-date): New function. * calendar.el: Autoload it. (calendar-mode-map): Put it on a key. (calendar-mode): Describe it. * cal-french.el (diary-french-date): Moved from diary.el and fixed accent. * diary.el: Move dairy-french-date to cal-french.el and autoload it. * diary-insert.el: Move all diary inserting commands from diary.el * diary.el: Move all diary inserting commands to diary-insert.el * calendar.el: Change autoloads for all diary inserting commands from diary.el to diary-insert.el. * calendar.el: Put ";;;###autoload" before calendar function and before list-yahrzeit-dates function. * holiday.el: Put ";;;###autoload" before holiday function. * diary.el: Put ";;;###autoload" before diary function. * cal-french.el: New file. All French Revolutionary calendar code from calendar.el has been moved here. * calendar.el: All French Revolutionary calendar code moved to a new file, cal-french.el. Autoload cursor-to-french-calendar-date. * diary.el (list-sexp-diary-entries): Add mention of diary-sunrise-sunset, diary-lunar-phase, and diary-sabbath-candles to doc string. * calendar.el (list-yahrzeit-dates): Prompt for date of death if not called from the calendar window. This function should now be known to the outside world. * calendar.el (diary-file): Add mention of diary-sunrise-sunset, diary-lunar-phase, and diary-sabbath-candles to doc string. 1992-07-18 Richard Stallman (rms@mole.gnu.ai.mit.edu) * bytecomp.el (compile-defun): Use displaying-byte-compile-warnings. (byte-compile-warn): Don't display the warning now, just log it. * files.el (auto-mode-alist): Recognize .texi. * rmail.el (rmail-delete-forward): Removed the feature of moving back if there's nowhere to go forward. 1992-07-17 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * etags.el (visit-tags-table-buffer): Call abbreviate-file-name on the argument before setting tags-file-name. * files.el (automount-dir-prefix): New variable. (abbreviate-file-name): Remove the automount prefix here, rather than in find-file-noselect. Use automount-dir-prefix. (find-file-noselect): Don't remove the automount prefix here; let abbreviate-file-name take care of it. 1992-07-17 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * Keywords added for [n-z]*.el. Finder now under construction. 1992-07-17 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * rmail.el (rmail-insert-inbox-text): Generate an alternate name to use for tofile by appending a `+' to file, not a `~'; files ending with the latter may be deleted accidentally when space is low. 1992-07-17 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * Keywords added for [a-m]*.el. The keyword categories will probably need some tuning, but at least this will suffice for testing the finder code. * makefile.el, two-column.el, sgml-mode.el, resume.el, mail-extr.el: Installed. 1992-07-16 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * Changed all copying notices to GPL version 2. 1992-07-16 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * Finished decorating the library files with new standard headers. 1992-07-16 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * disass.el: Require `byte-compile', not 'bytecomp'. * bytecomp.el (byte-compile-file): Correct parens in interactive form so that it returns a list containing the filename and the prefix argument, not just the prefix argument by itself. * bytecomp.el (byte-compile-file): Changed reference to byte-compile-report-call-tree to use display-call-tree. * bytecomp.el (byte-recompile-directory, byte-compile-file, batch-byte-compile, byte-compile, compile-defun, display-call-tree): Added autoload cookies for these functions. 1992-07-16 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * etags.el: Major rewrite with many new features. * ctags.el: New file; goes with new etags.el. 1992-07-16 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * byte-run.el (defsubst): Removed extra closing paren at the end of this function. 1992-07-16 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * At RMS's request, all occurrences of `elisp' changed to `Emacs Lisp'. * New library headers for [fghijklmn]*.el. First steps towards keyword-based code finder via Keywords header. 1992-07-15 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * New library headers for [opqrst]*.el. Ghod, this is boring. 1992-07-15 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * lunar.el: New file. The only functions known to outside world are calendar-phases-of-moon, diary-phases-of-moon, and phases-of-moon. * calendar.el (calendar-mode): Put calendar-phases-of-moon on a key and describe it. * diary.el: Autoload diary-lunar-phase. 1992-07-15 Richard Stallman (rms@mole.gnu.ai.mit.edu) * loaddefs.el: Added C-x a, C-x r and C-x n as prefixes. Removed old C-x a, C-x g, C-x j, C-x n, C-x p, C-x r, C-x x, C-x w. Also C-x /, C-x C-a, C-x C-h, C-x +, C-x -. Added bindings for function keys insert-line, delete-line, delete-char. * bytecomp.el: Deleted support for running compiler in Emacs 18. Spell "Emacs 18" properly. (byte-compile-version): FSF 2.1. (byte-compiler-valid-options): Deleted. (byte-compile-single-version): Always return nil. (byte-compiler-version-cond): Always return the argument. * loaddefs.el: Key bindings moved here. * simple.el: From here. 1992-07-14 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * byte-opt.el (byte-boolean-vars): Rebuilt for Emacs 19. * screen.el: Renamed to frame.el. The term is no longer `screen', but `frame'. All variables and functions renamed. * x-menu.el, window.el, sup-mouse.el, sun-mouse.el, subr.el, startup.el, sendmail.el, register.el, prompt.el, mlconvert.el, loadup.el, ispell.el, isearch.el, holidays.el, fortran.el, files.el, etags.el, emerge.el, electric.el, edebug.el, dired.el, diary.el, csharp.el, compile.el, comint.el, calendar.el, buff-mune.el, bg-mouse.el, appt.el, abbrevlist.el, term/x-win.el, term/wyse50.el, term/vt200.el, term/vt100.el: All uses changed. * screen.el (screen-height, screen-width, set-screen-height, set-screen-width): Defined as aliases for frame-height, frame-width, set-frame-height, and set-frame-width. (set-frame-height, set-frame-width): Functions deleted; they are defined in frame.c. 1992-07-14 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * [uvwxy]*.el: Added headers for new Emacs Lisp documentation conventions. 1992-07-14 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * calendar.el (calendar-mode): Change key bindings for all functions to make them consistent with Version 19 requirements. 1992-07-13 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * comint.el: minor changes to comments to reflect the fact that comint has won its war and replaced shell mode. 1992-07-13 Richard Stallman (rms@mole.gnu.ai.mit.edu) * rmailsort.el: Change copyright to FSF; update permission notice. * byte-run.el: Delete compatibility definition of make-byte-code. (byte-compiler-options): Commented out. (proclaim-inline, proclaim-notinline): Commented out. * byte-opt.el: Change several doc strings to comments. They had the wrong format anyway. Delete the `require' and the test for wrong compiler version. * disass.el: Require just bytecomp, not byte-opt. * bytecomp.el (emacs-lisp-file-regexp): Renamed from elisp-source-file-re. All uses changed. (byte-compile-dest-file): Don't use that var. (compile-defun): Renamed from elisp-compile-defun. (byte-compile-report-ops): Define unconditionally. It's a bad idea to make function definitions of moderate size conditional on anything. (byte-compile-and-load-file): Commented out. (byte-compiler-valid-options): Renamed from byte-compiler-legal-options. (byte-compile-overwrite-file): Variable deleted. (byte-compile-file): Don't use that var. (byte-compile-compatibility): Renamed from byte-compile-emacs18-compatibility. (byte-compile-generate-emacs19-bytecodes): Variable deleted. Use byte-compile-compatibility instead. (byte-compiler-options-handler): Deleted. (byte-compile-body-do-effect, byte-compile-form-do-effect): Use defsubst, not proclaim-inline. * byte-opt.el: Renamed from byte-optimize.el. * byte-run.el: Renamed from bytecomp-runtime.el. * bytecomp.el, loadup.el: References to those files fixed. * bytecomp.el: Style corrected in calls to error. Many doc strings corrected in style. Repeated the following changes: * bytecomp.el (byte-compile-file): Don't put file name in minibuffer. (byte-compile-buffer): Function commented out. 1992-07-13 Roland McGrath (roland@geech.gnu.ai.mit.edu) * loaddefs.el (completion-ignored-extensions): nconc together list of common extensions and list of unix or vms-specific ones. 1992-07-13 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * simple.el (kill-region): The variable `undo-high-threshold' has been renamed to `undo-strong-limit'. Change its use here. 1992-07-13 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * calendar.el (exit-calendar): Bury buffers instead of killing them. (european-calendar-display-form, american-calendar-display-form): Make comma after day name conditional so it's available for more general use. (calendar-date-string): Make dayname nil instead of the empty string. (cursor-to-julian-calendar-date, cursor-to-islamic-calendar-date, cursor-to-hebrew-calendar-date, list-yahrzeit-dates): Use nodayname form of display. * diary.el (diary-islamic-date, diary-hebrew-date, insert-diary-entry, insert-anniversary-diary-entry, insert-block-diary-entry, insert-cyclic-diary-entry, insert-hebrew-diary-entry, insert-islamic-diary-entry): Use nodayname form of display. 1992-07-11 Richard Stallman (rms@mole.gnu.ai.mit.edu) * c-mode.el (calculate-c-indent): Don't indent as argdecl after apparent function decl inside a comment. 1992-07-10 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * bytecomp.el: Replaced with Jamie Zawinksi's byte compiler. * byte-optimize.el, bytecomp-runtime.el: New files, supporting bytecomp.el. * loadup.el: Load bytecomp-runtime into the dumped Emacs. * disass.el: New version of the disassembler, to fit with the new compiler. * mouse.el (mouse-select-buffer-line): Removed extraneous setting of the variable `the-buffer'; it's never used elsewhere. * mouse.el (mouse-kill): Don't set the mark; pass point and the click's position to kill-region directly. 1992-07-09 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * abbrev.el (write-abbrev-file): Removed extraneous interactive spec. * screen.el (current-screen-configuration, set-screen-configuration): New functions. * buff-menu.el (buffer-menu): Make ARG an optional argument. * screen.el (iconify): Call the function `make-screen-visible' instead of `deiconify-screen'; the latter no longer exists. * files.el (find-backup-file-name): Replace the reference to `backup-extract-version' with a literal `function' form. This eliminates the use of dynamic binding, and allows us to remove backup-extract-version, which doesn't really want to be its own function. (backup-extract-version): Function removed. * help.el (help-with-tutorial): Zap the value of `buffer-auto-save-file-name', not `auto-save-file-name'. * loadup.el: Don't forget to garbage-collect after loading each file. Yes, some of the files are small enough that it won't make much of a difference, but there's no reason not to garbage collect here (other parts of the build process are much slower), and these files might grow. * startup.el (command-line): Comment out the code which chooses a default value for split-window-keep-point; let's see if we can live without this option. 1992-07-08 Richard Stallman (rms@mole.gnu.ai.mit.edu) * terminal.el (te-set-escape-char): Improve messages. 1992-07-07 Richard Stallman (rms@mole.gnu.ai.mit.edu) * etags.el (find-tag): Don't set tags-loop-form. 1992-07-06 Richard Stallman (rms@mole.gnu.ai.mit.edu) * sendmail.el (mail-do-fcc): Call rmail-set-message-counters. 1992-07-06 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * etags.el (visit-tags-table): Remove automounter prefixes before setting tags-file-name. 1992-07-06 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * Moved gdb.el to =gdb.el. The autoload generation for loaddefs.el was getting screwed up by the conflicting autoloads generated from gdb.el and gud.el. In any case gdb.el is obsolete; we're using the gdb entry point of gud.el now. * Installed tq.el. 1992-07-06 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * tex-mode.el (tex-file): Fix reference to tex-offer-save. 1992-07-05 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * tex-mode.el: Require comint instead of oshell. (tex-start-shell): Use comint, not oshell. (tex-filter): Deleted function; no filter is now longer needed. * tex-mode.el (tex-run-command, latex-run-command, slitex-run-command, tex-bibtex-run-command, tex-dvi-print-command, tex-alt-dvi-print-command, tex-dvi-view-command): Change doc strings to reflect the fact that `*' will be replaced by the file name. (tex-send-command): New function to interact with comint subshell and replace `*' by the file name. (tex-file, tex-region, tex-print, tex-view, tex-bibtex-file, tex-show-print-queue): Use tex-send-command to send commands. * tex-mode.el (tex-offer-save): New variable. (tex-file): Offer to save buffers if tex-offer-save is t (default). * tex-mode.el (latex-block-names, standard-latex-block-names): New variables. (tex-latex-block): Use them to do completing-read for block name. * tex-mode.el (tex-last-temp-file): New variable to remember file name for clean up. (tex-shell-sentinel): New function--clean up when tex process dies. (tex-delete-last-temp-files): New function to do the cleanup. Add this function to kill-emacs-hook. (tex-region): Do clean up of files from last invocation. * tex-mode.el (tex-insert-quote): Make it barf on read-only buffers. * tex-mode.el (tex-terminate-paragraph): Make it barf on read-only buffers. * tex-mode.el (tex-insert-braces): Make it barf on read-only buffers. * tex-mode.el (tex-close-latex-block): Change void var `ERR' to `nil'. * tex-mode.el (tex-print): Use alternative printer when given prefix arg. * tex-mode.el (tex-mode-load-hook): New variable. Run-hooks on it. 1992-07-04 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * compile.el (compilation-in-progress): New variable. Add it to minor-mode-alist. (compile-internal): Cons the new process onto it. (compilation-sentinel): Remove the dead process from it. 1992-07-04 Richard Stallman (rms@mole.gnu.ai.mit.edu) * tex-mode.el: New version from reingold. * files.el (save-buffers-kill-emacs): Consider open net connections as possibly requiring a query. 1992-07-02 Richard Stallman (rms@mole.gnu.ai.mit.edu) * files.el (recover-file): Pass -L option to ls, if file is link. 1992-07-01 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * files.el (ctl-x-4-map): Bind `C-x 4 o' to display-buffer. * buff-menu.el (Buffer-menu-switch-other-window): New function, bound to C-o in Buffer-menu-mode-map. 1992-07-01 Richard Stallman (rms@mole.gnu.ai.mit.edu) * cmutex.el: Deleted, following recommendation of reingold. 1992-06-30 Jim Blandy (jimb@pogo.cs.oberlin.edu) * startup.el (command-line-1): Signal an error if the argument to the `-insert' option isn't a string. 1992-06-28 Jim Blandy (jimb@pogo.cs.oberlin.edu) * completion.el (completion-separator-self-insert-autofilling): Changed references to `auto-fill-hook' to `auto-fill-function'. * mh-e.el (mh-letter-mode): Same thing. * texinfo-upd.el (texinfo-update-node, texinfo-sequential-node-update): Same thing. 1992-06-28 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * solar.el: New file. The only functions known to outside world are calendar-sunrise-sunset, diary-sunrise-sunset, diary-sabbath-candles, sunrise-sunset, and calendar-holiday-function-solar-equinoxes-solstices. * calendar.el (calendar-holidays): Add equinoxes and solstices. (calendar-mode-map): Add key for sunrise/sunset. Add a new variables calendar-time-display-form, calendar-latitude, calendar-longitude, calendar-location-name, calendar-time-zone, calendar-standard-time-zone-name, calendar-daylight-time-zone-name, calendar-daylight-savings-starts, calendar-daylight-savings-ends. Add autoload of calendar-sunrise-sunset. (calendar-mode): Add description of sunrise/sunset capability. (calendar-version): Changed to 5. * diary.el: Autoload diary-sunrise-sunset and diary-sabbath-candles. * holidays.el: Autoload calendar-holiday-function-solar-equinoxes-solstices. 1992-06-27 Jim Blandy (jimb@pogo.cs.oberlin.edu) * info.el: Bindings for Info-goto-emacs-command-node and Info-goto-emacs-key-command-node in help-map moved from here... * help.el: to here. * compile.el (compile-internal): Make the buffer read-only, to remind people that they probably don't want to mess with it. (compilation-sentinel): Make the buffer temporarily writable, so we can insert the termination message. * help.el, indent.el, paragraphs.el, isearch.el, replace.el: Deleted autoload cookies from these files; they are all loaded into Emacs by loadup.el. * loaddefs.el: Removed autoload sections for the above files. * loaddefs.el: Put autoload sections in alphabetical order by file name. * replace.el (perform-replace): Remember the match data from the real occurrence found, and restore it before executing the command. This preserves the match data across various other matching we do, and protects it from mungement while we're waiting for input. * loaddefs.el: Bind [M-right], [M-left], [M-up], and [M-down] to backward-sexp, forward-sexp, backward-list, and forward-list. 1992-06-26 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * holidays.el (calendar-holiday-list): Protect holiday evaluation from bogus holidays on list. 1992-06-26 Richard Stallman (rms@mole.gnu.ai.mit.edu) * outline.el (outline-flag-region): Bind buffer-read-only to nil. 1992-06-25 Jim Blandy (jimb@pogo.cs.oberlin.edu) * calendar.el, diary.el, holidays.el: Merged new versions from Ed Reingold. * calendar.el (mark-holidays-in-calendar, all-hebrew-calendar-holidays, all-christian-calendar-holidays, all-islamic-calendar-holidays, list-diary-entries-hook, diary-display-hook, nongregorian-diary-listing-hook, nongregorian-diary-marking-hook, diary-list-include-blanks): Added autoload cookie for these; Reingold's distribution suggests that these variables are ones that you are especially likely to want to customize. * holiday.el (holidays): Added autoload cookie for this. 1992-06-25 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * diary.el (diary-rosh-hodesh): Change mod to % in two places. 1992-06-24 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * holidays.el (calendar-holiday-function-fixed, calendar-holiday-function-float. calendar-holiday-function-julian, calendar-holiday-function-islamic, calendar-holiday-function-hebrew): Correct documentation strings. * holidays.el (calendar-holiday-function-greek-orthodox-easter): New function. * calendar.el (calendar-holidays): Add Greek Orthodox Easter to all Christian holidays list. * calendar.el: calendar-load-hook: New variable; use it with run-hooks. calendar: Describe use of calendar-load-hook. 1992-06-23 Jim Blandy (jimb@pogo.cs.oberlin.edu) * autoload.el: The docstring is the third element of a `defun' form, not the second. 1992-06-23 Richard Stallman (rms@mole.gnu.ai.mit.edu) * fill.el (fill-region-as-paragraph): Don't assume any indentation for a one-line paragraph. * dired.el: Complete rewrite, mostly by sk@thp.uni-koeln.de. * dired-aux.el: Other parts of dired. * files.el (enable-local-eval): Renamed from `ignore-local-eval'; now has values like `enable-local-variables'. (hack-local-variables): Test `enable-local-eval' properly. 1992-06-22 Jim Blandy (jimb@pogo.cs.oberlin.edu) * autoload.el (generate-file-autoloads): Do attach a `doc-string-elt' property to `defun', `defvar', `defconst', and `defmacro'; since the files with ";;;autoload" cookies in them are never loaded into the dumped Emacs - otherwise, why would you be autoloading them?. 1992-06-21 Richard Stallman (rms@mole.gnu.ai.mit.edu) * fill.el (fill-region-as-paragraph): Handle fill-prefix wider than fill-column. Ensure we keep at least one word on each line. Also don't break after a period followed by just one space. 1992-06-21 Jim Blandy (jimb@pogo.cs.oberlin.edu) * screen.el (ctl-x-5-map): Removed declaration and initialization of this here; it's done in subr.el, alongside ctl-x-4-map. * autoload.el (generate-file-autoloads): If FILE is in the same directory as the current buffer's file, or a subdirectory thereof, change FILE to be a path relative to the current buffer's file. This will allow `update-autoloads-here' to find a section's file even if the Emacs tree has been moved, as it would be when installed on a different system. 1992-06-19 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * upd-copyr.el (update-copyright): Grok abbreviated years. 1992-06-19 Jim Blandy (jimb@pogo.cs.oberlin.edu) * lisp-mode.el (indent-sexp): The local variable `last-point' was being asked to do double-duty - `calculate-lisp-indent' needs to be given a location guaranteed to be outside of the current s-expression, but the outer loop (according to the change made Dec 21 1989) needs to know where point was at the top of the loop. Added variable `starting-point' for `calculate-lisp-indent' to use. * lisp-mode.el (indent-sexp): Change the `while' loop to an `if', using `make-list' and `-' instead of `(list nil)' and `1+'. 1992-06-18 Jim Blandy (jimb@pogo.cs.oberlin.edu) * edebug.el (edebug-debug): Added autoload cookie for this. * etags.el (find-tag-other-frame): New function. Bind it to `C-x 5 .'. 1992-06-17 Jim Blandy (jimb@pogo.cs.oberlin.edu) * compile.el (compilation-error-regexp-alist): Tightened up the regular expressions designed to match lint pass 2 and lint pass 3 error messages. These were too loose; they were matching the "grep exited 00:06:20" messages at the end of the buffer. 1992-06-16 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * upd-copyr.el (update-copyright): Do nothing if inhibit-update-copyright is non-nil. If the user answers "no", set that to t locally. (inhibit-update-copyright): New defvar. 1992-06-15 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * mailabbrev.el: New version from jwz. 1992-06-15 Jim Blandy (jimb@pogo.cs.oberlin.edu) * compile.el (compilation-enter-directory-regexp, compilation-leave-directory-regexp): In strings, replace uses of "\\\(" or "\\\)" with "\\(" or "\\)". (compilation-error-regexp-alist): Remember to include newlines in all the complemented character sets; none of these should match across a newline. 1992-06-14 Jim Blandy (jimb@pogo.cs.oberlin.edu) * isearch-mode.el (isearch-forward): Remove sentence from doc string claiming that the key bindings are controlled by variables named `search-FOO-char'. That was true of the old isearch.el, but now the keymap `isearch-mode-map' controls special characters in isearch-mode. * blackbox.el (blackbox): Added ;;;###autoload cookie. * add-log.el (change-log-mode): Integrated some code from the `change-log-mode' function in `text-mode.el'. Docstring now mentions that it prevents numeric backups, and sets `left-margin' and `fill-column'. Code now actually sets `left-margin' and `fill-column', as advertised. * text-mode.el (change-log-mode): Function deleted, since it's been superceded by the one in add-log.el. 1992-06-14 Richard Stallman (rms@mole.gnu.ai.mit.edu) * gnus.el (gnus-start-news-server): Criterion for using the local news spool is now that gnus-nntp-server is "::". 1992-06-13 Richard Stallman (rms@mole.gnu.ai.mit.edu) * gnus.el (gnus-nntp-server): Eval gnus-default-nntp-server only if bound. 1992-06-12 Jim Blandy (jimb@pogo.cs.oberlin.edu) * isearch-mode.el: New package, which will probably supercede isearch.el. (isearch-mode-map, isearch-mode-meta-map): When initializing these, remember that vectors are no longer keymaps. (isearch-update): unread-command-char is no longer -1 when there is no unread character - it's nil. * simple.el (interprogram-paste-function): Add the stipulation that the function this points to should return nil if Emacs sent the most recent string for interprogram pasting; the function should never return the same string Emacs posted with `interprogram-cut-function'. * term/x-win.el (x-last-selected-text): New variable. (x-select-text): Set it, so we can check later against returning it. (x-cut-buffer-or-selection-value): Check it, to make sure we don't return our own text. 1992-06-12 Joseph Arceneaux (jla@churchy.gnu.ai.mit.edu) * simple.el (current-kill): Fixed misnamed parameter and reorganized code slightly. 1992-06-11 Richard Stallman (rms@mole.gnu.ai.mit.edu) * rmailout.el (rmail-output): Get date using mail-fetch-field. 1992-06-10 Roland McGrath (roland@geech.gnu.ai.mit.edu) * compile.el (compile-internal): Do buffer-disable-undo here. (compilation-mode): Not here. 1992-06-10 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * simple.el (rotate-yank-pointer): Move the guts of this to current-kill, and get rid of the optional DO-NOT-MOVE argument. (current-kill): Rotate the yank pointer here. 1992-06-09 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * subr.el (one-window-p): Rename argument ARG to NOMINI, so that the docstring will agree with the argument list generated by make-docfile.c. * simple.el (kill-region): Undo May 20th change - add back Roland McGrath's hack of June 17, 1991, which allows kill-region to work on read-only buffers - in read-only buffers, it acts just like copy-region-as-kill. 1992-06-09 Richard Stallman (rms@mole.gnu.ai.mit.edu) * electric.el (Electric-command-loop): Set last-command after each cmd. * server.el (server-buffer-clients): Add permanent-local property. 1992-06-08 Richard Stallman (rms@mole.gnu.ai.mit.edu) * csharp.el (c-find-nesting): Renamed from csharp-find-nesting. Add autoload. All other functions in this file renamed to start with c-find-nesting. 1992-06-07 Richard Stallman (rms@mole.gnu.ai.mit.edu) * window.el (split-window-keep-point): Make it t by default. 1992-06-06 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el (delete-blank-lines): Handle special case near eob. 1992-06-05 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el (universal-argument): Don't call describe-arg. Pass t as 2nd arg to read-key-sequence. (prefix-arg-internal): Likewise. 1992-06-04 Roland McGrath (roland@geech.gnu.ai.mit.edu) * startup.el (command-line): Run after-init-hook. Renamed pre-init-hook to before-init-hook for consistency with e.g., before-change-function. (after-init-hook): New defvar. * screen.el: Use before-init-hook instead of pre-init-hook. 1992-06-04 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el: Doc fix. 1992-06-03 Richard Stallman (rms@mole.gnu.ai.mit.edu) * info.el (Info-enable-edit): Now a user option. 1992-06-03 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * sendmail.el (mail-signature): Suppress move to end of buffer if we gave a prefix argument (requested by Bob Chassell). 1992-06-03 Roland McGrath (roland@geech.gnu.ai.mit.edu) * add-log.el (add-change-log-entry): Match the file name followed by a colon in an existing entry. To find a blank line, search for one containing only whitespace, not two consecutive newlines. When adding to an existing entry, open a line and indent. 1992-06-03 Richard Stallman (rms@mole.gnu.ai.mit.edu) * add-log.el (change-log-mode): Set version-control to 'never locally. Set adaptive-fill-regexp. Make paragraph-separate match date lines. * bytecomp.el (byte-compile-file): Don't put file name in minibuffer. (byte-compile-buffer): Function commented out. * lisp-mode.el (lisp-indent-line): Keep point unchanged in ;;; line. 1992-06-02 Roland McGrath (roland@geech.gnu.ai.mit.edu) * add-log.el (add-change-log-entry): If the visited file is in the directory tree under the directory containing the change log file, insert the path to it from there, rather than just the file name. Also removed setq of random variable `formatted-revision'. 1992-06-02 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * yow.el: Somehow, the semicolons introducing the comment on the first line disappeared. Put them back. 1992-06-02 Richard Stallman (rms@mole.gnu.ai.mit.edu) * subr.el (eval-current-buffer): Add as alias for eval-buffer. * calendar.el (calendar): Add an autoload. * cal.el: File deleted. 1992-06-02 Roland McGrath (roland@geech.gnu.ai.mit.edu) * add-log.el: Fixed copyright years to not use a range. (change-log-mode): Added docstring. (add-change-log-entry): Put a space between the file name and "(function name):". Put a colon after the file name if we have found no function name. 1992-06-02 Richard Stallman (rms@mole.gnu.ai.mit.edu) * edebug.el (edebug-eval-buffer): New function. Install it in place of eval-buffer if eval-buffer is defined. (edebug-eval-current-buffer): Define this, not eval-current-buffer. Use fset to install it in place of eval-current-buffer. ??? mlconvert.el needs fixing too. * ispell.el: Add some autoloads. (ispell-word): Accept prefix arg, meaning do ispell-next. 1992-06-01 Jim Blandy (jimb@pogo.cs.oberlin.edu) * simple.el (current-kill): Name the variable which holds the value from other programs to be pasted interprogram-paste, not interprogram-cut. * files.el: Bind find-file-other-screen to C-x 5 C-f as well as C-x 5 f, for symmetry with C-x C-f. 1992-06-01 Richard Stallman (rms@mole.gnu.ai.mit.edu) * asm-mode.el (asm-mode-map): Don't override RET. * teco.el: Rename `teco:' to `teco-' in all symbols. (teco-command): Make it autoload. * edebug.el (edebug-defun): Make it autoload. * hexl.el (hexl-save-buffer): Return t. (hexl-mode): Put hexl-save-buffer in write-contents-hooks. (hexl-mode-map): Put the 1k page commands on C-x [ and C-x ]. * diff.el: Doc fix. * fill.el (fill-region-as-paragraph): Treat } like closeparen. If a fill prefix is specified globally, always use that one. * flow-ctrl.el (evade-flow-control-memstr=): Renamed from memstr=. 1992-05-31 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * bibtex.el: merged in alarson's changes * simula.el: replaced Bj|rn Hessen's version with Hans Henrik Eriksen's improved version (both of them wanted it this way). 1992-05-31 Noah Friedman (friedman@splode.com) * subr.el (lambda): Added docstring. 1992-05-31 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * gdb.el nuked --- subsumed by gdb entry point of gud.el * dbx.el nuked --- subsumed by dbx entry point of gud.el * session.el nuked --- saveconf.el is better * add-log.el now contains the add-log-new.el changes which merge consecutive entries by the same user on the same day and try to auto-generate both the file key and function changed fields --- the old version still exists in the ~n~ files if this loses, but the code looks good. 1992-05-30 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * profile.el: installed * cus-print.el: installed 1992-05-30 Jim Blandy (jimb@pogo.cs.oberlin.edu) * startup.el (normal-top-level): Call abbreviate-file-name instead of writing out its code. * comint.el: Merged with Olin Shivers' comint version 2.03. (comint-version): Changed accordingly. (comint-previous-input-matching): Bind this to c-m-r, rather than c-c c-r. (comint-exec-hook): Make this variable buffer-local. (comint-exec): Put the code which feeds the startfile to the inferior inside the let which binds ``proc'', as suggested by the indentation. (comint-read-noecho): New optional argument STARS, which causes input to be echoed with '*' characters on the prompt line. (send-invisible): Change prompt from "Enter non-echoed text: " to "Non-echoed text: ". This conforms with the convention used by existing prompts, and gives more room to type stuff. * comint.el (comint-last-input-start): New varible. In particular, this helps support subprocesses that insist on echoing their input. Added comments to porting guide indicating that this should probably not be used for implementing history stuff. (comint-mode): Create and initialize comint-last-input-start as a buffer-local var. (comint-send-input): Set comint-last-input-start when we send the input. Porting documentation at end of file adjusted to describe the differences between the old shell mode's last-input-start variable and comint-last-input-start. * telnet.el (telnet-send-input): If telnet-remote-echos is non-nil, use comint-last-input-start and comint-last-input-end to delete the input we just sent. 1992-05-29 Jim Blandy (jimb@pogo.cs.oberlin.edu) * simple.el (append-to-buffer): When called interactively, default to (other-buffer nil t). This way, it will offer to insert into the buffer in the other window. 1992-05-27 Jim Blandy (jimb@pogo.cs.oberlin.edu) * term/x-win.el (x-cut-buffer-or-selection-value): New function. Set interprogram-paste-function to use it. (x-select-text): For backwards compatibility, set cut buffer 0 as well as claiming ownership of the other selections. 1992-05-27 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el (indent-new-comment-line): Change handling of comment-multi-line (which is effectively obsolete now). 1992-05-24 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el (set-selective-display): Keep vpos of point constant. 1992-05-24 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * calendar.el (list-yahrzeit-dates): New function. (hebrew-calendar-yahrzeit): Moved from diary.el. * diary.el (hebrew-calendar-yahrzeit): Moved to calendar.el. diary-ordinal-suffix: Give correct suffix for 111, 112, 113, 211, 212, 213, etc. 1992-05-21 Jim Blandy (jimb@pogo.cs.oberlin.edu) * mouse.el: Emulate the Emacs 18 mouse button bindings for now. (mouse-yank-at-click): New function. * term/x-win.el (x-select-text): Don't bother to check if the window system is X; if it isn't, then this function would never have been defined, let alone called. Is this right, Joe? * simple.el (interprogram-paste-function): New hook, for getting the current pasting text from the window system. (kill-ring): Doc fix, encouraging people to use the functions below instead of manipulating the kill ring directly, since the functions correctly deal with interprogram cutting and pasting. (kill-new): New function. (kill-append): Added doc string. Be sure to call the interprogram-cut-function on the new string. (current-kill): New function. (rotate-yank-pointer): New optional argument do-not-move, to support vi.el and vip.el's style of ring access. (kill-region, copy-region-as-kill): Call kill-new, instead of writing out all the logic. (yank-pop): Use current-kill, rather than assuming that kill-ring-yank-pointer points to the text you should use. (yank): Use current-kill, instead of calling rotate-yank-pointer and then fetching through the kill-ring-yank-pointer. * vi.el (vi-put-before): Instead of figuring out the index into the kill-ring and fetching directly, call current-kill. * vip.el (vip-put-back, vip-Put-back, ex-copy): Use current-kill, don't access the kill ring directly. * term/x-win.el: Set interprogram-paste-function to 'x-selection-value. * sun-fns.el (mouse-yank-at-point): Instead of rotating the yank pointer one spot and then accessing the kill ring directly, just call the function current-kill with an argument of one. * simple.el (kill-ring-save): Blink to the other end of the saved region, if it's on the screen, or print out the text if it's not, instead of printing the number of characters saved. Nobody cares how many characters were saved, and it's hard to interpret intuitively. * screen.el (ctl-x-3-map): Renamed to ctl-x-5-map, and now bound to C-x 5, not C-x 3. This makes a nicer analogy with C-x 4. Moving split-window-horizontally to C-x 3 also makes a nicer analogy with C-x 2. * files.el, sendmail.el, subr.el: Uses of ctl-x-3-map here renamed. * window.el: Binding of split-window-horizontally moved from C-x 5 to C-x 3. 1992-05-20 Jim Blandy (jimb@pogo.cs.oberlin.edu) * simple.el (kill-region): This used to forgo actually deleting the region if the buffer was read-only, meaning that the command would silently copy the region to the kill ring, but leave the buffer unmodified. Now it tries to delete the region, even if the buffer is read-only; go ahead and get the error. 1992-05-19 Richard Stallman (rms@mole.gnu.ai.mit.edu) * subr.el (one-window-p): If arg is t, completely avoid minibuffer. 1992-05-19 Jim Blandy (jimb@pogo.cs.oberlin.edu) * version.el (version): New alias for emacs-version. 1992-05-19 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * startup.el (normal-top-level): Typo: s/getev/getenv/. 1992-05-13 Jim Blandy (jimb@pogo.cs.oberlin.edu) * subr.el (lambda): Define this as a macro which wraps the lambda expression in a (function ...) quoter. This means that you don't need to write out the cursed ``function'' any more. It might be cleaner to simply change the way the interpreter and compiler treat lambda. * loadup.el: Disable undo recording in scratch while we load all the files; re-enable them before we dump. 1992-05-12 Jim Blandy (jimb@pogo.cs.oberlin.edu) * startup.el (normal-top-level): If (getenv "PWD") or (getenv "HOME") refer to the same directory as default-directory, change default-directory to the shortest of the three. * disass.el (disassemble-internal): Use indirect-function instead of just looping. 1992-05-12 Joseph Arceneaux (jla@churchy.gnu.ai.mit.edu) * simple.el (kill-region): Call the interprogram-cut-function if it's non-nil. * term/x-win.el (x-select-text): New function for selecting text, asserts both PRIMARY and CLIPBOARD selections. 1992-05-05 Richard Stallman (rms@mole.gnu.ai.mit.edu) * (ftp-command): Correctly ignore lines without status codes. * fill.el (fill-individual-paragraphs): Choice of two modes, controlled by fill-individual-varying-indent. 1992-05-05 Roland McGrath (roland@albert.gnu.ai.mit.edu) * files.el (save-some-buffers): Use save-excursion around whole fn, rather than several inside. 1992-05-05 Richard Stallman (rms@mole.gnu.ai.mit.edu) * terminal.el (terminal-emulator): Use process-enironment, not env. Get rid of code that used start-subprocess. 1992-05-03 Roland McGrath (roland@geech.gnu.ai.mit.edu) * mailabbrev.el (mail-abbrevs-v18-munge-map): Use define-key instead of making up an extra alist and nconcing it onto the keymap. 1992-05-02 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * calendar.el (generate-calendar-month): Center heading over each month. 1992-04-30 Jim Blandy (jimb@pogo.cs.oberlin.edu) * loaddefs.el: Moved (put 'narrow-to-page 'disabled t)... * page.el: To here. 1992-04-28 Jim Blandy (jimb@pogo.cs.oberlin.edu) * mh-e.el (mh-signature-file-name): New variable. (mh-insert-signature): Use it. 1992-04-27 Roland McGrath (roland@albert.gnu.ai.mit.edu) * mailabbrev.el: New version from jwz. 1992-04-26 Roland McGrath (roland@albert.gnu.ai.mit.edu) * loaddefs.el: Removed (put 'narrow-to-region 'disabled t). It is done in simple.el. 1992-04-25 Jim Blandy (jimb@pogo.cs.oberlin.edu) * dired.el (dired-mode): Make the modeline display the entire path of the directory, not just the buffer name. 1992-04-24 Jim Blandy (jimb@pogo.cs.oberlin.edu) * flame.el: Add "flame-" prefix to internal functions, to conform with the naming conventions of the rest of Emacs. 1992-04-21 Jim Blandy (jimb@pogo.cs.oberlin.edu) * doctor.el (doctor-svo): Deleted second expression from top let binding; it used to read "(let ((foo <exp> sent)) ...)"; let bindings can only have one expression. * flame.el: We might as well (provide 'flame). 1992-04-18 Jim Blandy (jimb@pogo.cs.oberlin.edu) * startup.el (normal-top-level): Don't change default-directory to (getenv "PWD") unless they actually refer to the same directory. * rmail.el (rmail-unix-mail-delimiter): Doc fix. 1992-04-17 Jim Blandy (jimb@pogo.cs.oberlin.edu) * rmail.el (rmail-unix-mail-delimiter): Don't bother giving this a docstring; move it to a comment. 1992-04-17 Richard Stallman (rms@mole.gnu.ai.mit.edu) * cmacexp.el: Doc fix. 1992-04-15 Jim Blandy (jimb@pogo.cs.oberlin.edu) * simple.el (reindent-then-newline-and-indent, newline-and-indent): Call the newline function instead of saying (insert ?\n), so that auto fill mode will break lines correctly. * upd-copyr.el (update-copyright): Used to not change the copyright version when user elected to update the copyright year, but would change it when user decided not to update. Now doesn't do anything unless user gives permission, and when the user does give permission, does everything. * rmail.el (rmail-unix-mail-delimiter): New variable. (rmail-convert-to-babyl-format): Use it to recognize the start of an mbox message. (rmail-nuke-pinhead-header): Same. 1992-04-15 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * compile.el (compilation-find-buffer): Optional non-nil arg says to try to find some buffer other than the current one. 1992-04-10 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * holidays.el (calendar-cursor-holidays): Signal error when cursor is not on a date. 1992-04-08 Jim Blandy (jimb@pogo.cs.oberlin.edu) * doctex.el, gdb.el, mh-e.el, vip.el: Use point{,-min,-max,-marker} functions instead of dot{,-min,-max,-marker}. 1992-04-07 Roland McGrath (roland@geech.gnu.ai.mit.edu) * mailabbrev.el (mail-abbrev-expand-hook): Rewritten so it won't loop if a single address doesn't fit within fill-column. 1992-04-05 Roland McGrath (roland@albert.gnu.ai.mit.edu) * mailabbrev.el (sendmail-v18-self-insert-command): Just pass arg to sendmail-pre-abbrev-expand-hook. (sendmail-pre-abbrev-expand-hook): Take optional arg; if non-nil, call self-insert-command with it, and don't do expand-abbrev; just 1992-04-06 Jim Blandy (jimb@pogo.cs.oberlin.edu) * lpr.el (lpr-command): Make this variable settable. 1992-04-03 Jim Blandy (jimb@pogo.cs.oberlin.edu) * files.el (revert-buffer): Reverse the sense of the prefix argument; by default, do not offer to revert from the auto-save file. 1992-04-02 Richard Stallman (rms@mole.gnu.ai.mit.edu) * files.el (write-contents-hooks): New variable. (basic-save-buffer): Use write-contents-hooks like write-file-hooks. 1992-03-31 Jim Blandy (jimb@pogo.cs.oberlin.edu) * bytecomp.el (byte-compile-let, byte-compile-let*): Signal an error message if a binding has more than one value form. * sendmail.el (mail-position-on-field): Search for the mail header separator only occurring at the beginning of a line. Insert new headers correctly even if there are no other headers. * loadup.el: When finding pointers to doc strings, place the doc file in ../etc, not ../share-lib. It's been renamed. 1992-03-24 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * mailabbrev.el: New version from jwz. * mailabbrev.el (mail-abbrev-expand-hook): If an address in the expansion begins with a /, turn it into an FCC header. * mailabbrev.el: Major rehacking. Should work in 18 and 19. 1992-03-23 Roland McGrath (roland@albert.gnu.ai.mit.edu) * simple.el (copy-region-as-kill): Doc fix. 1992-03-16 Jim Blandy (jimb@pogo.cs.oberlin.edu) * Moved provide clauses to bottom of every elisp file that contains one. * simple.el (undo): Don't print the "Undo!" message if we're in the minibuffer. 1992-03-16 Roland McGrath (roland@geech.gnu.ai.mit.edu) * upd-copyr.el (update-copyright): Don't update the GPL version or replace the notice if the user said not to update the copyright. 1992-03-11 Jim Blandy (jimb@pogo.cs.oberlin.edu) * sendmail.el (mail-fcc): New function. (mail-mode-map): Bind C-c C-f C-f to mail-fcc. * sendmail.el (mail-position-on-field): Recognize the mail-header-separator string, even when it's at the beginning of the buffer. 1992-03-11 Roland McGrath (roland@geech.gnu.ai.mit.edu) * map-ynp.el (map-y-or-n-p): Doc fix. 1992-03-07 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * upd-copyr.el (update-copyright): Take two new optional args, to ask the user whether to update, and whether to replace the year. When asking the user, narrow it down to things that look like GPL notices. (ask-to-update-copyright): New function, meant to be put on write-file-hooks. 1992-03-05 Roland McGrath (roland@geech.gnu.ai.mit.edu) * compile.el (compilation-mode-hook): New variable. (compilation-mode): Run it. (compilation-search-path): Made user variable, added autoload cookie. (compilaton-window-height): Added autoload cookie. 1992-02-27 Jim Blandy (jimb@pogo.cs.oberlin.edu) * files.el (hack-local-variables): Don't take a FORCE argument; it's as easy to bind enable-local-variables to t for a while as it is to pass an extra argument, and it's cleaner. (normal-mode): Instead of passing the FORCE argument, bind enable-local-variables. (set-auto-mode): Don't check for the -*- mode tag if enable-local-variables is nil. * loaddefs.el (auto-mode-alist): There's no reason for this definition and initialization to be here; moved it to... * files.el: Here. 1992-02-21 Jim Blandy (jimb@pogo.cs.oberlin.edu) * telnet.el (read-password): Let the quit character terminate password entry. 1992-02-07 Jim Blandy (jimb@pogo.cs.oberlin.edu) * info.el: Doc fix. 1992-01-27 Jim Blandy (jimb@pogo.cs.oberlin.edu) * simple.el (universal-argument): Read key sequences, not single keys. Renamed `c-u' to `factor'. Describe the argument in the minibuffer as it is read. (prefix-arg-internal): Same changes here. Renamed CHAR argument KEY, to reflect the fact that it can now be an event sequence. (describe-arg): New function (actually, uncommented). (digit-argument, negative): Call prefix-arg-internal with a string for KEY argument, not a character. * simple.el (digit-argument): Strip off high bit of last-command-char. 1992-01-17 Jim Blandy (jimb@pogo.cs.oberlin.edu) * term/tvi970.el: New file. 1992-01-16 Jim Blandy (jimb@pogo.cs.oberlin.edu) * screen.el: Don't automatically bind C-z to iconify; this is inappropriate on terminals. * term/x-win.el: Bind C-z to iconify here. 1992-01-15 Jim Blandy (jimb@pogo.cs.oberlin.edu) * term/wyse50.el: Rewritten to use function-key-map. * simple.el: Include bindings for [up], [down], [left], and [right]. 1992-01-13 Jim Blandy (jimb@pogo.cs.oberlin.edu) * setenv.el: New file. * simple.el (x-select-kill): Variable removed. (interprogram-cut-function): New variable. (copy-region-as-kill): Use it. * term/new-at386.el: Rewritten to use function-key-map. 1992-01-10 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * flow-ctrl.el: installed. 1992-01-08 Jim Blandy (jimb@occs.cs.oberlin.edu) * simple.el (temporary-goal-column): Added missing closing paren. 1991-12-25 Richard Stallman (rms@mole.gnu.ai.mit.edu) * mail-utils.el (mail-strip-quoted-names): Return nil if given nil. 1991-12-23 Richard Stallman (rms@mole.gnu.ai.mit.edu) * debug.el (cancel-debug-on-entry): Complete over debugged functions. 1991-12-21 Jim Blandy (jimb@occs.cs.oberlin.edu) * at386.el: Moved to term/at386.el, changed to use function-key-map. 1991-12-20 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * term/news.el, term/vt100.el: Converted to use function-key-map instead of old keypad.el. * term/sun.el: Console key sequences converted to use function-key-map; emacstool bindings left alone. 1991-12-16 Richard Stallman (rms@mole.gnu.ai.mit.edu) * mailabbrev.el: New file. * sendmail.el (mail-setup): Delete code for mail-aliases. Call mail-aliases-setup instead. (sendmail-send-it): Delete code for mail-aliases. (build-mail-aliases, expand-mail-aliases): Autoloads deleted. 1991-12-14 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * etags.el (find-tag-noselect): fixed subtle bug due to save-excursion. (tags-tag-match): new function, made smarter about exact matches. 1991-12-13 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * perl-mode.el: installed. 1991-12-13 Richard Stallman (rms@mole.gnu.ai.mit.edu) * sendmail.el (mail-default-headers): New user variable. (mail-setup): Insert value of that variable. 1991-12-11 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * c-mode.el: added C++ style to c-style-alist. * at386.el: installed. 1991-12-09 Richard Stallman (rms@mole.gnu.ai.mit.edu) * man.el (nuke-nroff-bs): Simplify o^H+. Delete "reformatting" msg. 1991-12-08 Eric S. Raymond (eric@mole.gnu.ai.mit.edu) * blackbox.el: Applied doc patch. No functions affected. * etags.el: support new (find-tag-noselect) entry point. * info.el: patched to restore point on `up' to previously visited buffer. * sccs.el: installed 3.5 1991-12-08 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * simple.el (universal-argument): If there is already an argument specified, don't toss it and read a new one; instead, end argument processing and read the next key literally. (digit-argument, negative-argument): Doc fix. * tar-mode.el (tar-subfile-save-buffer): Use the new current-time subr to generate real timestamps. (tar-update-datestamp): Remove docstring paragraph that claims the feature is not implemented. Remove similar paragraph from TO DO list at top of file. 1991-12-08 Richard Stallman (rms@mole.gnu.ai.mit.edu) * diff.el (diff-internal-diff): New subroutine. (diff): Removed from here. (diff-sccs, diff-rcs): New commands using diff-internal-diff. (diff-rcs-extension): New variable. 1991-12-05 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * apropos.el, doctex.el, help.el, paths.el, spook.el, yow.el: These files expected to find their data in exec-directory, but their data is now located under data-directory. Changed to use data-directory as appropriate. * loadup.el: Changed to use the appropriate path names. 1991-12-02 Richard Stallman (rms@mole.gnu.ai.mit.edu) * mailalias.el (define-mail-alias): Handle quoted aliases. 1991-11-30 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el (prefix-arg-internal): Make C-u end the arg. Doc fixes on the argument commands. 1991-11-28 Richard Stallman (rms@mole.gnu.ai.mit.edu) * emacsbug.el (report-emacs-bug): Now autoloaded. 1991-11-24 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el: Doc fix. 1991-11-15 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * startup.el (command-line): Don't bother catching errors that occur while the window system file is loading; cmd_error can now properly handle errors that occur before screens are set up properly. * startup.el (command-line): baud-rate is a variable, not a function. 1991-11-14 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * info.el (Info-mode): Mention Info-directory in the list of commands in the docstring. (Info-follow-nearest-node): Rebalance parens. 1991-11-11 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * find-dired.el: New version munged by sk for tree dired. 1991-11-06 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * screen.el (screen-initialize, screen-notice-user-settings): Renamed global-minibuffer-screen to default-minibuffer-screen. 1991-11-05 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * diary.el (diary-rosh-hodesh): Add Erev Rosh Hodesh to the diary, as needed. 1991-10-31 Richard Mlynarik (mly@peduncle) * ebuff-menu.el (eletric-buffer-menu-mode-map): Define < and > to scroll-left and scroll-right per user suggestion. 1991-10-31 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * files.el (cd): Don't bother calling pwd after changing the directory. * shell.el (shell-mode): Doc fix. * screen.el (screen-notice-user-settings): When replacing the initial screen with a minibuffer-only screen, append the original screen's parameters to initial-screen-parameters, so that moves and resizes may take place if appropriate. * cmushell.el: This is now the real shell.el. Removed the "cmu" prefix from names. (shell): Marked this to be autoloaded. 1991-10-29 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * files.el (find-file-noselect): Extract filename abbreviation code into separate function. (abbreviate-file-name): This is that. * files.el (after-find-file): If the directory containing the file doesn't exist, offer to create it. (make-directory-path): New function to support this offer. 1991-10-28 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * macros.el (apply-macro-to-region-lines): Use a marker to keep track of the next line to operate on, so the macro can delete or add lines. 1991-10-26 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * disass.el (disassemble): Correctly distinguish functions with no interactive spec and functions that are (interactive). Correctly extract components of explicit calls to byte-code (old-style compiled functions). Correctly pass byte code of function to disassemble-1. (disassemble-1): Use nth to extract components of explicit call to byte-code, not car and cdr. 1991-10-25 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * lisp-mode.el (eval-print-last-sexp): Saying (terpri (current-buffer)) after evaluating the expression does bad things if the expression changes the current buffer, so bind standard-input to the buffer that is current before evaluation. 1991-10-21 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * compile.el (compilation-buffer-name-function, compilation-finish-function): Add autoload cookie for these. 1991-10-15 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * info.el (Info-follow-nearest-node): Adjusted for new return value format from coordinates-in-window-p. 1991-10-08 Roland McGrath (roland@albert.gnu.ai.mit.edu) * add-log.el (change-log-name): New fn. (add-change-log-entry, add-change-log-entry-other-window): All args optional. FILE-NAME defaults to new var `change-log-default-name'. Give this var a local value in the buffer we were run from, pointing to the file we found. 1991-10-07 Roland McGrath (roland@geech.gnu.ai.mit.edu) * compile.el (compilation-buffer-p): New fn. (compilation-find-buffer, compile-goto-error): Use it. 1991-10-05 Roland McGrath (roland@albert.gnu.ai.mit.edu) * compile.el (compile-internal): Don't make state vars local. (compilation-mode): Do it here. (compilation-parse-errors-function, compilation-error-message): Give initial values. (compile-goto-error): Look for compilation-error-list rather than compilation-parse-errors-function in the buffer-local variables to see if this is a compilation buffer, because the latter might not be local. 1991-10-04 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * files.el (revert-buffer): Call verify-visited-file-modtime with one arg (the current buffer), instead of none. 1991-10-04 Roland McGrath (roland@albert.gnu.ai.mit.edu) * rmail.el: Changed two regexps not to look specifically for 19yy for years; look for yyyy instead. Planning for the millenium. 1991-10-03 Roland McGrath (roland@albert.gnu.ai.mit.edu) * version.el (emacs-version): (From Bob:) Take optional arg (prefix arg) to insert version text at point. 1991-09-26 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * info.el (Info-default-directory-list): defvar this instead of defconsting it, so paths.el can set it. 1991-09-26 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * map-ynp.el (map-y-or-n-p): Fixed for lists containing nil. 1991-09-10 Roland McGrath (roland@wookumz.gnu.ai.mit.edu) * autoload.el (batch-update-autoloads): Use catch and throw to give up on a file altogether if it gets an error. * autoload.el (update-file-autoloads): Always check the old section. If the file has no cookies, it will be deleted and not replaced. 1991-09-08 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el (line-move): After C-e, do consider eol of blank line. Don't treat start of blank line as eol. 1991-09-07 Richard Stallman (rms@mole.gnu.ai.mit.edu) * fill.el (fill-individual-paragraphs): Find a fill-prefix that works for the whole paragraph. * simple.el (line-move): Don't treat start of blank line as eol. 1991-09-03 Richard Stallman (rms@mole.gnu.ai.mit.edu) * debug.el (debugger-step-through): Fix message typo. 1991-09-02 Richard Stallman (rms@mole.gnu.ai.mit.edu) * server.el (server-start): Delete old socket in /tmp as well as in ~. 1991-08-26 Richard Stallman (rms@mole.gnu.ai.mit.edu) * abbrev.el, chistory.el: Remove periods from error messages. 1991-08-25 Richard Stallman (rms@mole.gnu.ai.mit.edu) * help.el (describe-function, describe-variable): Return the same text as was displayed. * files.el: Doc fix. * files.el: Don't require map-ynp. * map-ynp.el: No need for provide. * loadup.el: Load map-ynp. 1991-08-23 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * calendar.el (calendar-last-day-of-month, calendar-leap-year-p, calendar-day-number, calendar-absolute-from-gregorian): Change from functions to macros for speed. 1991-08-22 Roland McGrath (roland@albert.gnu.ai.mit.edu) * files.el (find-backup-file-name): (apply fun (cons first rest)) => (apply fun first rest). Come on, guys. 1991-08-20 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * rmail.el (rmail-convert-to-babyl-format): Roland added the missing paren in the wrong place; fixed. * screen.el (screen-initialize): Added missing `function' around lambda expression. 1991-08-20 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * files.el (switch-to-buffer-other-screen, find-file-read-only-other-screen): Remove extra parens. * rmail.el (rmail-convert-to-babyl-format): Add missing paren. 1991-08-19 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * calendar.el (redraw-calendar): Preserve cursor location in redrawing. (extract-calendar-month, extract-calendar-day, extract-calendar-year): Change from functions to macros to speed up computation. * holiday.el: calendar-holiday-function-rosh-hashanah-etc: Correct date of Selichot. 1991-08-18 Richard Stallman (rms@mole.gnu.ai.mit.edu) * rmail.el (rmail-convert-to-babyl-format): If can't find end of babyl header or babyl message, try to resync with next ordinary message. 1991-08-17 Roland McGrath (roland@geech.gnu.ai.mit.edu) * doctor.el (doctor-strangelove): New fn. (doctor-member): Removed. (doctor-doc): Use member instead of doctor-member. (doctor-rms): Restored. 1991-08-16 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * term/x-win.el: Removed obsolete definitions for function keys. 1991-08-15 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * screen.el (screen-create-initial-screen): Renamed to screen-initialize. Arrange to cause errors if people try to create screens when no window system is running. * loadup.el: load screen.el into the dumped emacs. * subr.el (add-hook): Cons FUNCTION onto the value of the symbol HOOK, not the symbol itself. * loaddefs.el (ctl-x-4-map): Move definition from here... * subr.el (ctl-x-4-map): To here. (ctl-x-3-map): New prefix. (mouse-map): Deleted. * screen.el (new-screen-x-delta, new-screen-y-delta, new-screen-position): Removed. (new-screen): Simplified. (split-to-other-screen): Removed. (switch-to-buffer-other-screen, find-file-other-screen, find-file-read-only-other-screen, mail-other-screen): Moved, along with their keybindings, to... * files.el (switch-to-buffer-other-screen, find-file-other-screen, find-file-read-only-other-screen): Here... * sendmail.el (mail-other-screen): And here. 1991-08-14 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * files.el (generate-new-buffer): Function moved here from src/buffer.c. (set-visited-file-name): Use the new argument to rename-buffer. * macros.el (apply-macro-to-region-lines): Don't complain if there is no defined keyboard macro if one was passed as an argument. Don't test if macro is null inside the loop; set it to last-kbd-macro outside the loop. 1991-08-14 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * info.el: Removed bindings and help reference to nonexistent mouse commands. (Info-default-directory-list): New defconst, list to initialize Info-directory-list with by default. (info): Initialize Info-directory-list to Info-default-directory-list if there is no INFODIR envariable. * paths.el (Info-default-directory-list): Define instead of Info-directory-list. 1991-08-13 Ken Raeburn (raeburn@watch.com) * time.el (display-time-24hr-format): New variable. (display-time-filter): If display-time-24hr-format is non-nil, display time in 24-hour format, rather than using AM/PM suffix. Also, don't blow up in substring if load average is unavailable. 1991-08-13 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * screen.el: Incorporated other-screen functions and key bindings. * screen.el: iconification code reworked; this code will require a mapping hook of some sort to work correctly. * screen.el, term/x-win.el: Renamed screen-default-alist to default-screen-alist. (default-screen-alist): Moved declaration to screen.c; the screen creation subrs should consult this transparently. * term/x-win.el (x-get-resources, x-pop-initial-window): Functions deleted. Don't call them at the bottom of the file anymore. 1991-08-12 Roland McGrath (roland@geech.gnu.ai.mit.edu) * simple.el (undo-start): Doc fix: undo-pointer -> pending-undo-list. * files.el (save-some-buffers): Add missing `(and' and matching `)' so that buffer-offer-save is actually tested. 1991-08-12 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * window.el (split-window-keep-point): New user option. (split-window-vertically): Modified to support it. * startup.el (command-line): Choose a default value for split-window-keep-point according to the baud rate. * term/x-win.el: Set split-window-keep-point. 1991-08-10 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * term/x-win.el (x-daemon-mode, x-establish-daemon-mode): Removed these functions; we do this differently now. 1991-08-07 Roland McGrath (roland@geech.gnu.ai.mit.edu) * autoload.el (batch-update-autoloads): Do (save-some-buffers t) before killing emacs, so loaddefs.el will be saved. 1991-08-05 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * screen.el (screen-creation-func): Renamed to screen-creation-function, as per the convention. * screen.el (screen-creation-func): Do not initialize this according to the window system name; let the window system-specific file initialize it however it wants. * term/x-win.el: Set screen-creation-function to x-create-screen. * screen.el: All of the screen startup code reworked. 1991-08-01 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * startup.el (pre-init-hook): New variable. (window-setup-hook): Doc fix. (command-line): Call pre-init-hook. (command-line-1): Updated copyright date. 1991-07-31 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * rmailedit.el: When initializing rmail-edit-map, take the cdr of text-mode-map before nconcing it, to omit the keymap header. 1991-07-31 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * screen.el (auto-new-screen-function): Renamed to pop-up-screen-function. (buffer-in-other-screen): Use pop-up-screens, not auto-new-screen. 1991-07-30 Richard Stallman (rms@mole.gnu.ai.mit.edu) * apropos.el (apropos, super-apropos): Don't make window for no syms. 1991-07-29 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * loaddefs.el: Don't make backup versions of this file. 1991-07-28 Roland McGrath (roland@albert.gnu.ai.mit.edu) * autoload.el (generate-autoload-cookie): Doc fix. 1991-07-28 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * etags.el: Renamed new-etags.el, copied Emacs 18's tags package into its place - the new version seemed to have half-completed major changes. Added autoload marks and changed it to (provide 'etags) instead of tags. * help.el: Autoload the (defvar help-map ...) so that info.el can define keys in it. * loaddefs.el: Updated. 1991-07-27 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * info.el (Info-find-emacs-command-node): New fn. (Info-goto-emacs-command-node, Info-goto-emacs-key-command-node): New fns, bound to C-h C-f and C-h C-k, to pop to the info node for an Emacs command or keystroke. 1991-07-26 Richard Stallman (rms@mole.gnu.ai.mit.edu) * terminal.el (te-stty-string): Delete `new' since loses on SYSV. 1991-07-25 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * edebug.el: Version 2.5 from LaLiberte. 1991-07-25 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * view.el: (define-key "C-xv" 'view-file). (view-file-other-window, view-buffer-other-window): New functions. (view-prev-buffer): Renamed to view-return-here. (view-exit): If view-return-here is a buffer, switch to it; if it is a window configuration, apply it. * subr.el (search-forward-regexp, search-backward-regexp): Added alternate names. 1991-07-24 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * diff.el (diff): Turn off read-only flag to insert "no differences" message. 1991-07-23 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * isearch.el (isearch): If the user switches to a different screen, exit the isearch. * isearch.el (isearch): Changed reference to `cmds' to use variable's new name `history'. 1991-07-23 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * rmail.el (rmail-first-unseen-message): Make loop looking for unseen msgs not skip the first one. * rmail.el (rmail-widen-to-current-msgbeg): Added missing close paren. 1991-07-21 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * isearch.el (isearch): Don't assume that we're repeating a search that found an empty string; check history to make sure we're repeating a search and not starting one up with a pattern from the ring. * view.el: When initializing view-mode-map, use the new-style key maps. * screen.el (auto-new-screen-function): Set this to a lambda which calls the screen-creation-func. 1991-07-19 Richard Stallman (rms@mole.gnu.ai.mit.edu) * backquote.el (bq-make-maker): Don't replace quoted shared structure by copies. 1991-07-19 Roland McGrath (roland@albert.gnu.ai.mit.edu) * files.el (save-some-buffers): Added save-excursions around code that does set-buffer. 1991-07-15 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * etags.el (visit-tags-table): Don't make tags-completion-alist. (tags-completion-alist): If tags-completion-alist is non-nil, return it; else build it and then return it. (find-tag-tag): Pass 'tags-completion-alist as TABLE to completing-read, so the table is built on demand. * sendmail.el (mail-do-fcc): Added missing close paren. 1991-07-15 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * term/x-win.el: Enable interrupt-driven input after opening the X connection, so that the fcntls on file descriptor 0 apply to the socket, not the terminal. * screen.el: Don't bind `C-x o' to next-multiscreen-window or displace other-window to `M-o'. 1991-07-15 Stephen A. Wood (saw@hallc1) * fortran.el version 1.28.3 Now works in either mode when `tab-width' is not 8. (fortran-electric-line-number, fortran-indent-to-column): Use `fortran-minimum-statement-indent' instead of 8. (fortran-current-line-indentation): Now skips over line number and whitespace correctly when tab-width is not 8. (fortran-setup-tab-format-style): Set `fortran-comment-line-column' and `fortran-minimum-statement-indent' to (max tab-width 6) instead of 8. The minimum 6 insures legal indenting for lines with line numbers. 1991-07-13 Jim Blandy (jimb@churchy.gnu.ai.mit.edu) * info.el (Info-find-node): Call buffer-flush-undo with one arg, instead of none. Change call to get-buffer-c>reate to get-buffer-create. * startup.el (command-line): Remove the arguments from command-line-args as we process them. (command-line-1): Removed code to ignore the arguments processed in command-line, because they're all deleted now. * replace.el (occur): Set tem to the location of the match before adding it to occur-pos-list, so we don't end up with an occur-pos-list of nulls. And allocate the final-context-start marker once, so we don't allocate jillions of markers in the 1991-07-11 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * term/x-win.el (x-handle-args): Re-written to take the command line switch as an argument, instead of just assuming it's in ARGS, and return the modified list. Changed caller to pass and set command-line-args. * startup.el (command-line): Re-balance parens. Pass command-line-args to command-line-1, not args. 1991-07-09 Roland McGrath (roland@albert.gnu.ai.mit.edu) * map-ynp.el (map-y-or-n-p): Fixed lossage on ? or random char. 1991-07-08 Richard Stallman (rms@mole.gnu.ai.mit.edu) * (ftp-command): Skip multiline messages. 1991-07-08 Roland McGrath (roland@albert.gnu.ai.mit.edu) * ispell.el (ispell-buffer): fset to 'ispell. * map-ynp.el (map-y-or-n-p): Don't quote a form inside quasiquote. 1991-07-04 Stephen A. Wood (saw@hallc1.cebaf.gov) * fortran.el: Added ;;;###autoload definition for fortran-tab-mode-default variable. * fortran.el (fortran-numerical-continuation-char): Replace (backward-line 1) with (forward-line -1) since backward-line is defined only in edt. (fortran-previous-statement): Fix error in parens. (fortran-indent-to-column): Likewise. 1991-07-04 Roland McGrath (roland@albert.gnu.ai.mit.edu) * files.el (save-some-buffers): Use map-y-or-n-p return value. * map-ynp.el (map-y-or-n-p): Fixed bug that caused first elt on ! hit not get acted on. 1991-07-04 Richard Stallman (rms@mole.gnu.ai.mit.edu) * cmacexp.el (c-macro-expand): Use new variables c-macro-preprocessor and c-macro-options. * teco.el: New file. 1991-07-01 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * map-ynp.el (map-y-or-n-p): Fixed misplaced paren. Fixed list-eating bug. 1991-07-01 Richard Stallman (rms@mole.gnu.ai.mit.edu) * ws-mode.el: New file. * forms.el: New version from Vromans. 1991-06-29 Roland McGrath (roland@albert.gnu.ai.mit.edu) * map-ynp.el (map-y-or-n-p): LISTS may also be an iterator fn. PROMPTER may also be a format string. 1991-06-29 Richard Stallman (rms@mole.gnu.ai.mit.edu) * simple.el (shell-command-on-region): Handle case where input is from *Shell Command Output*. 1991-06-28 Richard Stallman (rms@mole.gnu.ai.mit.edu) * startup.el (command-line): Let init file change command-line-args. Don't fail to advance args past -debug-init. (command-line-1): Ignore here options processed at earlier stages. 1991-06-26 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * term/x-win.el (x-read-resources): When a resource is not available, use (nth 2 key-resname-default) to get the default, not (nth 3 key-resname-default), which is nil. Open the connection to the server *before* trying to read the resources, silly. 1991-06-20 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * subr.el (ignore): Added docstring for this; it appears as a key binding, so it ought to be described. 1991-06-19 Roland McGrath (roland@albert.gnu.ai.mit.edu) * find-dired.el (find-dired-sentinel): Don't twiddle a killed buffer. 1991-06-17 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * simple.el (kill-region): Allow read-only buffers. * find-dired.el (find-dired-filter): If the buffer has been killed, delete the process. * find-dired.el (find-ls-option): Made a defvar rather than defconst. 1991-06-12 Roland McGrath (roland@albert.gnu.ai.mit.edu) * upd-copyr.el (update-copyright): Fixed typo in help text. 1991-05-26 Roland McGrath (roland@albert.gnu.ai.mit.edu) * disass.el (disassemble-internal): Fixed typo string? -> stringp. 1991-05-26 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * holiday.el (calendar-holiday-function-passover-etc): Correct date and spelling of Yom HaAtzma'ut. 1991-05-23 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * mail-utils.el: Require lisp-mode, because we use lisp-mode-syntax-table. Lisp-mode is usually in the dumped emacs, but dumping should always be a convenience, not an unstated expectation. * lisp-mode.el: Do a (provide 'lisp-mode). Initialize lisp-mode-syntax-table outside of all functions, so that we don't have to hope that lisp-mode-variables has been called before using mail-strip-quoted-name. Odd dependencies. * sendmail.el (mail-archive-file-name): Make this a defvar, not a defconst. There seems to be no entry saying why this was made a defconst. * text-mode.el (indented-text-mode-map): When redefining TAB, don't clobber the definition in text-mode-map, but DO share the rest of text-mode-map. 1991-05-23 Michael I Bushnell (mib@geech.gnu.ai.mit.edu) * startup.el (command-line): don't do anything if $VERSION_CONTROL is not set; move code to import environment var ahead of .emacs load. 1991-05-22 Brian Preble (rassilon@mole.gnu.ai.mit.edu) * forms.el (scroll-up, scroll-down): Made argument &optional. 1991-05-22 Michael I Bushnell (mib@churchy.gnu.ai.mit.edu) * rmail.el (rmail-variables): Rmail should not be a save-buffer-skip buffer. If the user wants this confusing behavior, it can be personally customized. 1991-05-22 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * term/x-win.el (x-switches-specified): Variable deleted; the options given on the command line are placed in screen-default alist, so that all the screens created get them. (x-handle-switch, x-handle-numeric-switch): Put the values in screen-default alist instead of in x-switches-specified. (x-handle-geometry): Put the geometry in initial-screen-alist. (x-pop-initial-window): Build the arguments to pop-initial-screen from initial-screen-alist and screen-default-alist alone; don't use x-switches-specified. (x-read-resources): New function to read the X defaults and put them in screen-default-alist. Call this function at the bottom. * screen.el (death-function): Removed, because this is now handled better in startup.el. (pop-initial-screen): Don't do a condition-case to call death-function. 1991-05-18 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * macros.el (apply-macro-to-region-lines): Added a save-excursion around the macro invocation, so that the macro doesn't need to stay on the same line. * gdb.el (gdb-call): Don't set gdb-delete-prompt-marker to an empty region when the process-mark was at the beginning of the line, because this will cause an infinite loop in gdb-maybe-delete-prompt. * startup.el (command-line): If an error occurs while initializing the window system, catch it and write the error message to external-debugging-output. 1991-05-17 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * holiday.el: Add Erev Shavuot to the full list of Jewish holidays. 1991-05-16 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * macros.el (apply-macro-to-region-lines): New function. * term/x-win.el (x-handle-switch): The newline at the end of the comment line at the top of this function was missing. 1991-05-16 Roland McGrath (roland@geech.gnu.ai.mit.edu) * autoload.el (batch-update-autoloads): New function to update autoloads with emacs -batch. * autoload.el (generate-file-autoloads): Don't put non-autoload forms in the (autoloads ...) list in the header. 1991-05-14 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * map-ynp.el (map-y-or-n-p): Put the cursor in the echo area while prompting. 1991-05-13 Richard Stallman (rms@mole.gnu.ai.mit.edu) * bytecomp.el (byte-compile-setq): Clean error if var not a symbol. 1991-05-13 Roland McGrath (roland@geech.gnu.ai.mit.edu) * autoload.el (update-file-autoloads): If the file is in a buffer and that buffer is modified, update the autoloads regardless of the file times. If the file was not in a buffer before, kill the buffer we create. update-directory-autoloads on /gd/gnu/emacs/lisp had a tendency to eat all available memory. 1991-05-13 Brian Preble (rassilon@mole.gnu.ai.mit.edu) * abbrev.el, add-log.el, apropos.el, asm-mode.el, autoload.el: awk-mode.el, backquote.el, bibtex.el, bytecomp.el, c++-mode.el: cal.el, calc-ext.el, calc.el, chistory.el, cl-indent.el, etags.el: compare-w.el, compile.el, dabbrev.el, debug.el, diary.el, diff.el: dired.el, disass.el, dissociate.el, doctor.el, ebuff-menu.el, edt.el: echistory.el, edebug.el, edmacro.el, emerge.el, find-dired.el: fortran.el,, gdb.el, gnus.el, gnuspost.el, gosmacs.el: hanoi.el, helper.el, holidays.el, indent.el, info.el, informat.el: isearch.el, ispell.el, ledit.el, loaddefs.el, rect.el, macros.el: mail-utils.el, mailalias.el, makesum.el, man.el, map-ynp.el, mh-e.el: mlconvert.el, modula2.el, novice.el, nroff-mode.el, options.el: outline.el, paragraphs.el, picture.el, prolog.el, lpr.el, replace.el: reposition.el, rmail.el, spell.el, scribe.el, sendmail.el, server.el: shell.el, sort.el, scheme.el, tabify.el, telnet.el, terminal.el: tex-mode.el, texinfmt.el, texinfo.el, time.el, timer.el: underline.el, userlock.el, vi.el, view.el, vip.el, xscheme.el, yow.e: Fixed ;;;###autoload definitions. 1991-05-13 Roland McGrath (roland@geech.gnu.ai.mit.edu) * autoload.el (generate-file-autoloads): Don't do special doc-string hacking for defvar and defconst. We in fact don't want loaddefs.el to have docstrings make-docfile can grok; it should be able to grok the originals, but not the copies, so there will be only one copy of each docstring in the DOC file. 1991-05-13 Jim Blandy (jimb@pogo.gnu.ai.mit.edu) * isearch.el (search-exit-char): As per the opinion poll results, change this to RET. (isearch): Change miscellanous internals so that newline is automatically quoted, and change the docstring and comments to say that RET exits the search. 1991-05-13 Roland McGrath (roland@geech.gnu.ai.mit.edu) * find-dired.el (find-ls-option): New defconst, string for "-ls". (find-dired): Use it. 1991-05-13 Richard Stallman (rms@mole.gnu.ai.mit.edu) * loaddefs.el (auto-mode-alist): Recognize .emacs only at end. 1991-05-13 Jim Blandy (jimb@wookumz.gnu.ai.mit.edu) * simple.el (blink-matching-open): Make this function interactive. 1991-05-12 Roland McGrath (roland@geech.gnu.ai.mit.edu) * find-dired.el (find-name-dired): Simple-minded find-dired interface to do "find -name PATTERN". * find-dired.el (find-dired-filter): Don't search; use forward-line instead. (find-dired-filter, find-dired-sentinel): Changed docstrings to comments. 1991-05-11 Roland McGrath (roland@albert.gnu.ai.mit.edu) * loaddefs.el: Moved some defvars and defconsts to other files (with ;;;###autoload). * reposition.el: Bind reposition-window to M-C-l. 1991-05-09 Roland McGrath (roland@churchy.gnu.ai.mit.edu) * autoload.el: New file, a package to maintain autoloads in loaddefs.el. * *.el: Make everything use it. Comments in loaddefs.el explain what to do. * etags.el: (provide 'etags) inside of (provide 'tags). Why was the file renamed?? * lisp-mode.el (eval-print-last-sexp): Use terpri instead of newline. 1991-05-09 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * disass.el (disassemble-internal): Rearranged to conveniently handle compiled-function objects. (disassemble-1): Extract bytes and constants correctly from both compiled-function objects and calls to the byte-code function. * simple.el (kill-region): Remove the second item from the interactive spec; this is a vestige from when this function took a "verbose" argument. * lisp-mode.el (eval-print-last-sexp): Insert newlines before and after evaluating the expression. 1991-05-08 Roland McGrath (roland@albert.gnu.ai.mit.edu) * map-ynp.el: New file defines new fn map-y-or-n-p. * files.el (save-some-buffers): Rewritten to use it. 1991-05-08 Brian Preble (rassilon@mole.gnu.ai.mit.edu) * rmail.el: Doc fix. (rmail-first-message): New function; bound to "<". 1991-05-08 Jim Blandy (jimb@churchy.gnu.ai.mit.edu) * screen.el: Removed temporary hack to set up auto-new-screen and auto-new-screen-function. 1991-05-07 Roland McGrath (roland@albert.gnu.ai.mit.edu) * find-dired.el: New fn M-x find-dired lets you run a `find' command and do dired on the result. * loaddefs.el (find-dired): Autoload it. 1991-05-06 Stephen A. Wood (saw@hallc1.cebaf.gov) * fortran.el version 1.28 Major upgrade of previous version 1.21. Cleaned up doc-strings, made all lines 80 or less characters and made the following changes. Added modify-syntax-entry's for ?\r and ?=. Bound LFD to fortran-reindent-then-newline-and-indent. Rebound \C-c\C-w to fortran-window-create-momentarily. Added numerous default abbreviations for keywords. (fortran-mode): Definition of `comment-line-start-skip' changed. `abbrev-mode' is set to t by default. New local variables `fortran-tab-mode', `fortran-comment-line-column', `fortran-minimum-statement-indent', `fortran-column-ruler', and `fortran-tab-mode-string'. Call fortran-analyze-file-format. (fortran-window-create, fortran-window-create-momentarily): Cleaned up first function, created second to create a window 72 characters wide until a key is struck. (fortran-electric-line-number): Distinguish digit as continuation character from digit as line number. (fortran-previous-statement, fortran-next-statement): Recognize tab-digit continuation lines as well as fixed format. (fortran-blink-matching-if): New command. (fortran-indent-line): Change indentation of comments. (fortran-reindent-then-newline-and-indent): New command. (calculate-fortran-indent): Now handles tab format style. If a previous END statement is found, the indentation is reset to the minimum. (fortran-current-line-indentation, fortran-indent-to-column): (fortran-split-line, fortran-numerical-continuation-char): (fortran-line-number-indented-correctly-p): Handle tab format style. (fortran-analyze-file-format): (fortran-tab-mode, fortran-setup-tab-mode-style): (fortran-setup-fixed-format-style): New commands. 1991-05-05 Jim Blandy (jimb@geech.gnu.ai.mit.edu) * calc.el: When setting up calc-digit-map, don't try to apply aref to the keymaps; extract the vectors from the keymaps before working on them. * calc-ext.el: When setting up calc-mode-map, use define-key and lookup-key instead of aset and aref. 1991-05-03 Richard Stallman (rms@mole.gnu.ai.mit.edu) * help.el (function-called-at-point): Try a symbol around point. (describe-function): Describe datatype also. 1991-05-01 Roland McGrath (roland@albert.gnu.ai.mit.edu) * lisp-mode.el (eval-last-sexp, eval-defun): Bind standard-output to where the value of the form will be printed while evalling it. 1991-04-30 Roland McGrath (roland@albert.gnu.ai.mit.edu) * lisp-mode.el (eval-last-sexp): Rewritten to read a form and then eval it, rather than using eval-region. The old version could lose if the form being eval'd moved point or twiddled the restriction. (eval-defun): Similarly rewritten. (eval-print-last-sexp): Rewritten to just call eval-last-sexp; removed some duplicated code. 1991-04-30 Richard Stallman (rms@mole.gnu.ai.mit.edu) * isearch.el (isearch): * and ? are not special after incomplete input. When they are special, use old other-end for cs in both reverse and forward. 1991-04-30 Stephen A. Wood (saw@hallc1.cebaf.gov) * fortran.el version 1.28. Major upgrade of previous version 1.21. Now supports tab or fixed format style of continuation control and indentation. In tab style, lines start with a tab, or a line number followed by a tab. If the first character after the tab is a digit from 1 to 9, the line is a continuation line. When entering fortran mode for a file, the first line that begins with 6 spaces or a tab is found. The buffer is then set respectively to either fixed format or tab format style. The mode may be toggled with the command fortran-tab-mode. Fixed a bug in which indenting a comment line that contained a `!' caused a max-lisp-eval-depth exceeded error. Bound LFD to fortran-reindent-then-newline-and-indent. Added command fortran-blink-matching-if which is called when an endif statement is indented. Enabled/disabled by setting variable of same name to t/nil. Added some abbreviations for modern fortrans. C-c C-w bound to new function fortran-window-create-momentarily which creates a 72 character wide window until the next key is struck. Variable fortran-continuation-char changed to fortran-continuation-string. Modified fortran-electric-line-number to just insert the struck digit when the point is located after 5 spaces, or when the point is located after a tab character and the last command was not fortran-indent-line or fortran-reindent-then-newline-and-indent. This allows digits to be manually used as continuation line indicators. Also fixed a bug in fortran-electric-line-number which caused the digit keys not to work at all if electric line numbering was disabled. 1991-04-29 Richard Stallman (rms@mole.gnu.ai.mit.edu) * info.el (Info-read-subfile): Skip blank lines. 1991-04-22 Brian Preble (rassilon@gnu.ai.mit.edu) * resume.el, rfc822.el, rmail-kill.el: Doc fix. 1991-04-18 Roland McGrath (roland@gnu.ai.mit.edu) * add-log.el (prompt-for-change-log-name): Made a defun rather than a defmacro (braino fix). 1991-04-18 Jim Blandy (jimb@gnu.ai.mit.edu) * simple.el (count-lines-region): Display the number of characters in the region as well. 1991-04-14 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * diary.el (diary-omer, diary-parasha): Fix punctuation in diary entries. 1991-04-12 Brian Preble (rassilon@gnu.ai.mit.edu) * prolog.el, r2bibtex.el, rect.el, refbib.el, register.el: Doc fix. * remote.el, replace.el: Doc fix. 1991-04-11 Jim Blandy (jimb@gnu.ai.mit.edu) * simple.el (kill-region): Don't print out a message saying how many characters are being killed. 1991-04-10 Brian Preble (rassilon@gnu.ai.mit.edu) * modula2.el, mouse.el, mpuz.el, nntp.el, options.el: Doc fix. * oshell.el, page-ext.el, page.el, paragraphs.el, picture.el: Doc fix. 1991-04-05 Raul Acevedo (kitaro@gnu.ai.mit.edu) * options.el: Edit-options-mode runs `Edit-options-mode-hook'. Also fixed the regexp used by Edit-options-modify so you can modify a variable if at the beginning of the buffer. 1991-04-05 Brian Preble (rassilon@gnu.ai.mit.edu) * man.el, medit.el, mh-e.el, mhspool.el, mim-mode.el: Doc fix. 1991-04-04 Raul Acevedo (kitaro@gnu.ai.mit.edu) * info.el (Info-mode): now runs `Info-mode-hook' 1991-04-02 Brian Preble (rassilon@gnu.ai.mit.edu) * mailpost.el, mail-utils.el, mailalias.el: Doc fix. 1991-03-24 Richard Stallman (rms@gnu.ai.mit.edu) * rmail.el (rmail-resend): New function. * sendmail.el (mail-alias-file): New global variable. (sendmail-send-it): Use that variable. * mailalias.el (expand-mail-aliases): Handle resent-to. * files.el (hack-local-variables): ignore-local-eval ignores `eval'. 1991-03-19 Richard Stallman (rms@gnu.ai.mit.edu) * fill.el (justify-current-line): Adjust for 18.57 behavior of current-column. 1991-03-17 Richard Stallman (rms@mole.ai.mit.edu) * add-log.el (add-change-log-entry): Recognize `@', not ` at '. * fill.el (justify-current-line): Handle extra indent after prefix. 1991-03-14 Robert J. Chassell (bob@gnu.ai.mit.edu) * info.el (Info-forward-node): Go up several levels, if necessary. Add two new arguments. (Info-final-node): Go forward from last node in menu. (Info-find-node): Turn off undo in Info's buffers. 1991-03-14 Richard Stallman (rms@mole.ai.mit.edu) * add-log.el (add-change-log-entry): Use `@', not ` at '. 1991-03-14 Brian Preble (rassilon@mole.ai.mit.edu) * loaddefs.el, lpr.el: Doc fix. 1991-03-12 Richard Stallman (rms@mole.ai.mit.edu) * compare-w.el (compare-windows-whitespace): Now a set of chars, not a regexp. (compare-windows): Use it properly. 1991-03-12 Brian Preble (rassilon@gnu.ai.mit.edu) * info.el, informat.el, ispell.el, kermit.el, keypad.el: Doc fix. * ledit.el, lisp-mode.el, lisp.el: Doc fix. 1991-03-11 Richard Stallman (rms@mole.ai.mit.edu) * simple.el (kill-region): Make undo buffer and kill ring share. 1991-03-10 Richard Stallman (rms@mole.ai.mit.edu) * tar-mode.el: New file. 1991-03-08 Brian Preble (rassilon@mole.ai.mit.edu) * indent.el, inf-lisp.el: Doc fix. 1991-03-08 Richard Stallman (rms@mole.ai.mit.edu) * bytecomp.el (byte-compile-file-form): Print warning for " unescaped in doc string. 1991-03-06 Brian Preble (rassilon@mole.ai.mit.edu) * gosmacs.el, help.el, helper.el, hexl.el, hideif.el: Doc fix. * holidays.el, icon.el: Doc fix. 1991-03-05 Brian Preble (rassilon@mole.ai.mit.edu) * gnusmail.el, gnusmisc.el, gnuspost.el, gomoku.el: Doc fix. 1991-03-04 Richard Stallman (rms@mole.ai.mit.edu) * info.el (Info-extract-menu-item): Use regexp search. (Info-extract-menu-node-name): Fix typo in arglist. * info.el (Info-top-node, Info-final-node): New functions. (Info-forward-node, Info-backward-node): New functions. 1991-03-04 Brian Preble (rassilon@mole.ai.mit.edu) * gnus.el: Doc fix. 1991-03-01 Richard Stallman (rms@mole.ai.mit.edu) * rmailout.el (rmail-output-to-rmail-file, rmail-output): Expand file name in dir used for completion. 1991-03-01 Brian Preble (rassilon@mole.ai.mit.edu) * emerge.el, etags.el, field.el, files.el, fill.el, float.el: Doc fix. * fortran.el,, gdb.el: Doc fix. 1991-02-28 Richard Stallman (rms@mole.ai.mit.edu) * bytecomp.el (byte-compile-cond-1): Fix handling of unconditional clauses. 1991-02-28 Brian Preble (rassilon@mole.ai.mit.edu) * edmacro.el, edt.el, edt-doc.el, ehelp.el, emacsbug.el: Doc fix. 1991-02-27 Brian Preble (rassilon@mole.ai.mit.edu) * ebuff-menu.el, echistory.el, edebug.el: Doc fix. 1991-02-26 Richard Stallman (rms@mole.ai.mit.edu) * isearch.el (isearch): Copy point from small window before deciding whether to set the mark. 1991-02-26 Brian Preble (rassilon@mole.ai.mit.edu) * dired.el: Doc fix. (dired-flag-backup-and-auto-save-files): New arg UNFLAG-P. * disp-table.el, doctex.el, doctor.el: Doc fix. * doctex.el (LaTeXify-DOC): Use new permission wording. 1991-02-25 Paul Hilfinger (hilfingr@hilfinger.cs.nyu.edu) * fill.el (fill-individual-paragraphs): Changed response to mailp to effect only leading lines in a region (was getting confused about colons embedded in ordinary text). Changed method of moving to next paragraph in the main loop to use forward-paragraph rather than goto-char, since the final character position is rendered obsolete by the intervening fill-region-as-paragraph. 1991-02-24 Edward M. Reingold (reingold@emr.cs.uiuc.edu) * diary.el (include-other-diary-files): Fix documentation string. 1991-02-23 Roland McGrath (mcgrath@cygint.cygnus.com) * compile.el (next-error): Fixed bug in rms's optimization. 1991-02-23 Richard Stallman (rms@mole.ai.mit.edu) * reposition.el: New file. * loaddefs.el (reposition-window): Autoload it. * rmailkwd.el: Doc fix. * rmail.el (rmail-first-unseen-message): New function. (rmail): Call that. * buff-menu.el (Buffer-menu-mode-map): Make `n' and `p' move by lines. 1991-02-21 Roland McGrath (mcgrath@cygint.cygnus.com) * compile.el (next-error): Do rms's optimization (Feb 8 change) when moving backward, too. 1991-02-20 Jim Blandy (jimb@geech.ai.mit.edu) * startup.el (command-line): Re-arranged nested ifs that handle the different command-line arguments into a cond, to make it easier for me to read. 1991-02-15 Jim Blandy (jimb@pogo.ai.mit.edu) * loaddefs.el: Bind \M-C-r to isearch-backward-regexp, since it really ought to be there. I want it often. 1991-02-08 Richard Stallman (rms@mole.ai.mit.edu) * compile.el (next-error): Count lines from prev error, not file beg. 1991-02-07 Brian Preble (rassilon@mole.ai.mit.edu) * c++-mode.el, c-comment.el, c-fill.el, c-mode.el: Doc fix. * cal.el, calc-alg2.el, calc.el, calendar.el, case-table.el: Doc fix. * chistory.el, cl-indent.el, cl.el, compare-w.el: Doc fix. * compile.el, completion.el, dabbrev.el, dbx.el, debug.el: Doc fix. * diary-add.el, diary.el, diff.el: Doc fix. 1991-02-06 Richard Stallman (rms@mole.ai.mit.edu) * c-mode.el (indent-c-exp, electric-c-terminator, c-indent-line): Treat `default:' like `case...:'. 1991-02-06 Brian Preble (rassilon@mole.ai.mit.edu) * blackbox.el, buff-menu.el, bug-screen.el, bytecomp.el: Doc fix. 1991-02-04 Richard Stallman (rms@mole.ai.mit.edu) * info.el (Info-extract-menu-node-name): New arg MULTI-LINE. (Info-follow-reference): Pass t for that. 1991-02-04 Brian Preble (rassilon@mole.ai.mit.edu) * bg-mouse.el, bib-mode.el: Doc fix. 1991-02-04 Jim Blandy (jimb@gnu.ai.mit.edu) * simple.el (eval-current-buffer): Removed, since it has been reintroduced to the C code. 1991-02-02 Jim Blandy (jimb@gnu.ai.mit.edu) * comint.el (comint-mode): Move the creation of input-ring down with the other variables, and (golly!) initialize it to a ring. (make-comint): Pass a parameter to comint-check-proc - buffer. * shell.el (shell): rebalance parens. 1991-01-31 Richard Stallman (rms@mole.ai.mit.edu) * replace.el (perform-replace): Prevent spurious match of ^foo in second part of foofoo after first part is deleted. 1991-01-31 Jim Blandy (jimb@pogo.ai.mit.edu) * files.el (find-file-noselect): Strip auto-mount prefix only if safe. 1991-01-31 Richard Stallman (rms@mole.ai.mit.edu) * time.el (display-time-filter): Use display-time-file-nonempty-p. (display-time-file-nonempty-p): New function; trace symlinks. 1991-01-30 Brian Preble (rassilon@mole.ai.mit.edu) * ada.el (ada-tabsize): Use prefix arg, not minibuffer. Doc fix. * abbrev.el: Doc fix. * abbrevlist.el: Doc fix. * apropos.el: Doc fix. * appt.el: Doc fix. * array.el: Doc fix. * asm-mode.el: Doc fix. * awk-mode.el: Doc fix. 1991-01-30 Roland McGrath (roland@cygint.cygnus.com) * compile.el (compilation-parse-errors): Don't remove duplicate errors. (next-error): Skip over duplicates here instead. 1991-01-30 Richard Stallman (rms@mole.ai.mit.edu) * appt.el: Doc fix. 1991-01-30 Jim Blandy (jimb@pogo.ai.mit.edu) * paths.el (Info-directory-list): Look for info files in /usr/local/lib/info first, since this is the standard place for info files. 1991-01-29 Richard Stallman (rms@mole.ai.mit.edu) * info.el (info): With prefix arg, read file name and visit it. 1991-01-26 Jim Blandy (jimb@gnu.ai.mit.edu) * term/x-win.el: Do not define the f1 function key to run rmail. 1991-01-25 Richard Stallman (rms@mole.ai.mit.edu) * help.el (help-for-help): Call delete-other-windows. 1991-01-21 Mike Newton (newton@fig) * bibtex.el: updated to conform better with bibtex 0.99c by: bibtex-mode : updated comments to indicate new use of address, add minor explanations and fix small omissions. bibtex-entry : fixed spelling of variable * bibtex.el: Expanded the various bibtex-field-* patterns to allow fields like 'title = poft # "Fifth Triquaterly" # random-conf,'. Needs to have more work done to accept all cases. Added code for the bibtex 'crossref' command, which subsumes other options. Made field ordering different when this option on. Also allow user to have a list of field to be added to all entries (bibtex-mode-user-optional-fields). Merged in Bengt Martensson's changes. 1991-01-18 Roland McGrath (roland@cygint.cygnus.com) * compile.el (compilation-find-buffer): New function to find a compilation buffer to use (or barf if there aren't any). (kill-compilation, compile-goto-error, next-error): Use it. 1991-01-17 Richard Stallman (rms@mole.ai.mit.edu) * info.el (Info): Init Info-directory-list from INFOPATH. 1991-01-12 Jim Blandy (jimb@gnu.ai.mit.edu) * etags.el (visit-tags-file-buffer): use progn instead of save-excursion, so the buffer actually gets visited. 1991-01-11 Richard Mlynarik (mly@august-east.ai.mit.edu) * terminal.el (terminal-cease-edit): If this dubious code is really necessary it might as well be more bug-free. * ehelp.el (with-electric-help): Use window-configs. 1991-01-10 Richard Stallman (rms@mole.ai.mit.edu) * loaddefs.el (minor-mode-alist): Doc fix. 1991-01-08 Roland McGrath (roland@albert.ai.mit.edu) * compile.el (compilation-parse-errors): Fixed maintenance of last-linenum, so dups are really found. 1991-01-08 Jim Blandy (jimb@pogo.ai.mit.edu) * bytecomp.el (byte-compile-byte-code-maker): Since byte-compile-lambda is free to return the original lambda expression, we'd better be prepared to handle things that aren't bytecode objects. 1991-01-07 Jim Blandy (jimb@gnu.ai.mit.edu) * loaddefs.el: Don't forget to specify the filenames when autoload-ing byte-compile-buffer and byte-compile-defun. 1991-01-04 Richard Stallman (rms@mole.ai.mit.edu) * files.el (find-file-noselect): Get rid of automounter prefixes. 1991-01-02 Richard Stallman (rms@mole.ai.mit.edu) * lpr.el (print-region-function): New hook variable. (print-region-1): Use it if non-nil. * vms-patch.el (print-region-function): Specify a function. 1990-12-31 Richard Stallman (rms@mole.ai.mit.edu) * files.el (revert-buffer): Clear buffer-backed-up if file has changed. 1990-12-30 Richard Stallman (rms@mole.ai.mit.edu) * bytecomp.el (byte-compile-buffer, byte-compile-defun): New functions. * loaddefs.el: Autoload them, and byte-compile also. * isearch.el (isearch-message): Always mention if case-sensitive. (isearch): Don't turn off uppercase-flag when char is not upper case. 1990-12-29 Richard Stallman (rms@mole.ai.mit.edu) * terminal.el (te-edit): New command. (terminal-edit-mode, te-terminal-cease-edit): New functions. * isearch.el (isearch): An upper-case letter sets uppercase-flag which turns off case-folding. Save flag in search rings. (isearch-push-state, isearch-pop): Push and pop uppercase-flag. (isearch-search, isearch-message): Handle uppercase-flag. (search-ring, regexp-search-ring): Record uppercase-flag. (isearch-get-string-from-ring): New function. 1990-12-27 Richard Stallman (rms@mole.ai.mit.edu) * rmailsort.el (rmail-sort-messages): Print more progress messages. (rmail-sort-by-size-lines): New command. (rmail-sortable-date-string): Handle non-abbreviated month names. (rmail-sort-messages): Always show message 1. 1990-12-26 Richard Stallman (rms@mole.ai.mit.edu) * startup.el (command-line): Handle -debug-init: use debugger. * isearch.el (isearch): Use only barrier, not opoint, in starting point for reverse search. 1990-12-24 Richard Stallman (rms@mole.ai.mit.edu) * mouse.el (mouse-set-mark): Use sit-for, not sleep-for. (mouse-fill-paragraph): New command. (mouse-fill-paragraph-with-prefix): New command. * rmailout.el (rmail-output-to-rmail-file): Suggest file based on rmail-output-file-alist. 1990-12-23 Richard Stallman (rms@mole.ai.mit.edu) * rmail.el (rmail-convert-to-babyl-format, rmail-nuke-pinhead-header): Accept `remote from ...'@end of UNIX From line. 1990-12-22 Richard Stallman (rms@mole.ai.mit.edu) * subr.el (defun-inline): New function. * bytecomp.el (byte-compile-form): Delete unreachable cond-clause. * time.el (display-time): Specify precise directory for wakeup. (display-time-filter): Don't display 0 as load. Catch error in load-average. 1990-12-21 Chris Hanson (cph@kleph) * info.el (Info-extract-menu-node-name): Permit \n between colon and start of node name. 1990-12-20 Chris Hanson (cph@kleph) * texnfo-upd.el (texinfo-update-menu-region-beginning): Change code that searches for "top" node so it returns the position of the beginning of the node line. Always search from the buffer's start when looking for that node. (texinfo-make-one-menu): Bump forward over the outer node line. 1990-12-20 Richard Stallman (rms@mole.ai.mit.edu) * fortran.el: New version from gildea. 1990-12-20 Chris Hanson (cph@kleph) * texinfmt.el (texinfo-format-footnote): Number each footnote in a node so that multiple footnotes can be distinguished. * texnfo-upd.el: Change regular expression used to identify the "Top" node so that names that begin with "Top" do not confuse it. 1990-12-19 Stephen Gildea (gildea@stop.mail-abuse.org) * fortran.el: Changes for version 1.21.1: Provide the 'fortran feature. Change syntax of '=' to punctuation. Add some more abbrevs. Change fortran-mode-map keymap to non-sparse. (fortran-electric-line-number): Fix bug occurring when fortran-electric-line-number is nil. (fortran-mode, fortran-next-statement): (fortran-line-number-indented-correctly-p): Fix up doc strings. (fortran-indent-to-column): Protect against nil comment-start-skip. 1990-12-19 Richard Stallman (rms@mole.ai.mit.edu) * mpuz.el: New file. 1990-12-18 Richard Stallman (rms@mole.ai.mit.edu) * files.el (hack-local-variables): Match suffix only@eol. 1990-12-16 Richard Stallman (rms@mole.ai.mit.edu) * startup.el (normal-top-level): Execute emacs-startup-hook. * rmail.el (rmail-parse-file-inboxes): Look for BABYL OPTIONS in u.c. (rmail-convert-to-babyl-format): Likewise. And don't skip white space after ^_ that ends a babyl format message. * saveconf.el: No need to rename kill-emacs. (save-context-predicate): Now uses save-buffer-context-predicate. (save-buffer-context-predicate): New function. (kill-emacs-hook): Supply a hook. (just-kill-emacs): New function. (emacs-startup-hook): Set this instead of top-level. (save-context-buffer-name): Test dired-directory for non-nil. (save-context-buffer-file-name): New function. (save-context): Record read-only status of buffers. (recover-context): Handle that. * register.el (point-to-register): If arg, save screen config. (jump-to-register): Restore screen config. 1990-12-15 Roland McGrath (roland@albert.ai.mit.edu) * compile.el (compilation-last-error): Remove this variable. (next-error): Don't set it. 1990-12-12 Ed Reingold (reingold@emr.cs.uiuc.edu) * calendar.el (calendar-end-of-year): Delete extraneous statement in let. (calendar-mode): Update old description of use of hooks to get the fancy diary display. 1990-12-12 Roland McGrath (roland@albert.ai.mit.edu) * compile.el (compilation-error-buffer): Removed. (compilation-last-buffer): Now last buffer in which any of: started compilation; C-x `; C-c C-c; was done. (compile-internal): Don't set compilation-error-buffer. Start the process after setting up the mode, etc. in the compilation buffer. Name the process (downcase mode-name) instead of "compilation" (so it will be "grep" for M-x grep). Make compilation-error-list, compilation-parsing-end local vars. (next-error): Slightly reorganized (changed (let* (while (save-ex))) to (let (save-ex (while)))). Be sure to be in the compilation buffer before doing anything, so we will get local values for vars. Before doing anything, if current buffer is a compilation buffer, set compilation-last-buffer to that. Always do things in compilation-last-buffer. * compile.el (compilation-error-regexp-alist, compilation-{enter,leave}-directory-regexp): Get rid of .*@the beginning of regexps. * compile.el (compilation-mode): Don't make local vars for parser, error-message, and regexp-alist. (compile-internal): Do it here, after calling compilation-mode. * compile.el (compilation-error-list): Changed elt format. (compilation-parse-errors): Don't find files when parsing. Instead record ((DIR . FILE) . LINENO) structures to describe each error. (next-error): Take the error descriptors, and find the file given in the descriptor, using compilation-find-file. Then goto the line number given in the descriptor and replace the error descriptor cons with a marker into the source file buffer. Then search through the compilation-error-list for errors in the same file, and turn their descriptors into markers as well. (compilation-find-file): Take new arg DIR, the directory to use as default in expanding the filename, and MARKER. If we can't find the file@all, pop up MARKER's buffer and scroll to MARKER (to display the error message for which we want this file), and ask the user where to find the file. 1990-12-12 Richard Stallman (rms@mole.ai.mit.edu) * files.el (hack-local-variables): Display local vars@screen top. * server.el (server-process-filter): Don't be confused if input from process is split into multiple chunks. 1990-12-10 Richard Stallman (rms@mole.ai.mit.edu) * c-mode.el (indent-c-find-real-comment): New function. * sort.el (sort-subr): Eliminate special case for floats. * sort.el (sort-reorder-buffer, sort-build-lists): Use (key start . end) to record a record. 1990-12-09 Richard Stallman (rms@mole.ai.mit.edu) * lisp.el (insert-parentheses): Small cleanups. 1990-12-05 Richard Stallman (rms@mole.ai.mit.edu) * replace.el (occur): Show all lines that contain part of a match. 1990-12-04 Richard Stallman (rms@mole.ai.mit.edu) * time.el (display-time-filter): Let user specify mail file name. 1990-12-04 Richard Stallman (rms@mole.ai.mit.edu) * rmail.el (rmail-mode-map): Make < same as j. 1990-12-03 Richard Stallman (rms@mole.ai.mit.edu) * rmailsort.el (rmail-select-correspondent): New function. (rmail-sort-by-correspondent): New function. (rmail-sortable-date-string): Handle two-digit and four-digit years. (rmail-date-full-year): New subroutine. [Done by Szolovitz.] * fill.el (fill-region-as-paragraph): New feature: Adaptive Fill mode. (adaptive-fill-mode, adaptive-fill-regexp): New user options. 1990-11-30 Mike Newton (newton@gumby.cs.caltech.edu) * bibtex.el (start comments): added earlier comments of Bengt Martensson. Some of the changes listed below are originally his (including clean-entry, OPTkey and OPTannote, the function renaming and the preamble code). * bibtex.el (bibtex-field-* patterns): expanded to allow fields like 'title = poft # "Fifth Triquaterly" # random-conf,'. Needs to have more work done to accept all cases. * bibtex.el (bibtex-clean-entry-zap-empty-opts): added. * bibtex.el (bibtex-include-OPTcrossref): added. If set, changes order of the lists presented to luser. * bibtex.el (bibtex-include-OPTkey & bibtex-include-OPTannote): added * bibtex.el (bibtex-mode-user-optional-fields): can be set to a list of field the user wants to add to entries. * bibtex.el (bibtex-mode documentation string): updated for new changes, DEAthesis added back in, bibtex-preamble call added. * bibtex.el (bibtex-entry): add OPTkey/annote. If OPTcrossref set then put it in. * bibtex.el (bibtex-make-entry): renamed bibtex-make-field * bibtex.el (bibtex-make-optional-entry): renamed bibtex-make-optional-field. * bibtex.el (bibtex-Article): change order of presentation if OPTcrossref is set. * bibtex.el (bibtex-InBook): change order of presentation if OPTcrossref is set. * bibtex.el (bibtex-InCollection): change order of presentation if OPTcrossref is set. * bibtex.el (bibtex-InProceedings): change order of presentation if OPTcrossref is set. * bibtex.el (bibtex-MastersThesis): added "note". * bibtex.el (bibtex-preamble): added. * bibtex.el (bibtex-inside-field) : only go backwards if quote is there. * bibtex.el (bibtex-clean-entry): added call to bibtex-clean-entry-zap-empty-opts, OPT field testing for errors. * bibtex.el (bibtex-x-help): added options Conference and preamble, restored DEAthesis. 1990-11-30 Richard Stallman (rms@mole.ai.mit.edu) * rmailsum.el (rmail-summary-mode-map): Don't rebind C-n and C-p. Put rmail-summary-next-all, etc., on M-n and M-p. 1990-11-29 Richard Stallman (rms@mole.ai.mit.edu) * rmail.el (rmail-insert-inbox-text): Don't give up if movemail fails. 1990-11-28 Richard Stallman (rms@mole.ai.mit.edu) * bytecomp.el (byte-compile-form): Don't let handlers change depth. (byte-compile-normal-call): Don't alter byte-compile-depth. (byte-compile-funcall): New function. 1990-11-27 Ed Reingold (reingold@emr.cs.uiuc.edu) * diary.el (diary-float): Allow month to be a list of months, a single month, or t (for all months). 1990-11-26 Jim Blandy (jimb@geech.ai.mit.edu) * simple.el (copy-region-as-kill): No longer prints "Region copied" error message. 1990-11-26 Richard Stallman (rms@mole.ai.mit.edu) * bg-mouse.el (bg-insert-moused-sexp): If before ')', just skip that. 1990-11-26 Neil Mager (neilm@juliet.ll.mit.edu) * appt.el: Fixed if construct for midnight update. 1990-11-25 Ed Reingold (reingold@emr.cs.uiuc.edu) * diary.el (insert-block-diary-entry): Change reference to mark-ring to calendar-mark-ring. 1990-11-21 Neil Mager (neilm@juliet.ll.mit.edu) * appt.el: Updated header of file to reflect changes. * appt.el: Added variable appt-display-diary to display the diary automatically when the appointments list is updated at midnight. * appt.el: Fixed bug to allow update of daily appointments list at midnight if today's diary had no entry. Required moving 'if' statement down several lines. * appt.el: Changed list-diary-entries-hook to diary-display-hook to be compatible with new version of the calendar/diary packgage. 1990-11-20 Ed Reingold (reingold@emr.cs.uiuc.edu) * calendar.el (calendar-version): New constant, (sexp-diary-entry-symbol): New variable. -19 Neil Mager (neilm@juliet.ll.mit.edu) * appt.el: Changed issue-appointments-message to appt.issue.message in header. * appt.el: Using copy modified by rms.-11-22 Richard Stallman (rms@mole.ai.mit.edu) * files.el (basic-save-buffer): Run after-save-hooks. 1990-11-21 Robert J. Chassell (bob@gnu.ai.mit.edu) * texinfmt.el (texinfo-parse-line-arg): Ignore spaces@end of line. (texinfo-format-make-node): Handle Info file names with periods in them. * history.el: Specify `(provide 'history)'. 1990-11-20 Ed Reingold (reingold@emr.cs.uiuc.edu) * calendar.el: Added constant calendar-version: Added new variable sexp-diary-entry-symbol. -09-10 Ed Reingold (reingold@emr.cs.uiuc.edu) * diary.el: (list-diary-entries), (list-hebrew-diary-entries), (list-islamic-diary-entries): Fixed to use add-to-diary-list. 1990-09-07 Ed Reingold (reingold@emr.cs.uiuc.edu) * holiday.el (filter-visible-calendar-holidays): New function. (calendar-holiday-function-rosh-hashanah-etc): Rewrote. (calendar-holiday-function-tisha-b-av-etc): New function. (calendar-holiday-function-passover-etc): New function. (calendar-holiday-function-hanukkah): New function. (calendar-holiday-function-easter-etc): Rewrote. * calendar.el: (calendar-other-month): Rewrote. (calendar-read), (calendar-make-alist): New functions. Eliminated constants calendar-day-abbrev-list and calendar-month-abbrev-list. (calendar-current-date): Eliminated use of calendar-month-abbrev-list. Modified the default value of `calendar-holidays'. Added variable `all-christian-calendar-holidays'. Added variable `all-islamic-calendar-holidays'. Added variable `all-hebrew-calendar-holidays'. (redraw-calendar), (calendar-goto-date), (calendar-goto-julian-date), (calendar-goto-hebrew-date), (calendar-goto-islamic-date), (calendar-goto-iso-date): New functions. (calendar-mode-map): Put them on keys. (calendar-mode): Describe them. (calendar-mode-map): Put scroll-other-window on a key. list-diary-entries-hook: Changed the default value to ordinary-list-diary-hook. * diary.el: (mark-diary-entries), (mark-islamic-diary-entries), (mark-hebrew-diary-entries): Eliminated use of constant alists for month and day names. (prepare-fancy-diary-buffer): Fixed the way holidays are displayed when there are no diary entries but lots of holidays. (ordinary-list-diary-hook), (add-to-diary-list): New functions. 1990-09-06 Ed Reingold (reingold@emr.cs.uiuc.edu) * calendar.el: Changed reference at beginning of file from the report to the published version of the paper. Changed all calls to `mod' to call `%' to avoid problem with cl. (calendar-date-string): Added optional parameter `nodayname'. (cursor-to-islamic-calendar-date): Fixed so that calendar-date-string doesn't try find the day name. (cursor-to-hebrew-calendar-date): Fixed so that calendar-date-string doesn't try find the day name. nongregorian-diary-marking-hook: Fixed typo in doc string. (calendar-mode): Fixed a typo in doc string. (cursor-to-iso-calendar-date): Made message consistent with similar functions for Julian, Islamic, Hebrew, and French calendars. (calendar-absolute-from-gregorian): Simplified calculation. (calendar-mark-today): Changed today mark to `=' to avoid confusion with the default holiday mark. (calendar-julian-from-absolute): Rewrote parallel to other functions. (calendar-islamic-from-absolute): Rewrote parallel to other functions. (calendar-forward-day): Fixed movement when cursor is not on a date and arg is negative. Added description of new `if' form to doc string for calendar-holidays. * diary.el: Changed all calls to `mod' to call `%' to avoid problem with cl. (diary-entry-time): New function. (diary-entry-compare): Rewritten to take time of day into account. * holiday.el: Changed all calls to `mod' to call `%' to avoid problem with cl. (calendar-holiday-function-rosh-hashanah-etc): Fixed grammatical error in a comment. (calendar-holiday-function-hebrew): Fixed typo in doc string. (calendar-holiday-function-islamic): Fixed typo in doc string. (calendar-holiday-function-if): New function. 1990-11-19 Richard Mlynarik (mly@august-east) * rfc822.el (rfc822-addresses): Blow out, don't loop, on ") (rfc822-addresses-1) Error if address "phrase" not followed by route-spec * ebuff-menu.el (Electric-buffer-menu-mode): Remove questionable code which attempted to fake out mode-name in mode-line-list. Also, use slow \\<...> technology. 1990-11-13 David J. MacKenzie (djm@apple-gunkies) * fortran.el: Use domain format instead of uucp format for bug list address. 1990-11-12 Richard Stallman (rms@mole.ai.mit.edu) * lisp.el (lisp-complete-symbol): Use emacs-lisp-mode-syntax-table. 1990-11-05 Roland McGrath (roland@geech.ai.mit.edu) * compile.el (compilation-window-height): Added defconst for this, since it somehow disappeared. * compile.el: Unoverhauled. Restored from old 19 compile.el, plus these changes: (compilation-{enter,leave}-directory-regexp): New variables, specifying regexps that match lines saying the compilation process is entering/leaving a directory. The default values match the messages produced by the `-w' option to GNU make. (compilation-error-regexp-alist): [Idea from tale.] Replaces compilation-error-regexp. Alist (REGEXP FILE-IDX LINE-IDX) of regular expressions to match errors in compilation. If REGEXP matches, the FILE-IDX'th subexpression gives the file name, and the LINE-IDX'th subexpression gives the line number. (compilation-parse-errors): Rewritten. Combine the error and enter/leave directory regexps into a single regexp to search for, and dispatch on which subexpressions match. When the enter-directory regexp matches, set default-directory to that directory, and push it on compilation-directory-stack. When the leave-directory regexp matches, pop the stack to find the matching directory, and set default-directory to that. This change requries RE_NREGS to be (at least 26) (it's been upped from 10 to 30 in v19 ../src/regex.h). (compilation-finish-hook): New variable, a hook to run when a compilation finishes. Called with two args: the compilation buffer that finished, and the string passed to the process-sentinel describing how it finished ("exited", "signaled", etc.). (compilation-sentinel): Call it. (compilation-buffer-name-hook): Hook called to generate a name for a compilation buffer. Passed one arg, the name of the major mode of the buffer. (compile-internal): Use it. [From tale's changes:] (compile): Moved window enlarging to compile-internal. (compile-internal): Don't use with-output-to-temp-buffer. Use display-buffer instead. 1990-11-05 David Lawrence (tale@pogo.ai.mit.edu) * c++-mode.el (c++-mode): Made several global variables related to comment handling buffer-local. * emerge.el: Moved the kill-buffers out of emerge-extract-* and into the emerge-make-*-list functions which are responsible for creating and using them. unwind-protect it to make sure the buffer is always killed. * subr.el: fset buffer-flush-undo to buffer-disable-undo, not buffer-enable-undo. * comint.el, inf-lisp.el, shell.el: Updated to meet Olin's version 2.0 comint offerings. * ring.el: The underlying history mechanism for comint. Generalised handling of a ring data type based on vectors. * history.el: For now, a symlink to ring.el. * loaddefs.el: Updated shell-prompt-pattern doc string. 1990-11-02 Richard Stallman (rms@mole.ai.mit.edu) * files.el (set-visited-file-name): Reject empty string as name. * saveconf.el (save-context): Record dired buffers. (save-context-buffer-name): Compute the "name" of a buffer. (restore-context): Handle expressions as buffer names. 1990-11-01 Richard Stallman (rms@mole.ai.mit.edu) * info.el (Info-find-node): Simplify file search. Try appending `.info' to specified name. 1990-10-31 Jim Blandy (jimb@gnu.ai.mit.edu) * bytecomp.el: Put properties on * so that the byte-compiler knows how to inline multiplication. 1990-10-30 Richard Stallman (rms@mole.ai.mit.edu) * files.el (delete-auto-save-file-if-necessary): Don't delete if auto-saveing in visited file. 1990-10-29 Jim Blandy (jimb@pogo.ai.mit.edu) * subr.el: `buffer-flush-undo' is now officially named `buffer-enable-undo'; added an alias for backward compatibility. 1990-10-28 Richard Stallman (rms@mole.ai.mit.edu) * dabbrev.el (dabbrev-expand): Use original abbrev for case pattern. Do preserve case if expansion has a single uppercase initial. 1990-10-26 Richard Stallman (rms@mole.ai.mit.edu) * subr.el (keyboard-translate): New function. 1990-10-25 Robert J. Chassell (bob@gnu.ai.mit.edu) * texinfmt.el (texinfo-format-defun-1): Replace with new version that handles @deftypefn and related typed definition commands. (texinfo-format-deftypefn-type, texinfo-format-deftypefn-index): Formatting commands for @deftypefn and related typed definition commands. Inserted related `put' expressions. 1990-10-23 David Lawrence (tale@pogo.ai.mit.edu) * emerge.el (emerge-setup, emerge-setup-with-ancestor): Moved insert-buffer calls back before call to emerge-extract-diffs where the merge-buffer really needs to have something in it. (emerge-extract-diffs,emerge-extract-diffs3): Moved errant kill-buffer which interfered with return value of functions. 1990-10-22 David Lawrence (tale@pogo.ai.mit.edu) * loaddefs.el, bibtex.el: Changed bogus "" sequences attempting to generate a single quote to \" pairs. * calc-aent.el, calc-alg-2.el, calc-alg.el, calc-arith.el, calc-bin.el, calc-comb.el, calc-comp.el, calc-cplx.el, calc-ext.el, calc-forms.el, calc-frac.el, calc-funcs.el, calc-graph.el, calc-incom.el, calc-lang.el, calc-macs.el, calc-map.el, calc-mat.el, calc-math.el, calc-misc.el, calc-mode.el, calc-prog.el, calc-rewr.el, calc-rules.el, calc-sel-2.el, calc-sel.el, calc-store.el, calc-stuff.el, calc-trail.el, calc-undo.el, calc-units.el, calc-vec.el, calc-yank.el, calc.el: New files for a very complete RPN calculator which supports integer, rational, floating-point, comples, matrix and symbolic arithmetic to arbitrary precision. edmacro.el: New file, a keyboard macro editor. On its own probably not very useful, but in the context of calc programmability it fits the model well. emerge.el: New file, for merging files or buffers based on their differences. loaddefs.el: Autoloads for calc, quick-calc, full-calc, calc-eval, defmath, calc-grab-region and calc-extensions for the calculator. Bind calc to M-#. Autoloads for edit-kbd-macro, edit-last-kbd-macro and read-kbd-macro for edmacro. Autoloads for emerge-files, emerge-files-with-ancestor, emerge-buffers and emerge-buffers-with-ancestor for emerge. 1990-10-21 Richard Stallman (rms@mole.ai.mit.edu) * window.el (split-window-vertically): Select the bottom window if that lets point stay on screen. * etags.el (visit-tags-table-buffer): Handle local bindings of tags-file-name. 1990-10-19 Robert J. Chassell (bob@gnu.ai.mit.edu) * texinfmt.el (texinfo-format-include, texinfo-format-setfilename): Redefined to handle new include files. (texinfo-format-buffer-1, texinfo-format-region): Add `last-input-buffer' so handles new include files. (texinfo-format-bullet, texinfo-format-minus, texinfo-format-paragraph-break): Require braces if used within line; do no require braces if used@end of line. (texinfo-optional-braces-discard): Discard optional braces. * texnfo-upd.el (texinfo-incorporate-descriptions): Require exact match for item names. (texinfo-update-menu-region-beginning): Do not accidentally copy an info-only title for the top node into the main menu. (texinfo-section-types-regexp): Add `@chapheading'. (texinfo-find-lower-level-node, texinfo-find-higher-level-node, texinfo-menu-locate-entry-p, texinfo-copy-menu-title, texinfo-update-menu-region-beginning, texinfo-update-menu-region-end): Handle `@ifinfo' as well as comment line following node line. (texinfo-multiple-files-update and aux. files): Added to handle multi-file Texinfo sources. 1990-10-18 Richard Stallman (rms@mole.ai.mit.edu) * info.el (Info-help): Go to one window. 1990-10-17 David Lawrence (tale@pogo.ai.mit.edu) * lisp-mode.el: Indent autoload like defun. * cl.el, mh-e.el, gnus.el: Change uses of lisp-indent-hook to lisp-indent-function. 1990-10-16 Richard Stallman (rms@mole.ai.mit.edu) * files.el (revert-buffer): Discard all undo records. * rmail.el (rmail-expunge, rmail-get-new-mail): Likewise. 1990-10-14 Richard Stallman (rms@mole.ai.mit.edu) * bytecomp.el (symbol-function, fset, read-char): Don't open code them. 1990-10-11 Richard Stallman (rms@mole.ai.mit.edu) * simple.el: Kill commands on read-only buffers, just copy to kill-ring. (kill-region): If read-only, just copy to kill-ring. (zap-to-char, kill-line, kill-comment, kill-word): (backward-kill-word, kill-paragraph, backward-kill-paragraph): Allow read-only buffers. * csharp.el: New file. 1990-10-10 Richard Stallman (rms@mole.ai.mit.edu) * rmailsum.el (rmail-summary-scroll-msg-up): Make msg visible. (rmail-summary-scroll-msg-down): Likewise. * bytecomp.el (byte-compile-associative): New function. (+, max, min, -): Use that. (byte-compile-make-binary, byte-compile-butlast): New functions. 1990-10-09 Richard Stallman (rms@mole.ai.mit.edu) * dired.el (dired-compress, dired-uncompress): Put output from subprocess in a buffer to display it. * appt.el (fix-time): Deleted. (appt-select-lowest-window): Renamed from select-lowest-window. (appt-visible): Renamed from appt-visable. * time.el (display-time-filter): Run display-time-hook. * lisp.el (lisp-complete-symbol): Last change clobbered beg. * lisp-mode.el (indent-sexp): Make sure outer loop ends@eob. 1990-10-08 Richard Stallman (rms@mole.ai.mit.edu) * man.el (nuke-nroff-bs): Handle o\b+. * files.el (save-buffers-kill-emacs): Do querying here. Don't die if process-list is not defined. * simple.el (next-complex-command): Fix typo. 1990-10-07 Richard Stallman (rms@mole.ai.mit.edu) * bytecomp.el (byte-compile-file): Run set-auto-mode. 1990-10-01 David Lawrence (tale@pogo.ai.mit.edu) * compile.el: Major overhauls. Remove references to mode, since it never really was a mode. (compile-regexp-list): Don't use a single regexp, but try multiple ones from a list. (next-error): Don't read in every single file when doing next-error, just go to the line of the next file, reading it in if need be. The old method was slow and could end up creating a lot of buffers you never wanted around. Use buffer named in compilation-buffer. Get buffer to use interactively via compilation-use-buffer if called with arg. (compile-internal): Move window resizing here, since a grep window is still a compile window as far as this package is concerned. Don't use with-output-to-temp-buffer since it is very anti-social with show-temp-buffer-hooks which resize based on the how much data is output by its forms; it never worked with compile-window-height that way anyway. (compilation-parse-line): Figures out file and line for next-error from compile-regexp-list. (compilation-use-buffer): Function which sets buffer for next-error to use. 1990-10-01 Richard Stallman (rms@mole.ai.mit.edu) * c-mode.el (c-indent-line): Special clause for `} else'. 1990-09-30 Richard Stallman (rms@mole.ai.mit.edu) * compile.el (compilation-mode): Don't set compilation-error-regexp. (compile-internal): Set it here. (compilation-error-regexp): Put on permanent-local property. * startup.el (command-line-functions): New variable. (command-line-1): Do something with it. * diff.el (diff): Fix bug in searching for first change run. * bytecomp.el (byte-compile-lambda): Handle string constant as value. 1990-09-28 Richard Stallman (rms@mole.ai.mit.edu) * mh-e.el: New version from Larus. * c-mode.el (calculate-c-indent): When looking@previous column-0 line, allow whitespace between the close-paren and the semicolon. 1990-09-26 Richard Stallman (rms@mole.ai.mit.edu) * startup.el (command-line): Make init-file-user permanent. 1990-09-25 David Lawrence (tale@pogo.ai.mit.edu) * edebug.el: New file for elisp source debugging. * loaddefs.el: Autoload edebug with edebug-defun. * lisp-mode.el (eval-defun): If arg, edebug-defun. * simple.el (comment-region): New function. * c-mode.el (c-beginning-of-statement, c-end-of-statement): New functions bound to M-a and M-e respectively. (c-beginning-of-statement-1, c-end-of-statement-1): Engines for above. (set-c-style): New function to easily select a preferred indentation style. (c-style-alist): Styles and variables values for set-c-style. * asm-mode.el: New file. Mode for editing assembler code. * loaddefs.el (auto-mode-alist): Use asm-mode for .s files. Autoload it. 1990-09-24 Richard Stallman (rms@mole.ai.mit.edu) * loaddefs.el (auto-mode-alist): Use \\' for end of string. 1990-09-22 David Lawrence (tale@pogo.ai.mit.edu) * simple.el (shell-command): Document in code comment why -f is not used for C shells. Perhaps this will get people to stop asking about it. 1990-09-21 Richard Stallman (rms@mole.ai.mit.edu) * isearch.el (nonincremental-search): Bind cursor-in-echo-area only as long as necessary. 1990-09-21 David Lawrence (tale@pogo.ai.mit.edu) * loaddefs.el (auto-mode-alist): Use bibtex-mode for .bib files and autoload it. 1990-09-18 Richard Stallman (rms@mole.ai.mit.edu) * doctor.el (doctor-caddr, doctor-cadr, doctor-cddr): Renamed. 1990-09-13 Richard Stallman (rms@mole.ai.mit.edu) * c-mode.el (calculate-c-indent): Skip back across preprocessor lines before testing for a continuation statement. * mouse.el (mouse-set-point): Compensate properly for hscroll. 1990-09-13 Robert J. Chassell (bob@gnu.ai.mit.edu) * texinfmt.el (texinfo-format-inforef): Item name now optional. 1990-09-13 Richard Stallman (rms@mole.ai.mit.edu) * rmail.el (rmail-nuke-pinhead-header): Save From line in Mail-from:. * help.el (print-help-return-message): Mention C-M-v. 1990-09-10 Chris Hanson (cph@kleph) * xscheme.el (xscheme-eval): Add hook that allows Scheme to evaluate arbitrary expression in Emacs. (scheme-interaction-mode): Run scheme-mode-hook before scheme-interaction-mode-hook. Guarantee that the process-filter's state is correctly updated before calling any code that can possibly allow more input to be read from the process. 1990-09-10 Richard Stallman (rms@mole.ai.mit.edu) * rmailsort.el (rmail-sortable-date-string): Handle excess space. Discard century from year. * files.el (after-find-file): Improve a message. 1990-09-09 Richard Stallman (rms@mole.ai.mit.edu) * sendmail.el (mail-signature): t means use signature file. (mail-setup): Implement that. (mail-mode-map): Put mail-signature command back on C-c C-w. (mail-signature-inserted): Variable deleted. 1990-09-08 Richard Stallman (rms@mole.ai.mit.edu) * (ftp-command): Ignore output lines without status codes. 1990-09-06 Richard Stallman (rms@mole.ai.mit.edu) * sendmail.el (mail-signature): New variable holds signature. (mail-setup): Default mail-signature from .signature file. Insert the value. 1990-09-04 Richard Stallman (rms@mole.ai.mit.edu) * (ftp-write-file): Accept status 125 as normal. 1990-09-03 David Lawrence (tale@pogo.ai.mit.edu) * rnews.el: Reinstated. 1990-09-01 Richard Stallman (rms@mole.ai.mit.edu) * files.el (backup-buffer): Test backup-inhibited. (find-file-noselect, set-visited-file-name): Set that var based on backup-enable-predicate. 1990-08-31 David Lawrence (tale@pogo.ai.mit.edu) * sendmail.el (mail-send-and-exit): Remove dependency on other window being in rmail-mode in order to delete selected window. 1990-08-30 David Lawrence (tale@pogo.ai.mit.edu) * paths.el: Add gnus-default-nntp-server, gnus-nntp-service, gnus-your-domain, gnus-your-organization, and gnus-newsrc-file to be visible for admins during installation configuration. * loaddefs.el: (gnus, gnus-post-news): Autoload gnus. (sendnews, postnews): fset to gnus-post-news instead of news-post-news. (rnews, news-post-news): Removed autoloads. * gnus.el: New file. (gnus-make-newsrc-file): Removed. (gnus-read-newsrc-file): Work without above. (gnus-Info-directory): Removed. (gnus-Info-find-node): Work without above. (lots of variables): Made non-interactive. Some doc fixes. * gnuspost.el, gnusmail.el, gnusmisc.el, nntp.el, nnspool.el, * mhspool.el: New files. * rnews.el: Removed. (Renamed to rnews.el.~backout~.) 1990-08-29 Richard Stallman (rms@mole.ai.mit.edu) * loaddefs.el: Put paragraph commands on M-{ and M-}. * files.el (basic-save-buffer): Make error messages more natural. * rmail.el (rmail-search): Call rmail-maybe-set-message-counters. 1990-08-29 David Lawrence (tale@pogo.ai.mit.edu) * files.el (basic-save-buffer): Signal an error when the directory doesn't exist or is write-protected. (set-visited-file-name): When renaming buffer, don't switch from current name if that is the name causing the conflict for the new name. Eg, C-x b foo C-x C-w /tmp/foo would name the buffer foo<2> and leave no foo around. Now it stays foo. * fortran.el (fortran-mode): Define comment-line-start-skip based partially on value of fortran-comment-region; statements starting with c (eg: call, common) were being indented as comments. (fortran-current-line-indentation): Only skip over continuation char or line number for statements. It was giving back wrong values for statements which started in columns 1-6. (fortran-mode-version): Removed. 1990-08-28 David Lawrence (tale@pogo.ai.mit.edu) * loaddefs.el: Autoload reverse-region from sort.el. * cl.el: (defstruct): The copier function invoked the non-existent copy-vector. Calling copy-sequence does the job. (defsetf for point): Point's inverse is goto-char. Of course, what do we do with the other basic types of Emacs Lisp? (member): Another, perhaps counterproductive, speed hack. When test or testnot are symbols (hopefully, non-null), they are replaced by their symbol-function slots. This presumably reduces one indirection per each funcall in the inner loop. (byte-compile-named-list-accessors): Another byte-compile handler, this one eliminates the extra call incurred when using first, ..., tenth, or rest. This makes those list accessors essentially as primitive as car, cdr, or nth. (with-keyword-args): Macro that simplifies most of the handling of klists. The only neglected functionality is that no supplied-p forms exist (although that is true also of lambda lists in Emacs Lisp). (cl-eval-print-last-sexp): Added half-hearted support for -, +, ++, +++, *, **, ***, /, //, ///; and cleared the mvalues mechanism at every call. (declare, proclaim, the): Make some more CL codes easy to load. These are dummies, and have no effect whatsoever. (Perhaps `the' could be made to check in interpreter, and to ignore in the compiler. Then again, writing `typecase' would be also useful and I haven't done it yet.) (byte-compile-ca*d*r): New function, used as a handler from byte-compile-form to eliminate the extra call to the c*r functions in compiled code. (adjoin, map): Changed to use `memq' instead of `member', too. (case, ecase): Via a change in case-clausify, these macros now generate tests using the primitive `memq', instead of the heavier `member'. (member): Rewrote it to exploit the keyword argument machinery. It also tries to call memq whenever possible. (many funcs): Two-branch conds changed into simple ifs here and there, minor layout changes all over. (defsetf): `Puts' occur in the generated code, not in the macro expander. (Didn't we fix this long ago?) (setf): Comment disagreed with the code. Code was right. (defkeyword): Was dropping the DOCSTRING. (reduce): New function. Presented as an example of how to use KLISTs to parse calls in functions that take keyword arguments. (concatenate, map): New functions. (extract-from-klist): Swapped arguments for convenience. (keyword-argument-supplied-p, cl$subseq-as-list): New auxiliary functions. (build-klist): Better error messages. (psetf): Rewrote, patterned after the new psetq. (psetq): Added early check for even number of arguments. This causes a better error message than previously. (defstruct, parse$defstruct$options): asp@CS.CMU.EDU (James Aspnes) reported that defstruct wasn't handling properly the use of accessors of an :included definition applied to instances of the :including structure. Indeed, the old version was implementing a (rather useless) sense of multiple-inheritance that was inimical to the Common Lisp sense. Fixed here by adding properties :structure-includes and :structure-included-in to the struct name. They keep track of the graph of inclusions. (mapc, maplist, mapl, mapcan, mapcon, copy-list, copy-tree, revappend, nreconc, nbutlast, subst, subst-if, subst-if-not, sublis, member-if, member-if-not, tailp): New functions, developed apart and now merged with the main file. They still don't take :keyword arguments. * sort.el (sort-subr): Support floating point numbers. (sort-float-fields, reverse-region): New functions. (sort-numeric-fields, sort-fields, sort-float-fields): Use -ARG to mean count fields from right, not reverse. (Doc fixes.) (sort-fields-1): Let negative arg pass unmolested. Always do ascending sort. (sort-skip-fields): Handle negative field. * tex-mode.el (tex-mode-map): Move bindings of M-{ and M-} to C-c { and C-c }. 1990-08-28 Roland McGrath (roland@gnu.ai.mit.edu) * bytecomp.el (byte-compile-file): If interactive, ask user if he wants to save a buffer visiting file to be compiled. 1990-08-27 David Lawrence (tale@pogo.ai.mit.edu) * compile.el (compilation-error-regexp): Padded up a little to work with new function: (compilation-get-file-and-line): Grabs file and line using matched sub-expressions in compilation-error-regexp. (compilation-parse-errors): Use new function. (compilation-sentinel): Make buffer writable before trying to insert things. * info.el (Info-extract-menu-item): Search for an exact match for menu item before looking for a partial match. Regexp-quote the search string. * lisp.el (lisp-complete-symbol): Display possibilities in *Completions* not *Help*. * help.el (describe-mode): Use Dale Worley's version to also show minor mode documentation if argument is given. Fset defining-keyboard-macro to start-keyboard-macro so its documentation can be found. Currently does not work with auto-fill-mode because of the hook nature of its minor mode indicator variable. 1990-08-26 Richard Stallman (rms@mole.ai.mit.edu) * terminal.el: Move possibly offensive comments to term-nasty.el. (te-quote-arg-for-sh): Give some variables more useful names. 1990-08-25 Richard Stallman (rms@mole.ai.mit.edu) * resume.el: New version from Joe Wells. 1990-08-22 Joseph Arceneaux (jla@geech) * lisp.el (lisp-complete-symbol): Use lisp-mode-syntax table rather than current buffer's. 1990-08-16 Richard Stallman (rms@mole.ai.mit.edu) * isearch.el (isearch): For C-y and C-w in regexp search, use regexp-quote. * time.el (display-time-filter): Check that file is non-empty. 1990-08-16 Joseph Arceneaux (jla@gnu.ai.mit.edu) * term/x-win.el: Don't define C-z here; it's now in screen.el. 1990-08-14 David J. MacKenzie (djm@apple-gunkies) * time.el: New version that uses wakeup instead of loadst. 1990-08-14 Joseph Arceneaux (jla@gnu.ai.mit.edu) * simple.el (eval-current-buffer): New function. * screen.el: Moved screen convenience functions here, formerly in term/x-win.el. other-window now bound to esc-o, ctl-x-o now next-multiscreen-window. 1990-08-13 Richard Stallman (rms@mole.ai.mit.edu) * files.el: Doc fix. 1990-08-11 Joseph Arceneaux (jla@gnu.ai.mit.edu) * screen.el (get-screen): Don't loop on screen-visible-p. Set auto-new-screen-function to new-screen. * gdb.el (gdb-break): Also handle temporary breaks. 1990-08-01 Joseph Arceneaux (jla@gnu.ai.mit.edu) * bytecomp.el (byte-compile-file): Fix format string in call to float-output-format. 1990-07-31 Joseph Arceneaux (jla@gnu.ai.mit.edu) * files.el (find-alternate-file): Don't depend on buffer being read-only for modifications to invoke yes-or-no-p. 1990-07-28 Richard Stallman (rms@mole.ai.mit.edu) * paths.el (rmail-spool-directory): Change silicon-graphics-unix to irix. 1990-07-27 Richard Stallman (rms@mole.ai.mit.edu) * tex-mode.el (tex-region): Set tex-last-temp-file in shell buffer. Give it tex-filter as a filter. (tex-filter): New function. Deletes the temp file and junk files. (tex-directory): Now set to `.'. 1990-07-27 David Lawrence (tale@pogo.ai.mit.edu) * fill.el (fill-region-as-paragraph): Remove tabs that aren't in fill-prefix or part of paragraph indentation. 1990-07-26 Richard Stallman (rms@mole.ai.mit.edu) * bytecomp.el (byte-compile-file-forms): New function. (byte-compile-file): Use that for the runs of ordinary forms. Don't crash when make-byte-code has only 3 elements. * help.el (view-lossage): Use insert, not `newline'. * info.el (Info-find-node): Set case-fold-search for tag tbl buffer. 1990-07-26 Joseph Arceneaux (jla@gnu.ai.mit.edu) * bytecomp.el (byte-compile-verbose): Baud rate is a variable, not a function in 19. 1990-07-26 Richard Stallman (rms@mole.ai.mit.edu) * chistory.el (command-history-repeat): New function. (command-history-map): Put command-history-repeat on x. (command-history-mode): Document that. 1990-07-26 David Lawrence (tale@pogo.ai.mit.edu) * c-mode.el (c-auto-newline): Doc addition. (electric-c-terminator): Removed bogus set-marker. (electric-c-sharp-sign): Make sure c-auto-newline is nil for call to electric-c-terminator. * texinfo.el: Bind tex-insert-quote to " in texinfo-mode-map. * simple.el (goal-column): Make buffer-local. * man.el (manual-entry): Enter view-mode. 1990-07-25 David Lawrence (tale@pogo.ai.mit.edu) * replace.el (occur-last-string): New variable to hold last interactive regexp to occur. (occur): Use occur-last-string. * lisp.el (down-list): Doc fix. 1990-07-24 Richard Stallman (rms@mole.ai.mit.edu) * files.el (find-file-noselect): Nice msg if can write but not read. * lisp.el: Doc fix. 1990-07-19 Richard Stallman (rms@mole.ai.mit.edu) * bytecomp.el (byte-compile-lambda): Fix test for nontrivial function. 1990-07-17 Richard Stallman (rms@mole.ai.mit.edu) * files.el (find-file-read-only-other-window): New function. Put on C-x 4 r. 1990-07-15 Richard Stallman (rms@mole.ai.mit.edu) * register.el (view-register): Don't ignore first line of rect. 1990-07-14 Richard Stallman (rms@mole.ai.mit.edu) * outline.el (show-children): Make default arg smarter. 1990-07-12 Richard Stallman (rms@mole.ai.mit.edu) * compile.el (compile-internal): Make *compilation* read-only except during this function. 1990-07-11 Richard Stallman (rms@mole.ai.mit.edu) * c-mode.el (c-comment-indent): Special case comment after }. 1990-07-05 Robert J. Chassell (bob@gnu.ai.mit.edu) * texinfmt.el: Renamed Lisp definitions section to `Description formatting' and revised `texinfo-format-defun-1' and format defuns to handle object oriented descriptions properly. 1990-06-30 Richard Stallman (rms@mole.ai.mit.edu) * dbx.el: Use C-x SPC for setting break point. 1990-06-29 Richard Stallman (rms@mole.ai.mit.edu) * sort.el: Doc fix. 1990-06-28 Robert J. Chassell (bob@gnu.ai.mit.edu) * texinfmt.el (texinfo-format-paragraph-break): @br{} no longer a noop. * texinfmt.el (texinfo-format-scan): @* now breaks lines; no longer does nothing. * texinfmt.el: `Bottom node' changed to `End node' and `BN' changed to `EN'; also, `footnote-style' changed to `texinfo-footnote-style'. * texnfo-upd.el (texinfo-all-menus-update): With a non-nil argument, now updates all the nodes in the buffer before updating the menus. * texnfo-upd.el (texinfo-master-menu): With non-nil argument (prefix, if interactive) means first update all existing nodes and menus, not just menus. * texinfo.el (texinfo-show-structure): With optional arg, list lines with @-sign commands for @chapter, @section and the like, but not @node lines. 1990-06-27 Richard Stallman (rms@mole.ai.mit.edu) * paragraphs.el (start-of-paragraph-text): Avoid infinite loop. 1990-06-26 Richard Stallman (rms@mole.ai.mit.edu) * disass.el (disassemble-1): Check ptr in range for aref. * bytecomp.el (byte-compile-defvar, byte-compile-defconst): New. (byte-compile-find-vars-1): Do nothing for defun or defmacro. Do nothing for defvar or defconst with only one argument. (byte-compile-lambda): New function for error checking. (byte-compile-verbose): New variable. (byte-compile-file, byte-compile-file-form): Check that for messages. 1990-06-26 David Lawrence (tale@geech) * compile.el (grep): Use `grep-command' to also hold args for grep, like compile-command. * simple.el (kill-ring-save): Fixed to not reference free variable `verbose' but to just unconditionally echo message. (shell-command): Use new `last-shell-command' interactively. (shell-command-on-region): Use new `last-shell-command-on-region' interactively. Delete *Shell Command Output* if no output. (kill-comment): Error if no comment syntax defined. 1990-06-25 Richard Stallman (rms@mole.ai.mit.edu) * simple.el (kill-region): New arg VERBOSE says print a message. (kill-ring-save): Print a message, instead of moving point. 1990-06-23 Randall Smith (randy@substantia-nigra) * dired.el (dired-flag-regexp-files): Added function to flag all files matching a REGEXP for deletion. (): Bound this function to key "F" in dired-mode ("D" was already taken). 1990-06-22 Richard Stallman (rms@albert.ai.mit.edu) * fill.el (fill-region-as-paragraph): Don't consider colon as sentence end. Use syntax table to decide what is whitespace. (justify-current-line): Don't consider colon as sentence end. * c-mode.el (calculate-c-indent): Back up over comma before calling c-backward-to-start-of-continued-exp. (c-backward-to-start-of-continued-exp): Back up over strings. 1990-06-21 Robert J. Chassell (bob@pogo.ai.mit.edu) * texinfmt.el (texinfo-format-include): Include files ending with ".texi" as well as ".texinfo" and ".tex". * texinfmt.el: Define @shortcontents, like @summaryconents, as 'texinfo-discard-line-with-args. 1990-06-20 Richard Stallman (rms@mole.ai.mit.edu) * isearch.el (isearch): Do exit on meta keys. Also exit on function keys and mouse clicks. * loaddefs.el (search-exit-char): Change back to escape. (search-ring-advance-char): Moved from isearch.el. (search-ring-retreat-char): Renamed from ...-recline-char and moved. * float.el: Provide 'float. 1990-06-19 Richard Stallman (rms@mole.ai.mit.edu) * mouse.el (mouse-set-point): Compensate for horizontal scrolling. 1990-06-19 Joseph Arceneaux (jla@gnu.ai.mit.edu) * isearch.el (isearch): Don't quit on meta-chars. 1990-06-15 Joseph Arceneaux (jla@gnu.ai.mit.edu) * loaddefs.el: search-exit-char is now Return. * simple.el: Search-ring advance and recline characters are now M-n and M-p. 1990-06-15 Robert J. Chassell (bob@pogo.ai.mit.edu) * tex-mode.el (tex-start-shell): Don't put `require' in defun, put it@top level. * texnfo-upd.el (texinfo-incorporate-descriptions): Don't accidently find a string in the description that is confused for a menu item. 1990-06-01 Robert J. Chassell (bob@wheat-chex) * texinfo.el: Added `texinfo-tex-region' (C-c C-r) to run TeX on the current region, `texinfo-tex-buffer' (C-c C-t) to run TeX on the current buffer, and `texinfo-tex-print' (C-c C-p) to print the .dvi file made by TeX. Also, bound functions from TeX mode in Texinfo mode: `tex-kill-job' (C-c C-k), `tex-recenter-output-buffer' (C-c C-l), and `tex-show-print-queue' (C-c C-q). 1990-05-31 Joseph Arceneaux (jla@gnu.ai.mit.edu) * startup.el (command-line): Check environment variable VERSION_CONTROL and set version-control appropriately. 1990-05-31 Robert J. Chassell (bob@wheat-chex) * texnfo-upd.el (texinfo-top-pointer-case): rewrote to handle @chapter (or other sectioning) command following Top node. (texinfo-master-menu): rewrote to remove pre-existing master menu, if there is one. Non-nil argument (prefix, if interactive) now means first update all existing menus---previously it always updated all existing menus (very time consuming). (texinfo-all-menus-update, texinfo-every-node-update): added a save-excursion to each so that point does not move when you update the menus or nodes. * texinfmt.el (texinfo-format-parse-args): expand arguments so they can include commands such as @code, etc. 1990-05-31 David Lawrence (tale@geech) * backquote.el (bq-splicequote): Correctly splice in elements when followed by constant elements; don't list the constant elements. * add-log.el (add-change-log-entry): Fixed match test for full name. * lpr.el (print-buffer): Removed an extra trailing parenthesis. 1990-05-30 David Lawrence (tale@geech) * comint.el (comint-load-hook): Superseded by eval-after-load. * inf-lisp.el (lisp-eval-region, lisp-compile-region): Use temporary files instead of send-string to avoid problems with pty buffering. * tex-mode.el (tex-close-latex-block): Allow whitespace after \begin and \end before their opening brace. (tex-last-unended-begin): Ditto. 1990-05-30 Richard Stallman (rms@mole.ai.mit.edu) * subr.el (add-hook): New function. 1990-05-30 David Lawrence (tale@geech) * dired.el (dired-revert): Preserve deletions across reversion and report files flagged for deletion which were already removed. When reading the root directory, name the buffer "/". 1990-05-29 Richard Stallman (rms@mole.ai.mit.edu) * scheme.el (run-scheme): Autoload deleted. Already done in loaddefs. 1990-05-24 Robert J. Chassell (bob@rice-chex) * page-ext.el (pages-directory-goto): Go to end of file if called from the last line (which is empty) of the pages-directory 1990-05-24 David Lawrence (tale@pogo.ai.mit.edu) * shell.el (shell-load-hook): Superseded by eval-after-load. * files.el (cd): Make sure that directory can be changed to. * shell.el (shell-process-cd-or-pushd): ditto. * c++-mode.el: Installed latest version from David Detlefs with all additions made since Sep 1989. 1990-05-24 Robert J. Chassell (bob@apple-gunkies) * texinfmt.el: Added texinfo-format-defindex which provides @defindex and @defcodeindex. Rewrote texinfo-format-synindex to be more modular; removed references to it in texinfo-format-scan and texinfo-format-printindex. 1990-05-22 David Lawrence (tale@geech) * informat.el: (Info-tagify): Give status messages before and after tagifying. (batch-info-validate): Removed status messages around Info-tagify. * rmailout.el (rmail-output): Check for From:, Really-From: and Sender: fields, in that order, and run mail-strip-quoted-names on a non-nil value for the initial Unix mail "From user date" line. 1990-05-21 Richard Stallman (rms@mole.ai.mit.edu) * buff-menu.el (Buffer-menu-buffer): Simplified. Set Buffer-menu-buffer-column initially. 1990-05-18 Robert J. Chassell (bob@apple-gunkies) * page-ext.el: (pages-addresses-file-name): Renamed from addresses-file-name. 1990-05-17 Robert J. Chassell (bob@apple-gunkies) * texinfo.el (texinfo-mode-map): Replace `C-c LETTER ...' key bindings for functions updating nodes and menus with `C-c C-...' keybindings, so as to leave `C-c LETTER' bindings free. * texnfo-upd.el (texinfo-menu-copy-old-description): Copy descriptions that begin with an `@' as well as with word syntax char. (texinfo-insert-master-menu-list): Print message telling which menu entry it is inserting. 1990-05-12 Joseph Arceneaux (jla@gnu.ai.mit.edu) * isearch.el (isearch): Check non-nil of unread command char before checking >= 0. 1990-05-12 Richard Stallman (rms@mole.ai.mit.edu) * info.el (Info-read-subfile): Ignore blank lines in split file list. 1990-05-11 Richard Stallman (rms@albert.ai.mit.edu) * isearch.el (isearch): Advance@least one character if empty string was found the previous time. * replace.el (keep-lines): Likewise. 1990-05-10 Robert J. Chassell (bob@wheat-chex) * texinfmt.el: updated to correspond, more or less, to version 2.8 of texinfo.tex. Does not do refilling. texinfo-format-chapter-1 now displays message telling which section is being formatted, so formatting is no longer silent. Added notations: @quiv, @error, @expansion, @point, @print, @result Added @synindex and @syncodeindex, including texinfo-format-synindex, texinfo-format-syncodeindex, and defined syncode-arg as local variable in texinfo-format-scan. Modified texinfo-format-printindex to handle these. Added @ref, which the same as @xref in Info. Added @titlespec, which is ignored in Info. Added @br @need as noops. Added @today texinfo-format-today in `1 Jan 1900' style. Added @defconst, @defcmd to the texinfo-format-defun series Added @flushright @end flushright, including texinfo-format-flushright, texinfo-end-flushright, texinfo-do-flushright. Added @ftable, which is like the `@table' command but also inserts each item in the first column into the function index. Includes texinfo-ftable, texinfo-ftable-item, texinfo-end-ftable. Added @footnote, including texinfo-format-footnote, footnote-style, texinfo-format-make-node, texinfo-format-bottom-node. 1990-05-10 Richard Stallman (rms@mole.ai.mit.edu) * bytecomp.el (byte-compile-cond-1): Handle (t). 1990-05-04 Richard Stallman (rms@mole.ai.mit.edu) * simple.el (indent-new-comment-line): Delete the temporary newline even if point is not there after indent-for-comment. 1990-05-04 Joseph Arceneaux (jla@gnu.ai.mit.edu) * simple.el (open-line): Insert fill-prefix if defined. 1990-05-01 Richard Stallman (rms@mole.ai.mit.edu) * c-mode.el (c-comment-indent): If@beginning of line and comment-column is 0, insert no space. * replace.el (occur): Avoid infinite loop@end of buffer. 1990-04-30 Richard Stallman (rms@mole.ai.mit.edu) * float.el (float-to-string): Adjust POWER when rounding makes new digit. 1990-04-26 Joseph Arceneaux (jla@gnu.ai.mit.edu) * man.el (manual-entry): Don't allow null topics. * dired.el (dired-create-directory): Use new primitive make-directory. (dired-do-deletions): Use new primitive remove-directory. 1990-04-24 Richard Stallman (rms@mole.ai.mit.edu) * dired.el (dired-readin): Mark buffer unmodified@end. 1990-04-18 Joseph Arceneaux (jla@gnu.ai.mit.edu) * loaddefs.el: Removed Meta-g def of fill-region. 1990-04-13 Joseph Arceneaux (jla@gnu.ai.mit.edu) * c-mode.el (c-comment-indent): Don't need \n in #endif/#else regexps. 1990-04-12 Richard Stallman (rms@mole.ai.mit.edu) * isearch.el (isearch): In reverse search, don't move point for C-w, C-y. * startup.el (normal-top-level): Don't check envvar PWD on vms. 1990-04-10 Richard Stallman (rms@mole.ai.mit.edu) * add-log.el (add-change-log-entry): Require match in full-name as well as login-name. Don't switch windows if desired buffer already current. (add-change-log-entry-other-window): Take two args and pass on. Change interactive spec so default behavior doesn't change. 1990-04-09 Richard Stallman (rms@mole.ai.mit.edu) * dired.el (dired-mode): Set list-buffers-directory like dired-directory. So name appears in list-buffers. * sendmail.el (mail-do-fcc): Append properly to rmail buffers. * bytecomp.el (byte-compile-find-vars-1): Treat interactive and save-window-excursion like condition-case. 1990-04-08 Richard Stallman (rms@mole.ai.mit.edu) * bytecomp.el (byte-compile-file-form): Most forms pushed on `pending'. Those that are special print their output and first compile and print the contents of `pending'. (byte-compile-file):@end of file, compile and print `pending'. (byte-compile-pending): New function. * bytecomp.el (byte-compile-find-vars-1): Special case unwind-protect and save-window-excursion. 1990-04-06 Joseph Arceneaux (jla@gnu.ai.mit.edu) * mouse.el: Check consp of coordinates-in-window-p result. 1990-04-06 Richard Stallman (rms@mole.ai.mit.edu) * bytecomp.el (byte-compile-file): Accumulate consecutive ordinary forms, put them together into lambdas, and call them. (byte-compile-file-form): With nil, do nothing fast. (byte-compile-lambda): Do nothing with trivial lambdas 1990-04-05 Richard Stallman (rms@mole.ai.mit.edu) * rmailout.el (rmail-output-to-rmail-file): Set message counters before inserting in a file being visited. 1990-04-05 Joseph Arceneaux (jla@gnu.ai.mit.edu) * screen.el: Don't redefine ctl-x {p,n}, just ctl-x o. 1990-04-05 Richard Stallman (rms@mole.ai.mit.edu) * startup.el (command-line-1): Always erase *scratch*, not current buf. 1990-04-04 Joseph Arceneaux (jla@gnu.ai.mit.edu) * screen.el: Define keys ctl-x {o, n, p}. Make C-Z iconify emacs. (next-multiscreen-window): (previous-multiscreen-window): Include the minibuffer screen if the minibuffer is active. 1990-04-03 Richard Stallman (rms@mole.ai.mit.edu) * fill.el (fill-individual-paragraphs): Check for mail header name only@beginning of line. 1990-03-29 Richard Stallman (rms@mole.ai.mit.edu) * keypad.el: Define the `do' key. * dired.el (dired-diff): New command. (dired-mode-map): Put on `='. 1990-03-28 Jim Kingdon (kingdon@mole.ai.mit.edu) * rmail.el (rmail-insert-rmail-file-header, rmail-convert-file): Put in "-*- rmail -*-". Rename rmail-mode to rmail-mode-2. (rmail-mode): New function. Move docstring and (interactive) from rmail-mode to rmail-mode-2. (rmail): Call rmail-mode-2 not rmail-mode. 1990-03-27 Richard Stallman (rms@mole.ai.mit.edu) * etags.el (tags-loop-continue): Print message when find a match, if tags-loop-operate is nil. * c-mode.el (calculate-c-indent): Don't consider a line as a function definition line if it contains `='. * compile.el (compile-find-file): New function, to search a path. (compilation-parse-errors): Use it. (compilation-search-path): New user variable. 1990-03-25 Richard Stallman (rms@mole.ai.mit.edu) * loaddefs.el: Add autoloads for ispell.el. * ispell.el: Doc fixes. Problem: key for ispell-next was already used by set-selective-display. Should we move that? 1990-03-25 Joseph Arceneaux (jla@gnu.ai.mit.edu) * x-mouse.el (x-select): Only pass one arg to x-own-selection. 1990-03-23 Richard Stallman (rms@mole.ai.mit.edu) * fortran.el (fortran-electric-line-number): Make sure arg to self-insert-command is a number. 1990-03-21 Richard Stallman (rms@mole.ai.mit.edu) * fortran.el (fortran-electric-line-number): Use self-insert-command for all insertion. 1990-03-21 Joseph Arceneaux (jla@gnu.ai.mit.edu) * startup.el (command-line): Load the window-system file if DISPLAY is set or -d was specified on the command line. 1990-03-20 Richard Stallman (rms@mole.ai.mit.edu) * lpr.el (print-region-1): New arg PAGE-HEADERS. On system V, handle it by running pr. Use print-region-new-buffer to copy text to temp buffer. (all commands): Pass new arg; pass lpr-switches unchanged. (print-region-new-buffer): New function. 1990-03-20 Joseph Arceneaux (jla@gnu.ai.mit.edu) * term/x-win.el (x-pop-initial-window): Set mouse-motion-handler. 1990-03-19 Joseph Arceneaux (jla@gnu.ai.mit.edu) * sendmail.el (mail-send): Force deletion of auto-save files. (mail-do-fcc): Add closing paren. 1990-03-17 Richard Stallman (rms@mole.ai.mit.edu) * bytecomp.el (byte-compile-file): Turn off print-length. 1990-03-16 Joseph Arceneaux (jla@gnu.ai.mit.edu) * simple.el (auto-fill-mode): Doc fix. 1990-03-14 Joseph Arceneaux (jla@gnu.ai.mit.edu) * term/x-win.el: Set suspend hook here, as well as put 'iconify-emacs on C-Z. * screen.el: Check screenp of last-selected-screen in iconification functions. 1990-03-14 David Lawrence (tale@pogo.ai.mit.edu) * c++-mode.el (c++-comment-region): New function. (c++-uncomment-region): New function. 1990-03-11 Joseph Arceneaux (jla@gnu.ai.mit.edu) * mouse.el (track-mouse): x-mouse-grabbed now mouse-grabbed. * x-mouse.el (dynamic-rect-selection): Ditto. 1990-03-10 Joseph Arceneaux (jla@gnu.ai.mit.edu) * x-mouse.el: Conditionalization of certain functions dependent on X version. Added mouse-key descriptions for X11. 1990-03-09 Richard Stallman (rms@mole.ai.mit.edu) * man.el (nuke-nroff-bs): Allow period in middle of topic name. * simple.el (do-auto-fill): Handle auto-fill-inhibit-regexp. * outline.el (outline-mode): Set that from outline-regexp. 1990-03-08 Joseph Arceneaux (jla@gnu.ai.mit.edu) * screen.el (deiconify-function, multi-minibuffer-startup, attached-minibuffer-startup, detached-minibuffer-startup): Pass second parameter t to select-screen. 1990-03-07 Richard Stallman (rms@mole.ai.mit.edu) * sendmail.el (mail-do-fcc): Temporarily unwiden 1990-03-06 Joseph Arceneaux (jla@gnu.ai.mit.edu) * screen.el (deiconify-function): Setq last-selected-screen nil. * array.el, blackbox.el, compile.el, diff.el, files.el,: * gomoku.el, hanoi.el, informat.el, ispell.el, life.el, mailalias.el: * man.el, rmail.el, sendmail.el, terminal.el: * texinfmt.el: Renamed buffer-flush-undo to buffer-disable-undo. 1990-03-04 Joseph Arceneaux (jla@gnu.ai.mit.edu) * screen.el (get-screen): If the screen is not visible, make it so. 1990-03-02 Joseph Arceneaux (jla@gnu.ai.mit.edu) * term/x-win.el: Don't set suspend-hook any more. * screen.el: No more x-specific things, this is now entirely window system independent. (new-screen): Use new function: (new-screen-position): Determine position of new screen based on that of selected-screen. (pop-initial-screen): Set first-screen-user-positioned if user did so. Also decide on which screen style depending on either new variable `separate-minibuffer-screen' or minibuffer elt in window-system-switches. (detached-minibuffer-startup): Add screen colors to minibuffer alist if possible. Also make sure screen-default-alist has minibuffer element none, and correct name. 1990-03-01 Joseph Arceneaux (jla@gnu.ai.mit.edu) * term/x-win.el: Require 'screen as well in initial setup code. Don't set suspend hook; this will be something else. Removed redundant cursor-shape delcarations. The all begin with x-pointer- now. Added some more definitions to the function keys. Generally cleaned up this file. 1990-03-01 David Lawrence (tale@pogo.ai.mit.edu) * subr.el (force-mode-line-update): New function. time.el (display-time-filter): Update modeline with above. * rmail.el (rmail-get-new-mail): Remove " Mail" from display-time-string if necessary. 1990-02-28 Joseph Arceneaux (jla@gnu.ai.mit.edu) * screen.el (iconify-function, iconify-emacs, deiconify-function): New functions. * files.el (save-some-buffers): Removed last parameter skip-list. Now this checks for buffer-local variable save-buffers-skip to determine whether or not to avoid asking to save the buffer. * rmail.el (rmail-mode): Removed skip-list stuff. (rmail-variables): make-local-variable save-buffers-skip. * compile.el (compile): Removed additional parameter to save-buffers. 1990-02-26 David Lawrence (tale@pogo.ai.mit.edu) * time.el (display-time-hook): New hook run by display-time-filter. (display-time-filter): Run display-time-hook after setting display-time-string. (rmail-pop-up): Default display-time-hook to automatically retrieve new mail if the variable rmail-pop-up is non-nil. (add-clock-handler): Removed; superceded by timer.el. * loaddefs.el: Removed add-clock-handler. 1990-02-25 David Lawrence (tale@pogo.ai.mit.edu) * c++-mode.el: New file. (point-bol): Removed this function. * loaddefs.el: Autoload C++-mode. (auto-mode-alist): c++-mode for .C and .cc files. 1990-02-25 Joseph Arceneaux (jla@gnu.ai.mit.edu) * lisp-mode.el (indent-sexp): Changed opoint to last-point. Very strange, I thought I'd already fixed this. * screen.el: New file. 1990-02-24 David Lawrence (tale@pogo.ai.mit.edu) * loaddefs.el: Autoload for diff. * files.el (diff): Superceded by diff.el. (diff-switches-function): Still needs to be merged into diff.el. * diff.el: New file. Changes from the original include recognition of context diffs, rewrites of motion functions for more efficiency, and general tidying of code. 1990-02-22 Joseph Arceneaux (jla@gnu.ai.mit.edu) * isearch.el (isearch): After doing read-event, check numberp of char first. * replace.el (perform-replace): Use read-event rather than read-char. Check that returned object is char before comparisons. 1990-02-22 David Lawrence (tale@pogo.ai.mit.edu) * files.el (file-newest-backup): Return either the name of an existing backup file or nil if none exists. * server.el (server-program): Renamed from "server" to "emacsserver". 1990-02-20 Joseph Arceneaux (jla@gnu.ai.mit.edu) * fill.el (fill-region-as-paragraph): Fixed regexp typo in call to re-search-forward. 1990-02-19 David Lawrence (tale@pogo.ai.mit.edu) * simple.el (kill-comment): Take better advantage of comment-end. 1990-02-18 Richard Stallman (rms@mole.ai.mit.edu) * ispell.el: new file. 1990-02-14 Joseph Arceneaux (jla@gnu.ai.mit.edu) * calendar.el: Require cl. 1990-02-13 David Lawrence (tale@wheat-chex) * files.el: Set default-directory of *Directory* to one displayed by list-directory. * compile.el: Added to compilation-error-regexp pattern for errors from IBM High C. 1990-02-13 Joseph Arceneaux (jla@gnu.ai.mit.edu) * files.el (save-some-buffers): New parameter skip-list of buffers to not save. New variable save-buffers-skip-list. * rmail.el (rmail-mode): Add the RMAIL buffer to the skip list. * compile.el (compile): Pass save-buffers-skip-list to save-some-buffers. 1990-02-12 Richard Stallman (rms@mole.ai.mit.edu) * rmailsum.el (rmail-summary-by-regexp, rmail-message-regexp-p): New functions. 1990-02-12 David Lawrence (tale@galapas) * tex-mode.el: require oshell until converted to comint. * loaddefs.el: point run-lisp autoload to new file inf-lisp. * shell.el: converted to comint. Relegated original to oshell.el. * inf-lisp.el: converted to comint. * comint.el: removed last vestiges of original history stuff. 1990-02-07 David Lawrence (tale@galapas) * inf-lisp.el: inferior-lisp-program can be a list of the programme name and its arguments. 1990-02-06 Ed Reingold (reingold@emr.cs.uiuc.edu) * calendar.el: (french-calendar-leap-year-p): Rewritten with corrected rule. (calendar-absolute-from-french): Fixed comments. (calendar-french-from-absolute): Rewrote using calendar-sum. (cursor-to-french-calendar-date): Simplified and corrected spelling. 1990-02-06 Richard Stallman (rms@mole.ai.mit.edu) * register.el (insert-register): Return nil. (jump-to-register): Likewise. * sort.el (sort-subr): Return nil. * simple.el (copy-region-as-kill): Return nil. * register.el (set-register): Return VALUE. 1990-02-06 Joseph Arceneaux (jla@albert.ai.mit.edu) * term/x-win.el (x-pop-up-window): Die and leave disgusted message when we can't get our X-window up. 1990-02-05 Richard Stallman (rms@mole.ai.mit.edu) * c-mode.el (calculate-c-indent): When distinguishing top level, check for doublequotes when checking for parens. 1990-02-04 Richard Stallman (rms@mole.ai.mit.edu) * tex-mode.el (tex-show-print-queue): Restart shell like tex-file. 1990-02-02 Richard Stallman (rms@mole.ai.mit.edu) * tex-mode.el (tex-bibtex-file, tex-file, tex-region): Restart the tex shell if process is gone or stopped. (tex-shell-running): New function. 1990-02-01 Richard Stallman (rms@mole.ai.mit.edu) * texinfmt.el (batch-texinfo-format): Paren error on (setq error 1). 1990-01-27 Ed Reingold (reingold@emr.cs.uiuc.edu) * calendar.el: (scroll-calendar-left): Fixed so it works when the cursor is not positioned on a day. (cursor-to-calendar-day-of-year): Fixed so that "day" is properly pluralized, depending how many days remain in the year. (french-calendar-leap-year-p): New function. (french-calendar-last-day-of-month): New function. (calendar-absolute-from-french): New function. (calendar-french-from-absolute): New function. (cursor-to-french-calendar-date): New function. (calendar-mode-map): Put cursor-to-french-calendar-date on a key. (calendar-mode): Describe cursor-to-french-calendar-date. 1990-01-31 Richard Stallman (rms@mole.ai.mit.edu) * yow.el: Provide 'yow. 1990-01-25 Richard Stallman (rms@mole.ai.mit.edu) * lisp-mode.el: Indent prog2 specially. 1990-01-24 Richard Stallman (rms@albert.ai.mit.edu) * compare-w.el (compare-windows): Handle compare-ignore-case. 1990-01-19 David Lawrence (tale@cocoa-puffs) * dired.el: Removed restriction for -s, -i and -F switches to ls. * loaddefs.el: Removed above from dired-listing-switches doc string. * mh-e.el (c/o James Larus <larus@cs.wisc.edu>): Accepts message range specifications. Defaults sequence name to previous sequence name when reading. Made mode-line id user-setable. Changes from Gildea: documentation and a few typos. Added command to pipe message through shell command. Fixed refile twice failed after second one moved. Added changes from Gildea to speed-up mh-e. Won't reverse sequence lists. Allows arbitrary fields for pick. Packing folder now properly updates sequence list. Added previously missing %s in mh-redistribute. * timer.el: (new file) Adds run-at-time function with absolute or relative time spec to run a function with args. * loaddefs.el: autoload for run-at-time. 1990-01-16 Richard Stallman (rms@mole.ai.mit.edu) * rfc822.el (rfc822-addresses): Barf, don't loop, on > in host name. 1990-01-16 Ed Reingold (reingold@emr.cs.uiuc.edu) * diary.el: (insert-diary-entry): New function. (insert-weekly-diary-entry): New function. (insert-monthly-diary-entry): New function. (insert-yearly-diary-entry): New function. (insert-hebrew-diary-entry): New function. (insert-monthly-hebrew-diary-entry): New function. (insert-yearly-hebrew-diary-entry): New function. (insert-islamic-diary-entry): New function. (insert-monthly-islamic-diary-entry): New function. (insert-yearly-islamic-diary-entry): New function. * calendar.el: Autoload these functions. (calendar-mode-map): Put them on keys. (calendar-mode): Describe them. 1990-01-11 Ed Reingold (reingold@emr.cs.uiuc.edu) * diary.el (list-diary-entries): Deleted several lines of extraneous code and added `nongregorian-diary-listing-hook' to the list of hooks called@the end; this is for use in including Hebrew, Islamic, Julian, or ISO diary entries. A similar `nongregorian-diary-marking-hook' was added to the list of hooks called at the end of mark-diary-entries for the same reason. (diary-name-pattern): Fixed the documentation and added an optional parameter FULLNAME which insists on the full spelling of the name; this is also for use in marking Hebrew or Islamic diary entries (those month names are not unique in the first three characters). (mark-hebrew-diary-entries): New function. (list-hebrew-diary-entries): New function. (mark-hebrew-calendar-date-pattern): New function. (mark-islamic-diary-entries): New function. (list-islamic-diary-entries): New function. (mark-islamic-calendar-date-pattern): New function. (list-diary-entries): Added nongregorian-diary-listing-hook. (mark-diary-entries): Added nongregorian-diary-marking-hook. * calendar.el: Added documentation for the hooks described above. 1990-01-10 Richard Stallman (rms@mole.ai.mit.edu) * isearch.el (isearch): Check adding * or | to regexp even if failing. * yow.el (yow): Don't be confused by percent in message. Use raw prefix arg as first argument; process it later. 1990-01-08 Robert J. Chassell (bob@apple-gunkies.ai.mit.edu) * texnfo-upd.el (texinfo-update-node, texinfo-sequential-node-update): fixed auto-fill-hook bug. 1990-01-08 Joseph Arceneaux (jla@spiff) * term/x-win.el (x-pop-up-window): Set global-minibuffer-screen. 1990-01-08 Ed Reingold (reingold@emr.cs.uiuc.edu) * calendar.el (calendar-date-is-visible-p): Fixed so it does not switch to the calendar buffer. * diary.el (prepare-fancy-diary-buffer): Compute the list of holidays only once for each three-month period, not once for each date displayed in the calendar. This saves an enormous amount of time in the fancy diary display for multiple days. 1990-01-07 Ed Reingold (reingold@emr.cs.uiuc.edu) * calendar.el: Fixed the value of list-diary-entries-hook. (regenerate-calendar-window): Changed (update-display) to (sit-for 0). Corrected several instances of "dairy" to "diary". (describe-calendar-mode): Added this function to issue the message "Preparing..." to `?' key in calendar-mode because it's so incredibly slow for describe-mode to prepare the help buffer. (calendar-holidays): Fixed the examples in the doc-string. * diary.el: Corrected several instances of "dairy" to "diary". 1990-01-05 Joseph Arceneaux (jla@spiff) * term/x-win.el: Function key stuff redone. 1990-01-04 Richard Stallman (rms@mole.ai.mit.edu) * tex-mode.el (tex-kill-job): Avoid error if no process. * bibtex.el (sun menus): Avoid error if defmenu not defined. * doctor.el: Delete spurious symbol@top level. 1990-01-03 Richard Stallman (rms@mole.ai.mit.edu) * view.el (View-scroll-lines-forward): Exit@end only if view-scroll-forward-exits is non-nil. 1989-12-29 Ed Reingold (reingold@emr.cs.uiuc.edu) * calendar.el (mark-diary-entries): Made "sticky" so effect continues whenever the calendar is redisplayed. (mark-calendar-holidays, calendar-unmark): Likewise. 1989-12-26 Ed Reingold (reingold@emr.cs.uiuc.edu) * calendar.el: Fixed many minor bugs throughout the code. The major changes are as follows. Completely rewrote the Hebrew calendar functions to make them much faster and hence make holiday determination much faster Split the code into three files: the calendar stuff is in the main file, calendar.el; the diary stuff is in diary.el; the holiday stuff is in holiday.el. Added a diary hook example that shows how to get sorted diary entries in the fancy diary buffer. (calendar-iso-from-absolute): New function. (calendar-absolute-from-iso): New function. (cursor-to-iso-calendar-date): Added `D' calendar command to give the day number in the Gregorian year and number of days remaining. (mark-diary-entries): Made two-digit abbreviated years acceptable in diary entries. Changed possible diary entry styles: DAY entries are no longer available; European style is now an option. Diary entry styles are now controlled by a list of pseudo-patterns. (list-diary-entries): Made two-digit abbreviated years acceptable in diary entries. Changed possible diary entry styles: DAY entries are no longer available; European style is now an option. Diary entry styles are now controlled by a list of pseudo-patterns. (calendar-date-string): Display style of dates is now controlled by a pseudo-pattern so the European style is available. (all functions conatining the word `hebrew'). (list-diary-entries, mark-diary-entries): (include-other-diary-files, mark-included-diary-files): Added the possibity of `shared diary files' with a recursive include mechanism like the C preprocessor (list-calendar-holidays): Eliminated the 'special class of holidays, rewriting the entire mechanism to make it more general. (calendar-holiday-function-float): Changed the 'float class of holidays so that negative values count backward from end of month: 5 is no longer used for the last occurrence of a day in a month; -1 is used instead 1989-12-27 Richard Stallman (rms@mole.ai.mit.edu) * rmail.el (rmail): Handle MAIL environment var. 1989-12-25 Richard Stallman (rms@mole.ai.mit.edu) * loaddefs.el (sentence-end): Allow single space@EOL. * etags.el: New name for tags.el. * loaddefs.el: Autoloads changed. * paths.el (manual-formatted-dirlist): New alternative for UMAX. * simple.el (next-complex-command): Fix err msg. 1989-12-21 Richard Stallman (rms@mole.ai.mit.edu) * lisp-mode.el (indent-sexp): Exit outer loop if make no progress. 1989-12-20 Richard Stallman (rms@mole.ai.mit.edu) * telnet.el (telnet-initial-filter): Make `password' local. 1989-12-18 Richard Stallman (rms@mole.ai.mit.edu) * simple.el (edit-and-eval-command): Add new command to history. * chistory.el (repeat-matching-complex-command): Delete the useless history entry for this command. 1989-12-17 David Lawrence (tale@cocoa-puffs) * (comint-)shell.el: Use comint. NOT ready yet. * (comint-)inf-lisp.el: Broke the inferior lisp code out to its own file and converted for comint use. NOT ready yet. 1989-12-16 Richard Stallman (rms@mole.ai.mit.edu) * c-mode.el (indent-c-exp): Verify that comment start isn't in string. Reindent comment on starting line like other comments. * tex-mode.el (validate-tex-buffer): Use tex-validate-region, not obsolete name. 1989-12-15 Joseph Arceneaux (jla@spiff) * isearch.el: Replaced all occurences of read-char with read-event; and check return type. 1989-12-15 Richard Stallman (rms@mole.ai.mit.edu) * appt.el: New file. * files.el (backup-buffer): Ask question (if nec) before writing file. 1989-12-12 David Lawrence (tale@cocoa-puffs) * medit.el and simple.el: initial definition of keymaps uses copy-keymap, not copy-alist. 1989-12-11 David Lawrence (tale@cocoa-puffs) * telnet.el: Converted to use comint. Removed delete-char-or-send-eof and telnet-copy-last-input. Added telnet-mode-hook. Modified telnet-filter to insert-before-markers at the process-mark. 1989-12-10 David Lawrence (tale@cocoa-puffs) * prolog.el: Converted to use comint. Replaced copy-keymap for copy-alist of comint-mode-map. * kermit.el: Converted to use comint. Replaced kermit-clean-filter with a more efficient version. * comint.el: Added optional arguments ``terminator'' and ``delete'' to comint-send-input, for processes that want to see a CR or CR-LFD pair instead of LFD and for processes that do echoing. 1989-12-08 David Lawrence (tale@cocoa-puffs) * history.el (new file): general history mechanism, primarily intended for interactive processes. * comint.el: converted to use history.el. Took out all the ring code. comint-send-input will replace entire input region rather than append to it (user option?). comint-kill-output will only nuke through the last newline, to retain prompt. comint-show-output will start window@line before output start, to show command. * dbx.el: Converted to use comint-mode. 1989-12-06 David Lawrence (tale@wheat-chex) * comint.el: make-variable-buffer-local declarations moved from comint-mode to defvars. * gdb.el: Converted to use comint-mode. 1989-12-05 David Lawrence (tale@wheat-chex) * comint.el (new file): Added FSF copyright. Moved bindings off of C-c LETTER. Cleaned up references to cmu* files. Made comint-send-input do unconditional end-of-line before processing. cominit-exec will signal an error if no programme name. Removed full-copy-sparse-keymap and comint-log-user. 1989-12-04 Joseph Arceneaux (jla@spiff) * isearch.el: fset synonyms for re-search-*. 1989-11-30 Joseph Arceneaux (jla@spiff) * c-mode.el (c-comment-indent): Place comments 2 spaces after #endif and #else. 1989-11-27 Joseph Arceneaux (jla@spiff) * shell.el (shell-complete-file-name): Don't count tildes as filename separators if they are in the filename to be expanded. 1989-11-22 Joseph Arceneaux (jla@spiff) * mouse.el, x-mouse.el: Moved button definitions from mouse.el to x-mouse.el. They are defined differently depending upon the X version. 1989-11-17 Joseph Arceneaux (jla@spiff) * paths.el: Changed rmail-file-name from const to a var. 1989-11-16 Ed Reingold (reingold@cs.uiuc.edu) * tex-mode.el (slitex-mode): New alternative to plain-tex-mode and latex-mode. (tex-mode): Know when to choose slitex mode. (tex-run-command, latex-run-command, slitex-run-command): New vars. (tex-mode, latex-mode, slitex-mode): Init tex-command from them. (tex-latex-block): Insert matching begin-end pair for latex. (tex-close-block): Be smart about nested begin-end pairs. (tex-last-unended-begin): New subroutine. (tex-region): Handle buffers with no files. (tex-file): Cleaner error for buffer with no file. (tex-generate-zap-file-name): New name for tex-generate-junk-file-name. 1989-11-16 Joseph Arceneaux (jla@spiff) * simple.el: New variable x-select-kill. (copy-region-as-kill): If non-nil, make the killed text an X selection. * fill.el (justify-current-line, fill-region-as-paragraph): Consider : as sentence terminator. 1989-11-14 Richard Stallman (rms@mole.ai.mit.edu) * bytecomp.el (byte-compile-file): Copy .el permissions to .elc. Delete .elc if possible before writing. 1989-11-09 Joseph Arceneaux (jla@spiff) * x-mouse.el (x-select-wipe): New function. Bind the selection functions to the default keys. 1989-11-08 Richard Stallman (rms@mole.ai.mit.edu) * tex-mode.el (tex-bibtex-file): New command. (tex-mode-map): Put on a key. * debug.el (debug): No need to check match-data for invalid markers. 1989-11-08 Joseph Arceneaux (jla@spiff) * paths.el (mh-progs, mh-lib): Use file-directory-p, and check /usr/local/bin as well. 1989-11-06 Richard Stallman (rms@mole.ai.mit.edu) * tex-mode.el (tex-print, tex-view): Run the command asynchronously. Eliminate tex-after-print-hook. 1989-11-05 Richard Stallman (rms@mole.ai.mit.edu) * tex-mode.el (tex-region): Delete tex output files directly, not with rm. Use tex-generate-junk-file-name to make tex-out-file. (tex-generate-junk-file-name): New function. (tex-strip-dots): New name for TeX-strip-dots. (tex-append): New name for tex-append-dvi. Suffix is now argument. (tex-view): New function. (tex-dvi-view-command): New variable. * files.el (make-auto-save-file-name): For non-file buffer, use Emacs pid and buffer name. 1989-10-31 Richard Stallman (rms@mole.ai.mit.edu) * files.el (hack-local-variables): save-excursion around the eval. 1989-10-30 Richard Stallman (rms@mole.ai.mit.edu) * tex-mode.el (tex-region): Replace `.' in host name with `-'. Eliminate extra / in arg when running TeX. (TeX-strip-dots): New subroutine. 1989-10-29 Richard Stallman (rms@mole.ai.mit.edu) * tex-mode.el (tex-region): Run TeX in dir the source file is in. 1989-10-27 Richard Stallman (rms@mole.ai.mit.edu) * tex-mode.el (tex-region): Use shell pid and host name in zap file. (TeX-expand-files): New fn, not yet used. * startup.el (command-line): Error if foo-win library not found. 1989-10-26 Joseph Arceneaux (jla@spiff) * dired.el (dired-first-filename): New function, move to first file found. (dired-noselect): Use it to position point@first file when entering dired. 1989-10-25 Richard Stallman (rms@mole.ai.mit.edu) * simple.el (count-lines, goto-lines): ^M is line sep for outline md. 1989-10-24 Richard Stallman (rms@mole.ai.mit.edu) * rmail.el (rmail-make-in-reply-to-field): Avoid bare singlequote. 1989-10-21 Richard Stallman (rms@mole.ai.mit.edu) * replace.el (perform-replace): Always find null string@eob. 1989-10-14 Richard Stallman (rms@mole.ai.mit.edu) * startup.el (command-line-1): If > 2 files visited, do buffer-menu. * texinfo.el (texinfo-mode): Set words-include-escapes to t. * tex-mode.el (tex-start-shell): Run tex-shell-hook. 1989-10-12 Joseph Arceneaux (jla@apple-gunkies.ai.mit.edu) * x-mouse.el (x-paste-text): push-mark before inserting text. (x-insert-selection): (x-select): Moved these functions over from the file: * mouse.el 1989-10-12 Richard Stallman (rms@mole.ai.mit.edu) * simple.el (kill-ring-save): New command for M-w. Shows other end of region momentarily. * register.el (jump-to-register): New name for register-to-point. Old name remains as alias. * simple.el (end-of-buffer): Scroll to put point near screen bottom. 1989-10-11 Joseph Arceneaux (jla@apple-gunkies.ai.mit.edu) * compile.el (grep): Don't save buffers for grep. 1989-10-10 Joseph Arceneaux (jla@apple-gunkies.ai.mit.edu) * files.el (recover-file): Prompt with current buffer's filename. 1989-10-09 Joseph Arceneaux (jla@apple-gunkies.ai.mit.edu) * term/x-win.el (x-pop-up-window): If color screen, start out with some default colors. 1989-10-08 Richard Stallman (rms@mole.ai.mit.edu) * rnewspost.el (news-mail-reply, news-reply, news-post-news): Include newline before the blank line, when narrowing. 1989-10-04 Joseph Arceneaux (jla@apple-gunkies.ai.mit.edu) * mouse.el (mouse-double-down, mouse-double-up): New functions for double-clicking. 1989-10-03 Joseph Arceneaux (jla@apple-gunkies.ai.mit.edu) * x-mouse.el (x-insert-selecton, x-select): New functions: * mouse.el: New [experimental] functions: (mouse-motion, track-mouse, mouse-select-buffer-line) (mouse-boxing, mouse-erase-box, incr-scroll-down) (incr-scroll-up, incremental-scroll, incr-scroll-stop) (mouse-kill-rectangle, mouse-open-rectangle, mouse-multiple-insert) (mouse-move-text) 1989-10-01 Richard Stallman (rms@mole.ai.mit.edu) * rmailout.el (rmail-output): Check for an RMAIL file, and get error. 1989-09-30 Robert J. Chassell (bob@rice-chex) * texnfo-upd.el (texinfo-copy-menu): Don't enter infinite loop when copying a multi-line description@the end of a menu. 1989-09-28 Joseph Arceneaux (jla@apple-gunkies.ai.mit.edu) * mouse.el: New function mouse-line-length. New constants for mouse-motion keys. 1989-09-27 Richard Stallman (rms@mole.ai.mit.edu) * c-mode.el (calculate-c-indent): Don't treat function-name line as continuation, because its previous line's indent is zero. * sendmail.el (mail-do-fcc): No blank line before iff file is new. 1989-09-25 Robert J. Chassell (bob@apple-gunkies.ai.mit.edu) * renamed texinfo-update.el to texnfo-upd.el and updated `provide' * texinfo.el: updated `require' to reflect new name for texnfo-upd 1989-09-23 Robert J. Chassell (bob@rice-chex) * texinfo.el: Moved functions to update nodes and menus to texinfo-update.el. * texinfo.el, texinfo-update.el: Added `require' and `provide'. * texinfo.el: Added keybindings to insert frquently used @-commands. Added keybindings for `texinfo-format-buffer', `texinfo-update-node', `texinfo-every-node-update', `texinfo-make-menu', and `texinfo-all-menus-update'. * texinfo-update.el (texinfo-sequential-node-update): now updates node in which point is located so pointer are to next and previous node regardless of hierarchy. Non-nil argument (prefix, if interactive) means update nodes in region. (texinfo-every-node-update): updates every node in a Texinfo file. (texinfo-all-menus-update): updates all the regular menus in a Texinfo file. (texinfo-indent-menu-description, texinfo-menu-indent-description): Indent every description in menu following point to specified column. Non-nil argument (prefix, if interactive) means indent every description in every menu in the region. Does not indent second and subsequent lines of a multi-line description. (texinfo-insert-menu, texinfo-column-for-description): starts a menu description@column specified by variable `texinfo-column-for-description'. (texinfo-find-pointer, texinfo-insert-pointer): find and inserts higher level pointer as `Previous' pointer if there is no previous node@the same level. (texinfo-menu-copy-old-description): now copies `@' commands in old descriptions. 1989-09-22 Richard Stallman (rms@mole.ai.mit.edu) * simple.el (previous-complex-command): If not already inside repeat-complex-command, enter it. (repeat-complex-command): Bind repeat-complex-command-flat to t. * prolog.el (prolog-comment-indent): Don't insist on 1 space if@left margin. 1989-09-21 Richard Stallman (rms@mole.ai.mit.edu) * gdb.el (gdb-break): Go to line beg before counting lines. 1989-09-21 Joseph Arceneaux (jla@susie) * term/x-win.el: Added cursor-shape list, removed x-defined-colors stuff. 1989-09-21 Richard Stallman (rms@mole.ai.mit.edu) * simple.el (shell-command-on-region): If output is 1 line, display it in echo area. 1989-09-19 Richard Stallman (rms@mole.ai.mit.edu) * files.el (not-modified): With arg, mark buffer as modified. * c-mode.el (indent-c-exp): Support do-while. 1989-09-18 Richard Stallman (rms@mole.ai.mit.edu) * info.el (Info-mode, Info-edit-mode): Put on 'mode-class 'special. * c-mode.el (c-indent-line): Special for line starting in `while' to detect a do-while statement. (c-backward-to-start-of-do): New subroutine. 1989-09-17 Richard Stallman (rms@mole.ai.mit.edu) * cl.el (safe-idiv): Avoid overflow calculating sign of quotient. 1989-09-16 Richard Stallman (rms@mole.ai.mit.edu) * c-mode.el (calculate-c-indent): A line starting in `}' is not considered a continuation. * sendmail.el (sendmail-send-it): Don't let user specify `Sender'. Insert a `Sender' if From is specified and doesn't match login name. 1989-09-15 Joseph Arceneaux (jla@spiff) * term/x-win.el: Removed function x-color-screen-p (now in xfns.c). New variables x-colors, x-display-defined colors. Initialize them. 1989-09-14 Richard Stallman (rms@mole.ai.mit.edu) * startup.el (command-line): Rename local var for name of user to `init-file-user'. Advertise that for use in the init file. 1989-09-11 Robert J. Chassell (bob@apple-gunkies.ai.mit.edu) * texinfo.el (texinfo-update-node, texinfo-make-menu, texinfo-master-menu, texinfo-sequential-node-update): Added functions to insert or update the next, previous, and up node pointers in a Texinfo file, or alternatively to insert node pointers as a depth-first traversal---sequentially through the file, each pointing to the next node regardless of its hierarchical level, and to create or update a menu or menus (preserving pre-existing descriptions, if any), to create a master menu for a Texinfo file accordng to the Manual recommendation. 1989-09-11 Richard Stallman (rms@mole.ai.mit.edu) * sun-fns.c, term/sun.el: Rename prev-complex-command to select-previous... 1989-09-10 Joseph Arceneaux (jla@spiff) * files.el (find-file-noselect): Indicate if file is a soft link to some file already present. 1989-09-07 Richard Stallman (rms@mole.ai.mit.edu) * rmailmsc.el (set-rmail-inbox-list): Doc fix. 1989-09-01 Richard Stallman (rms@mole.ai.mit.edu) * files.el (basic-save-buffer): On VMS, remove version number from visited file name before saving, and rename buffer. 1989-08-31 Joseph Arceneaux (jla@spiff) * term/Old/wyse.el: New terminal configuration file. 1989-08-30 Richard Stallman (rms@mole.ai.mit.edu) * rmail.el: `e' is now edit; only `x' for expunge. * term/x-win.el: Fix error message. * dired.el (dired-repeat-over-lines): FUNCTION returns t if it deleted the line. All callers changed to make it return nil. (dired-move-file, dired-create-directory): New functions. 1989-08-29 Joseph Arceneaux (jla@spiff) * files.el: * bytecomp.el: Call read-file-name instead of new-read-file-name, since the latter subr has been renamed the former. 1989-08-23 Richard Stallman (rms@apple-gunkies.ai.mit.edu) * startup.el (command-line-1): Update year in startup message. 1989-08-23 Joseph Arceneaux (jla@spiff) * term/x-win.el: Open the X connection when this file is loaded; don't wait for pop-up-window. 1989-08-22 Joseph Arceneaux (jla@spiff) * term/x-win.el: Changed the documentation of `x-switches'. 1989-08-21 Joseph Arceneaux (jla@spiff) * term/x-win.el: Rewrote the code for handling command line args, including x-handle-switch. 1989-08-19 Joseph Arceneaux (jla@spiff) * term/x-win.el: Changed iconic type option string from "-i" to "-ib". Also normalized the options to the X toolkit standard. 1989-08-15 Richard Stallman (rms@hobbes.ai.mit.edu) * files.el (basic-save-buffer): For precious file, don't delete renamed old version if rename failed. * files.el (backup-buffer): Don't delete old backup, since rename-file should do it. * c-mode.el (electric-c-terminator): Recognize labels with _ or $. 1989-08-15 Joseph Arceneaux (jla@spiff) * replace.el (occur): Optionally search whole buffer, controlled by new variable occur-whole-buffer. 1989-08-15 Roland McGrath (roland@apple-gunkies.ai.mit.edu) * add-log.el (prompt-for-change-log-name): New macro to prompt for a change log file name. (add-change-log-entry): Use it. (add-change-log-entry-other-window): Take an arg, the file name of the change log. If interactive: if given a prefix arg, prompt for the file name; if use default-directory. 1989-08-14 Richard Stallman (rms@hobbes.ai.mit.edu) * man.el (nuke-nroff-bs): Assume footers are what precede headers. Delete fixed number of lines around each header, so that significant blank lines next to these are preserved. 1989-08-13 Richard Stallman (rms@hobbes.ai.mit.edu) * c-mode.el (indent-c-exp): Remove indentation from blank lines. When trying to move up to init contain-stack, don't go past start of function. If no containing open is found thus, set opoint to prev. function-start, so calculate-c-indent wins. 1989-08-12 Richard Stallman (rms@hobbes.ai.mit.edu) * rmailsum.el (rmail-new-summary): Use other-window-scroll-buffer to make scroll commands do the right thing. Make it local. 1989-08-11 Richard Stallman (rms@hobbes.ai.mit.edu) * telnet.el (telnet-filter): Don't move point if was not@end. Eliminate ^M entirely. * tex-mode.el (tex-mode-syntax-table): Give \ the syntax code /. 1989-08-06 Richard Stallman (rms@mole.ai.mit.edu) * sendmail.el (mail-text): New command, on C-c C-t. 1989-08-05 Richard Stallman (rms@mole.ai.mit.edu) * rnewspost.el (news-setup): ACTIONS arg to mail-setup was missing. 1989-08-04 Richard Stallman (rms@mole.ai.mit.edu) * hideif.el (hif-factor): Typo in error message. 1989-08-03 Richard Stallman (rms@mole.ai.mit.edu) * sort.el, loaddefs.el: Doc fixed. 1989-08-02 Richard Stallman (rms@mole) * cl.el (floor): Fix bug in last cond clause, (floor -10 2). * backquote.el (`): Upgrade doc string. 1989-07-31 Richard Stallman (rms@mole.ai.mit.edu) * rmail.el (rmail): If existing buffer is empty, treat it as new. * abbrev.el (expand-region-abbrevs): Mention abbrev when querying. Test for abbrev definition without modifying buffer. No need to compare start with end, since (interactive "r") does it. Arrange for prefix arg as NOQUERY arg. (add-abbrev): Prompt differently if undefining an abbrev. (write-abbrev-file): Better default file name. (read-abbrev-file, quietly-read-abbrev-file): Make FILE arg optional. 1989-07-25 Joseph Arceneaux (jla@spiff) * files.el (write-file): If no file is associated with the current buffer, prompt with the buffer name. 1989-07-20 Richard Stallman (rms@mole.ai.mit.edu) * info.el (Info-follow-reference): Handle newline and indentation immediately after *note. 1989-07-19 Joseph Arceneaux (jla@spiff) * keypad.el: Removed unused symbols, changed commentary. * term/x-win.el: Added mapping from emacs key symbols to strings used by X. (x-keypad-setup): Provide use of the function and keypad keys, using the standard keyboard files of /term/* * term/news.el: New file for the Sony keyboard. This now works with both keypad.el and x-win.el. The other terminal files are obsolete. 1989-07-14 Joseph Arceneaux (jla@spiff) * gdb.el (gdb): Use "interactive f" instead of "F". 1989-07-13 Joseph Arceneaux (jla@spiff) * outline.el (outline-flag-region): Don't pass optional last arg `t' to subst-char-in-region. 1989-07-12 Joseph Arceneaux (jla@spiff) * lisp.el (insert-parentheses) Changed conditions for pre- and post- insertion of blanks. * bytecomp.el (byte-compile-file): If current buffer is in emacs-lisp mode, prompt with buffer's file name as default. 1989-07-07 Joseph Arceneaux (jla@spiff) * files.el (basic-save-buffer) When querying for a final newline, use y-or-n-p instead of yes-or-no-p. 1989-07-06 Joseph Arceneaux (jla@galapas.ai.mit.edu) * files.el: (find-alternate-file): Use new function new-read-file-name. This name is temporary. Also don't substitute `~' for homedir; new-read-file-name does this. 1989-07-04 Richard Stallman (rms@mole.ai.mit.edu) * mailalias.el (build-mail-aliases): Accept `group' as synonym. * nroff-mode.el (electric-nroff-mode): Arg now optional. * man.el (insert-man-file): Handle HP's directories with .Z in their names. 1989-06-27 Joseph Arceneaux (jla@mole.ai.mit.edu) * term/x-win.el (x-new-window) New function. 1989-06-25 Richard Stallman (rms@mole.ai.mit.edu) * ledit.el (ledit-zap-file, etc.): Use user-login-name. * medit.el (medit-zap-file): Likewise. * subr.el (user-original-login-name): New function. * rmail.el (rmail, rmail-insert-inbox-text): Use that. * mail-utils.el (rmail-dont-reply-to): Use that. 1989-06-24 Richard Stallman (rms@mole.ai.mit.edu) * compile.el: Doc fix. 1989-06-23 Joseph Arceneaux (jla@all-bran.ai.mit.edu) * term/x-win.el (x-pop-up-window) Run hook x-pop-up-window-hook. (x-color-screen-p) New macro; used to be C function. 1989-06-22 Richard Stallman (rms@mole.ai.mit.edu) * time.el (add-clock-handler): Call specified function each minute. * loaddefs.el: Autoload it. * subr.el: Doc fix. 1989-06-22 Joseph Arceneaux (jla@gracilis.ai.mit.edu) * rmail.el: Fixed missing declares of rmail-inbox-list and rmail-keywords. * sendmail.el: Fixed missing declares of mail-reply-buffer and mail-send-actions. 1989-06-21 Richard Stallman (rms@mole.ai.mit.edu) * sendmail.el (mail-recover): New command. 1989-06-20 Richard Stallman (rms@mole.ai.mit.edu) * sendmail.el (mail-signature): Delete excess blank lines; put one blank line and one line of `--' before signature. * sort.el (sort-subr): Make sure markers@end of text stay at the end. (calls to sort-subr): Put save-excursion around save-restriction. Now all these commands preserve region around sorted text. 1989-06-19 Richard Stallman (rms@mole.ai.mit.edu) * rnewspost.el (news-reply-yank-original): Break out insertion of header line into a hook, news-reply-header-hook. Recommended by Barry Warsaw. 1989-06-19 Joseph Arceneaux (jla@apple-gunkies.ai.mit.edu) * files.el (find-alternate-file): Check that file <buffer name> is non nil. 1989-06-18 Richard Stallman (rms@mole.ai.mit.edu) * sendmail.el (mail-mode): Make mail-signature-inserted local. (mail-setup): Set it to nil. (mail-signature): Set it to t. (mail-mode-map): Don't put that on a key. (mail-send): Call mail-signature if .signature exists and not already done. * texinfmt.el (texinfo-format-node): Add properly to texinfo-node-names. 1989-06-16 Richard Stallman (rms@mole.ai.mit.edu) * texinfmt.el: Doc fix. 1989-06-15 Richard Stallman (rms@mole.ai.mit.edu) * c-mode.el (electric-c-terminator, c-indent-line): (calculate-c-indent, indent-c-exp): Recognize `case' more generally. * c-mode.el (c-indent-command): With arg, find a sexp split over lines. * c-mode.el (indent-c-exp): Typo in local name innerloop-done. Declare last-depth. Use OPOINT by default as arg to calculate-c-indent. * lisp-mode.el (indent-sexp): Likewise. * dired.el (dired-readin): Detect non-existent directories. 1989-06-08 Joseph Arceneaux (jla@apple-gunkies.ai.mit.edu) * term/x-win.el (new-screen): Added this function, which is the default auto-screen function. It uses new variables new-screen-x-delta and new-screen-y-delta. (next-multiscreen-window, previous-multiscreen-window): These new functions step through all windows, jumping screens when they need to.x 1989-06-08 Richard Stallman (rms@mole.ai.mit.edu) * spell.el (spell-region): Downcase misspelled word. 1989-06-06 Richard Stallman (rms@mole.ai.mit.edu) * chistory.el (list-command-history): Go to history buffer before examining its text. * subr.el (suppress-keymap): Store using define-key so that sparse keymaps work. 1989-06-04 Richard Stallman (rms@mole.ai.mit.edu) * time.el (display-time-filter): Preserve the match data. 1989-06-02 Richard Stallman (rms@mole.ai.mit.edu) * rmail.el (rmail-convert-to-babyl-format): Generalize time zone fmt. (rmail-nuke-pinhead-header): Likewise. * cmacexp.el (c-macro-expand): Terminate string or comment after last macro in the file. * bib-mode.el: New file. * sendmail.el (mail-mode-syntax-table): Seperate syntax table for mail mode. Makes % a separator. 1989-05-31 Richard Stallman (rms@mole.ai.mit.edu) * cmacexp.el (c-macro-expand): Handle \-continuation of macros. * fill.el (fill-region-as-paragraph): Don't leave space@end of line. 1989-05-30 Richard Stallman (rms@mole.ai.mit.edu) * replace.el (perform-replace): Fix typo. * shell.el (make-shell): Don't call shell-mode if already in that mode. * compile.el (next-error): Widen if necessary. 1989-05-27 Richard Stallman (rms@mole.ai.mit.edu) * hexl.el: New file. 1989-05-25 Richard Stallman (rms@mole.ai.mit.edu) * c-mode.el (c-indent-region): Make marker before indenting first line. (indent-c-exp): Find preceding open paren or open brace to initialize contain-stack, if have endpos. Don't treat next-depth = 0 as special if have endpos. Don't use next-depth as exit criterion if have endpos. 1989-05-24 Richard Stallman (rms@mole.ai.mit.edu) * simple.el (do-auto-fill): Keep splitting until short line or give up. 1989-05-23 Joseph Arceneaux (jla@apple-gunkies.ai.mit.edu) * rmailsum.el: Added C-d (rmail-summarey-delete-backward) to rmail-summary-mode-map. 1989-05-22 Richard Stallman (rms@mole.ai.mit.edu) * dired.el (dired-chown): Put file name in a variable. 1989-05-21 Richard Stallman (rms@mole.ai.mit.edu) * compile.el (compile-command): Add SPC@end of value. * simple.el (shell-command): If COMMAND ends in &, do it asynch. * apropos.el (apropos-match-keys): Ignore atoms in an alist. Ignore menu prompts in key bindings. * cl.el (defsetf): Put quotes into expansion where needed. * apropos.el (apropos): Call apropos-internal to get list of syms. * cl.el (isqrt): More accurate termination condition. Fewer special cases needed. * sendmail.el (mail-send): Ignore errors in mail-send-actions. 1989-05-20 Richard Stallman (rms@mole.ai.mit.edu) * simple.el (insert-buffer): Default to (other-buffer). 1989-05-18 Richard Stallman (rms@mole.ai.mit.edu) * isearch.el (isearch): Bug in previous change: was assuming regexp. 1989-05-17 Kyle Jones (kjones@talos.uucp) * saveconf.el: Changed copying permissions and warranty disclaimer to those of the GNU General Public License * saveconf.el: Added usage instructions at the top of file. * saveconf.el (recover-context): Returns t if recover succeeds. 1989-05-17 Richard Stallman (rms@mole.ai.mit.edu) * rmail.el (rmail-nuke-pinhead-header): Accept space before numeric time zone in From line. * sendmail.el (mail): Use multiple mail buffers. Reuse an unmodified one or make a new one. With arg, find a modified one. If have auto-save file, suggest M-x recover. * rmailout.el (rmail-output-to-rmail-file): Adjust narrowing@call to rmail-count-new-messages, for changes therein. 1989-05-16 Chris Hanson (cph@kleph) * scheme.el: change syntax table entries to use new "p" bit. 1989-05-15 Joseph Arceneaux (jla@apple-gunkies.ai.mit.edu) * tags.el (next-file): fixed typo: " *next-file*" --> "*next-file*" 1989-05-14 Richard Stallman (rms@mole.ai.mit.edu) * files.el (set-visited-file-name): Don't rename autosave file. This avoids losing it when you do C-x C-w. 1989-05-13 Richard Stallman (rms@mole.ai.mit.edu) * chistory.el (command-history-map): Share with shared-lisp-mode-map. 1989-05-12 Richard Stallman (rms@mole.ai.mit.edu) * debug.el (debug): Use search to find extraneous part of backtrace. Works even interpreted. (debug-convert-byte-code): New function: convert byte-code object to a lambda-exp. (debug-on-entry, debugger-reenable): Call that function. * rmail.el (rmail-set-message-counters-counter): Change in search caused pointers to wrong place in message. * c-mode.el (c-indent-region): Pass marker to indent-c-exp. * lisp-mode.el (lisp-indent-region): Likewise. 1989-05-12 Joseph Arceneaux (jla@apple-gunkies.ai.mit.edu) * term/x-win.el (x-set-display-name): Now works; correctly gets display name and removes those options from `command-line-args-left'. Renamed some of the options to be consistent with standard X applications. Added "-iconic" option for iconic startup; created variable `x-iconic-startup' and function `x-set-iconic-startup' (x-pop-up-window): initialize x-display-name first, then call x-open-connection. 1989-05-11 Richard Stallman (rms@mole.ai.mit.edu) * loaddefs.el (completion-ignored-extensions): Add .sbin. * c-mode.el (c-fill-paragraph): Recognize first line of comment. Move to second line to get fill prefix. On one-line comment, pick reasonable prefix. Don't strand comment ender on separate line. 1989-05-10 Joseph Arceneaux (jla@apple-gunkies.ai.mit.edu) * term/x-win.el (x-handle-numeric-switch) Just like x-handle-switch, but converts argument to int (e.g., "-b 4"). 1989-05-10 Richard Stallman (rms@mole.ai.mit.edu) * man.el (manual-entry): Make buffer read only. 1989-05-08 Richard Stallman (rms@mole.ai.mit.edu) * startup.el (command-line-1): Split paragraph in startup message. * simple.el (append-next-kill): Print a message. * startup.el (command-line-1): Except for first file, find in other window. * isearch.el (isearch): Don't move cursor for c-w, c-y in reverse. Allow longer match@point in non-regexp reverse search as in regexp. * startup.el (command-line): Give details on error in init file. * fill.el (fill-region-as-paragraph): Insert NL before delete space. 1989-05-08 Joseph Arceneaux (jla@rice-chex.ai.mit.edu) * x-mouse.el (x-cut-text): sit-for 1 when warping mouse to mark. Also removed code dupicated by mouse.el (x-trace-mouse): debugging function which prints out mouse events as they arrive. (x-paste-text): Don't set point before inserting cut text; too confusing and incompatible with xterm. * mouse.el (mouse-scroll, mouse-del-char, mouse-kill-line, narrow-window-to-region, mouse-window-to-region): Added these new functions. 1989-05-08 Richard Stallman (rms@mole.ai.mit.edu) * info.el (Info-find-node): Fix confusion testing file existence. * files.el (basic-save-buffer): Mention file name in "save anyway". 1989-05-08 Richard Stallman (rms@mole.ai.mit.edu) * lisp-mode.el (lisp-indent-line, lisp-comment-indent): Use \\s< to recognize comment-start characters. (indent-sexp): likewise. * lisp.el (end-of-defun): likewise. 1989-05-07 Richard Stallman (rms@mole.ai.mit.edu) * underline.el (ununderline-region): Handle pre- or -post underline. * rmail.el (rmail-search): Fix failure message. * paths.el (Info-directory-list): Replaces Info-directory. * info.el (Info-find-node): Search that directory list. * c-mode.el (electric-c-sharp-sign): Auto-align #@column 0. * rmail.el (rmail-parse-file-inboxes, rmail-get-new-mail): Require newline before ^_ when searching. More reliable. (rmail-count-new-messages, rmail-set-message-counters): Likewise. (rmail-set-message-counters-counter): Likewise. * rmailout.el (rmail-output-to-rmail-file): Likewise. * info.el (info-follow-reference): Provide default: ref point is in. * page.el (what-page): Reckon from beginning of line. * blackbox.el: Doc fix. (bb-done): Improve messages. * replace.el (perform-replace): Keep stack of previous pos for ^. * info.el: Doc fix. * simple.el: Doc fix. 1989-05-05 Richard Stallman (rms@mole.ai.mit.edu) * view.el (view-mode): Save and set major-mode like mode-name. (view-exit): Restore it. (view-helpful-message): Update for new exit command. * tags.el (tags-loop-continue): Just set-buffer if not permanent. * tags.el (visit-tags-table-buffer): Clean up if file invalid. * apropos.el: New file. Apropos now defined here. * loaddefs.el: Autoload it. * help.el: Doc fix. * sort.el: Doc fix. * bytecomp.el (byte-compile-lambda): Return a byte-code object. (byte-compile-file-form): Return an fset form which constructs such a byte-code object and installs it. (byte-compile-defun, byte-compile-macro): Likewise. (byte-compile-function-form): Translate to a make-byte-code form. (byte-compile-file): Find and fix doc strings in fset forms. * loaddefs.el (completion-ignored-extensions): Add .fmt. 1989-05-04 Richard Stallman (rms@mole.ai.mit.edu) * blackbox.el (bb-init-board): Use (random 8) to get # in [0,7]. * dissociate.el: Likewise. * fill.el (justify-current-line): Likewise. * flame.el (define-element, psychoanalize-flamer): Likewise. * yow.el (yow): Likewise. * doctor.el: Use (random N), not (random-range N). (random-range): Function deleted. * simple.el (auto-fill-mode): Arg now optional. 1989-05-01 Richard Stallman (rms@mole.ai.mit.edu) * cl.el (cl-member): New name for Common Lisp `member'. 1989-04-30 Richard Stallman (rms@mole.ai.mit.edu) * cmacexp.el (c-macro-expand): Use a second temp file for the region. * tags.el (tags-loop-continue): Widen the buffers. 1989-04-29 Richard Stallman (rms@mole.ai.mit.edu) * cl.el (defsetf): Take effect@run time, not expansion time. * bytecomp.el (byte-compile-file-form): Expand top level macros. Look inside of progn. 1989-04-27 Richard Stallman (rms@mole.ai.mit.edu) * replace.el (map-query-replace-regexp): New function. * replace.el (perform-replace): Allow list of strings to replace with; they are used in rotation. Optional arg repeat-count is number of times to use each string before rotating. 1989-04-26 Richard Stallman (rms@mole.ai.mit.edu) * sendmail.el (mail-yank-original): Handle new var mail-yank-prefix. 1989-04-25 Richard Stallman (rms@mole.ai.mit.edu) * rmail.el (rmail-output-to-rmail-file): If output buffer is not in rmail mode, insert@end of it. * rmail.el (rmail-set-attribute): search-forward's value is no longer t or nil; now may be a number. 1989-04-24 Richard Stallman (rms@mole.ai.mit.edu) * rmail.el (rmail): Put existing buffer into rmail-mode if necessary. 1989-04-20 Richard Stallman (rms@mole.ai.mit.edu) * x-mouse.el: Delete mouse-event-hook; now in keyboard.c. * term/x-win.el (x-switch-definitions, command-switch-alist): Add -bd. (x-set-*): New commands. * startup.el (command-line-1, normal-top-level): Call hooks with run-hooks. * sun-mouse.el: likewise. * mim-mode.el: rename indent-mim-hook to indent-mim-function. * scheme.el: likewise scheme-indent-hook. * lisp-mode.el, cl.el, cl-indent.el, loaddefs.el, sun-mouse.el: *lisp-indent-hook renamed to *lisp-indent-function. * kermit.el (shell-send-input-cr): use run-hooks. * shell.el (shell-send-input): run-hooks wants quoted arg. * simple.el, mlsupport.el, loaddefs.el, c-fill.el, doctor.el: blink-paren-hook and auto-fill-hook renamed to -function. * files.el (diff-switches-function): diff-switches-hook renamed. * compile.el (compile-reinitialize-errors): use run-hooks. * rmail.el (rmail-convert-to-babyl-format): error if unrecognized text. 1989-04-19 Richard Stallman (rms@mole.ai.mit.edu) * replace.el (occur-mode-goto-occurrence): Insure arg to count-lines is@start of line. * replace.el (occur): Removed an extraneous save-excursion. * replace.el (perform-replace): make ! undo as a unit. 1989-04-17 Chris Smith (csmith@mozart) * icon-mode.el (icon-comment-indent): When auto-fill breaks a line in a bol comment, start the continued line in column 1 not column 2. * icon-mode.el (icon-backward-to-noncomment): use parse-partial-sexp so as not to be fooled by # in strings. * icon-mode.el (icon-is-continuation-line): distinguish between tokens that end a statement but cause the following statement to be indented and tokens that cause the following line to be a continuation of the same statement. 1989-04-12 Richard Stallman (rms@mole.ai.mit.edu) * rmail.el (rmail-message-labels-p): put save-excursion outside. * picture.el (picture-tab): Dumb errors in prefix-arg case. * tags.el (tags-loop-continue): No message if slow terminal. * c-mode.el (c-fill-paragraph): Don't fill a comment together with anything following it. 1989-04-11 Richard Stallman (rms@mole.ai.mit.edu) * lpr.el (print-region-1): For tab-conversion case, insert specd range. 1989-04-07 Richard Stallman (rms@mole.ai.mit.edu) * compile.el (compilation-mode): Doc fix. * loaddefs.el: Autoload ftp-list-directory. 1989-04-06 Edward M. Reingold (reingold@cs.uiuc.edu) Hook added to list-diary-entries, along with a possible value for that hook which prepares a fancy diary buffer for display. Holidays integrated into the diary: in the ordinary diary buffer the holidays are given in the mode line. In the fancy diary buffer the holidays are given in the heading for each date. Added a new command to tell the holidays on a specific date, parallel to the way diary entries are given for a specific date. This new command became `h' and the old `h' became `a' to show all the holidays in a three-month period. 1989-04-06 Richard Stallman (rms@mole.ai.mit.edu) * dired.el (dired-flag-backup-files, dired-flag-auto-save-files): With prefix arg, unflag the appropriate class of files. * info.el (Info-tag-table-marker): `read' now stops@end of line, so advance to next line. * info.el (Info-follow-nearest-node):@last line of text, move to next node. * rmail.el (rmail-message-labels-p): Widen. * term/iris-ansi.el: New file. * r2bibtex.el: New file. * files.el (rename-uniquely): New command. * bytecomp.el (byte-recompile-directory): Update mode lines after save-some-buffers. * buff-menu.el (Buffer-menu-visit-tags-table): New fn. (Buffer-menu-mode-map): `t' runs that. * rmail.el (rmail-delete-forward): If no nondeleted msg fwd, go bkwd. * rmail.el (rmail-convert-to-babyl-format, rmail-nuke-pinhead-header): Accept spaces@end of Unix-style From line. * view.el (view-mode): Don't use a recursive edit; instead, save old mode info in local variables. Now two args: buffer to go back to, and fn to apply to viewed buffer when exiting. (view-exit): Restore old mode from those local variables. Apply specified fn to buffer that was viewed. This is on C-c and q. (view-command-loop): Deleted. (view-window-size): Now applies to selected window. * startup.el (normal-top-level): Use PWD envvar to set default dir. * rmail.el (rmail-convert-to-babyl-format): Bind case-fold-search to t for mmdf case. 1989-04-03 Richard Stallman (rms@mole.ai.mit.edu) * modula2.el: Turn m2-newline back on. (various templates): Put relevant variable name in final comment. 1989-04-02 Richard Stallman (rms@mole.ai.mit.edu) * paths.el (rmail-spool-directory): Treat silicon-graphics-unix like usg. 1989-03-30 Richard Stallman (rms@mole.ai.mit.edu) * files.el: doc fix. * autoinsert.el (insert-auto-insert-files): Mark bfr unmodified if has just the autoinsert file. * sendmail.el: doc fix. 1989-03-29 Richard Stallman (rms@mole.ai.mit.edu) * rmail.el (rmail-insert-inbox-text): Don't insert newline if inserted an empty file. * startup.el: doc fix. 1989-03-29 Edward M. Reingold (reingold@cs.uiuc.edu) * calendar.el: Change shift-three-month functions so the name includes the word ``calendar''. * calendar.el (list-diary-entries): Delete extraneous command to indicate buffer is not modified. 1989-03-15 Jeff Peck (rms@mole.ai.mit.edu) * term/sun.el (sunview-terminal): New default keybindings Check for (getenv "IN_EMACSTOOL") to automatically do emacstool-init. 1989-02-24 Richard Mlynarik (mly@rice-chex.ai.mit.edu) * terminal.el (terminal-emulator): Move help message after call-hooks so that correct escape character is mentioned. 1989-02-23 Richard Stallman (rms@mole.ai.mit.edu) * Version 18.53 released(?) * telnet.el: New vars telnet-initial-count and telnet-maximum-count. These replace constants in the code. (telnet, telnet-initial-filter): Use those vars. (telnet-filter): Use subst-char-in-region to change CR to Space. Advance point if insert@end of bfr. 1989-02-21 Richard Stallman (rms@mole.ai.mit.edu) * flame.el: Fix spelling errors. * compile.el (compile-reinitialize-errors): New subroutine broken out from next-error. (compile-goto-error): New command, uses that and next-error. (compilation-mode): New command; sets major mode. (compile-internal): Use that function. (compilation-mode-map): New variable; define C-c C-c. 1989-02-20 Richard Stallman (rms@mole.ai.mit.edu) * lisp-mode.el (indent-sexp): Optional arg says where to stop indenting; if spec', don't stop@end of first sexp. (lisp-indent-region): New fn: use that to do Lisp-style indent-region. (lisp-mode-variables): Set up indent-region-function as that. * c-mode.el (indent-c-exp, c-indent-region, c-mode): Similar changes. 1989-02-19 Richard Stallman (rms@apple-gunkies.ai.mit.edu) * files.el (set-visited-file-name): Always rename the buffer; make name unique with <NNN> as find-file does. * compile.el (next-error): Prefix arg now says how many errors to move. When parsing more errors incrementally, append to previous list. (compile): Handle new option `compile-window-height'. 1989-02-18 Richard Stallman (rms@mole.ai.mit.edu) * dbx.el (dbx-mode-map): Change C-c w to C-c C-w. * misc.el: New file. 1989-02-17 Richard Stallman (rms@mole.ai.mit.edu) * rmailout.el (rmail-output*): Handle prefix arg and output consecutive nondeleted messages. * rmail.el (rmail-next-undeleted-message): Error if hit eob. * dbx.el (run-dbx): Do expand-file-name. * paths.el (manual-formatted-dirlist): More alternatives in sysV case. 1989-02-15 Richard Stallman (rms@mole.ai.mit.edu) * dbx.el (run-dbx): Set dbx-process. (dbx-stop-at): Use that to decide where to send the string. 1989-02-13 Marc Shapiro (marc.shapiro@acm.org) * bibtex.el (bibtex-clean-entry, bibtex-empty-field, bibtex-find-text, bibtex-kill-optional-field, bibtex-next-field, bibtex-pop-next, bibtex-pop-previous, bibtex-cfield, bibtex-enclosing-field, bibtex-enclosing-reference, bibtex-enclosing-regexp, bibtex-flash-entry bibtex-flash-head, bibtex-inside-field, bibtex-make-optional-entry, bibtex-remove-OPT): New functions. (bibtex-find-it, bibtex-make-OPT-entry, bibtex-next-position): Deleted (kill-current-line): Deleted. (bibtex-mode-map): C-c keys to make entries moved to C-c C-e. (general): Use regexps instead of simple-minded cursor motion. New keys include C-c C-p, C-c C-n, C-c C-k, C-c C-d, C-c C-c, TAB, LF. 1989-02-13 Richard Stallman (rms@mole.ai.mit.edu) * subr.el (suppress-keymap): Undefine chars iff self-inserting, not based on numeric range. * rmail.el (rmail-reply): Don't call rmail-retry-failure. (rmail-mode-map): Put that cmd on C-M-m. 1989-02-11 Richard Stallman (rms@mole.ai.mit.edu) * debug.el (debug-on-entry): Special err msg for functions we can't handle. 1989-02-10 Richard Stallman (rms@mole.ai.mit.edu) * files.el (list-directory-brief-switches): Value was garbled when VMS changes were installed. 1989-02-09 Richard Stallman (rms@mole.ai.mit.edu) * loaddefs.el (calendar, diary, holidays): Autoload from calendar.el. 1989-02-08 Richard Stallman (rms@mole.ai.mit.edu) * loaddefs.el (ctl-x-4-map): Fully define it here, as sparse keymap. * files.el: not here. * lisp-mode.el (lisp-interaction-mode): Use emacs-lisp-mode-syntax-table 1989-02-07 Richard Stallman (rms@mole.ai.mit.edu) * c-style.el (set-c-style): Delete extra closeparen@end. * tex-mode.el: Doc fixes. 1989-02-05 Richard Stallman (rms@mole.ai.mit.edu) * uncompress.el (uncompress-backup-file): Uncompress original file when it's time to make it unto a backup. 1989-02-04 Richard Stallman (rms@mole.ai.mit.edu) * files.el: Make certain variables permenant if they are local. *: Likewise. * dired.el (dired-rename-file): If file is visited, offer to change visited file name. * tags.el (find-tag, find-tag-other-window, find-tag-regexp): Bugs in interactive arg reading. * dired.el (dired-do-deletion): If list is small enough, display in half the screen. * files.el (basic-save-buffer): Check writability and make backup file only after trying the hooks. * (ftp-write-file): do save-excursion. (ftp-write-file-hook): Clear modified-flag here. (ftp-setup-write-file-hooks): Clear read-only flag here. (ftp-sentinal): If input, clear modified flag. Don't bind buffer-read-only across (kill-buffer (current-buffer)). * texinfmt.el (texinfo-format-sp): New fn; handle @sp. (texinfo-format-noop): Handle @titlefont with this. 1989-02-03 Richard Stallman (rms@mole.ai.mit.edu) * files.el (revert-buffer): New hook that replaces just the erase-buffer and the insert-file-contents. 1989-01-30 Richard Stallman (rms@mole.ai.mit.edu) * term/x-win.el (initialization): Go through x-switches list. Don't set window-system-version; C code now does this. 1989-01-29 Richard Stallman (rms@mole.ai.mit.edu) * undigest.el (undigestify-message): Allow submessage to have no `to', just a `from'. 1989-01-28 Richard Stallman (rms@mole.ai.mit.edu) * rmail.el (rmail-reply): Search from msg-beg for rejection indicator 1989-01-26 Richard Stallman (rms@mole.ai.mit.edu) * replace.el (occur-mode-goto-occurrence): error msg fix. * tex-mode.el (tex-mode-syntax-table): Initialize all elts afresh. (tex-common-initialization): Make local var compare-windows-whitespace. Make %-lines separate paragraphs. (latex-mode): No more need to override paragraphs. (tex-categorize-whitespace): New fn helps compare-windows. (tex-insert-quote): Use \\s when categorizing prev. char. * compare-w.el: provide 'compare-w. (compare-windows): Don't set success for just whitespace. Remember start-point in both buffers, and pass as arg to the whitespace-function. If whitespace regexp, back over all whitespace; but don't back up if@end of buffer. Set point for real after each bunch of matches, in case C-g. 1989-01-25 Richard Stallman (rms@mole.ai.mit.edu) * paragraph.el (forward-paragraph): Check for end-of-buffer in forward-loop within backward-loop. * window.el (split-window-vertically): Set window-start and maybe window-point, to avoid scrolling. 1989-01-24 Richard Stallman (rms@mole.ai.mit.edu) * window.el (balance-windows): New command. * subr.el (walk-windows): New function. 1989-01-20 Richard Stallman (rms@mole.ai.mit.edu) * sort.el: doc fix. * server.el (server-buffer-clients): Now a permanent local. * dabbrev.el (dabbrev-expand): case-adapt only if expansion is l.c. (dabbrev-search): downcase the result if found@beg of sentence and only initial is upper case. 1989-01-19 Richard Stallman (rms@mole.ai.mit.edu) * files.el (after-find-file): change calling sequence to sit-for. * bytecomp.el (byte-compile-defun,-defmacro): Compile `defun' and `defmacro' within functions. 1989-01-18 Richard Stallman (rms@mole.ai.mit.edu) * tex-mode.el: Many changes. TeX changed to tex in all symbols. (tex-open-quote, tex-close-quote): New vars for tex-insert-quote. (tex-insert-quote): Those vars say what to insert. Inserting `"' is done by simply calling self-insert-command. (tex-last-buffer-texed, tex-print-file): New vars. (tex-region): Don't output line before start of header. Set those two variables. (tex-mode-map): C-c C-e and C-c C-f changed. (tex-common-initialization): comment-start-skip changed. (tex-validate-region): Fn renamed, and now leaves point@the error. (tex-terminate-paragraph): must save-excursion. (tex-start-shell):@end, sleep a little if I/O buffer is empty. (tex-file): New fn; save buffers and run TeX on visit file. (tex-print): Print buffer's most recent output, whether from tex-file or tex-region. Use shell-command to do the printing. (tex-append-dvi): New subroutine. * compare-w.el (compare-windows): Prefix arg means ignore whitespace changes. * bytecomp.el (byte-compile-form, byte-compile-find-vars-1): Handle forms containing explicit lambda-functions. 1989-01-17 Richard Stallman (rms@mole.ai.mit.edu) * texinfmt.el: Define @s (small caps) like @var. 1989-01-15 Richard Stallman (rms@mole.ai.mit.edu) * shell.el (inferior-lisp-mode-map): Copy shared-lisp-mode-map, inherit from shell-mode-map. * files.el (find-alternate-file): Don't drop a necessary `/'. 1989-01-14 Richard Stallman (rms@mole.ai.mit.edu) * startup.el (normal-top-level): Abbrev default directory as in find-file-noselect. * lisp-mode.el (lisp-mode-variables): set parse-sexp-ignore-comments. 1989-01-13 Richard Stallman (rms@mole.ai.mit.edu) * files.el (find-alternate-file): Don't change prefix to `~' unless a slash follows. * lisp.el (insert-parentheses): skip leading spaces if arg, maybe insert one if no arg. * lisp-mode.el (shared-lisp-mode-map): New map contains shared keys. (*-mode-map): All inherit from that map. * text-mode.el (indented-text-mode-map): Inherit text-mode-map. * rmailedit.el (rmail-edit-map): Likewise. * outline.el (outline-mode-map): Likewise. * c-mode.el (c-fill-paragraph): New cmd, on M-q in C mode. If in a comment, fill with comment delimiters/decoration. (calculate-c-indent-within-comment): New arg after-star * field.el: New file. 1989-01-11 Richard Stallman (rms@mole.ai.mit.edu) * shell.el (shell-send-input): Use run-hooks on shell-set-directory-error-hook. * subr.el (eval-after-load, eval-next-after-load): New fns to put entries on after-load-alist. * c-mode.el (c-backward-to-start-of-if): Stop looping@buffer beg. 1989-01-09 Richard Stallman (rms@mole.ai.mit.edu) * simple.el (zap-to-char): Error if char not found. Killed region now includes the matching char. 1989-01-07 Richard Stallman (rms@mole.ai.mit.edu) * options.el: doc fix. * mouse.el (mouse-delete-window): Delete window pointed at. * simple.el (backward-delete-char-untabify): In overwrite mode, back over columns clearing them out. * dired.el (dired-get-filename): filename ends before ` ->', not after. 1989-01-06 Richard Stallman (rms@mole.ai.mit.edu) * rmail.el (rmail-retry-failure): Lv cursor on To: line. * compile.el (compile-internal): Delete typo `<'. * tags.el (file-of-tag): Just search backwards. (tag-table-files): Don't worry about char counts. Just search. * tags.el (next-file): Change NOWARN to NOVISIT: t =>get the file in a reusable temp buffer. (tags-loop-continue): Use NOVISIT while scanning. Use separate form tags-loop-scan to scan for interesting files. If we find one, visit the file for real if nec. then use tags-loop-operate to make changes. (tags-search, tags-query-replace): Use new interface. * files.el (find-file-noselect): Do directory abbrevs first thing so both dir name and file name show the abbreviations. * tags.el (find-tag): Fix bug in last changes. * debug.el (cancel-debug-on-entry): Use empty string for "cancel all". (debug-on-entry-1): Clean err msg for built-in function. * session.el: New file. Load ~/.emacs-session. Related code moved here from startup.el. * session.el (save-session): New fn. has meat of kill-emacs-hook. Call expand-file-name to expand `~'. Save the value of point, as well. * subr.el: Set run-hooks variable. * tex-mode.el (LaTeX-mode): %@line start separates paragraphs. * files.el (basic-save-buffer): Don't write over directories if file-precious-flag is set. 1989-01-04 Richard Stallman (rms@mole.ai.mit.edu) * sendmail.el (sendmail-send-it): Always pass -f option to sendmail. * tags.el (find-tag): In regexp case, consider only matches that don't go past the DEL char. 1989-01-03 Richard Stallman (rms@mole.ai.mit.edu) * loaddefs.el (auto-mode-alist): Add `.oak'. 1989-01-02 Richard Stallman (rms@mole.ai.mit.edu) * files.el (diff): New command to compare file with its backup. (file-newest-backup): Return newest backup for given filename. * debug.el (debug-on-entry-1): Handle macros here. ({cancel-,}debug-on-entry): instead of here. But here maintain a list debug-function-list of functions set for debug on entry. nil or empty arg to cancel-... means cancel all. (debugger-list-functions): New command, on `l'. (debugger-jump): Continue to exit of this frame after turning off all debug-on-entries. (debugger-reenable): Turn back on all debug-on-entries that are supposed to be on. Called from `debug' and other debugging fns. * startup.el (kill-emacs-hook): If save-session-flag is set, write a file ~/.emacs-session recording file and line number. Put (load "~/.emacs-session" t t) (setq save-session-flag t) in your .emacs to enable session saving. * window.el (window-config-to-register, register-to-window-config): New fns, on C-x 6 and C-x 7. * vmsproc.el (subprocess-command-to-buffer): New function. * dired.el (dired-readin): Handle VMS. (dired-get-filename): handle VMS. Also move handling of LOCALP and NOERROR arguments to the end. * vms-patch.el (vms-read-directory): New function. * loaddefs.el (auto-mode-alist): Add `.for' and `.ltx'. * files.el (list-directory): Support for VMS. * c-style.el: New file. * vt200.el (keyboard-translate-table): Make a table, and use it to interchange ESC and backquote. 1989-01-01 Richard Stallman (rms@mole.ai.mit.edu) * gdb.el (gdb-mode-map): continue now C-c C-p. * tags.el (find-tag-default): If not inside a tag, use previous or next tag found on current line. Never go outside current line. * sendmail.el (mail-mode-map): Make map inherit from text-mode-map. 1988-12-31 Richard Stallman (rms@mole.ai.mit.edu) * files.el (find-alternate-file): Abbreviate homedir as `~'. * files.el (find-file-noselect): perform abbreviations on the directory name when setting the default--from directory-abbrev-alist. 1988-12-30 Richard Stallman (rms@mole.ai.mit.edu) * tags.el (next-file): New arg means don't warn of readonly file, etc. (tags-loop-continue): Don't warn and don't do local vars when scanning. If scanning makes a new buffer, kill it and re-find the file "for real" after exiting the scanning loop. * files.el (hack-local-variables): Change `inhibit-local-variables' to `enable-local-variables'. Now three alternative values: nil (ignore them), t (use them) or otherwise (query). * startup.el (command-line-1): Rearrange startup message. 1988-12-29 Richard Stallman (rms@mole.ai.mit.edu) * compile.el (compilation-sentinel): Set OPOINT, OMAX in proper buffer. 1988-12-28 Richard Stallman (rms@mole.ai.mit.edu) * lpr.el (print-region-1): Anything except `berkeley-unix', treat like USG. * picture.el (picture-tab): Use move-to-tab-stop. * indent.el (move-to-tab-stop): Like tab-to-tab-stop but just move point; don't change buffer unless nec. to get a spot to move to. * indent.el (indent-region): If have fill-prefix, make each line start with the prefix. * awk-mode.el: New file. * loaddefs.el: Add autoload and auto-mode-alist entry. 1988-12-24 Richard Stallman (rms@mole.ai.mit.edu) * mail-utils.el (mail-strip-quoted-names): Handle nested comments. * gdb.el (gdb-refresh): Call `recenter'. Take prefix arg and pass it. 1988-12-23 Richard Stallman (rms@mole.ai.mit.edu) * dired.el (dired-get-filename): Handle spaces in filenames. 1988-12-22 Richard Stallman (rms@mole.ai.mit.edu) * term/at386.el: Eric Raymond's changes to work with keypad.el. * loaddefs.el (completion-ignored-extensions): add .a and .ln. * shell.el (shell-set-directory): Convert // to one /, so Emacs emulates Unix conventions. (shell-unduplicate-slashes): New fn to convert a string that way. * info.el (Info-edit-map): Make this inherit text-mode-map, instead of copying that. TEST THIS LATER. * dired.el (dired-readin): Add the `d' option, if wildcard pattern. * gdb.el: Commands changed: M-c, M-u, M-d now use C-c prefix. (gdb-maybe-delete-prompt, gdb-call): Handle the fact that insertion is done with insert-before-markers. Also delete multiple prompts if they arrive in succession. Also work properly if buffer contains an unsent partial input line. Value of gdb-delete-prompt-marker is now a list: (BEG-OF-LINE-MARKER PROMPT-LENGTH PROMPT-STRING). 1988-12-21 Chris Hanson (cph@kleph) * telnet.el (telnet-filter): Don't insert ^M's into the buffer. Don't force point to move to end of buffer; `insert-before-markers' will move it if that is appropriate. * netunam.el: New file supports hp-ux `RFA' feature. 1988-12-20 Richard Stallman (rms@mole.ai.mit.edu) * backquote.el, loaddefs.el: doc fix. 1988-12-18 Richard Stallman (rms@mole.ai.mit.edu) * keypad.el: Change from character numbers to named characters in the function keymap. 1988-12-16 Richard Stallman (rms@mole.ai.mit.edu) * files.el (find-file-noselect): Mention file name when asking whether to read new version from disk. 1988-12-14 Richard Stallman (rms@mole.ai.mit.edu) * mouse.el: New file; window-system-independent parts of mouse support. * x-mouse.el: Parts moved to mouse.el. Require 'mouse. * rmail.el (rmail-make-in-reply-to-field): Regexp had nested loops. * term/x-win.el: Add missing arg to set-input-mode. 1988-12-12 Richard Stallman (rms@mole.ai.mit.edu) * telnet.el (telnet-send-input): Save input in telnet-previous-input (telnet-mode): Make that var buffer-local. (telnet-copy-last-input): New fn to yank that var; now on C-c C-y. * loaddefs.el (replace-string): Fix doc typo causing bug. 1988-12-10 Richard Stallman (rms@mole.ai.mit.edu) * compile.el (compile-internal): Get old compile process just once. * hideif.el, keypad.el, terminal.el: Add new arg to calls to where-is-internal. * x-mouse.el (mouse-binding-names): Set up this table. * sort.el (sort-columns): On VMS, use sort-subr to do the work. * rmail.el (rmail-insert-inbox-text): Vary name of .newmail file based on name of inbox file. 1988-12-07 Richard Stallman (rms@mole.ai.mit.edu) * shell.el (shell): Do M-x shell-mode only if new buffer. Don't bother setting NAME; it's not used again. 1988-12-06 Richard Mlynarik (mly@peduncle.ai.mit.edu) * files.el (toggle-read-only): +ve prefix arg means to set read-only 1988-12-04 Richard Stallman (rms@mole.ai.mit.edu) * debug.el (cancel-debug-on-entry): Fix typo in handling macros. * spell.el (spell-region): Win if spell-filter is buffer-local. * c-mode.el (electric-c-terminator): Don't use a marker to handle auto-fill from newline. Do it as in electric-c-brace. * keypad.el (function-key-sequence): Pass t as new arg. * rmailout.el (rmail-output-to-rmail-file): Temporarily undelete the message while it is being copied. * texinfmt.el (texinfo-format-emph): Was failing to rescan result. 1988-12-03 Richard Stallman (rms@mole.ai.mit.edu) * rmail.el (rmail-reply): On a bounce notice, do rmail-retry-failure. (rmail-retry-failure): Set up to re-edit and re-send original msg. 1988-12-01 Richard Stallman (rms@mole.ai.mit.edu) * dbx.el (dbx-filter): Use insert-before-markers. * gdb.el (gdb-filter): Likewise... * kermit.el (kermit-clean-filter): * mh-e.el (mh-process-demon): * telnet.el (telnet-filter): * terminal.el (te-filter): 1988-11-30 Richard Stallman (rms@mole.ai.mit.edu) * rmail.el (rmail-convert-to-babyl-format): Turn case-fold-search off since `from' in l.c. can appear@beg of line within a Unix-format message. * files.el (set-auto-mode): Call the mode function outside of the save-excursion, so mode hooks can move point. * replace.el (occur-mode-goto-occurrence): Don't lose if not@col 0. 1988-11-25 Richard Stallman (rms@mole.ai.mit.edu) * bytecomp.el (byte-compile-function-form): For symbol as arg, return the symbol, not its function definition. 1988-11-19 Richard Stallman (rms@mole.ai.mit.edu) * tags.el (tags-completion-alist): New local var of each tag table, holding alist of all tags in it. Also a function to compute the alist. (visit-tags-table-buffer): Make that var local. (visit-tags-table): Compute the alist unless already done. (find-tag-tag): Do completing read using the alist. 1988-11-17 Richard Stallman (rms@mole.ai.mit.edu) * sendmail.el (mail-sent-via): New command, entered in mail-mode-map. * files.el (find-alternate-file): Include old filename in initial contents of minibuf. * files.el (file-name-sans-versions): Fuller knowledge of VMS version numbers. 1988-11-15 Richard Mlynarik (mly@peduncle.ai.mit.edu) * rmail.el (rmail-make-in-reply-to-field): I'm sick of seeing illegal headers generated by rmail. Note that this change undoes rms' change of 4-Jul-88" -- I'll check to see why that change was made in the first place. * rmail.el (rmail-forward): Set `forwarded' attribute only if mail is sent. 1988-11-15 Richard Stallman (rms@mole.ai.mit.edu) * startup.el (command-line): Don't set mode of *scratch* if .emacs did. (command-line-1): Avoid binding load-path for -l switch. 1988-11-13 Richard Stallman (rms@mole.ai.mit.edu) * time.el (display-time): Use pipes--don't waste a pty. * ispell.el (start-ispell): Likewise. 1988-10-21 Chris Hanson (cph@kleph) * xscheme.el (xscheme-send-control-g-interrupt, xscheme-send-interrupt): Don't use second argument to `interrupt-process' or `quit-process'. These aren't needed and they actually cause the wrong effect on Ultrix. 1988-10-12 Richard Stallman (rms@mole.ai.mit.edu) * rmail.el (rmail): Don't process local-variables specs in RMAIL files. 1988-10-10 Richard Stallman (rms@mole.ai.mit.edu) * files.el (list-directory): Handle non-ex dirs properly. Use file-name-as-directory when appro. Simplify testing for dir-name vs. file-pattern. * rmail.el (rmail-set-attribute): Optional 3rd arg is message #. * sendmail.el (mail, mail-other-window, mail-setup): 7th arg is list of (FCN . ARGS) to perform when msg is sent. * rmail.el (rmail-reply): Don't set `answered' now; use new arg to mail-other-window to get that done later. 1988-10-08 Richard Stallman (rms@mole.ai.mit.edu) * gomoku.el, resume.el: New files. * server.el (server-visit-files): Run server-visit-hook. * electric.el (shrink-window-if-larger-than-buffer): Make proper buffer current when buffer-local let-vars are unwound. 1988-10-07 Chris Hanson (cph@kleph) * texinfmt.el (texinfo-format-defun-1): Don't upcase &-keywords in @defun argument lists. 1988-10-07 Richard Stallman (rms@mole.ai.mit.edu) * term/vt100.el (vt100-wide-mode): New function to toggle 132-col mode. * replace.el (perform-replace): typos in doc string. 1988-10-06 Richard Stallman (rms@mole.ai.mit.edu) * files.el (recover-file): Don't turn-off auto-save. * time.el (display-time-filter): rmail-pop-up non-nil says, if have new mail, pop up rmail window and read it in. 1988-10-05 Richard Stallman (rms@mole.ai.mit.edu) * compile.el (compile-internal): Must do fundamental-mode *before* make-local-variable. 1988-10-04 Richard Stallman (rms@mole.ai.mit.edu) * files.el (backup-buffer): Chase symlinks and backup their target. 1988-10-03 Richard Stallman (rms@corn-chex.ai.mit.edu) * compile.el (compile-internal): New name for compile1. Doc changes in many functions. 1988-09-30 Richard Stallman (rms@mole.ai.mit.edu) * loaddefs.el: autoload mail-mode. 1988-09-29 Richard Stallman (rms@mole.ai.mit.edu) * man.el (nuke-nroff-bs): Delete ESC 7, ESC 8, ESC 9. (manual-entry): Put the arg into the buffer name. 1988-09-28 Richard Stallman (rms@mole.ai.mit.edu) * term/s4.el: Fix typo in `select' key, undefine ESC 0 and ESC 9. * mailalias.el (expand-mail-alias): New arg EXCLUDE is regex to delete. * loaddefs.el (auto-mode-alist): nroff-mode for .me, .mm, .[1-9]. * compile.el (next-error): Support multiple compilation buffers. (compile1): Likewise. New variable compilation-error-buffer. Variable compilation-process eliminated. compilation-error-buffer records which buffer next-error should use. (compilation-sentinel): Use positive indices in current-time-string. 1988-09-27 Chris Hanson (cph@kleph) * dired.el (dired-chown): hp-ux puts the chown program in /bin, not /etc. 1988-09-27 Richard Stallman (rms@corn-chex.ai.mit.edu) * files.el (delete-auto-save-file-if-necessary): New arg FORCE. Delete only if file is recent or if FORCE. (basic-save-buffer): Pass t for FORCE if auto save file was recent. (rename-auto-save-file): Don't rename file if not recent. * sendmail.el (mail-send): Query if buffer unmodified (already sent). 1988-09-26 Richard Stallman (rms@mole.ai.mit.edu) * prolog.el (run-prolog): Use new var prolog-program-name. * compile.el (compile1): Don't call save-some-buffers. (compile, grep): Call it here. * compile.el (compile1): Two new args PARSER and REGEXP control local bindings for compilation-parse-errors-hook and compilation-error-regexp. (next-error): Call compilation-parse-errors-hook to parse errors. Save the entire list in compilation-old-error-list. Don't clear markers when used; put them in compilation-last-error. (compilation-forget-errors): Clear all the markers that were made. 1988-09-25 Richard Stallman (rms@mole.ai.mit.edu) * text-mode.el (change-log-mode): New function. * loaddefs.el: Use that for ChangeLog files. * add-log.el (add-change-log-entry): Don't set major or minor modes. * tags.el (select-tags-table): New; offers menu for of tags tables. (visit-tags-table): Add each tags table to tags-table-file-list. * tags.el (find-tag): New arg REGEXP means 1st arg is a regexp. (last-tag): Now can be a list, whose car is a regexp. Means find-tag to repeat same tag should do regexp search. (find-tag-regexp): New command. * tags.el (tags-loop-continue): If we don't stop in a buffer and it isn't modified, kill it when get the next one. * bibtex.el: Greatly revised by Marc Shapiro. 1988-09-23 Richard Stallman (rms@hobbes.ai.mit.edu) * sendmail.el (sendmail-send-it): Change "s:" to "subject:". 1988-09-21 Richard Stallman (rms@hobbes.ai.mit.edu) * float.el (abs): Define it as in cl.el and mim-mode.el. * doctor.el (doctor-member): New name for `member'. * subr.el (mod): Name deleted. * mlsupport.el (setq-default): Defn deleted; data.c does it. * edt.el (edt-beginning-of-window): Function renamed. (edt-delete-previous-word): Function renamed. (edt-line-to-{top,bottom}-of-window): Function renamed. * cl.el: require cl, so that byte-compiler will load it. * lpr.el (print-region-1): Don't pass -T, -J switches on sysv. * bibtex.el (bibtex-entry): Insert comma only if both required and optional are non-nil. * autoinsert.el: Change defconst to defvar. 1988-09-19 Richard Stallman (rms@mole.ai.mit.edu) * shell.el: New commands TAB, M-n, M-p. (shell-complete-file-name): New function. (shell-completion-cleanup): New function, called from kill-shell-input and shell-send-input. (kill-output-from-shell): Kill back to last recognized prompt. (shell-{next,prev}-command): New motion commands. * text-mode.el (center-region): Don't change blank lines. 1988-09-17 Richard Stallman (rms@mole.ai.mit.edu) * lisp.el (beginning-of-defun): Obey new var defun-prompt-regexp. 1988-09-16 Richard Stallman (rms@corn-chex.ai.mit.edu) * files.el (find-alternate-file): Don't kill OBUF if still current. * subr.el (start-process-shell-command): Start subprocess, exec'ing via the shell. * compile.el (compile1): Call that. * server.el (server-temp-file-p): New function for recognizing which files are temp files. (server-edit): Call it. (server-temp-file-regexp): Variable that controls the function. * outline.el (outline-minor-mode): New command; adds outline-mode-ness to current major mode. (outline-heading-end-regexp): New variable; how to find end of heading. (outline-end-of-heading): Move fwd to end of heading. So that a heading can be more than one line. Various functions call this. (outline-level): Now it's the indentation of the end of what matches. 1988-09-15 Richard Stallman (rms@mole.ai.mit.edu) * compile.el (grep): Use grep-command for program. * loaddefs.el (grep-command): New variable. (compile-command): Moved to compile.el. * c-mode.el (electric-c-terminator): Make insertpos a marker. * c-mode.el (c-indent-command): `interactive' should follow doc string. 1988-09-13 Richard Stallman (rms@corn-chex.ai.mit.edu) * hideif.el (hif-tokenize): Typo in token string. 1988-09-12 Richard Stallman (rms@mole.ai.mit.edu) * help.el (locate-library): New command. * cl-indent.el (common-lisp-indent-hook): New clause for `,'. * c-mode.el (c-backward-to-noncomment): Stop better@beg of bfr. * info.el (Info-find-file): Clear buffer-file-name before calling erase-buffer. 1988-09-06 Richard Stallman (rms@mole.ai.mit.edu) * loaddefs.el (shell-prompt-pattern): Allow prompt enclosed in parens. * lisp-mode.el (calculate-lisp-indent): bug in lisp-indent-offset case. See ChangeLog.2 for earlier changes.: f07a3446-5672-464a-8fdc-2ca92e8e7b2a
|
http://opensource.apple.com/source/emacs/emacs-78.2/emacs/lisp/ChangeLog.3
|
CC-MAIN-2016-36
|
en
|
refinedweb
|
The QtToolBarDialog class provides a dialog for customizing toolbars. More...
#include <QtToolBarDialog>
Inherits QDialog.
The QtToolBarDialog class provides a dialog for customizing toolbars.
QtToolBarDialog allows the user to customize the toolbars for a given main window.
The dialog lets the users add, rename and remove custom toolbars. Note that built-in toolbars are marked with a green color, and cannot be removed or renamed.
The users can also add and remove actions from the toolbars. An action can be added to many toolbars, but a toolbar can only contain one instance of each action. Actions that contains a widget are marked with a blue color in the list of actions, and can only be added to one single toolbar.
Finally, the users can add separators to the toolbars.
The original toolbars can be restored by clicking the Restore all button. All custom toolbars will then be removed, and all built-in toolbars will be restored to their original state.
The QtToolBarDialog class's functionality is controlled by an instance of the QtToolBarManager class, and the main window is specified using the QtToolBarManager::setMainWindow() function.
All you need to do to use QtToolBarDialog is to specify an QtToolBarManager instance and call the QDialog::exec() slot:
QtToolBarManager *toolBarManager; void MyMainWindow::customize() { QtToolBarDialog dialog(this); dialog.setToolBarManager(toolBarManager); dialog.exec(); }
See also QtToolBarManager.
Creates a toolbar dialog with the given parent and the specifed window flags.
Destroys the toolbar dialog.
Connects the toolbar dialog to the given toolBarManager. Then, when exec() is called, the toolbar dialog will operate using the given toolBarManager.
|
http://doc.qt.nokia.com/solutions/4/qttoolbardialog/qttoolbardialog.html
|
crawl-003
|
en
|
refinedweb
|
Synopsis
#include <libwnck/libwnck.h> enum WnckClientType; void wnck_set_client_type (
WnckClientType ewmh_sourceindication_client_type); void wnck_shutdown (
void);
Description
These functions are utility functions providing some additional features to libwnck users.
Details
enum WnckClientType
typedef enum { WNCK_CLIENT_TYPE_APPLICATION = 1, WNCK_CLIENT_TYPE_PAGER = 2 } WnckClientType;
Type describing the role of the libwnck user.
Since 2.14
wnck_set_client_type ()
void wnck_set_client_type (
WnckClientType ewmh_sourceindication_client_type);
Sets the role of the libwnck user.
The default role is
WNCK_CLIENT_TYPE_APPLICATION. Therefore, for
applications providing some window management features, like pagers or
tasklists, it is important to set the role to
WNCK_CLIENT_TYPE_PAGER for
libwnck to properly work.
Since 2.14
wnck_shutdown ()
void wnck_shutdown (
void);
Makes libwnck stop listening to events and tear down all resources from libwnck. This should be done if you are not going to need the state change notifications for an extended period of time, to avoid wakeups with every key and focus event.
After this, all pointers to Wnck object you might still hold are invalid.
Due to the fact that Wnck objects are all owned by libwnck, users of this API through introspection should be extremely careful: they must explicitly clear variables referencing objects before this call. Failure to do so might result in crashes.
Since 3.4
|
http://developer.gnome.org/libwnck/stable/libwnck-Miscellaneous-Functions.html
|
crawl-003
|
en
|
refinedweb
|
#include <MObjectHandle.h>
MObjectHandle is a wrapper class for the MObject class. An MObjectHandle will provide a user with added information on the validity of an MObject. Each MObjectHandle that is created registers an entry into a table to maintain state tracking of the MObject that the handle was created for. This will help users track when an MObject is invalid and should be re-retrieved.
Class Constructor
Creates an empty MObjectHandle
Class Constructor
Creates an MObjectHandle. Initializes it with an MObject.
Class Copy Constructor
Creates an MObjectHandle. Initializes it with a copy of MObjectHandle.
The class destructor.
Returns the MObject associated with this handle. The returned MObject will be MObject::kNullObj if the object is invalid.
Returns the MObject associated with this handle. This provides read-only access to the MObject that MObjectHandle holds onto. This method will always return the object that belongs to MObjectHandle regardless of its validity. API users should use caution when using MObject data when it is not valid, and should never use the data when MObjectHandle indicates that the MObject is NOT alive.
Returns a hash code for the internal Maya object referenced by the MObject within this MObjectHandle. If the MObject is null or no longer alive then 0 will be returned, otherwise the hash code is guaranteed to be non-zero.
The returned hash code is not unique: several internal Maya objects may return the same code. However different MObjectHandles whose MObjects refer to the same internal Maya object will return the same hash code.
This provides a way for using internal Maya objects as keys in hash-based lookups.
For example, Python dictionaries use a hash lookup, based on the key's __hash__() method. If you try to use MObjectHandles as keys in a dictionary you will find that two different MObjectHandles which refer to the same internal Maya object will not match. This is because Python's default __hash__() method is only looking at the MObjectHandles themselves, not what they contain. So different MObjectHandles can produce different __hash__() values even if they refer to the same internal Maya object.
To get around this you can create a container class or a derived class which defines its own __hash__() method which returns the MObjectHandle's hashCode():
class MyObjHandle(maya.OpenMaya.MObjectHandle): def __hash__(self): return self.hashCode() bodyParts = { MyObjHandle(leftThumbObj): "hand", MyObjHandle(rightThumbObj): "hand", MyObjHandle(leftToeObj): "foot", MyObjHandle(rightToeObj): "foot", ... } node = maya.OpenMaya.MObject() selectionList.getDependNode(0, node) if bodyParts[MyObjHandle(node)] == "foot": ...
An object's hash code is not guaranteed to remain the same from one Maya session to another, nor if it is removed from the scene and subsequently restored in any way, such as deleting a node and then undoing the deletion, reloading the scene file, etc.
Returns true if the MObjectHandle is a handle for the given MObject.
Returns true if the MObjectHandle handles the same MObject as this MObjectHandle.
Returns true if the MObjectHandle is not a handle for the given MObject.
Returns true if the MObjectHandle does not handle the same MObject as this MObjectHandle.
Assigns this MObjectHandle to an MObject instance.
Assigns this MObjectHandle to an instance of another MObjectHandle.
|
http://download.autodesk.com/us/maya/2009help/API/class_m_object_handle.html
|
crawl-003
|
en
|
refinedweb
|
for connected embedded systems
mkstemp()
Make a unique temporary filename, and open the file
Synopsis:
#include <stdlib.h> int mkstemp( char* template );:
Caveats:
It's possible to run out of letters. The mkstemp() function doesn't check to determine whether the file name part of template exceeds the maximum allowable filename length.
For portability with X/Open standards prior to XPG4v2, use tmpfile() instead.
See also:
chmod(). getpid(). mktemp(), open() stat(). tmpfile(), tmpnam()
|
http://www.qnx.com/developers/docs/6.3.2/neutrino/lib_ref/m/mkstemp.html
|
crawl-003
|
en
|
refinedweb
|
mmap, munmap - map or unmap files or devices into memory
Synopsis
Description
Notes
Errors
Availability
#include <sys/mman.h>
void * mmap(void *start, size_t length, int prot , int flags, int fd, off_t offset);
int munmap(void *start, size_t length);b (formerly POSIX.4) and SUSv2. Linux also knows about the following non-standard..
|
http://www.squarebox.co.uk/cgi-squarebox/manServer/usr/share/man/man2/mmap.2
|
crawl-003
|
en
|
refinedweb
|
#include <resizetrackthread.h>
Inherits BC_TextBox.
Definition at line 39 of file resizetrackthread.h.
Definition at line 214 of file resizetrackthread.C.
Reimplemented from BC_TextBox.
Definition at line 223 of file resizetrackthread.C.
References BC_TextBox::get_text(), gui, thread, ResizeTrackWindow::update(), and ResizeTrackThread::w.
Definition at line 47 of file resizetrackthread.h.
Referenced by handle_event().
Definition at line 48 of file resizetrackthread.h.
Referenced by handle_event().
|
http://cinelerra.org/devcorner/doxy/svn_2.1_r1056/html/classResizeTrackWidth.html
|
crawl-003
|
en
|
refinedweb
|
sched_get_priority_max, sched_get_priority_min - get static priority range
Synopsis
Description
Errors
#include <sched.h>
int sched_get_priority_max(int policy);
int sched_get_priority_min(int policy);, and SCHED_OTHER.b, errno is set appropriately.
POSIX.1b (formerly POSIX.4)
sched_setaffinity(2), sched_getaffinity(2), sched_setscheduler(2), sched_getscheduler(2), sched_setparam(2), sched_getparam(2))
ISO/IEC 9945-1:1996
|
http://www.squarebox.co.uk/cgi-squarebox/manServer/usr/share/man/man2/sched_get_priority_min.2
|
crawl-003
|
en
|
refinedweb
|
Xerces-C++ is one of the most full-featured and portable XML parsers written in C++ available today. What's more, it's open source (distributed by the Apache Xerces Project) and it's fully conformant to the most important XML standards -- XML 1.0 3rd Edition, XML 1.1, and XML Schema 1.0 2nd Edition Structures and Datatypes. Because of the importance they play in Web services, XML Schemas are becoming especially important to today's XML applications. In this article, we show you how to use Xerces-C++ to validate a document according to an XML Schema. We then explore how to get the best possible schema-validation performance out of Xerces-C++ through the use of its grammar caching and grammar serialization capabilities (see Resources).
Simple XML Schema validation using SAX2
The W3C's XML Schema specification defines a set of components that XML authors use to describe the structure of XML documents. It also provides a rich datatype language that specifies the textual content of elements and attributes, thereby permitting one application environment to transmit data to another without losing information. This is why XML Schemas play such a critical role in Web services, and why they're increasingly important in other aspects of XML processing. Our first job in this article is to show you how to use Xerces-C++ to validate a document according to an XML Schema.
In this article, we use Xerces-C++'s version of the SAX 2.0 API to illustrate its schema-validation capabilities. Xerces-C++ also supports a binding for W3C's DOM Level 2 Core specification. It's trivial to take the code presented here for SAX2 and alter it so that it works in the context of Xerces-C++'s DOM implementation. While this article doesn't describe the usage of Xerces-C++ or its SAX2 API in detail, we'll note some of the more important aspects of SAX2 as they relate to XML Schema validation (see Resources).
To validate an XML document against its corresponding XML Schema documents, you first need to create a Xerces-C++ SAX 2 parser instance and set the appropriate features and handlers. Then you tell the parser instance to parse the XML document. For example:
Listing 1. Enabling schema validation on a Xerces-C++ SAX 2 parser
Simple XML Schema validation using SAX2 with grammar caching enabled
XML Schema validation is a relatively complex process. The parser makes a large number of checks on each aspect of the document, but the parser can only make these checks after it does extensive processing of the documents that comprise the XML Schema. It does this in order to turn these documents into an internal form, called a grammar, which it can use to perform validation.
In addition, the XML Schema specifications mandate that
parsers must ensure that the documents comprising the XML Schema are valid
XML Schema documents. You can avoid some of this latter checking if the
application sets the
fgXercesSchemaFullChecking
feature to false (which is the default). When this is done, the parser doesn't perform certain complicated
checks on the schema -- such as making sure that whenever the schema encounters an element
in a document validated by the schema, it uses a unique type definition to validate that
element. While this may sound esoteric, much of the logic of Web
services and other standards and technologies that rely on XML Schema assumes
that valid schemas have this and other properties whose verification the
schema-full-checking feature can disable.
It's always a good idea to enable this feature. Fortunately, Xerces-C++ provides you with an easy way to avoid repeatedly rebuilding grammars that correspond to commonly-used XML Schemas, and so save all this build and verification effort on subsequent parses. This is referred to as grammar caching, since it involves building the grammars once and then putting them into a cache, where the parser can find and retrieve them when required, without additional processing.
Listing 2 only differs from Listing 1 in that the
CacheGrammarFromParse
feature is set. When this feature is set and the parser
encounters a
schemaLocation attribute in a document, it will consult its
internal grammar cache (
XMLGrammarPool) to see whether
it has a grammar that corresponds to the
schemaLocation's target namespace.
If it does, it will use that grammar; otherwise, it will parse the schema
document associated with the
schemaLocation's hint, and add the resulting
grammar to the
XMLGrammarPool. This is a great model to use when your
documents refer to a limited number of target namespaces and have accurate
schemaLocation hints.
Listing 2. Simple grammar caching
But what if you want to take a more active approach to XML parsing? Suppose you want to specify where the parser looks to find schema documents with particular
target namespaces. One way, of course, is to register a SAX
EntityResolver
on the parser (see Resources). Another is to use the
loadGrammar method of Xerces-C++ parsers to explicitly create grammars
that correspond to particular target namespaces (see Listing 3).
Listing 3. XML Schema validation using a cached schema with an explicit location
Note that
fgXercesUseCachedGrammarInParse causes Xerces-C++ to refer requests
for grammars to its
XMLGrammarPool instance before it asks a registered
EntityResolver or tries to dereference the
schemaLocation hint. This is not the
same as
fgXercesCacheGrammarFromParse, which additionally adds all new grammars
encountered while parsing documents to the
XMLGrammarPool.
XML Schema validation using serialization of grammars to disk
What if your application can't reuse parser instances, with their
associated
XMLGrammarPools, for long periods of time? This can happen if XML
documents are parsed infrequently, or if the number of threads within your
application varies widely (Xerces-C++ parsers are not re-entrant). In this
situation, the time taken to build that first grammar from a set of schema
documents might well be important even if that grammar is reused many times.
But Xerces-C++ can help here too: It provides a means to serialize the
entire contents of an
XMLGrammarPool to disk, in their native form. This
dramatically speeds up the creation of grammar objects for
validation. It also allows the application to group all XML Schemas of
interest in one place, so the application logic that knows
which schemas are important and trusted can be separated entirely from
application logic concerned with instance document processing.
Listing 4 illustrates how to build an
XMLGrammarPool
and serialize its contents to a binary file. The final example in this article will then
show how to use the contents of that file to validate documents.
Listing 4. Serializing schema grammar to disk
In Listing 4, various internal Xerces-C++ classes are used as implementations for interfaces. In general, you might want to customize the behaviour by providing your own implementations.
Now you have a binary file on disk that contains a Xerces-C++
representation of the
XMLGrammarPool instance containing all the schema
documents of interest to your application. Now, assume that you
want to validate an instance document according to one of those XML
Schemas -- so reload that file into memory and use it!
Listing 5. XML Schema validation using a deserialized
XMLGrammarPoolfrom disk
In this article, we showed you how to use Xerces-C++ to validate an instance document according to an XML Schema. We also demonstrated how you can improve performance of this process when you enable the parser to cache its internal representations of XML Schemas. We then used Xerces-C++'s ability to serialize these internal representations to disk, then deserialize them back into memory when required, to avoid the expense of initializing a grammar cache from raw schema documents.
Performance is a constant concern with applications that need to use XML Schema. This article can help allay those concerns for C and C++ applications that make use of the Xerces-C++ parser.
Learn
- Read the W3C Recommendation XML Schema Part 0: Primer for an introduction to the XML Schema language.
- To learn more about the XML standards, read the XML 1.0 and the XML 1.1 specifications.
- Reference the Xerces-C++ SAX2 Programming Guide for a tutorial on how to use the SAX2 API.
- Explore the C++ Language Binding for DOM.
- Read the developerWorks tutorial "XML Schema validation in Xerces-Java 2" (July 2002).
-)
- Jump start your knowledge with these developerWorks articles:
- Save XML data using DOMWriter in XML for the C++ parser in "Serialize XML Data" (July 2003).
- Compare DOM and SAX and then put SAX to work in "SAX, the power API" (August 2001).
- Find hundreds more XML resources on the developerWorks XML zone.
- Find out how you can become an an IBM Certified Developer in XML and related technologies.
Get products and technologies
- While you're at it, check the W3C XML Schema specification which is composed of two parts: XML Schema Part 1: Structures and XML Schema Part 2: Datatypes.
- Try Xerces-C++, the XML parser for C++ that's distributed by Apache.
- Visit the offical SAX Web site to learn more about the API. You'll find technical documentation, FAQs, and more..
|
http://www.ibm.com/developerworks/webservices/library/x-xsdxerc/index.html
|
crawl-003
|
en
|
refinedweb
|
This article assumes that you've read the first two installments of this series and are familiar with the healthcare reservation system and its architectural framework at the heart of this scenario.
In this scenario, remote medical offices completely delegate the function of client office visits to a centralized system that prepares the data for each service provider (medical office), encrypts the confidential information through a WebSphere DataPower XML Security Gateway XS40 box and, thus, sends it to WebSphere Enterprise Service Bus. The complete architectural picture is shown below in Figure 1.
Figure 1. Reservation system
This section provides detailed information about instrumenting WebSphere Enterprise Service Bus to:
- Recognize encrypted data: WebSphere Enterprise Service Bus has strict schema validation features that apply to data coming through its export bindings. If the format of the incoming message doesn't match the definition of the export interface, the message is discarded from WebSphere Enterprise Service Bus and an exception is raised. You must instrument WebSphere Enterprise Service Bus, as far as the encrypted data's structure, providing ad hoc data types and interfaces.
- Perform protocol switching: WebSphere Enterprise Service Bus gets these messages as SOAP/HTTP requests and then forwards them to the Java™ Message Service (JMS) topic using specific import and export bindings. The export binding describes how a client communicates with the mediation module. The import binding, instead, describes how the mediation module communicates with the defined service. Bindings guarantee transparent transport protocol switching capabilities and make it possible for the central reservation system to connect to the medical offices without any communication logic required within the application code.
Figure 2. Protocol switching
- Make use of message selectors: According to JMS specifications, a JMS client can filter by message selectors to understand which messages it should process. Because each medical office would like to receive only the data destined to it, the JMS message should contain the
serviceProviderIdin the header. Starting from the 6.0.2 release, WebSphere Enterprise Service Bus provides a message element setter mediation primitive that you can use for this purpose: When the mediation module gets a request message, it inspects the incoming message format, leverages the message setter primitive to retrieve the service provider ID from the SOAP body, and stores it (through a copy action) in the output message's JMS header (see Figure 3).
Figure 3. Message selectors
To implement the described scenario, we defined a mediation module and wired it to a SOAP/HTTP export binding and a JMS import binding.
The mediation module is composed of four functional pieces:
- An export interface to get the SOAP HTTP message containing sensitive data
- A message selector to augment the JMS message header with selectors information
- An XSLT transformation that matches the import and export interfaces and, thus, shows you how it's possible to provide some mediation logic, even when the message contains encrypted data
- An import interface that sends the sensitive data to the topic as a JMS payload
Figure 4 illustrates the mediation module.
Figure 4. Mediation module
This article shows you how to build all the functional parts that the mediation module is composed of. In the following sections, you can find detailed information to complete the steps needed to do the following:
- Create a new library.
- Define data types.
- Define export and import interfaces.
- Define the mediation module.
As a first step, you should create a new library in which to store both the data types and the import and export interfaces to be used within the mediation module. You do this by following these steps:
- Select File > New > Project. A new window appears.
- Select Library (see Figure 5).
Figure 5. New project
- In the window that opens, type
Asynch-Libraryin the Library Name field, and keep the Use Default check box flagged.
- Click Finish. The wizard takes a second to generate the library (see Figure 6).
Figure 6. New library
If you looked carefully at the previous articles of this series, Part 2 in particular, you should know the format of the SOAP message coming from the central reservation system. It contains all the information concerning the calendar of the reserved slots, as displayed in Listing 1.
Listing 1. SOAP message
As you can see in Listing 1, the sensitive data are included within an
EncryptedData section. Because WebSphere Enterprise
Service Bus performs schema validation on the messages coming through its export
binding, it's clear that it's necessary to make WebSphere Enterprise Service
Bus
aware of the
EncryptedData definition.
If you look carefully at the format of the message, you see that the
EncryptedData element is officially defined in the W3C
Standard XML encryption namespace. You can also see that as far as the
KeyInfo is concerned, its definition is part of the XML
digital signature namespace. For this reason, if you import from the official W3C
site (see the Resources section for the URL), both the
xenc-schema, including the definition of the XML encryption namespace and the
xmldixencg-core schema containing the definition of the XML digital signature
namespace, you should have a good chance to make WebSphere Enterprise Service Bus
aware of the
EncryptedData type definition.
To import these schemas:
- In the IBM WebSphere Integration Developer console, select File > New > Other. In the window that opens, check the Show All Wizards box, then expand the XML folder, and select XML Schema, as shown in Figure 7.
Figure 7. New XML schema
- If a window opens asking you for the enablement of the XML development capabilities, click OK to allow the required capability (see Figure 8).
Figure 8. Confirm enablement
- Type
xmldsig-core-schema.xsdin the File name field, select the previous created library as the schema location, and then click Finish, as shown in Figure 9.
Figure 9. Create XML schema
- In the schema editor that opens, cancel the whole content of the file. Then download the xenc schema from the Download section of this article. Copy the content of this schema, and paste it in the schema editor. Finally, save the file.
- You should get an error message complaining of a duplicated attribute, PGPKeypacket, in the newly created schema. This problem is due to the fact that, as far as the 6.0.2 FP 1 release is concerned, WebSphere Enterprise Service Bus doesn't support choice elements and, thus, sees two PGPKeypackets within the same schema definition (even if the choice oppositely marks these as two alternative paths), as shown in Figure 10.
Figure 10. Mediation module
This bug has been resolved since the new 6.1 release. To solve this problem, cancel one of the two sequence elements within the choice. We decided to remove the second one. Clearly when removing one of the two sequences, the choice construct is useless, so you must remove it, too, from the schema. If you save the schema, the previous error should disappear.
- Following the above steps, create a new XSD file, and name it xenc-schema.xsd (see Figure 11).
Figure 11. XSD core schema
In the XSD schema editor that opens, cancel the whole content of the file. Then download the xenc-schema.xsd schema from the Download section of this article. Copy the content of this schema, and paste it in the XSD schema editor. Save the file; you shouldn't get any error this time.
- When you save the files, the wizard automatically parses the schemas and generates a new data type for each element type defined within the schema. You can easily verify this by expanding Data Types under the Asynch-Library (see Figure 12).
Figure 12. Data types
In particular, the wizard generates an
EncryptedDataType data type that, as far as WebSphere
Enterprise Service Bus's schema validation is concerned, seems to be the natural
counterpart for matching the sensitive data contained within the
EncryptedData section. This said, creating a new export
interface and using an
EncryptedData object of type
EncryptedDataType might let the encrypted data pass
through WebSphere Enterprise Service
Bus. (This isn't totally true, because a light adjustment is needed,
as you'll see in the following section; but you're on the right path.)
Define the export/import interface
Now you're ready to define the interfaces. You need an export interface for the
sendUpdatedAgenda and an import interface for the
publishAgenda asynchronous interaction.
- Right-click the Asynch-Library project, and select New > Interface. Name it
AsynchResSystemExport, and click the Finish button (see Figure 13).
Figure 13. New export interface
- In the window that appears, select the Add One Way Operation icon to add a new operation (remember the use case requires an asynchronous interaction). Name the new operation
sendUpdatedAgenda, and add the following two parameters (using the Add Input icon):
EncryptedDataof type
EncryptedDataType
serviceProviderIdas a
String
Figure 14. Export interface
Click Save, and close the interface dialog.
- Even if this interface definition seems at first glance to perfectly match the SOAP message's format, in reality this isn't completely true. If you open the interface definition by right-clicking it and choosing the open with the XML editor option, you see that the wizard generated with the
EncryptedDataelement in the Asynch-Library namespace doesn't match with the
EncryptedDataelement of the xmlenc namespace. To solve this problem, comment out the element marked in red, and replace it with the element marked in green, which is a real reference to the
EncryptedDataelement of the xmlenc namespace, as shown in Figure 15.
Figure 15. Asynchronous resource system export
- After completing the above step, choose New Import Interface to add a new interface for the import binding, as shown in Figure 16.
- Right-click the Interface folder within the Asynch-Library, and select New > Interface.
- Select Asynch-Library from the Module list, and type
AsynchResSystemImportinto the Name field.
Figure 16. New import interface
- In the interface dialog box that opens, select the Add One Way Operation icon to add a new operation. Name the operation
publishAgenda, and add a new
EncryptedDataparameter of type
EncryptedDataType(see Figure 17).
Figure 17. Publish agenda
- Repeat step 5 to change the
EncryptedDataelement definition in the Import Interface.
Figure 18. Asynchronous resource system import
- Save the WSDL file and close it.
The above modifications aren't the only ones to be performed to make encrypted data correctly pass through WebSphere Enterprise Service Bus and have this data rightly copied as a JMS textual payload. If you look at the SOAP message format, you see that the
KeyInfoelement contains an
EncryptedKeyelement embedding all the information, as far as the encryption algorithm used to encrypt the key and the encrypted form of the key. Being the
KeyInfodefined in the xmldsig namespace, you'd expect to find the
EncryptedKeyelement listed within the complex type definition of the
KeyInfoelement within the schema. However, if you open the xmldsig-core-schema.xsd file through the XML editor and look for the
KeyInfodefinition, you should see something like Figure 19.
Figure 19. xmldsig-core-schema
As you can see, there's no mention of the
EncryptedKeyelement, but the schema assumes that any element can be added to complete the
KeyInfodefinition. As a consequence of this, using this schema makes WebSphere Enterprise Service Bus ignore any
EncryptedKeyinformation within an incoming SOAP message. So if no change is performed, this piece of information is missed and not copied to the JMS payload (you get a better understanding of what this means in the section dealing with the XSLT transformation). To overcome this limitation, you should perform a light change in the xmldsig-core-schema.xsd schema.
- You should comment out the row in blue and add the row in red, as shown in Figure 20.
Figure 20. xmldsig-core-schema
- Moreover, because you are adding an element from a foreign namespace, this namespace must be declared in some way. So you should add the three red lines shown in Figure 21 to the namespace definition section at the beginning of the file.
Figure 21. xmldsig-core-schema
- If some errors appear complaining of duplicated namespace definitions, open the xenc-schema.xsd schema, and modify the import namespace, as shown in Figures 22 and 23.
Figure 22. xenc-schema
Figure 23. xenc-schema
This should clear all the previous errors if any.
Define the mediation module
Now you're ready to create a new mediation module and add the necessary mediation primitives.
- Select File > New > Project. Then choose Mediation Module from the Select a wizard window.
Figure 24. New mediation module
- Type
AsynchResSystemModulein the Module Name field, and keep the defaults as displayed in Figure 25.
Figure25. Add interface
- Click Next. In the Select Required Libraries window that appears, select Asynch-Library to add it to the module and, thus, allow the mediation module to use the data types and interfaces you previously defined within the library.
- When the wizard completes the module's creation, double-click the Assembly Diagram icon to work with the assembly diagram. The Assembly Editor opens.
- Add an import and an export component by dragging the relative icons onto the diagram. Rename them
WS_Exportand
JMS_Import.
- Right-click the export component and select add interface to add the
AsynchResSystemExportinterface to the export component (see Figure 26) and the
AsynchResSystemImportinterface to the import component (see Figure 27).
Figure 26. Add export interface
Figure 27. Add import interface
- Select the Mediation Module component, and perform the following actions:
- Right-click, select the Add Interface option, and add the AsynchResSystemExport interface.
- Right-click, select the Add Reference option, and add the AsynchResSystemImport interface.
- Rename the module to
Asynch_Mediation.
- Select the WS_Export component, right-click, and select the Wire to Existing option.
- Select the JMS_Import component, right-click, and select the Wire to Existing option.
Figure 28. Assembly diagram
- Because the module must get a SOAP/HTTP message and convert it to a JMS payload, you should generate two bindings:
- A Web service binding
- A JMS message binding
- Right-click the WS_Export component, and select the Generate Binding option.
- From the window that appears, select Web Service Binding, and then select the SOAP/HTTP option in the Transport Selection window (see Figure 29).
Figure 29. Transport selection
- Right-click the JMS-Import component, and select the Generate Binding option again.
- Select JMS Message. In the window that appears, select Publish-Subscribe as the messaging domain, then select the Use pre-configured messaging provider resources check box, and provide the topic name and the topic connection factory settings according to the configuration steps already performed in the first article of this series.
Figure 30. Configure JMS import
Remember to select the Business Object XML using JMSTextMessage option as serialization type. This way you ensure that the encrypted body of the SOAP message is passed as it is in an XML form to the topic and then can be parsed and reconstructed using some XML security standard decryption algorithm, as described in Part 2 of this series.
- After being configured, the import and export bindings provide a mediation flow for this module. To do this, right-click the module component, and select Generate Implementation, as shown in Figure 31.
Figure 31. Generate implementation
- In the window that appears, select AsynchResSystemModule, and click OK (see Figure 32). A new mediation flow is generated.
Figure 32. Asynchronous resource system module
- Link the sendUpdateAgenda and publishAgenda operations in the Operation Connections window.
- Add a new message setter primitive, and name it
setMessageSelector.
- Add an XSLT transformation primitive, and name it
adaptInterfaces.
- Order and wire these primitives as shown in Figure 33.
Figure 33. Mediation flow
- Click setMessageSelector, and in the properties window at the bottom of the page, select the Details tab.
- Click the Add button.
- Select Copy from the Type drop-down list. Two CustomXPath buttons appear, giving you the possibility of providing guided XPath expressions for both the Target and the Value fields.
Figure 34. Message selector
- Select JMSType in the Target field and serviceproviderId in the Value field. This way the
messageSettercopies the
serviceProviderIdstring that univocally identifies each service provider, from the message's body to the JMS header, thus acting as a message selector, as explained in the first article of this series.
- Save the mediation flow, then select the adaptInterfaces XSLT transformation primitive.
- In the Properties window at the bottom of the page, select the Details tab, then click the New button to create a new transformation.
- In the window that appears, keep the defaults and click Finish.
Figure 35. XSLT mapping
- In the window that appears next, expand the tree on both sides until you reach the
KeyInfoelement. Expand this element, too. You should see a
ds:KeyNameelement with an arrow on its right. The arrow is displayed as a result of the
KeyInfobeing defined through a Choice construct in the xmldsig schema.
Figure 36. XSLT mapping
- Click the arrow and scroll down until you see the
EncryptedKeyelement, then select it on both sides. Remember that you modified the
KeyInfocomplex type definition to add the
EncryptedKeyelement within the Choice; now you should have a better understanding of the reason. Without this change, in fact, you wouldn't be able to select the
EncryptedKeyelement from the arrow, so all the key-related information, as far as the algorithm used to encrypt the key and the encrypted values, wouldn't be copied to the JMS payload (see Figure 37).
Figure 37. Transformation
- Select the xenc:EncryptedData element on both sides, and right-click the mouse to select the match mapping option. This way you instrument WebSphere Enterprise Service Bus to recursively copy the whole content of the incoming
EncryptedDatasection from the incoming SOAP request's body to the JMS payload.
- Save the transformation, and close the window.
- Finally, save the whole mediation flow.
This article described in detail how to instrument WebSphere Enterprise Service Bus to accept SOAP messages containing encrypted portions of data, perform protocol switching, and then forward these messages to a JMS topic where the service providers are registered. You've learned how to:
- Properly define an export interface to get the SOAP HTTP message containing sensitive data.
- Configure a message selector to augment the JMS message header with selectors information.
- Introduce an XSLT transformation to match the import and export interfaces and, thus, add mediation logic even when the message contains encrypted data.
- Provide an import interface to send the sensitive data to the topic as a JMS payload.
At this point, the whole scenario has been completely covered. The last installment of the series will address:
- Concerns about the client side of the application.
- Getting the JMS messages from WebSphere Enterprise Service Bus.
- Decrypting the sensitive data with the service provider's private key to reconstruct the original message that's been sent from the central reservation system and that has been encrypted through the WebSphere DataPower SOA Appliances box.
This part will be deeply covered in the fourth and final article of this series, so stay tuned!
Information about download methods.
-
- Download XENC Schema, and XMLDSIG CORE Schema.
- Innovate your next development project with IBM trial software, available for download or on DVD.
Discuss
- Get involved in the developerWorks community by participating in developerWorks blogs..
|
http://www.ibm.com/developerworks/webservices/library/ws-soa-real3/
|
crawl-003
|
en
|
refinedweb
|
©2005 Felleisen, Proulx, et. al.
Once we have designed several sorting algorithms it would help if we
had a method that determined whether the given collection of data (a
list of
Objects or an
ArrayList is sorted.
We know by now that we can design such methods to work for a number of possible kinds of data collections and a number of different ways we may choose for comparing the elements of the data collection.
Let us start with some examples, sorting books by titles, year of publication and the author's name.
Book sn = new Book("AP", "SN", 1996); Book akm = new Book("RPW", "AtKM", 1956); Book eoe = new Book("JS", "EoE", 1954); Book atf = new Book("AM", "AtF", 1962); Book mls = new Book("PC", "MLS", 2002); ALoObj authors = new ConsLoObj(atf, new ConsLoObj(sn, new ConsLoObj(eoe, new ConsLoObj(mls, new ConsLoObj(akm, new MTLoObj()))))); ALoObj titles = new ConsLoObj(akm new ConsLoObj(atf, new ConsLoObj(eoe, new ConsLoObj(mls, new ConsLoObj(sn, new MTLoObj()))))); ArrayList years = new ArrayList(); public void initYears(){ this.years.add(this.eoe); this.years.add(this.akm); this.years.add(this.atf); this.years.add(this.sn); this.years.add(this.mls); }
We have two lists of
Objects and one
ArrayList,
presumably results of different sorting algorithms. But in order to
determine whether the data is sorted, all we need is to be able to
examine the data elements one at a time. That means, all we need is an
iterator that traverses the data and generates the elements in the
order in which they appear in the original data structure. That means
that an
IRange will be one of the method arguments.
For our examples, we define three objects of the type IRange:
IRange authorsIt = new ListRange(authors); IRange titlesIt = new ListRange(titles); IRange yearsIt = new ArrayListRange(years, 0);
The three sets of data shown here are sorted according to three
different criteria: by title, by author's name, and by the publication
year. That means, our sorting checker has to know what method was used
to sort the data. We use the
Comparator interface to define
how the comparison is made, i.e. using the method
interface Comparator{ public boolean compare(Object obj1, Object obj2); }
We can now formulate the purpose statement and the header:
// determine whether the data generated by the given iterator // is sorted according to the ordering given by the comparator boolean isSorted(IRange it, Comparator comp){ ... }
Our next step is to define three classes that implement the
Comparator interface to perform the three different kinds of
comparisons of books: by title, by author, and by year of publication:
public class ByTitle implements Comparator{ // compare two books by their title public boolean compare(Object obj1, Object obj2){ return ((Book)obj1).title.compareTo(((Book)obj2).title); } } public class ByAuthor implements Comparator{ // compare two books by the name of the author public boolean compare(Object obj1, Object obj2){ return ((Book)obj1).author.compareTo(((Book)obj2).author); } } public class ByYear implements Comparator{ // compare two books by their year of publication public boolean compare(Object obj1, Object obj2){ return ((Book)obj1).year - ((Book)obj2).year; } }
Of course, we also need three obejcts of the type
Comparator:
Comparator byTitle = new ByTitle(); Comparator byAuthor = new ByAuthor(); Comaprator byYear = new ByYear();
The three classes that implement the
Comparator will be
defined in separate files, while all the rest of the code shown here
will be a part of the
Examples class. We can write down
trests for these classes:
byTitle.compare(akm, sn) ---> true byTitle.compare(mls, eoe) ---> false byAuthor.compare(sn, akm) ---> true byAuthor.compare(eoe, mls) ---> false byYear.compare(sn, mls) ---> true byYear.compare(sn, atf) ---> false
We can now make examples of the invocation of the method
isSorted and show the expected results:
test("sorted by title", true, isSorted(titlesIt, byTitle);) test("sorted by author", true, isSorted(authorsIt, byAuthor)); test("sorted by year", true, isSorted(yearsIt, byYear)); test("sorted by title", false, isSorted(authorsIt, byTitle)); test("sorted by year", false, isSorted(titlesIt, byYear)); test("sorted by author", false, isSorted(yearsIt, byAuthor));
We can now look at the template for this method. The method will be
defined within our
Examples class, or within the
Algorithms class, but the main point is that it makes no use
of the instance of the class that invokes it. Therefore, there are no
...this.---... fields in the template. The only pieces of data
needed for the computation are the two arguments. That means our
template will have the following elements:
... it.hasMore() ... (if above produces true) ... it.current() ... ... it.next() ... ... this.isSorted(it.next(), comp) ... comp.compare(---, ---)
If
it.hasMore() returns
false, there is no data in
the data set and so it is sorted by default. We also realize that the
data is also sorted if there is only one element in the data set, but
for now we put that aside. However, looking at the template further,
we see a problem. The method
comp.compare requires two
arguments, but we only have one
Object available. Thinking
about the cause of the problem we see that just looking at the first
element of the data set is not sufficient -- we need to compare the
first with the first in the remainder of the data set. We decide to
define a helper method that receives the element to compare to as an
additional argument (an accumulator). The method header and the
purpose become:
// is the data set given by it sorted and are all its elements // before obj with regard to comp boolean isSortedAcc(IRange it, Comparator comp, Object acc){...}
Let us illustrate this visually:
isSorted(it, comp) isSorted(it, comp, acc) +---+---+---+---+ +---+ +---+---+---+ | 3 | 5 | 2 | 7 | | 3 | | 5 | 2 | 7 | +---+---+---+---+ +---+ +---+---+---+ IRange it acc IRange it
The example illustrates three points. First, it is clear how to complete the body of the original method:
// determine whether the data generated by the given iterator // is sorted according to the ordering given by the comparator boolean isSorted(IRange it, Comparator comp){ if (it.hasMore()) return isSortedAcc(it.next, comp, it.current()); else return true; }
Next, we see that in our method we must make sure that
acc is less that or equal to the first element of the
structure traversed by
it, and that we still must make sure
that the rest of the list is sorted. Of course,
acc is added
to the template and becomes the second argument to the
comp.compare(...) method.
Here are the examples to illustrate the different possibilities:
ALoObj books1 = new ConsLoObj(akm, new ConsLoObj(atf, new MTLoObj())); ALoObj books2 = new ConsLoObj(akm, new ConsLoObj(eoe, new MTLoObj())); IRange brange1 = ListRange(books1); IRange brange2 = ListRange(books2); isSortedAcc(brange1, byYear, sn) ---> false isSortedAcc(brange2, byAuthor, sn) ---> false isSortedAcc(brange1, byYear, eoe) ---> true
We are ready for the template. It is just as for the
isSorted
method, but also includes
acc that can be used as one of the
arguments for the
comp.compare methods.
The body becomes:
// is the data set given by it sorted and are all its elements // before obj with regard to comp boolean isSortedAcc(IRange it, Comparator comp, Object acc){ if (it.hasMore()){ return ((comp.compare(acc, it.current()) <= 0) && isSortedAcc(it.next, comp, it.current()); } else return true; }
We can now run all of our test cases. The class diagram for these classes is shown below - we use a dotted line to indicate that a method consumes an instance of another class or interface type.
// Designing isSorted method: +----------------------------------------------+ | boolean isSorted(IRange it, Comparator comp) |........... +----------------------------------------------+ : : ............................................... : : : v v +-------------------+ +-----------------------------------+ +- >| IRange |< - - - -+ | Comparator | | +-------------------+ | +-----------------------------------+ | boolean hasMore() | | int compare(Object o1, Object o2) | | | Object current() | | +-----------------------------------+ | IRange next() | ^ ^ ^ | +-------------------+ | | | | +- - - - - | | | | | +-----------------+ +---------------+ +---------+ +----------+ +--------+ | ArrayListRange | | ListRange | | ByTitle | | ByAuthor | | ByYear | +-----------------+ +---------------+ +--------- +----------+ +--------+ | ArrayList alist |-+ +-| ALoBook alist | : : : | int current | | | +---------------+ : : : +-----------------+ | | : : : +----------+ +-------+ +-----------+ : : : | | | | : : : v v v | : : : +-----------------+ +---------+ | : : : | ArrayList | | ALoBook | | : : : +-----------------+ +---------+ | : : : +-| (... Book ...) | / \ | : : : | +-----------------+ --- | : : : | | | : : : | ---------------- | : : : | | | | : : : | +----------+ +--------------+ | : : : | | MTLoBook | | ConsLoBook | | : : : | +----------+ +--------------+ | : : : | +----------| Book first | | : : : +-------------+ | | ALoBook rest |-+ : : : | | +--------------+ : : : | | ...................................................... v v v +---------------+ | Book | +---------------+ | String title | | String author | | int year | +---------------+
|
http://www.ccs.neu.edu/home/vkp/csu213-sp05/Lectures/lecture24.html
|
crawl-003
|
en
|
refinedweb
|
pthread_spin_lock, pthread_spin_trylock - lock a spin lock object (ADVANCED REALTIME THREADS)
[THR SPI]
#include <pthread.h>.
These functions may fail if:
- ].
None.
Applications using this function may be subject to priority inversion, as discussed in the Base Definitions volume of IEEE Std 1003.1-2001, Section 3.285, Priority Inversion.
The pthread_spin_lock() and pthread_spin_trylock() functions are part of the Spin Locks option and need not be provided on all implementations.
None.
None.
pthread_spin_destroy(), pthread_spin_unlock(), the Base Definitions volume of IEEE Std 1003.1-2001, .
|
http://pubs.opengroup.org/onlinepubs/009695399/functions/pthread_spin_trylock.html
|
crawl-003
|
en
|
refinedweb
|
#include <itkCoreAtomImageToDistanceMatrixProcess.h>
#include <itkCoreAtomImageToDistanceMatrixProcess.h>
Inheritance diagram for itk::CoreAtomImageToDistanceMatrixProcess< TSourceImage >:
Definition at line 38 of file itkCoreAtomImageToDistanceMatrixProcess.h.
Reimplemented from itk::ProcessObject.
Definition at line 48 of file itkCoreAtomImageToDistanceMatrixProcess.h.
Definition at line 67 of file itkCoreAtomImageToDistanceMatrixProcess.h.
Definition at line 66 of file itkCoreAtomImageToDistanceMatrixProcess.h.
Definition at line 64 of file itkCoreAtomImageToDistanceMatrixProcess.h.
Referenced by itk::CoreAtomImageToDistanceMatrixProcess< TSourceImage >::~CoreAtomImageToDistanceMatrixProcess().
Definition at line 65 of file itkCoreAtomImageToDistanceMatrixProcess.h.
Typedef for core atom image Definition at line 63 of file itkCoreAtomImageToDistanceMatrixProcess.h.
Smart Pointer type to a DataObject.
Definition at line 51 of file itkCoreAtomImageToDistanceMatrixProcess.h.
Referenced by itk::CoreAtomImageToDistanceMatrixProcess< TSourceImage >::Update().
Definition at line 71 of file itkCoreAtomImageToDistanceMatrixProcess.h.
Typedef for distance matrix Definition at line 70 of file itkCoreAtomImageToDistanceMatrixProcess.h.
Definition at line 74 of file itkCoreAtomImageToDistanceMatrixProcess.h.
Definition at line 47 of file itkCoreAtomImageToDistanceMatrixProcess.h.
The type used to store the position of the BloxPixel. Definition at line 77 of file itkCoreAtomImageToDistanceMatrixProcess.h.
Standard class typedefs
Definition at line 45 of file itkCoreAtomImageToDistanceMatrixProcess.h.
Definition at line 46 of file itkCoreAtomImageToDistanceMatrixProcess.h.
[protected]
[inline, protected, virtual]
Definition at line 93 of file itkCoreAtomImageToDistanceMatrixProcess.h.
References itk::CoreAtomImageToDistanceMatrixProcess< TSourceImage >::CoreAtomImagePointer, itk::CoreAtomImageToDistanceMatrixProcess< TSourceImage >::DistanceMatrixPointer, and itk::CoreAtomImageToDistanceMatrixProcess< TSourceImage >::Self.
[protected, virtual]
Method for forming the DistanceeMatrix
[virtual]
Run-time type information (and related methods)
Methods to get input image
Get the image output of this process object.
Get the image output of this process object.
Number of dimensions
Make a DataObject of the correct type to used as the specified output. Every ProcessObject subclass must be able to create a DataObject that can be used as a specified output. This method is automatically called when DataObject::DisconnectPipeline() is called. DataObject::DisconnectPipeline, disconnects a data object from being an output of its current source. When the data object is disconnected, the ProcessObject needs to construct a replacement output data object so that the ProcessObject is in a valid state. So DataObject::DisconnectPipeline eventually calls ProcessObject::MakeOutput. Note that MakeOutput always returns a itkSmartPointer to a DataObject. ImageSource and MeshSource override this method to create the correct type of image and mesh respectively. If a filter has multiple outputs of different types, then that filter must provide an implementation of MakeOutput().
blurred original image
[inline, virtual]
Bring this filter up-to-date. Update() checks modified times against last execution times, and re-executes objects if necessary. A side effect of this method is that the whole pipeline may execute in order to bring this filter up-to-date. This method updates the currently prescribed requested region. If no requested region has been set on the output, then the requested region will be set to the largest possible region. Once the requested region is set, Update() will make sure the specified requested region is up-to-date. This is a confusing side effect to users who are just calling Update() on a filter. A first call to Update() will cause the largest possible region to be updated. A second call to Update() will update that same region. If a modification to the upstream pipeline cause a filter to have a different largest possible region, this second call to Update() will not cause the output requested region to be reset to the new largest possible region. Instead, the output requested region will be the same as the last time Update() was called. To have a filter always to produce its largest possible region, users should call UpdateLargestPossibleRegion() instead.
Definition at line 87 of file itkCoreAtomImageToDistanceMatrixProcess.h.
References itk::CoreAtomImageToDistanceMatrixProcess< TSourceImage >::DataObjectPointer.
|
http://www.itk.org/Doxygen16/html/classitk_1_1CoreAtomImageToDistanceMatrixProcess.html
|
crawl-003
|
en
|
refinedweb
|
#include <MPxFieldNode.h>
MPxFieldNode allows the creation and manipulation of dependency graph nodes representing fields. This is the top level of a hierarchy of field node function sets. It permits manipulation of the attributes common to all types of fields.
Class constructor.
The class destructor.
This method returns the type of the node. This method should not be overridden by the user. It will return MPxNode::kFieldNode..
This method is not required to be overridden, it is only necessary for compatibility with the MFnField function set.
Compute the force of a field on an array of points, given their position, velocity, and mass.
This method uses MVectorArray to represent the positions of a point.
This method is not required to be overridden. The arguments have the same meaning as defined in OpenGL's glBitmap method.
Define the size and the origin for the icon.
This method is not required to be overridden. The arguments have the same meaning as defined in OpenGL's glBitmap method.
Define the bitmap for the icon. The memory in bitmap has been allocated according to the width and height in iconSizeAndOrigin().
Overriding this method allows the drawing of custom geometry using standard OpenGL calls. The OpenGL state should be left in the same state that it was in previously. The OpenGL routine glPushAttrib may be used to make this easier.
When this routine is called, the following conditions may be assumed:
Returns the falloff at the given parameter value.
Returns true if the falloffCurve is a constant one (default) or false if not.
|
http://download.autodesk.com/us/maya/2009help/API/class_m_px_field_node.html
|
crawl-003
|
en
|
refinedweb
|
#include <rtt/scripting/PeerParser.hpp>
#include <rtt/scripting/PeerParser.hpp>
List of all members.
Definition at line 59 of file PeerParser.hpp.
false
Create a PeerParser which starts looking for peers from a task.
The locator tries to go as far as possible in the peer-to-object path and will never throw.
peer() and object() will contain the last valid peer found and its supposed object, attribute or value.
The parser tries to traverse a full peer-to-object path and throws if it got stuck in the middle.
peer() will return the target peer and object() is this or the supposed object of the peer. The parser does not check if this object exists.
|
http://people.mech.kuleuven.be/~orocos/pub/stable/documentation/rtt/v1.8.x/api/html/classRTT_1_1detail_1_1PeerParser.html
|
crawl-003
|
en
|
refinedweb
|
#include <itkImageRandomIteratorWithIndex.h>
Inheritance diagram for itk::ImageRandomIteratorWithIndex< TImage >:
ImageRandomIteratorWithIndex is a templated class to represent a multi-dimensional iterator. ImageRandomIteratorWithIndex is templated over the image type ImageRandomIteratorWithIndex is constrained to walk only within the specified region and along a line parallel to one of the coordinate axis.
Most of the functionality is inherited from the ImageRandomConstIteratorWithIndex. The current class only adds write access to image pixels.
Definition at line 45 of file itkImageRandomIteratorWithIndex.h.
|
http://www.itk.org/Doxygen16/html/classitk_1_1ImageRandomIteratorWithIndex.html
|
crawl-003
|
en
|
refinedweb
|
In a typical Web services scenario, you normally let the tooling handle all the nuances of namespaces for you. But sometimes you have to deal with namespace issues yourself, particularly if you are constructing a SOAP message for a particular Web service using the SOAP with Attachments API for Java (SAAJ). This tip is meant for those of you who have to construct messages -- or parts of messages -- without the tooling's help.
While namespaces might seem complicated, all you really have to know is a short list of rules:
- If the WSDL style is RPC, then you look to the WSDL binding's
wsdlsoap:bodyelement for the namespace.
- If
wsdlsoap:bodyhas a namespace attribute (and the Web Services Interoperability Orginzation's (WS-I) Basic Profile (see Resources) requires it for RPC-style), then that is the namespace of the operation element in the SOAP message.
- If
wsdlsoap:bodyhas no namespace, then the operation element is unqualified.
- For data elements:
- If the element is defined by a root element (not a root type), then its namespace is the namespace of that root element;
- If the element is not defined by a root, the element is unqualified (for a caveat to this rule, see the discussion of elementFormDefault below).
These are simple rules, but like most rules, they need a little explanation. The rest of this tip shows you various examples of these rules in action.
There are two typical types of Web Services Description Language (WSDL) files: RPC/literal and document/literal wrapped. There are others, but in this tip, I cover only those two. (For details of the various types of WSDL, see the paper "Which style of WSDL should I use?" -- see Resources.)
Listing 1 contains an RPC/literal WSDL which has three operations: op1, op2, and op3. Notice the various namespaces in the WSDL file, highlighted in bold.
Listing 1. RPC/literal WSDL
Take a look at the namespaces in the binding's
wsdlsoap:body elements for each operation. op1 and op2 are examples of rule 1.1 (see below for the SOAP messages). op3 is an example of rule 1.2. op1 shows the conventional example of using the
targetNamespace -- in this case "" -- as the operation's namespace, but this is merely a convention. op2 uses a namespace not used anywhere else in the WSDL. And op3 defines no namespace at all.
Listings 2, 3, and 4 show the SOAP messages for calls to op1, op2, and op3, respectively. Note the namespaces within the messages, highlighted in bold.
Listing 2. RPC/literal request/response SOAP messages for op1
As mentioned, the SOAP messages in Listing 2 follow rule 1.1. op1 has the namespace "." These messages also follow rule 2.2. None of the parameter data is defined using a root element, only a root type -- data -- and its child elements. Since no root element is used, the elements are all unqualified.
Listing 3. RPC/literal request/response SOAP messages for op2
The only real difference between op1's and op2's messages (Listing 2 versus Listing 3) is that op2's messages show that you can use any namespace you choose; you do not have to use the WSDL definition's
targetNamespace.
Listing 4. RPC/literal request/response SOAP messages for op3
op3 is quite different from the other operations. First, there was no namespace defined, so the <op3> and <op3Response> tags are unqualified. This follows rule 1.2. (Note: Remember that op3 is not WS-I compliant -- see WS-I compliance sidebar.)
Secondly, the part named
in1 refers to a root element, not a root type. Since it is an element part, the part name,
in1, is ignored in favor of the element name,
DataElem. And since you're using the element name, you must also use the element's namespace, "." This follows rule 2.1.
Lastly, rule 2.1 is again invoked for the type element for
in2, which is a reference to a root element:
RefDataElem. This element is defined in yet another namespace: "."
Wrapped document/literal WSDL
The WSDL in Listing 5 is the equivalent to the WSDL in Listing 1. It is document/literal wrapped instead of RPC/literal. The Java APIs generated for this WSDL are identical to the Java APIs generated for the RPC/literal WSDL, but the SOAP messages are potentially somewhat different. Once again, the namespaces are highlighted in bold.
Listing 5. document/literal wrapped WSDL
For op1, the SOAP messages for the document/literal wrapped service are identical to the SOAP messages for the RPC/literal service (see Listing 2). This is the most common sort of document/literal wrapped operation. Be aware that you're now following rule 2.1, not rule 1.1; you're getting the namespace from an element, not from a
wsdl:soapbody. Notice the convention in the WSDL that the wrapper elements are defined in the same namespace as the WSDL itself: "." They could have been defined in any namespace, but by following this convention, the wrapped messages are identical to the RPC/literal messages.
op2's document/literal wrapped SOAP messages are in Listing 6.
Listing 6. Document/literal wrapped request/response SOAP messages for op2
The document/literal wrapped messages for op2 make it much more obvious that you're following rule 2.1 rather than rule 1.1. You're completely ignoring the namespace in the binding's
wsdl:soapbody.
Finally, let's compare the SOAP messages for the RPC/literal op3 (Listing 4) and the document/literal wrapped op3 (Listing 7). Like op2, the only difference is the namespace of op3. The RPC version has no namespace, but the document version does have a namespace; just like all the other document messages, it gets the namespace from the element's namespace: rule 2.1.
Listing 7. Document/literal wrapped request/response SOAP messages for op3
A comment about the default namespace
The default namespace is the one that you use to eliminate the need for a prefix. For example, in Listing 8, both e and f are in the default namespace, which is defined here as
urn:default; e is in it because the default namespace is defined on e, and f is in it because it's a child of e.
Listing 8. Example of default namespace use
Here's some advice: don't use the default namespace in instance data.
- If you use the default namespace and you take something out of context -- for example,
<f/>-- then you have no idea just by looking at it whether that element is unqualified or whether it is qualified by some ancestor.
- If you really want a child to be unqualified, then you must introduce the blank namespace to do it. For instance, in Listing 9, e is in the
urn:defaultnamespace and f is unqualified in a rather strange-looking manner.
Listing 9. Example of an unqualified name inside a default namespace
elementFormDefault="qualified"
A schema attribute that has an affect on namespaces is
elementFormDefault. The default setting for this attribute is "unqualified," which is what you've been seeing so far -- child elements are unqualified. But if you add
elementFormDefault="qualified" to all of the schemas in the document/literal wrapped WSDL, then all elements in the messages would be qualified with their parent's namespace. For example, Listing 10 contains the document/literal wrapped messages for the op3 operation from the WSDL in Listing 5 when
elementFormDefault is qualified. In general, you do not want to use
elementFormDefault="qualified" because it bloats the messages, but a year or more ago there were interoperability issues between various vendors, and setting this attribute sometimes fixed the problems.
Listing 10. Document/literal wrapped request/response SOAP messages for op1 with elementFormDefault="qualified"
Under normal circumstances, you should never worry about namespaces in the SOAP message. But there are times when you must; for example, when you have to create your SOAP message by hand. In this case, you must have a thorough understanding of how WSDL maps to SOAP. If you follow the rules presented in this tip, you should have no problem hand-writing your SOAP messages with all the proper namespaces.
- Read W3C's SOAP with Attachments specification.
- Understand what document/literal wrapped is by reading the article "Which style of WSDL should I use?" (developerWorks, October 2003).
- Read the Web Services Description Language (WSDL) 1.1, the specification of WSDL.
- Learn more about IBM and WS-I.
- Read the XML Schema Primer.
- Browse the Web Services Interoperability (WS-I) organization's Web pages.
- Java API for XML-Based RPC (JAX-RPC) Downloads & Specifications provides links to the JAX-RPC 1.1 specification.
-.
Russell Butek is an IBM Web services consultant. He was one of the developers of the IBM WebSphere Web services engine. He.
|
http://www.ibm.com/developerworks/webservices/library/ws-tip-namespace/index.html
|
crawl-003
|
en
|
refinedweb
|
#include <itkGaussianDerivativeSpatialFunction.h>
Inheritance diagram for itk::GaussianDerivativeSpatialFunction< TOutput, VImageDimension, TInput >:
GaussianDerivativeSpatialFunction implements a standard derivative of gaussian curve in N-d. m_Normalized determines whether or not the Derivative 44 of file itkGaussianDerivativeSpatialFunction.h.
|
http://www.itk.org/Doxygen16/html/classitk_1_1GaussianDerivativeSpatialFunction.html
|
crawl-003
|
en
|
refinedweb
|
Now in preview
Transparent Data Encryption (TDE) with customer managed keys for Managed Instance
Announces. TDE with BYOK support is offered in addition to TDE with service managed keys which is enabled on all new Azure SQL Databases, single databases, pools, and managed instances by default.
Transforming your data in Azure SQL Database to columnstore format
Announces. Learn why this format is valuable and how it can compress data and boost the performance of your analytical queries. This feature is currently in preview in all flavors of Azure SQL Database including logical servers, elastic pools, and Managed Instances.
Also in preview
Now generally available
Virtual Network Service Endpoints for serverless messaging and big data
Virtual Networks and Firewall rules for both Azure Event Hubs and Azure Service Bus are now generally available. This feature adds to the security and control you have over your cloud environments. Now, traffic from your virtual network to your Azure Service Bus Premium namespaces and Standard and Dedicated Azure Event Hubs namespaces can be kept secure from public Internet access and completely private on the Azure backbone network. Customers dealing with PII (Financial Services, Insurance, etc.) or looking to further secure access to their cloud visible resources will benefit the most from this feature.
Also now available
- Migrating to the Az.ApiManagement PowerShell module
- Azure Monitor for Containers agent updates
- Azure IoT Edge 1.0.5 release
- Azure Cosmos DB emulator support for Cassandra API
- Dev/test pricing for Azure SQL Database Managed Instance is now available
- Support for SQL to Azure SQL DB Managed Instance online migrations
- Premium tier now available for the Azure Database Migration Service
- SQL Data Warehouse integration with Informatica iPaaS on Azure
- Azure DevTest Labs: CIS Windows Server 2016 Benchmark L2 available in your lab
- Power BI service December update
- Power BI Desktop December Update
- Power BI Embedded new workspace experience creation API
- Power BI Embedded zero-downtime capacity scale
- Azure Resource Health monitoring for Power BI Embedded
- Power BI Embedded capacity metrics to monitor workloads
- Self-service big data prep (dataflows) available in Power BI Embedded
News and announcements
Microsoft open sources Trill to deliver insights on a trillion events a day
An internal Microsoft project, known as Trill, is for processing “a trillion events per day” is now being open sourced on GitHub to address the need to process massive amounts of data each millisecond is becoming a common business requirement. Trill started as a research project at Microsoft Research in 2012, and since then, has been extensively described in research papers.. By open-sourcing Trill, we want to offer the power of the IStreamable abstraction to all customers the same way that IEnumerable and IObservable are available. Trill powers internal applications and external services, reaching thousands of developers. A number of powerful, streaming services are already being powered by Trill, such as Bing Ads, Azure Stream Analytics, and Halo.
Conversational - AI updates December 2018
Bot Framework SDK version 4.2 is now available. The team.
Azure PowerShell ‘Az’ Module version 1.0
Az is a new Azure PowerShell module that is built to harness the power of PowerShell Core and Cloud Shell and maintain compatibility with Windows PowerShell 5.1. Az ensures that Windows PowerShell and PowerShell Core users can get the latest Azure tooling in every PowerShell on every platform. Az also simplifies and normalizes Azure PowerShell cmdlet and module names. Az is open source and ships in Azure Cloud Shell and is available from the PowerShell Gallery. The Az module version 1.0 was released on December 18, 2018, and will be updated on a two-week cadence in 2019, starting with a January 15, 2019 release.
Participate in the 16th Developer Economics Survey
The Developer Economics Q4 2018 survey is an independent survey from SlashData, an analyst firm in the developer economy that tracks global software developer trends. Every year more than 40,000 developers around the world participate in this survey, so this is a chance to be part of something big, voice your thoughts, and make your contribution to the developer community. The Developer Economics Q4 2018 survey is for all developers (professionals, hobbyists, and students) engaging in the following software development areas: web, mobile, desktop, backend services, IoT, AR/VR, machine learning and data science, and gaming.
The biggest IoT stories of 2018
As 2018 draws to a close, the IoT Team took a look back at the topics that drove the most interest and excitement here on the Azure blog—and a window into what’s coming for this technology in the near future, covering everything from smart spaces, to the intelligent edge, to open standards and interoperability. We’re seeing new ecosystems and solutions emerge that unify data and insights from multiple places to enable new possibilities. As smart cities, vehicles, buildings, spaces, energy, and more converge, the opportunities grow—and so do needs for end-to-end manageability and security. We are committed (in April, we announced our intention to invest $5 billion in IoT over the next five years) to solve these challenges with built-in connectivity, real-time performance, and security innovation at the intelligent edge.
The year in review: Hybrid applications for developers
Ricardo Mendes Principal Program Manager, Azure Stack, takes a look at the technology landscape supporting hybrid scenarios and does a retrospective of the myriad announcements throughout 2018 that enabled developers to focus more on building apps and worry less about infrastructure. This year has been amazing for developers that design, develop, and maintain cloud-based apps. Azure Stack has improved support for DevOps practices. You can use Kubernetes containers. You can use API Profiles with Azure Resource Manager and the code of your choice.
Additional news and updates
- Azure Log Analytics is available in West US 2
- Retirement of Media Hyperlapse (in preview) on March 29, 2019
- Azure Scheduler will retire on September 30, 2019
Technical content
Fine-tune natural language processing models using Azure Machine Learning service
Learn how you can fine-tune Bidirectional Encoder Representations from Transformers (BERT) easily using the Azure Machine Learning service, as well as topics such as using distributed settings and tuning hyperparameters for the corresponding dataset. In this post, you’ll see some preliminary results to demonstrate how to use Azure Machine Learning service to finetune the NLP models. After BERT is trained on a large corpus (for example, English Wikipedia), the assumption is that because the dataset is huge, the model can inherit a lot of knowledge about the English language. In addition to tuning different hyperparameters for various use cases, Azure Machine Learning service can be used to manage the entire lifecycle of these kinds of experiments. Azure Machine Learning service provides an end-to-end cloud-based machine learning environment, so customers can develop, train, test, deploy, manage, and track machine learning models All the code is available on the GitHub repository.
Anatomy of a secured MCU. Broadly, any MCU-based device belongs in one of two categories – devices that may connect to the Internet and devices designed to never connect to the Internet. Connecting an MCU-based device to the Internet is a watershed moment because any MCU can become a potential general-purpose digital weapon in the hands of an attacker. Learn how Azure Sphere-certified MCUs go beyond a typical hardware root of trust used in an MCU. This post discusses what puts the “secured” in a secured Azure Sphere MCU. Specifically, the Pluton Security Subsystem design details, as well as some other general silicon security improvements.
How to migrate from AzureRM to Az in Azure PowerShell
As noted above, the Azure PowerShell team released Az, a new cross-platform PowerShell module that will replace AzureRM. You can install this module by running Install-Module Az in an elevated PowerShell prompt. With the introduction of PowerShell Core, PowerShell is a cross-platform product. Therefore, it became a priority for Azure PowerShell to have cross-platform support. Because of the changes required to support running Azure PowerShell cross-platform, we created a new module rather than modifying the existing AzureRM module. Moving forward, all new functionality will be added to the Az module, while AzureRM will only be updated with bug fixes. In this post, you’ll learn how to migrate from AzureRM to Az in Azure PowerShell.
Top 3 free resources developers need for learning Azure
I wrote this post, which covers.
Best practices for queries used in log alerts rules
There are several "Dos and Don'ts" you can follow to make your query run faster. Yossi Yossifon, Senior Program Manager on Microsoft Azure, provides some best practices for Log alerts rules queries in Log Analytics and Application Insights. Check his post for a few tips and a link to the query best practices in the Azure documentation.
Connect Azure Data Explorer to Power BI for visual depiction of data
Azure Data Explorer (ADX) is a lightning-fast indexing and querying service helps you build near real-time and complex analytics solutions for vast amounts of data. ADX can connect to Power BI, a business analytics solution that lets you visualize your data and share the results across your organization. The various methods of connection to Power BI enable interactive analysis of organizational data such as tracking and presentation of trends. Learn the various ways to query data from Azure Data Explorer to Power BI. Additional connectors and plugins to analytics tools and services will be added in the weeks to come.
Azure shows
Episode 258 - Live from KubeCon 2018 | The Azure Podcast.
Pix2Story- Neural AI Storyteller | AI Show.
Building a Pet Detector in 30 minutes or less! | AI Show
Storytelling is at the heart of human nature and Natural Language Processing is a field that is driving a revolution in the computer-human interaction. That is why we decided to explore AI Pix2Story to see if we could teach an AI to be creative, be inspired by a picture and take it to another level.
Connect devices from other IoT clouds to Azure IoT Central | Internet of Things Show
Learn about how to connect other IoT clouds like Sigfox, Particle, and The Things Network to IoT Central with the IoT Central device bridge open-source solution. We'll talk about what the device bridge is and how it works, and demo a device connected to The Things Network use the device bridge to connect to your IoT Central app.
Running your First Docker Container in Azure | The DevOps Lab
Dam.
Introduction to Multi-Signature Wallets | Block Talk
This video provides an overview of multi-signature wallets (smart contract) along with a walkthrough of simple multi-signature wallet written in Solidity language. The topics covered in this video include adding owners to the wallet and the workflow that takes place in order to capture multiple signatures from owners before the transfer of value can be completed.
How to run an app inside a container image with Docker | Azure Tips and Tricks
Learn how to create a container based on an image, and then create a running app inside of it. Once you get set up with Docker on your local dev machine by installing the Docker desktop application for your operating system, you can easily run an app.
Chris Patterson on the Future of Azure Pipelines - Episode 015 | The Azure DevOps Podcast
Jeffrey Palermo and Chris Patterson, Principal Program Manager at Microsoft, discuss how the infrastructure of Azure Pipelines is changing, what a build will mean in the future, the goal of Azure Pipelines evolution, and more.
Customers, industries, and partners
A fintech startup pivots to Azure Cosmos DB
Fintech start-up and Microsoft partner clearTREND Research had a plan was to commercialize a financial trend engine and provide a subscription investment service to individuals and professionals. Learn how their reasons for choosing Azure Cosmos DB as the best solution that could adapt, evolve, and enable their business to innovate faster in order to turn opportunities into strategic advantages. You’ll also get some tips from the clearTREND team to consider when designing and implementing a solution with Azure Cosmos DB. The team that designed and implemented the clearTREND solution are architects and developers with Skyline Technologies.
IoT in Action: New insights for retail
For in-depth insights around the latest developments in IoT for retail, including how customer expectations are changing and how IoT investments can impact store profitability, you can register for a live IoT in Action event in New York (co-located with NRF 2019) on January 14, 2019, or sign up for our industry-specific retail webinar on January 8, 2019. You will get insights into how IoT can help you delight customers, improve the effectiveness of your associates, and increase the efficiency of your operations. You can also take a deep dive into building retail IoT solutions at our upcoming 2-day Virtual Bootcamp in late January and early February.
Azure Marketplace new offers – Volume November, we published 80 new offers.
A Cloud Guru's Azure This Week - 21 December 2018 (Christmas special!)
In this Christmas special edition of Azure This Week, Lars talks about static websites on Azure Storage now being generally available, the preview of neural network text-to-speech with Jessa and Guy, and some more serverless Azure news with Azure Functions.
|
https://azure.microsoft.com/de-de/blog/azure-source-volume-63/
|
CC-MAIN-2020-05
|
en
|
refinedweb
|
libdnet is dependency for open-vm-tools-nox11
libdnet fails to build unless PF is installed as part of base system. If you installworld minus PF (WITHOUT_PF=true), libdnet fails to find a suitable firewall (as reported), even though ipfw2 is available.
On building:
|------------------------------------------|
|No suitable firewall interface found. Most|
|probably you are not running the FreeBSD |
|OS. Please consider using this version |
|of libdnet with the FreeBSD system |
|------------------------------------------|
===> Script "configure" failed unexpectedly.
Please report the problem to onatan@gmail.com [maintainer] and attach the
"/var/build/.amd_mnt/public/FreeBSD/ports/net/libdnet/work/libdnet-1: stopped in /.amd_mnt/public/FreeBSD/ports/net/libdnet
===>>> make build failed for net/libdnet
===>>> Aborting update
===>>> You can restart from the point of failure with this command line:
portmaster <flags> net/libdnet
This command has been saved to /tmp/portmasterfail.txt
cat /tmp/portmasterfail.txt
portmaster <flags> net/libdnet
Other than having to re-build/install world with PF, is there any update or workaround for this?
build log:
configure:16687: checking for net/pfvar.h
configure:16687: cc -c -O2 -pipe -fstack-protector-strong -fno-strict-aliasing conftest.c >&5
In file included from conftest.c:49:
/usr/include/net/pfvar.h:50:10: fatal error: 'netpfil/pf/pf.h' file not found
#include <netpfil/pf/pf.h>
^~~~~~~~~~~~~~~~~
1 error generated.
|
https://bugs.freebsd.org/bugzilla/show_bug.cgi?id=239046
|
CC-MAIN-2020-05
|
en
|
refinedweb
|
I'm developing an ICN plugin with a PluginResponseFilter. The structure of my plugin looks like this:
public class FilterPlugin extends Plugin { @Override public String getId() { return "FilterPlugin"; } @Override public String getName(Locale locale) { return "Filter Plugin"; } @Override public String getVersion() { return "1.0"; } @Override public PluginResponseFilter[] getResponseFilters() { return new PluginResponseFilter[] { new Filter() }; } @Override public String getConfigurationDijitClass() { return "myCompany/ConfigurationPane"; } }
If I load this plugin in Content Navigator, it loads just fine, with the exception of an HTTP request to.
ViewerPlugin is the ID of another plugin I developed, but uninstalled a while ago. When I open I get the source code of my Dojo module. This isn't the first time I get the invalid call to the
ViewerPlugin resource, so I suspect Content Navigator cached it and used it ever since. I tried restarting Content Navigator, but that didn't change anything.
Answer by Calvin_Zhang (671) | Apr 27, 2018 at 08:16 PM
Hi,
It may be cached by the browser. Every time the javascript file changed, the browser cache may need to be cleared.
There are 2 ways to load the plugin. One is for class files and one is for jar file. For jar file loading, it needs to be loaded and saved again after change, and also need to reload the whole ICN web page. For class file mode, just need to reload the whole ICN web page and make the change effective.
But the js file and html file change still need to clear the browser cache.
Answer by jase_kross (236) | May 03, 2019 at 05:03 PM
What version of ICN is the plugin loaded into?
Do you have the ability to select individual plugins for the affected desktop? In older versions of ICN all plugins are loaded by default. If you happen to be running one of these versions it may be possible that the desktop is loading a cached ICN database reference to the plugin.
When you loaded the replacement plugin did you overwrite the old one or did you go through the steps to physically delete the plugin via the ICN Administration tool and then create a new plugin and load the jar? If you loaded the plugin over the existing plugin it would create a new plugin entry with a different id and wouldn't remove the old plugin entry from the ICN database. Thus you wouldn't see two different plugins, only the newer plugin. If this is the case you can clean it up by removing the newer plugin then reloading the old plugin before removing it again and finally adding the newer plugin.
156 people are following this question.
Why does callbacks.getP8ObjectStore() return null when called from the Admin desktop? 2 Answers
Calling ICN plugin service from other web app 1 Answer
How can you print all documents, that you get as result of a search ? 1 Answer
icn plugin how to upload file to plugin service? 2 Answers
RAD9.5 , RAD9.6 and ICN 3.0 - any plans for updated JARS? 1 Answer
|
https://developer.ibm.com/answers/questions/444942/$%7BawardType.awardUrl%7D/
|
CC-MAIN-2020-05
|
en
|
refinedweb
|
There is a method named "Monotone Chain Method" for finding convex hull of some points. It it quite easy to understand how and why it works.
We basically sort all points based on x axis. Then we find the left most points. Then we try to go clockwise as long as we can, we'll reach the right most point. These points will form upper hull. Then from the right most point, we again try to go CW and reach left most point.
Visualization:
Pseudocode:
# Given: P = list of points on a place. length(P) >= 3.# Notation:# L[-1] := last element of list L# L[-2] := second last element of list L.sort points in P by x-coordinate, break ties by y-coordinateU, L = [], [] # empty-lists. for upper, lower hulls.for i = 1, 2, ..., n:while length(U) >= 2 and (U[-2], U[-1], P[i]) != clockwise turn:remove the last point from Uappend P[i] to Ufor i = n, n-1, ..., 1:while length(L) >= 2 and (L[-2], L[-1], P[i]) != clockwise turn:remove the last point from Lappend P[i] to LRemove the last point of each list (it's the same as the first point of the other list).Concatenate U and L to obtain the convex hull of P.Points in the result will be listed in clockwise order.
Here is a sample code in C++:
ll cross (point a, point b, point c) {return (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x);}vector<point> ConvexHull(vector<point>&p, int n) {int sz = 0;vector<point> hull(n + n);sort(p.begin(), p.end());for(int i = 0; i < n; ++i) {while (sz > 1 and cross(hull[sz - 2], hull[sz - 1], p[i]) <= 0) --sz;hull[sz++] = p[i];}for(int i = n - 2, j = sz + 1; i >= 0; --i) {while (sz >= j and cross(hull[sz - 2], hull[sz - 1], p[i]) <= 0) --sz;hull[sz++] = p[i];} hull.resize(sz - 1);return hull;}
For more details, you can read this: Convex hull-Monotone chain
|
https://www.commonlounge.com/discussion/a8f953d33c4547b8863b79b18f1795cd
|
CC-MAIN-2020-05
|
en
|
refinedweb
|
OCCUtils provides
Face::FromPoints() to linearly connect a set of
gp_Pnt points and make a face from the resulting edges:
#include <occutils/Face.hxx> using namespace OCCUtils; gp_Pnt p1, p2, p3; // Your points! TopoDS_Face face = Face::FromPoints({p1, p2, p3});
Face::FromPoints() will automatically remove duplicate consecutive points and connect the last point to the first point.
Note that if there are not enough unique points (you need at least 3 unique points to make a valid face!),
Face::FromPoints() will return a
TopoDS_Face where
.IsNull() is
true.
|
https://techoverflow.net/2019/07/05/how-to-make-topods_face-from-gp_pnts/
|
CC-MAIN-2020-05
|
en
|
refinedweb
|
37809/python-convert-all-sheets-of-excel-to-csv
I am using the following with this code is that it takes data only from the first sheet and not other sheets. I have 4 sheets and want them to be converted to csv too. Please help.
You will have to parse through the sheets and then get data. Refer to the following code:)
You could try using the AST module. ...READ MORE
You can use the ast module
Ex:
import ast
s = """[{'10': ...READ MORE
XLSX tables are usually created in MS ...READ MORE
if you google it you can find. ..
Already have an account? Sign in.
|
https://www.edureka.co/community/37809/python-convert-all-sheets-of-excel-to-csv
|
CC-MAIN-2020-05
|
en
|
refinedweb
|
Author of this article has published varieties of articles in the stream of java software development. In this post, you will learn the way to create an ArrayList from an Array. Author has begun the post by defining Array and ArrayList. You will also learn the steps to convert an Array to ArrayList in this guide.
Features of an Array
- The Array, which stores a fixed-size sequential collection of elements of the same type. An array is used to store a collection of data.
- Array is static in size that is fixed length data structure, one cannot change the length after creating the Array object.
- resize() operation :Auto resize of ArrayList lowers the performance as temporary array is used by the ArrayList to copy elements from old to new array.
- add() or get() operation :Adding an element or receiving it from the ArrayList object or array is similar in performance because for ArrayList object, such operations run in regular time
- We can use for loop or for each loop to iterate through array.
- Array object has the length variable which returns the length of the array.
- In array we insert elements using the assignment operator.
- Array can be Single Dimensional and multi-dimensional array
- Array stores Primitive data types as well as Objects.
- Java is that you cannot use Generics along with Array.
- Array in java is index based; first element of the array is stored at 0 index.
- An array is an Object. So, just as you can synchronize on any Object, you can sync an array.>
Features of an ArrayList
- The ArrayList class extends AbstractList and implements the List interface.
- Java ArrayList class uses a dynamic array for storing the elements.
- Every ArrayList object contains instance variable capacity that shows the ArrayList size. ArrayList expands automatically once elements are added to it.
- resize() operation: Arraylist is supported by Array when you resize it as it uses the System.arrayCopy(src, destPos, srcPos, length, dest) method.
- Using iterator for iterating via ArrayList is another thing we can do. ArrayList class’s iterator returns these iterators and method of listiterator fails fast.
- The size() method offers the length of the ArrayList.
- We can insert elements into the arraylist object using the add () method.
- You will always find ArrayList in single dimensional. Both ArrayList and Array can have duplicate elements.
- Both can store null values and uses index to refer to their elements.<
- add () or get() operation :adding or receiving an element from the ArrayList or Array object has matched performance. These operations run in regular time.
- ArrayList allows you to use Generics to ensure type-safety. ArrayList Stores Objects and arrayList allow random access.
- ArrayList class, manipulation is slow because a lot of shifting needs to be occurred if any element is removed from the array list.
- Java ArrayList class is non-synchronized.
-> Converting an Array to ArrayList
Here we are sharing three different ways to convert Array to ArrayList.
Constructs a list containing the elements of the specified collection, in the order they are returned by the collection’s iterator.
Syntax:
ArrayList<T> arraylist= new ArrayList<T> (Arrays.asList (arrayname));
import java.util.ArrayList; import java.util.ArrayList; import java.util.Arrays; public class Example1 { public static void main(String[] args) { /* Array Declaration and initialization */ String countryNames[] = { “India”, “Russia”, “US”, “France” }; /* Array to ArrayList conversion */ ArrayList<String> countrylist = new ArrayList<String> (Arrays.asList (countryNames)); /* adding new elements to the converted List */ countrylist.add(“China”); /* Final ArrayList content display using for */ for (String str : countrylist) { System.out.println(str); } } } Output: India Russia US France China
Collections.addAll() method all the array elements to the specified collection.
It does the same as
Arrays.asList method however it is much faster than it so performance wise this is a best way to get the array converted to
ArrayList
Syntax:
Collections.addAll(arraylist, new Item(1), new Item(2), new Item(3));
public class Example2 { public static void main(String[] args) { /* Array Declaration and initialization */ String cityName[] = { “Delhi”, “Paris”, “Chicago”, “Melbourne” }; /* Array to ArrayList conversion */ ArrayList<String> citylist = new ArrayList<String>(); Collections.addAll(citylist, cityName); /* Adding new elements to the converted List */ citylist.add(“Beijing”); /* Final ArrayList content display using for */ for (String str: citylist) { System.out.println(str); } } } Output : Delhi Paris Chicago Melbourne Beijing
Method 3: Manual way of doing things
We can also add all the array’s element to the arraylist manually. Below example of manual conversion.
public class Example3 { public static void main(String[] args) { /* ArrayList declaration */ ArrayList<String> arraylist = new ArrayList<String>(); /* Initialized Array */ String array[] = { “Text1”, “Text2”, “Text3”, “Text4” }; /* array.length returns the current number of elements present in array*/ for (int i = 0; i < array.length; i++) { arraylist.add(array[i]); } /* ArrayList content */ for (String str : arraylist) { System.out.println(str); } } } Output : Text1 Text2 Text3 Text4
Java software development expert has shared this post with entire java community, programmers, and developers. The purpose of this post is to make them learn about Array and ArrayList and the ways to convert an Array to ArrayList.+
Have something to add in tutorial?? Please share in comments.
Follow us for more hacking tutorials on Facebook, Google Plus and Twitter.
|
https://buffercode.in/building-an-arraylist-from-an-array-in-java-software-development/
|
CC-MAIN-2018-13
|
en
|
refinedweb
|
In the article I’ll try to give an overview of the methods how you can enable operations with HTTP Cookies in WebDynpro applications running within the Portal.
Short digression: Cookie and WebDynpro
Questions about HTTP Cookies appear periodically when new developers begin to study WebDynpro Java and design more or less complex web-applications. If you run SDN search with the phrase like “cookies in WebDynpro” you very likely get hundreds of forum threads, blogs and articles related to the topic. In most cases tasks appearing before a developer when he/she remembers about cookies include reading some NetWeaver application server’s system properties transferred within cookies (a) or use cookies for a personalization based on users’ preferences (b).
The main conceptual problem which causes lots of questions around is the following. Most of developers threat WebDynpro as one more framework for building RIA, but in fact the framework just follows MVC pattern and doesn’t expect to be running especially in a browser environment. For example, standalone or mobile clients do not deal with HTTP, JS or Cookies. That’s why from the initial version WebDynpro have not ever officially supported Cookies and haven’t provided API for that. And that’s why questions like “how to read/write cookies?” appear again and again in WebDynpro forums.
“I know all this, but how to read/write cookies?..”
Approach 1 (not recommended): Using holes in WebDynpro API
In web-applications WebDynpro framework behaves like a wrapper oevr the standard Java Servlet request/response cycle. This makes still possible to retrieve the original servlet session objects – HTTPServletRequest & HTTPServletResponse instances, and use them for reading/writing cookies as you do in usual JSP applications. This could be achieved via such undesirable means as down-class-casting and not public API usage.
For example, the following forum thread shows the example of such code: Java webdypro : how to create /read cookie with NW 7.0 ?
Potential risks: In a next WebDynpro release your application could become not compilable or even worse, – compilable, but not working properly at runtime.
Restrictions: The solution can work in case of standalone WebDynpro web-application, but quite predictably does not work if the application running as iView in the Portal. The Portal page builder invokes WebDynpro application indirectly and the original servlet’s session simply do not reach it.
The next two methods explained below are only applicable if an application is running within the Portal. But in this case we can realize completely legal solution and avoid the mentioned risks.
WebDynpro application running within the Portal
Article Integrating Web Dynpro Java and SAP NetWeaver Portal: How to use extended features of the SAP Application Integrator explains very well how a WebDynpro application is integrated in the Portal iView. In two words, there is SAP Application Integrator which is responsible (excepting all other functions) for launching a WebDynpro application running as a WebDynpro iView. Initially the integrator is requested by a client browser and then performs a HTTP redirect to the target WebDynpro application. It computes the target WebDynpro application URL based on the settings of the launched iView. The next things that happen depend on iView type…
For NW04 WebDynpro iView (based on WebDynpro iView template) the computed URL points directly to the target WebDynpro application. The URL is finally invoked via HTTP Redirect, so it’s still possible to extract HTTP Cookie from a servlet session as described in Approach 1.
For NW04s WebDynpro iView (based on WebDynpro page builder) the computed URL points to a proxy application – WebDynpro page builder, which in turn is responsible for invoking the target application. In the case a servlet session is almost empty; extracting HTTP Cookies is not possible. That’s why Approach 1 does not work here.
Approach 2 (cookie reading): Using SAP Application Integrator + Custom Parameter Provider
The idea is proposed in forum thread Web Dynpro cookie read: Servlet workaround, but session problems… and also based on the mentioned above article. Here I’m just explain it in details.
When SAP Application Integrator computes the target WebDynpro application URL it’s possible to extend the URL with custom parameters. This allows us to put HTTP Cookies coming from the client’s request to the URL as parameters. Then the URL parameters will reach the target WebDynpro application. With the approach we can only read cookies, but we cannot send them back to the client.
Below is a short step-by-step guide how to proceed with the method. Read section “Using customer-specific parameter providers” in the article for further details.
- Enable support for customer-specific parameter providers in EP System Administration.
- Create a new Portal DC or reuse an existing one if there are any in your application development.
- Create a new Portal service which is nothing but customer-specific parameter provider. Configure it as required.
- Extend the service implementation (see the code below).
- To get it compiled at build-time you need to add a reference to classes of EP service com.sap.portal.appintegrator. By analogy the similar reference shall be added to portalapp.xml for runtime:
- Connect the implemented service to the iView: setup iView’s properties Custom Exits for ‘ParameteProvider’ and Application Parameters.
Here I’m providing the code of such a portal service which is responsible for Cookie reading. It takes the cookie from servlet’s request and returns it as URL parameter.
public class UserPrefsSrv implements ICustomerParameterProvider {
private static final String PARAM_NAME = "Cookie.UserPref";
public String getParameter(IPortalComponentRequest request, String paramName) throws Throwable {
if (PARAM_NAME.equals(paramName)) {
String cookie = readCookie(request, getUserCookieKey(request, "com.epam.xapp.UserPref"));
return (cookie != null) ? (PARAM_NAME + "=" + cookie) : null;
}
return null;
}
private String readCookie(IPortalComponentRequest request, String key) {
String value = null;
Cookie[] cookies = request.getServletRequest().getCookies();
for (int i = 0; i<cookies.length; i++) {
if (key.equals(cookies[i].getName())) {
value = cookies[i].getValue();
break;
}
}
return value;
}
public String getParameterDefault(IPortalComponentRequest request, String paramName) throws Throwable {
return null;
}
public Enumeration getAllParameterNames() {
return new StringTokenizer(PARAM_NAME);
}
private String getUserCookieKey(IPortalComponentRequest request, String baseKey) {
return baseKey + "_" + request.getUser().getLogonUid();
}
}
Approach 3 (universal): Using additional hidden iView with client JavaScript
The idea of the method is based on a small JavaScript code which is responsible for reading/writing Cookies… [Enhance your Portal WebDynpro application with HTTP Cookies, [part2]: JavaScript based solution]
Please, try the link now. The second part have been just released.
BR, Siarhei
HttpServletResponse response = (HttpServletResponse)responseObj.getProtocolResponse();
here could you please tell me why the response object is coming null
See my explanation here:
|
https://blogs.sap.com/2010/02/16/http-cookies-in-portal-webdynpro-application-part1-overview/
|
CC-MAIN-2018-13
|
en
|
refinedweb
|
NAME | SYNOPSIS | DESCRIPTION | EXAMPLES | ATTRIBUTES | SEE ALSO
cc [ flag... ] file ... -lelf [ library ... ] #include <libelf.h>Elf *elf_begin(int fildes, Elf_Cmd cmd, Elf *ref);
elf_begin(), elf_end(), elf_memory(), elf_next(), and elf_rand() work together to process Executable and Linking Format (ELF) object files, either individually or as members of archives. After obtaining an ELF descriptor from elf_begin() or elf_memory(), the program may read an existing file, update an existing file, or create a new file. fildes is an open file descriptor that elf_begin() uses for reading or writing. elf is an ELF descriptor previously returned from elf_begin(). The initial file offset (see lseek(2)) is unconstrained, and the resulting file offset is undefined.
cmd may have the following values:
When a program sets cmd to this value, elf_begin() returns a null pointer, without opening a new descriptor. ref is ignored for this command. See, elf_begin() allocates a new ELF descriptor and prepares to process the entire file. If the file being read is an archive, elf_begin() also prepares the resulting descriptor to examine the initial archive member on the next call to elf_begin(), as if the program had used elf_next() or elf_rand() to ``move'' to the initial member.
Second, if ref is a non-null descriptor associated with an archive file, elf_begin() lets a program obtain a separate ELF descriptor associated with an individual member. The program should have used elf_next() or elf_rand() to position ref appropriately (except for the initial member, which elf_begin() prepares; see the example below). In this case, fildes should be the same file descriptor used for the parent archive.
Finally, if ref is a non-null ELF descriptor that is not an archive, elf_begin() increments the number of activations for the descriptor and returns ref, without allocating a new descriptor and without changing the descriptor's read/write permissions. To terminate the descriptor for ref, the program must call elf_end() once for each activation. See the examples below for more information.
This command duplicates the actions of ELF_C_READ and additionally allows the program to update the file image (see elf_update(3ELF)). That is, using ELF_C_READ gives a read-only view of the file, while ELF_C_RDWR lets the program read and write the file. ELF_C_RDWR is not valid for archive members. If ref is non-null, it must have been created with the ELF_C_RDWR command.
If the program wishes to ignore previous file contents, presumably to create a new file, it should set cmd to this value. ref is ignored for this command.
elf_begin() ``works'' on all files (including files with zero bytes), providing it can allocate memory for its internal structures and read any necessary information from the file. Programs reading object files thus may call elf_kind(3ELF) or elf32_getehdr(3ELF) to determine the file type (only object files have an ELF header). If the file is an archive with no more members to process, or an error occurs, elf_begin() returns a null pointer. Otherwise, the return value is a non-null ELF descriptor.
Before the first call to elf_begin(), a program must call elf_version() to coordinate versions.
elf_end() is used to terminate an ELF descriptor, elf, and to deallocate data associated with the descriptor. Until the program terminates a descriptor, the data remain allocated. A null pointer is allowed as an argument, to simplify error handling. If the program wishes to write data associated with the ELF descriptor to the file, it must use elf_update() before calling elf_end().
Calling elf_end() removes one activation and returns the remaining activation count. The library does not terminate the descriptor until the activation count reaches 0. Consequently, a 0 return value indicates the ELF descriptor is no longer valid.
elf_memory() returns a pointer to an ELF descriptor, the ELF image has read operations enabled ( ELF_C_READ). image is a pointer to an image of the Elf file mapped into memory, sz is the size of the ELF image. An ELF image that is mapped in with elf_memory() may be read and modified, but the ELF image size may not be changed.
elf_next() provides sequential access to the next archive member. That is, having an ELF descriptor, elf, associated with an archive member, elf_next() prepares the containing archive to access the following member when the program calls elf_begin(). After successfully positioning an archive for the next member, elf_next() returns the value ELF_C_READ. Otherwise, the open file was not an archive, elf was NULL, or an error occurred, and the return value is ELF_C_NULL. In either case, the return value may be passed as an argument to elf_begin(), specifying the appropriate action.
elf_rand() provides random archive processing, preparing elf to access an arbitrary archive member. elf must be a descriptor for the archive itself, not a member within the archive. offset gives the byte offset from the beginning of the archive to the archive header of the desired member. See elf_getarsym(3ELF) for more information about archive member offsets. When elf_rand() works, it returns offset. Otherwise, it returns 0, because an error occurred, elf was NULL, or the file was not an archive (no archive member can have a zero offset). A program may mix random and sequential archive processing.
When processing a file, the library decides when to read or write the file, depending on the program's requests. Normally, the library assumes the file descriptor remains usable for the life of the ELF descriptor. If, however, a program must process many files simultaneously and the underlying operating system limits the number of open files, the program can use elf_cntl() to let it reuse file descriptors. After calling elf_cntl() with appropriate arguments, the program may close the file descriptor without interfering with the library.
All data associated with an ELF descriptor remain allocated until elf_end() terminates the descriptor's last activation. After the descriptors have been terminated, the storage is released; attempting to reference such data gives undefined behavior. Consequently, a program that deals with multiple input (or output) files must keep the ELF descriptors active until it finishes with them.
A prototype for reading a file appears on the next page. If the file is a simple object file, the program executes the loop one time, receiving a null descriptor in the second iteration. In this case, both elf and arf will have the same value, the activation count will be 2, and the program calls elf_end() twice to terminate the descriptor. If the file is an archive, the loop processes each archive member in turn, ignoring those that are not object files.
if (elf_version(EV_CURRENT) == EV_NONE) { /* library out of date */ /* recover from error */ } cmd = ELF_C_READ; arf = elf_begin(fildes, cmd, (Elf *)0); while ((elf = elf_begin(fildes, cmd, arf)) != 0) { if ((ehdr = elf32_getehdr(elf)) != 0) { /* process the file . . . */ } cmd = elf_next(elf); elf_end(elf); } elf_end(arf);
Alternatively, the next example illustrates random archive processing. After identifying the file as an archive, the program repeatedly processes archive members of interest. For clarity, this example omits error checking and ignores simple object files. Additionally, this fragment preserves the ELF descriptors for all archive members, because it does not call elf_end() to terminate them.
elf_version(EV_CURRENT); arf = elf_begin(fildes, ELF_C_READ, (Elf *)0); if (elf_kind(arf) != ELF_K_AR) { /* not an archive */ } /* initial processing */ /* set offset = . . . for desired member header */ while (elf_rand(arf, offset) == offset) { if ((elf = elf_begin(fildes, ELF_C_READ, arf)) == 0) break; if ((ehdr = elf32_getehdr(elf)) != 0) { /* process archive member . . . */ } /* set offset = . . . for desired member header */ }
An archive starts with a ``magic string'' that has SARMAG bytes; the initial archive member follows immediately. An application could thus provide the following function to rewind an archive (the function returns -1 for errors and 0 otherwise).
#include <ar.h> #include <libelf.h> int rewindelf(Elf *elf) { if (elf_rand(elf, (size_t)SARMAG) == SARMAG) return 0; return -1; }
The following outline shows how one might create a new ELF file. This example is simplified to show the overall flow.
elf_version(EV_CURRENT); fildes = open("path/name", O_RDWR|O_TRUNC|O_CREAT, 0666); if ((elf = elf_begin(fildes, ELF_C_WRITE, (Elf *)0)) == 0) return; ehdr = elf32_newehdr(elf); phdr = elf32_newphdr(elf, count); scn = elf_newscn(elf); shdr = elf32_getshdr(scn); data = elf_newdata(scn); elf_update(elf, ELF_C_WRITE); elf_end(elf);
Finally, the following outline shows how one might update an existing ELF file. Again, this example is simplified to show the overall flow.
elf_version(EV_CURRENT); fildes = open("path/name", O_RDWR); elf = elf_begin(fildes, ELF_C_RDWR, (Elf *)0); /* add new or delete old information */ . . . /* ensure that the memory image of the file is complete */ elf_update(elf, ELF_C_NULL); elf_update(elf, ELF_C_WRITE); /* update file */ elf_end(elf);
Notice that both file creation examples open the file with write and read permissions. On systems that support mmap(2), the library uses it to enhance performance, and mmap(2) requires a readable file descriptor. Although the library can use a write-only file descriptor, the application will not obtain the performance advantages of mmap(2).
See attributes(5) for descriptions of the following attributes:
creat(2), lseek(2), mmap(2), open(2), ar(3HEAD), elf(3ELF), elf32_getehdr(3ELF), elf_cntl(3ELF), elf_getarhdr(3ELF), elf_getarsym(3ELF), elf_getbase(3ELF), elf_getdata(3ELF), elf_getscn(3ELF), elf_kind(3ELF), elf_rawfile(3ELF), elf_update(3ELF), elf_version(3ELF), libelf(3LIB), attributes(5)
NAME | SYNOPSIS | DESCRIPTION | EXAMPLES | ATTRIBUTES | SEE ALSO
|
https://docs.oracle.com/cd/E19683-01/816-5218/6mbcj7nba/index.html
|
CC-MAIN-2018-13
|
en
|
refinedweb
|
Tech Brief
Making your Web apps more interactive is easier than you think.
It's a great concept, but
one that you probably approach with some trepidation. You might think that this requires the re-write of your ASP.NET pages with hundreds or thousands of lines of JavaScript with embedded XML. Under most circumstances you would be right, but Microsoft released a toolkit called ASP.NET AJAX (previously code-named "Atlas") that substantially eases the use of AJAX in existing ASP.NET apps.
ASP.NET AJAX can be downloaded for Visual Studio 2005 at. It's also an integrated part of Visual Studio 2008, so if you've downloaded and started using this new IDE, you're all set.
UpdatePanel Control
A key ASP.NET AJAX control is the UpdatePanel. The UpdatePanel control serves to provide existing ASP.NET pages with AJAX functionality but with no additional code. It works by specifying regions of an ASP.NET page that can be updated without refreshing the entire page. It's ideal for taking existing pages and turning them into AJAX pages.
You can use the UpdatePanel to wrap a portion of your existing ASP.NET page. The portion you choose is likely to be some data that updates frequently, and that seems slow because the entire page refreshes. The UpdatePanel control then takes what would normally be a post-back and turns it into an XML call over HTTP. If an end user clicks on a button, changes data, sorts the data grid within the bounds of the UpdatePanel, or does other things that would normally cause a full page refresh, the action is performed much faster.
The namespace for the UpdatePanel class is System.Web.UI. Controls can be added declaratively at design time or programmatically as a result of a runtime action. In addition to putting an UpdatePanel control directly on a page, you can use UpdatePanel controls inside user controls, or on master and content pages.
If the UpdateMode property of the UpdatePanel control
is set to Always, the UpdatePanel control's content is updated on every postback that originates from the page. This includes postbacks from controls that are inside other UpdatePanel controls and postbacks that are not inside UpdatePanel controls.
If the property is set to Conditional, the UpdatePanel control's content is updated as follows:
ScriptManager Control
An ASP.NET AJAX page must include one instance of the ScriptManager control, which is a server control that makes script resources available to the browser. This control registers the script for the Microsoft AJAX Library for the page. This enables client-side scripts to support features such as partial-page rendering and Web-service calls. When a page contains an UpdatePanel control, the ScriptManager control manages partial-page rendering in the browser by working with the page lifecycle to update the data inside UpdatePanel controls.
You can use multiple UpdatePanel controls to update different page regions independently. If you have multiple buttons, data input and display panels, grids, or other ASP.NET controls, you can put an UpdatePanel around each and have them operate independently of one another. When a page with multiple UpdatePanel controls is first called and rendered, all content within these controls is updated and sent to the browser. After the initial rendering, those controls are updated individually based on changes to their content.
|
https://visualstudiomagazine.com/articles/2008/01/01/key-ajax-control.aspx
|
CC-MAIN-2018-13
|
en
|
refinedweb
|
An ImportFileHandle for data. More...
#include <ImportPlugin.h>
An ImportFileHandle for data.
Base class for FlacImportFileHandle, LOFImportFileHandle, MP3ImportFileHandle, OggImportFileHandle and PCMImportFileHandle. Gives API for sound file import.
The Ogg format supports multiple logical bitstreams that can be chained within the physical bitstream. The sampling rate and number of channels can vary between these logical bitstreams. For the moment, we'll ignore all but the first logical bitstream.
Ogg also allows for an arbitrary number of channels. Luckily, so does Audacity. We'll call the first channel LeftChannel, the second RightChannel, and all others after it MonoChannel.
Definition at line 119 of file ImportPlugin.h.
Definition at line 151 of file ImportPlugin.h.
Definition at line 122 of file ImportPlugin.h.
Definition at line 128 of file ImportPlugin.h.
Definition at line 134 of file ImportPlugin.h.
References _(), Maybe< X >::create(), GetFileDescription(), mFilename, and mProgress.
Referenced by PCMImportFileHandle::Import().
Implemented in LOFImportFileHandle, and PCMImportFileHandle.
Referenced by CreateProgress().
Referenced by ImportStreamDialog::OnOk().
Definition at line 173 of file ImportPlugin.h.
Referenced by CreateProgress(), and PCMImportFileHandle::Import().
Definition at line 174 of file ImportPlugin.h.
Referenced by CreateProgress(), and PCMImportFileHandle::Import().
|
http://doxy.audacityteam.org/class_import_file_handle.html
|
CC-MAIN-2018-13
|
en
|
refinedweb
|
A BlockFile that reads and writes uncompressed data using libsndfile. More...
#include <SimpleBlockFile.h>
A BlockFile that reads and writes uncompressed data using libsndfile.
A block file that writes the audio data to an .au file and reads it back using libsndfile.
There are two ways to construct a simple block file. One is to supply data and have the constructor write the file. The other is for when the file already exists and we simply want to create the data structure to refer to it.
The block file can be cached in two ways. Caching is enabled if the preference "/Directories/CacheBlockFiles" is set, otherwise disabled. The default is to disable caching.
Read-caching: If caching is enabled, all block files will always be read-cached. Block files on disk will be read as soon as they are created and held in memory. New block files will be written to disk, but held in memory, so they are never read from disk in the current session.
Write-caching: If caching is enabled and the parameter allowDeferredWrite is enabled at the block file constructor, NEW block files are held in memory and written to disk only when WriteCacheToDisk() is called. This is used during recording to prevent disk access. After recording, WriteCacheToDisk() will be called on all block files and they will be written to disk. During normal editing, no write cache is active, that is, any block files will be written to disk instantly.
Even with write cache, auto recovery during normal editing will work as expected. However, auto recovery during recording will not work (not even manual auto recovery, because the files are never written physically to disk).
Definition at line 46 of file SimpleBlockFile.h.
Create a disk file and write summary and sample data to it.
Constructs a SimpleBlockFile based on sample data and writes it to disk.
Definition at line 101 of file SimpleBlockFile.cpp.
References SimpleBlockFileCache::active, BlockFile::CalcSummary(), SimpleBlockFileCache::format, format, GetCache(), BlockFile::GetFileName(), mCache, mFormat, BlockFile::mSummaryInfo, BlockFile::GetFileNameResult::name, SimpleBlockFileCache::needWrite, ArrayOf< X >::reinit(), SAMPLE_SIZE, SimpleBlockFileCache::sampleData, SimpleBlockFileCache::summaryData, SummaryInfo::totalSummaryBytes, FileException::Write, and WriteSimpleBlockFile().
Create the memory structure to refer to the given block file.
Construct a SimpleBlockFile memory structure that will point to an existing block file. This file must exist and be a valid block file.
Definition at line 146 of file SimpleBlockFile.cpp.
Definition at line 160 of file SimpleBlockFile.cpp.
static
Definition at line 440 of file SimpleBlockFile.cpp.
References DirManager::AssignFile(), Internat::CompatibleToDouble(), DirManager::GetProjectDataDir(), XMLValueChecker::IsGoodFileString(), XMLValueChecker::IsGoodInt(), XMLValueChecker::IsGoodString(), min(), and PLATFORM_MAX_PATH.
Referenced by DirManager::HandleXMLTag().
Create a NEW block file identical to this one.
Create a copy of this BlockFile, but using a different disk file.
Definition at line 487 of file SimpleBlockFile.cpp.
References BlockFile::mLen, BlockFile::mMax, BlockFile::mMin, and BlockFile::mRMS.
Referenced by ODDecodeBlockFile::Copy().
Reimplemented from BlockFile.
Definition at line 276 of file SimpleBlockFile.cpp.
References SimpleBlockFileCache::active, AU_SAMPLE_FORMAT_16, AU_SAMPLE_FORMAT_24, auHeader::encoding, floatSample, SimpleBlockFileCache::format, int16Sample, int24Sample, auHeader::magic, mCache, BlockFile::mFileName, BlockFile::mLen, SimpleBlockFileCache::needWrite, ReadData(), ReadSummary(), ArrayOf< X >::reinit(), SAMPLE_SIZE, SimpleBlockFileCache::sampleData, SimpleBlockFileCache::summaryData, and SwapUintEndianess().
Definition at line 596 of file SimpleBlockFile.cpp.
References GetFreeMemory(), and gPrefs.
Referenced by SimpleBlockFile().
Reimplemented from BlockFile.
Definition at line 84 of file SimpleBlockFile.h.
Reimplemented from BlockFile.
Definition at line 591 of file SimpleBlockFile.cpp.
References SimpleBlockFileCache::active, mCache, and SimpleBlockFileCache::needWrite.
Referenced by WriteCacheToDisk().
Definition at line 495 of file SimpleBlockFile.cpp.
References SimpleBlockFileCache::active, AU_SAMPLE_FORMAT_16, AU_SAMPLE_FORMAT_24, auHeader::encoding, floatSample, BlockFile::GetLength(), int16Sample, int24Sample, auHeader::magic, mCache, BlockFile::mFileName, mFormat, BlockFile::mSummaryInfo, SimpleBlockFileCache::needWrite, SAMPLE_SIZE_DISK, SwapUintEndianess(), and SummaryInfo::totalSummaryBytes.
Read the data section of the disk file.
Read the data portion of the block file using libsndfile. Convert it to the given format if it is not already.
Definition at line 395 of file SimpleBlockFile.cpp.
References SimpleBlockFileCache::active, ClearSamples(), BlockFile::CommonReadData(), CopySamples(), SimpleBlockFileCache::format, mCache, BlockFile::mFileName, min(), BlockFile::mLen, BlockFile::mSilentLog, FileException::Read, SAMPLE_SIZE, and SimpleBlockFileCache::sampleData.
Referenced by FillCache(), and ODDecodeBlockFile::ReadData().
Read the summary section of the disk file.
Read the summary section of the disk file.
Definition at line 346 of file SimpleBlockFile.cpp.
References SimpleBlockFileCache::active, Maybe< X >::create(), BlockFile::FixSummary(), mCache, BlockFile::mFileName, BlockFile::mSilentLog, BlockFile::mSummaryInfo, ArrayOf< X >::reinit(), SimpleBlockFileCache::summaryData, and SummaryInfo::totalSummaryBytes.
Referenced by FillCache(), and ODDecodeBlockFile::ReadSummary().
if the on-disk state disappeared, either recover it (if it was
Definition at line 553 of file SimpleBlockFile.cpp.
References AU_SAMPLE_FORMAT_16, auHeader::channels, auHeader::dataOffset, auHeader::dataSize, auHeader::encoding, auHeader::magic, BlockFile::mFileName, BlockFile::mLen, BlockFile::mSummaryInfo, auHeader::sampleRate, and SummaryInfo::totalSummaryBytes.
Write an XML representation of this file.
Definition at line 422 of file SimpleBlockFile.cpp.
References XMLWriter::EndTag(), BlockFile::mFileName, BlockFile::mLen, BlockFile::mMax, BlockFile::mMin, BlockFile::mRMS, XMLWriter::StartTag(), and XMLWriter::WriteAttr().
Referenced by ODDecodeBlockFile::SaveXML().
Reimplemented from BlockFile.
Definition at line 581 of file SimpleBlockFile.cpp.
References SimpleBlockFileCache::format, GetNeedWriteCacheToDisk(), mCache, BlockFile::mLen, SimpleBlockFileCache::needWrite, SimpleBlockFileCache::sampleData, SimpleBlockFileCache::summaryData, and WriteSimpleBlockFile().
Definition at line 164 of file SimpleBlockFile.cpp.
References AU_SAMPLE_FORMAT_16, AU_SAMPLE_FORMAT_24, AU_SAMPLE_FORMAT_FLOAT, BlockFile::CalcSummary(), auHeader::channels, auHeader::dataOffset, auHeader::dataSize, auHeader::encoding, floatSample, int16Sample, int24Sample, auHeader::magic, BlockFile::mFileName, BlockFile::mSummaryInfo, SAMPLE_SIZE, auHeader::sampleRate, and SummaryInfo::totalSummaryBytes.
Referenced by SimpleBlockFile(), WriteCacheToDisk(), and ODDecodeBlockFile::WriteODDecodeBlockFile().
Definition at line 95 of file SimpleBlockFile.h.
Referenced by FillCache(), GetNeedWriteCacheToDisk(), GetSpaceUsage(), ReadData(), ReadSummary(), SimpleBlockFile(), and WriteCacheToDisk().
Definition at line 98 of file SimpleBlockFile.h.
Referenced by GetSpaceUsage(), and SimpleBlockFile().
|
http://doxy.audacityteam.org/class_simple_block_file.html
|
CC-MAIN-2018-13
|
en
|
refinedweb
|
7 raco decompile: Decompiling Bytecode
The raco decompile command takes the path of a bytecode file (which usually has the file extension ".zo") or a source file with an associated bytecode file (usually created with raco make) and converts the bytecode file’s content back to an approximation of Racket code. Decompiled bytecode is mostly useful for checking the compiler’s transformation and optimization of the source program.
The raco decompile command accepts the following command-line flags:
--force —
skip modification-date comparison on the given file’s path and an associated ".zo" file (if any)
-n ‹n› or --columns ‹n› —
format output for a display with ‹n› columns starting with @ that indicates the source module. Finally, imported variables with constantness have a midfix: :c to indicate constant shape across all instantiations, :f to indicate a fixed value after initialization, :p to indicate a procedure, :P to indicate a procedure that preserves continuation marks on return, :t to indicate a structure type, :mk to indicate a structure constructor, :? to indicate a structure predicate, :ref to indicate a structure accessor, or :set! to indicate a structure mutator.. Similarly, a #%call-with-immediate-continuation-mark call is equivalent to a call-with-immediate-continuation-mark call, but avoiding a closure allocation.
A define-values form may have (begin '%%inline-variant%% expr1 expr2) for its expression, in which case expr2 is the normal result, but expr1 may be inlined for calls to the definition from other modules. Definitions of functions without an '%%inline-variant%% are never inlined across modules.
Function arguments and local bindings that are known to have a particular type have names that embed the known type. For example, an argument might have a name that starts argflonum or a local binding might have a name that starts flonum to indicate a flonum value.
A #%decode-syntax form corresponds to a syntax object.
7.1 API for Decompiling
7.2 API for Parsing Bytecode
The compiler/zo-parse module re-exports compiler/zo-structs in addition to zo-parse..3 API for Marshaling Bytecode
7.4 Bytecode Representation
The compiler/zo-structs library defines the bytecode structures that are produced by zo-parse and consumed by decompile and zo-marshal.
Warning: The compiler/zo-structs library exposes internals of the Racket bytecode abstraction. Unlike other Racket libraries, compiler/zo-structs is subject to incompatible changes across Racket versions.
7.4.1 Prefix
The max-let-depth field indicates the maximum stack depth that code creates (not counting the prefix array).
The binding-namess field provides a per-phase mapping from symbols that appear in prefix for top-level def-values forms and in top-level def-syntaxes forms. Each symbol is mapped to an identifier that will be bound (after introduction into the namespace) by the definition.
The prefix field describes top-level variables, module-level variables, and quoted syntax-objects accessed by code.
The code field contains executable code; it is normally a form, but a literal value is represented as itself..
When an element of stxs is #f, it coresponds to a syntax object that was optimized away at the last minute. The slot must not be referenced by a topsyntax form.
The src-inspector-desc field provides an inspector name that is used within syntax-object bindings. At run time, the prefix gets an inspector, and bindings that reference the same inspector name are granted access capabilities through that inspector.
7.4 (i.e., phase 0) code. The syntax-bodies list has a list of forms for each higher phase in the module body; the phases are in order starting with phase 1. The body forms use prefix, rather than any prefix in place for the module declaration itself, while members of lists in syntax-bodies have their own prefixes. After each form in body or syntax-bodies is evaluated, the stack is restored to its depth from before evaluating the form.
The unexported list contains lists of symbols for unexported definitions that can be accessed through macro expansion and that are implemented through the forms in body and syntax-bodies. Each list in unexported starts with a phase level.
The max-let-depth field indicates the maximum stack depth created by body forms (not counting the prefix array).
The dummy variable is used to access the top-level namespace.
The lang-info value specifies an optional module path that provides information about the module’s implementation language.
The internal lexical information; the syntax object should contain a vector of two elements, where the first element of the vector is a syntax object for the module’s body, which includes the outside-edge and inside-edge scopes, and the second element of the vector is a syntax object that has just the module’s inside-edge scope.
The binding-names value provides additional information to module->namespace to correlate symbol names for variables and syntax definitions to identifiers that map to those variables. A separate table of names exists for each phase, and a #t mapping for a name indicates that it is mapped but inaccessible (because the relevant scopes are inaccessible).
The flags field records certain properties of the module. The 'cross-phase flag indicates that the module body is evaluated once and the results shared across instances for all phases; such a module contains only definitions of functions, structure types, and structure type properties.
The pre-submodules field records module-declared submodules, while the post-submodules field records module*-declared submodules.
7.4.3 Expressions
The closure-map field is a vector of stack positions that are captured when evaluating the lambda form to create a closure. The closure-types field provides a corresponding list of types, but no distinction is made between normal values and boxed values; also, this information is redundant, since it can be inferred by the bindings referenced though closure-map.
When a closure captures top-level or module-level variables or
refers to a syntax-object constant, the variables and constants are
represented in the closure by capturing a prefix (in the sense
of prefix). The toplevel-map field indicates
which top-level and lifted variables are actually used by the
closure (so that variables in a prefix can be pruned by the run-time
system if they become unused) and whether any syntax objects are
used (so that the syntax objects as a group can be similarly
pruned). A #f value indicates either that no prefix is
captured or all variables and syntax objects in the prefix should be
considered used. Otherwise, numbers in the set indicate which
variables and lifted variables are used. Variables are numbered
consecutively by position in the prefix starting from
0, but the number equal to the number of non-lifted
variables corresponds to syntax objects (i.e., the number is
include if any syntax-object constant is used). Lifted variables
are numbered immediately
afterward—.
Changed in version 6.1.1.8 of package zo-lib: Added a number to toplevel-map to indicate whether any syntax object is used, shifting numbers for lifted variables up by one if any syntax object is in the prefix.
After rhs is evaluated, the stack is restored to its depth from before evaluating rhs. Note that the new slot is created before evaluating rhs.
After rhs is evaluated, the stack is restored to its depth from before evaluating rhs.
When the toplevel is an expression, if both const? and ready? are #t, then the variable definitely will be defined, its value stays constant, and the constant is effectively the same for every module instantiation. If only const? is #t, then the value is constant, but it may vary across instantiations. If only ready? is #t, then the variable definitely will be defined, but its value may change. If const? and ready? are both #f, then a check is needed to determine whether the variable is defined.
When the toplevel is the right-hand side for def-values, then const? is #f. If ready? is #t, the variable is marked as immutable after it.
Unlike the begin0 source form, the first expression in seq is never in tail position, even if it is the only expression in the list.
After rhs is evaluated, the stack is restored to its depth from before evaluating rhs.
After each of key and val is evaluated, the stack is restored to its depth from before evaluating key or val.
7.4.4 Syntax Objects
The content of wrap is typically cyclic, since it includes scopes that contain bindings that refer to scopes.
The from-inspector-desc and to-inspector-desc fields similarly should be both #f or both non-#f. They record a history of code-inspector replacements.
The bindings list indicates some bindings that are associated with the scope. Each element of the list includes a symbolic name, a list of scopes (including the enclosing one), and the binding for the combination of name and scope set. A given symbol can appear in multiple elements of bindings, but the combination of the symbol and scope set are unique within bindings and across all scopes. The mapping of a symbol and scope set to a binding is recorded with an arbitrary member of the scope set.
The bulk-bindings field lists bindings of all exports from a given module, which is an optimization over including each export in bindings. Elements of bindings take precedence over elements of bulk-bindings, and earlier elements of bulk-bindings take precedence over later elements.
If the scope represents a scope at a particular phase for a group of phase-specific scopes, mark-owner refers to the group.
Scopes within the group are instantiated at different phases on demand. The scopes field lists all of the scopes instantiated for the group, and the phase at which it is instantiated. Each element of scopes must have a multi-owner field value that refers back to the multi-scope.
path: the referenced module.
name: the referenced definition within its module.
phase: the phase of the referenced definition within its module.
nominal-path: the module that was explicitly imported into the binding context; this path can be different from path when a definition is re-exported.
nominal-export-name: the name of the binding as exported from nominal-path, which can be different from name due to renaming on export.
nominal-phase: the phase of the export from nominal-path, which can be different from phase due to re-export from a module that imports at a phase level other than 0.
import-phase: the phase of the import of nominal-path, which shifted (if non-0) the binding phase relative to the export phase from nominal-path.
inspector-desc: a name for an inspector (mapped to a specific inspector at run time) that determines access to the definition.
path: the imported module.
phase: the phase of the import module’s exports.
src-phase: the phase at which path was imported; src-phase combined with phase determines the phase of the bindings.
inspector-desc: a name for an inspector (mapped to a specific inspector at run time) that determines access to the definition.
exceptions: exports of path that are omitted from the bulk import.
prefix: a prefix, if any, applied (after exceptions) to each of the imported names.
|
https://docs.racket-lang.org/raco/decompile.html
|
CC-MAIN-2018-13
|
en
|
refinedweb
|
Odoo Help
Odoo is the world's easiest all-in-one management software. It includes hundreds of business apps:
CRM | e-Commerce | Accounting | Inventory | PoS | Project management | MRP | etc.
How to create a method that will display values from database to a selection type field?
def _sel_warehouse(self, cr, uid, context=None): obj = self.pool.get('stock.warehouse') ids = obj.search(cr, uid, []) res = obj.read(cr, uid, ids, ['id','name'], context) res = [(r['id'],r['name']) for r in res] return res
This is the closest code that I found but it lacks the flexibility of a sql query. Is there any other approach or do I have to add some line of code to get the desired output? Ex. query that I would like to use "select name from stock_location where usage = 'internal'".
About This Community
Odoo Training Center
Access to our E-learning platform and experience all Odoo Apps through learning videos, exercises and Quizz.Test it now
|
https://www.odoo.com/forum/help-1/question/how-to-create-a-method-that-will-display-values-from-database-to-a-selection-type-field-32608
|
CC-MAIN-2018-13
|
en
|
refinedweb
|
RECOMMENDED: If you have Windows errors then we strongly recommend that you download and run this (Windows) Repair Tool.
"The vulnerability is caused due to an unspecified error when using the Adobe Flash Player plug. In the recent period, the battle for the most powerful browser was involving only Internet Explorer and Firefox, a lot of users considering.
Frustrated Windows 10 users have reported the issue on an old Microsoft.
After that, the CMS said it was withholding about one-third of the data for unspecified reasons. The e-mail announcing the downtime said visitors should use Internet Explorer versions 8-10 in accessing the website, and that it is “not.
SCRIPT16389 unspecified error when loading large set of hi. – SCRIPT16389 unspecified error when loading large set of hi. unspecified error as well on a page with. IE DC no longer output error in the console as seen in.
Canon Mp480 Error 2 140 0 The New York Times – But compared with their predecessors, these are gigantic, weighty machines, nearly double the size of the old Canon BJC55. At a tallish 13.3 by 6.5 by 3.2 inches (for the HP. battery is another $90, or $140 with a very clever stand that. # # List of USB ID’s #
Version 2.0 introduces a new flyout, Internet Explorer trigger plugin and adds various tweaks. and comes with an improved sign-in error flow. FluffyApp 2.0 also re-engineers the way it uses hotkeys to follow the Windows-provided.
I have a simple calendar popup window come up when a date on the calendar is clicked. The code below works in Opera, FF and Chrome but not in IE6-8. It.
I had an unspecified error in IE8 in my jquery-1.3.2.min.js file at line:19; I dont know how to fix it because that file has lot of functions. is there any solution.
Cdf-ms Error Vista Original Title: 2/9131 (_0000000000000000.cdf-ms) error message. Unable to start or repair Windows. Error message 2/9131 (_0000000000000000.cdf-ms). What to do? Vista SP1 – error booting !! 0xc0190002 !! 328/88027 ($$_boot_pcat_ja-jp_d98fca962b0246de.cdf-ms). I cannot get this error to go away and boot my PC now. Please help!!! Troubleshooting – Guy Leech's Blog – So I resumed the process,
Open and Resolved Bugs. The open and resolved bugs for this release are accessible through the Cisco Bug Search Tool. This web-based tool provides you with access to.
1.When I click on many links to webpages, unspecified errors arise and do not let the webpages open in Internet Explorer 8. Sometimes they open if tried a second or.
C#er : IMage: JQuery, IE6, and 'Could not set the selected property. Unspecified error.'
Jan 22, 2015. Uncaught means the error was not caught in a catch statement, and. and recent versions of Internet Explorer also give simpler errors than Chrome. code for IE6, and it's notoriously unhelpful “unspecified error at line 1” :-O.
Compile Netcat on Windows using MinGW -. – I wanted a way to compile Netcat on Windows using MinGW so I could have a version without the GAPING_SECURITY_HOLE option (-e command line option).
It also provides the steps necessary to create IIS7 sites, applications, and virtual directories, and options for configuring them. If you are familiar with IIS6.
JavaScript can be a nightmare to debug: Some errors it gives can be very difficult to understand at first, and the line numbers given aren’t always helpful either.
An additional update is required before IE8 RC can be installed: without it, IE8 RC1 will balk during setup and show an error message saying "Setup cannot continue because one or more updates required to install Windows Internet.
Regression Error Term Stata
Nov 9, 2011. Browser = "IE" for Internet explorer, and App.Test. patch installed, I get an unspecified error message on the line pertaining to "CHRO".
I'm getting unspecified error when reading document.namespaces in IE8. I can't seem to reproduce the problem in a standalone page, my snippet is: function.
This page has an unspecified potential security risk. – John. – Jun 16, 2007. This page has an unspecified potential security risk. Also, it's not dependent on IE7, as I still only had IE6 running in that virtual machine. I get this error message when i sign out of yahoo messenger…plz help me. is this.
Your cache (6.5.4) and BananAlbum (5.0) with Intenret Explorer 7. Oturum aç the webserver itself, there are no problems for me. Outer Tie-rod removal Is there DOM.
Primary RC = E_FAIL (0x80004005) – Unspecified error [!] Full error info present: true. VD: error opening image file 'd:miscvpcxpsp3-ie6XP SP3 with IE6.vhd'.
Can someone please tell me how to disable Internet Explorer Script Error – says: An Error has occurred in the script on this page. Error: Unspecified error.
RECOMMENDED: Click here to fix Windows errors and improve system performance
|
http://thesecondblog.com/ie6-unspecified-error/
|
CC-MAIN-2018-13
|
en
|
refinedweb
|
Topic Listener MDB problemsKaroy Bandai Oct 19, 2009 7:56 PM
MDB doesn't seem to connect to JMS Topic, message posted by j2se client to JMS Topic doesn't seem to show in Topic stats.
Setup: WinXP, JBoss 5.1, Eclipse Galileo, JDK 1.6.
JBoss setup seems to be functioning, as an EJB app has deployed and was tested just fine.
@MessageDriven(activationConfig = {
@ActivationConfigProperty(
propertyName = "destinationType",
propertyValue = "javax.jms.Topic") },
mappedName = "JMSTopic1",
name="TopicMDB1")
public class TopicMDB1 implements MessageDrivenBean, MessageListener {...}
Using Eclipse JEE plugin, the MDB is added to an EAR proj, which is then "deployed" {Run} on JBoss.
The deployment seems to conclude without errors, but there are no signs of the bean anywhere.
A j2se test client puts a simple text msg to the Topic, but there's no sign of that msg either in the JMS system, nor is it being consumed by anybody {obviously}.
I am a noob to JBoss, but have done this in Weblogic many times, if that counts for anything.
Any suggestions would be welcome.
karoy
1. Re: Topic Listener MDB problemsKaroy Bandai Oct 19, 2009 8:27 PM (in response to Karoy Bandai)
By this bit:
"I" wrote:I meant that while the server console log shows all kinds of stuff being done, as the JSM tracing is turned on, using these instructions:.
...there's no sign of that msg either in the JMS system...
I just don't see it the Topic's statistics that a message passed through or something.
2. Re: Topic Listener MDB problemsYong Hao Gao Oct 19, 2009 10:44 PM (in response to Karoy Bandai)
Hi,
It seems like a MDB config issue, can you post the question to EJB team? Also JBM has some good examples for users to get started. You can download them from JBoss.org. Especially there is an example ejb3mdb that may be of some interest to you.
Howard
3. Re: Topic Listener MDB problemsKaroy Bandai Oct 20, 2009 2:20 PM (in response to Karoy Bandai)
So, indeed, the fix seems to have been related to a missing Activation Property: @ActivationConfigProperty(propertyName = "destination", propertyValue = "JMSTopic1").
This is kinda strange, since the setting mappedName, already names the Topic.
The bean wasn't deploying properly, but the error was swallowed until the JBoss log4j settings were set to TRACE, which ended up spelling out the details.
|
https://developer.jboss.org/thread/129709
|
CC-MAIN-2018-13
|
en
|
refinedweb
|
With this post, I’m starting a new series on how to use custom patterns in UI Automation. Custom patterns (and custom properties and events) are a new feature of UI Automation added in Windows 7, and I thought it would be interesting to build on my previous samples to show how to use this new feature. The samples for this post are here.
The MSDN page for custom patterns is quite good and is a useful reference to go along with this introduction.
These posts are going to cover a few different topics, weaving in and out of each other:
- What are custom patterns in UI Automation?
- Why would you use them?
- What work does UIA do and what do you have to do to use custom patterns?
- What extra work do you need to do to use them in managed code?
To answer the second question, I’m going to pose an example. In the earlier series on building your own UIA provider, I built a state indicator, similar to a traffic light, that showed red, yellow and green states. My control has UI Automation properties like Name, Automation ID, and Value. The Value is “red”, “yellow”, or “green.” Suppose I wanted to expose some other information from my control that doesn’t fit nicely into UI Automation’s categories? For example, suppose I wanted a string called ReadyState that would be “ready” for green and not ready for the other states? Or suppose my control had some interesting internal state, like the number of times it had been clicked during the current run? There’s no UI Automation property to answer that question, so I’m stuck. Those two examples are focused on test automation, but there are Accessibility examples, too: If I had an object that represented an equation, how would I add a property to query the underlying math syntax (say, in MathML) for the equation? You wouldn’t. Try as we might, my team cannot invent every possible UI Automation property. We created the custom patterns and properties mechanism to allow developers to invent their own.
Now I can get back to the first question: what are custom patterns and properties in UI Automation? They are a set of patterns and properties that a client and a provider register with UI Automation so that they can communicate with each other. In a sense, they are like an IDL file or a network protocol: both sides need to agree on the interface or protocol before they can communicate with each other.
In the case of a custom property – and that’s going to be my focus for the rest of this post – the client and the provider need to agree on:
- A unique ID (GUID) to identify the property
- The property’s type: integer, string, bool, double, and UIA element are the main ones
Let’s start looking at our sample, which implements a ReadyState property, as I sketched above. We’ll start with the client. First, the client has to register the property with the UIA Registrar:
// Get our pointer to the registrar Interop.UIAutomationCore.IUIAutomationRegistrar registrar = new Interop.UIAutomationCore.CUIAutomationRegistrarClass(); // Set up the property struct UIAutomationPropertyInfo propertyInfo = ReadyStateProperty.Data; // Register it int propertyId; registrar.RegisterProperty( ref propertyInfo, out propertyId);
The UIAutomationPropertyInfo struct is populated in other code, but it just has the property GUID, type, and programmatic name. Once I register the property, I get back an integer property ID. Now I can add code to GetPropertyValue to respond to that property ID:
public override object GetPropertyValue(int propertyId) { if (propertyId == ReadyStateSchema.GetInstance().ReadyStateProperty.PropertyId) { return (this.control.Value == TriColorValue.Green) ? "Ready" : "Not Ready"; } return base.GetPropertyValue(propertyId); }
And that’s it – my provider work is done. That was easy. Now I can show a screenshot of the Inspect tool, like I usually do – right? Well, no, I can’t. Remember, both the provider and the client need to know about a custom property, and Inspect doesn’t know abut it. In order to consume my new property, I’ll need another client.
This gave me a reason to do something for these samples that I wanted to do for a long time: add unit tests. I’m a huge fan of unit tests. I’m accustomed to using the testing framework that we use in the Windows organization, but I can’t use that for samples, so I used the Visual Studio 2008 testing framework instead, in the Microsoft.VisualStudio.TestTools.UnitTesting namespace. My unit tests needed some functionality that was important, but not vital to this post: it needs to run the UiaControls.exe sample, find the window, and find the custom provider. You can look at the sample to see how this works; it’s not hard. Once I have that, my unit test for the custom property looks like this:
UIAControls.ReadyStateSchema.GetInstance().Register();
...
[TestMethod] public void TestReadyStateProperty() { // Query our custom property object readyStateValue = this.customElement.GetCurrentPropertyValue(
UIAControls.ReadyStateSchema.GetInstance().ReadyStateProperty.PropertyId); Assert.IsInstanceOfType(readyStateValue, typeof(string)); // By default, UIAControls.exe launches in not-ready state Assert.AreEqual("Not Ready", (string)readyStateValue); }
I can use my custom property just like any other UIA property: I pass its property ID to GetCurrentPropertyValue() and get the property back. I validate that it is a string, and more specifically the string I was expecting.
The ReadyStateSchema class is a singleton that encapsulates all of the data about the ReadyState property. UIA doesn’t require this – you can keep the data wherever you want. But since you only need to register a property once, it feels like a Singleton pattern, and it seems clean to keep the custom property’s GUID, type, and assigned property ID in one place. The schema is a bit heavyweight for one property, but when we have a whole pattern, it will be a good fit.
If you are working in native code, that’s pretty much it. The native code syntax is pretty similar to managed code, and you’ll need just about the number of lines of code I’ve shown here. I don’t have a published sample for this in native code, but the translation is easy, and there are good samples up already at the MSDN page on custom pattern registration.
For managed code, unfortunately, it takes a lot of work to make this all happen. I wrote this sample to make this easier, by creating a working body of code to borrow from. This part of UIA was just not written with managed-code interoperability in mind. I had fun taking on the challenge, but I imagine others might not – hence the sample. To summarize what I needed to do:
- Customize the interop IL for UIAutomationCore.tlb to fix some parameters that were imported as “ref int” that should have been IntPtr. (CustomizeUiaInterop project)
- Add custom project steps to disassemble the interop DLL, run the customizer, and re-assemble it. (UiaCoreInterop project)
- Create a number of helper classes to assist with creating the native UIAutomation structures that are used to register custom properties and patterns. (CustomPatternHelpers.cs)
There were a few more things for custom patterns, but I’ll get to those in a later post. This was sufficient for custom properties, which actually cover a lot of scenarios, as long as you don’t need custom verbs/actions/manipulations for your UI. If you do, you’ll need custom patterns, which I’ll cover in a later post.
In the meantime, if you run the sample, you can see the TestReadyStateProperty test passing, demonstrating how to declare and use a custom property in UI Automation.
Superb post. But i can't download the samples. Can you please update here the proper download URL?
Sorry, the samples accompanying this series of posts are no longer available.
Really Great.
Could you please help me , i am stuck in a sitution which i have described below.
I am working in a WPF application.
————————————
In My Application, I have a Xaml file, which contain one “FlowDocumentScrollViewer control”.
In code behind (.cs file) file, I have created a table with two columns and four rows.
Then I added this table to my control (FlowDocumentScrollViewer) flowdocument property.
(for example: FlowDocumentScrollViewer.Document = table;)
When I start run my application below screen pops up:
(Application screenshot: 01)
()
……………………………………………………………………………………………………………………….
I have created a CodeUI test project to test and validate my flowdocument
—————————————————————-
I have to do automation on this screen by CodedUI framework and I am new here.
When I start “Coded UI Test Builder” for my FlowDocumentScrollViewer to record it and to automate it, I have found no help at all. it gives me a simple “Document” control.
I need to validate table (FlowDocumentScrollViewer.Document property) in my CodedUI test project.
When I drag CodedUI Test Builder crosshair icon to my FlowDocumentScrollViewer control, it got highlighted by Blue rectangle.
I don’t know how can I get table out from FlowDocumentScrollViewer.Document property in my coded UI test project to access/automate it for data validation test.
Please find below CodedUI test builder properties:
(Application screenshot: 02)
()
What should I do to access my table in test project, to verify data?
Please help me…. I am stuck here
|
https://blogs.msdn.microsoft.com/winuiautomation/2010/12/07/uia-custom-patterns-part-1/
|
CC-MAIN-2016-50
|
en
|
refinedweb
|
Java.lang.Runtime.exec() Method
Description
The java.lang.Runtime.exec(String[] cmdarray, String[] envp, File dir) method.
Declaration
Following is the declaration for java.lang.Runtime.exec() method
public Process exec(String[] cmdarray, String[] envp, File dir)
Parameters
cmdarray -- array containing the command to call and its arguments.
envp -- array of strings, each element of which has environment variable settings in the format name=value, or null if the subprocess should inherit the environment of the current process.
dir -- the working directory of the subprocess, or null if the subprocess should inherit the working directory of the current process.
Return Value
This method returns a new Process object for managing the subprocess
Exception
SecurityException -- If a security manager exists and its checkExec method doesn't allow creation of the subprocess
IOException -- If an I/O error occurs
NullPointerException -- If command is null
IndexOutOfBoundsException -- If cmdarray is an empty array (has length 0)
Example
This example requires a file named test.txt in our C:/ folder with the following contents:
Hello
The following example shows the usage of lang.Runtime.exec() method.
package com.tutorialspoint; import java.io.File; public class RuntimeDemo { public static void main(String[] args) { try { // create a new array of 2 strings String[] cmdArray = new String[2]; // first argument is the program we want to open cmdArray[0] = "notepad.exe"; // second argument is a txt file we want to open with notepad cmdArray[1] = "test.txt"; // print a message System.out.println("Executing notepad.exe and opening test.txt"); // create a file which contains the directory of the file needed File dir = new File("c:/"); // create a process and execute cmdArray and currect environment Process process = Runtime.getRuntime().exec(cmdArray, null, dir); // print another message System.out.println("test.txt should now open."); } catch (Exception ex) { ex.printStackTrace(); } } }
Let us compile and run the above program, this will produce the following result:
Executing notepad.exe and opening test.txt test.txt should now open.
|
http://www.tutorialspoint.com/java/lang/runtime_exec_dir.htm
|
CC-MAIN-2016-50
|
en
|
refinedweb
|
Content-type: text/html
curs_scanw, scanw, wscanw, mvscanw, mvwscanw, vw_scanw, vwscanw - Convert formatted input from a Curses window
#include <curses.h>
int scanw( char *fmt[, arg]... ); int wscanw( WINDOW *win, char *fmt[, arg]... ); int mvscanw( int y, int x, char *fmt[, arg]... ); int mvwscanw( WINDOW *win, int y, int x, char *fmt[, arg]... ); include <stdarg.h> include <curses.h>
int vw_scanw( WINDOW *win, char *fmt, va_list varglist ); include <varargs.h> include <curses.h>
int vwscanw(
WINDOW *win,
char *fmt,
va_list varglist
);
Curses Library (libcurses)
Interfaces documented on this reference page conform to industry standards as follows:
scanw, wscanw, mvscanw, mvwscanw, vw_scanw, vwscanw: XPG4-UNIX
Refer to the
standards(5)
reference page for more information
about industry standards and associated tags.
The scanw, wscanw, and mvscanw routines correspond to scanf (see fscanf(3)). The effect of these routines is as though wgetstr were called on the window, and the resulting line were used as input for the scan. Fields that do not map to a variable in the fmt field are lost.
The vw_scanw routine is similar to vwprintw in that it uses a variable argument list. The third argument is va_list, a pointer to a list of arguments, as defined in <stdarg.h>.
The
vwscanw
routine is equivalent to
vw_scanw
except that
va_list
is defined in
<varargs.h>. Use of
vw_scanw
is recommended for
new applications.
The header file
<curses.h>
automatically
includes the header file
<stdio.h>.
These routines return
ERR
on failure and
OK
upon successful completion.
Functions: curses(3), curs_getstr(3), curs_printw(3), fscanf(3)
Others: standards(5)
|
http://backdrift.org/man/tru64/man3/mvwscanw.3.html
|
CC-MAIN-2016-50
|
en
|
refinedweb
|
How to use the Service Bus WCF Relay with .NET
This article describes how to use the Service Bus relay service. The samples are written in C# and use the Windows Communication Foundation (WCF) API with extensions contained in the Service Bus assembly. For more information about the Service Bus relay, see the Service Bus relayed messaging overview.
Note
To complete this tutorial, you need an Azure account. You can activate your MSDN subscriber benefits or sign up for a free account.
What is the requiring intrusive changes to a corporate network infrastructure.
The Service Bus relay enables enables you to securely control who can access these services at a fine-grained level. It provides a powerful and secure way to expose application functionality and data from your existing enterprise solutions and take advantage of it from the cloud.
This article demonstrates how to use the Service Bus relay to create a WCF web service, exposed using a TCP channel binding, that implements a secure conversation between two parties.
Create a service namespace
To begin using the Service Bus relay in Azure, you must first create a namespace. A namespace provides a scoping container for addressing Service Bus resources within your application.
To create a service namespace:
- Log on to the Azure portal.
- In the left navigation pane of the portal, click New,
- In the list of namespaces, click the newly created namespace name.
- In the namespace blade, click Shared access policies.
In the Shared access policies blade, click RootManageSharedAccessKey.
In the Policy: RootManageSharedAccessKey blade, click the copy button next to Connection string–primary key, to copy the connection string to your clipboard for later use. Paste this value into Notepad or some other temporary location.
Get the Service Bus NuGet package
The Service Bus NuGet package is the easiest way to get the Service Bus API and to configure your application with all of the Service Bus dependencies. To install the NuGet package in your project, do the following:
- In Solution Explorer, right-click References, then click Manage NuGet Packages.
Search for "Service Bus" and select the Microsoft Azure Service Bus item. Click Install to complete the installation, then close the following dialog box:
Use Service Bus to expose and consume a SOAP web service with TCP these steps, complete the following procedure to set up your environment:
- Within Visual Studio, create a console application that contains two projects, "Client" and "Service", within the solution.
- Add the Microsoft Azure Service Bus NuGet package to both projects. This package adds all the necessary assembly references to your projects.
How to create the service
First, create the service itself. Any WCF service consists of at least three distinct parts:
- Definition of a contract that describes what messages are exchanged and what operations are to be invoked.
- Implementation of said contract.
- Host that hosts the WCF service and exposes several endpoints.; } }
Configure a service host programmatically into the
Main function of the Service application, you will have a functional service. If you want your service to listen exclusively on Service Bus, remove the local endpoint declaration.
Configure a service host in the App.config file
You can also configure the host using the App.config file. The service hosting code in this case appears in the next example.
ServiceHost sh = new ServiceHost(typeof(ProblemSolver)); sh.Open(); Console.WriteLine("Press ENTER to close"); Console.ReadLine(); sh.Close();
The endpoint definitions move into the App.config file. The NuGet package has already added a range of definitions to the App.config file, which are the required configuration extensions for Service Bus. The following example, which is the exact equivalent of the previous code, should appear directly beneath the system.serviceModel element. This code example.
Create the client
Configure a client programmatically following example calls the service and prints 9. You can run the client and server on different machines, even across networks, and the communication will still work. The client code can also run in the cloud or locally.
Configure a client in the App.config file
The following code shows how to configure the client using the App.config file.
var cf = new ChannelFactory<IProblemSolverChannel>("solver"); using (var ch = cf.CreateChannel()) { Console.WriteLine(ch.AddNumbers(4, 5)); }
The endpoint definitions move into the App.config file. The following example,> >
Next steps
Now that you've learned the basics of the Service Bus relay service, follow these links to learn more.
- Service Bus relayed messaging overview
- Azure Service Bus architectural overview
- Download Service Bus samples from Azure samples or see the overview of Service Bus samples.
|
https://docs.microsoft.com/en-us/azure/service-bus-relay/service-bus-dotnet-how-to-use-relay
|
CC-MAIN-2016-50
|
en
|
refinedweb
|
The left hemisphere also reads prose passages with greater decoding accuracy, more fluency, and fewer errors potions violate the semantic and syntactic struc- ture of the sentence. In R. This led to the formulation by Wills of downward comparison theory, parents, churches and synagogues, hospitals, alternative health providers, and the busi- ness community is necessary to mange issues that may arise, including political groups that may perceive Health Promotion in Schools 163 Page 1013 s0040 health promotion as too radical.
Res. He found foods disgusting in their grayish, dead appearance, and he had to close his eyes to eat. Unemployment arises for frictional, structural, and cyclical reasons. 5 52. A coach demonstrates a basketball shot to a player. (1996). Just as your body is sym- metrical, having two arms and two legs, negative;inhibition of carcinogenesis. Journal of Personality, 69, 9791006. 76°.
If we had taken s to be a complex variable, the same calculation, with Re(s) 0, would have given L(1) 1s. This methodproducesthickerpaintsthatare hardertoapply,anditisnotyetknownif suchpaintsarelonglasting.
Cambridge, E. Page 73 Page 74 Assays of Recombinant AC in Sf9 Cells 77 6 Assays of Recombinant Adenylyl Cyclases Expressed in Sf9 Binary options safe brokers Ronald Taussig Summary This chapter outlines procedures for the expression of mammalian membrane- bound adenylyl cyclases (AC) in Sf9 cells and subsequent in vitro methods for assessing the activity of these cyclases.
Kirk in 1963. 5) a-~-~- Graham Binary options safe brokers and his colleagues correlated the asymmetry in the course of the Sylvian (lateral) fissure, as revealed by ca- rotid angiogram, credit binary option the results of carotid so- dium amobarbital speech testing (see Binaryoptionsexperts com 11).
The model also asserts that the current social context and past binar y circum- stances experienced as members of earlier born cohorts must be considered when conceptualizing psychother- apy with older adults. Arthur, M. Since the particle is in free binary options safe brokers, there is no boundary condition on the state function; the velocity or linear momentum of the particle can have any value and is a continuous eigen value of borkers operator px.
They occupy themselves Binary options trading room with the toys and equipment available because these bore them and can binary options brokers switzerland used in only a limited number of ways. Terrault. Psychiatry, respectively. These regions project to the hip- pocampus, binary options safe brokers so conventional surgeries and many forms of brain injury that affect the hippocampus may also damage the rhinal cortex or the pathways from the rhinal cortex to the hippocampus.
One of the most consistent and well-researched relationships regarding the effects of binary options safe brokers for chroni- cally or terminally ill binary options resources is the increased risk of depression. Clin. Cohen, S. (1998). However, if the flux tubes con- tain finite-pressure plasma and the volumes of the two flux tubes differ, then the inter- change will result in compression of the plasma in the flux tube which initially had the larger volume and expansion of plasma in the flux tube which initially had the optins volume.
The forensic psychologist can demonstrate both kinds of expertise by submitting a professional resume (a curriculum vitae) when requested by the lawyers or the judge and by displaying profes- sional credentials, such as degree, licensure, and board certification, on the letterhead used for the report. These findings suggested that binary options for us citizens in resources for LGBT youth have the potential to diminish negative psychological outcomes.
Stuttman,1983.306580590, 1982. Daffner, R. (1998). Third, which is by definition the ratio of the complex amplitude of the induced macroscopic polarization to the Maxwell field in binary options trading optionsxpress medium Ez PzðtÞ 14 zzð!0ÞE~zei!0t þ zzð!0ÞE~zei!0t (1138) From (11. Strauss.
The concentrations of the lipids can be varied, but usually 50 μM PIP2 opitons used as the final concentration options trading vs binary options each reaction. Delusion is another example showing the optiьns of intuition american binary option the diagnostics of schizophrenia, however, are mentioned.
Speaking machine of Wolfgang Von Kempelen, 31, 33, 37 priscol, 41 50-propyl methylphosphonofluorid- ate, 92 physostigmine (neostigmine), 61, Binary options safe brokers Prostigmine, see neostigmine protection against benzoylcholine, 199 against fluoroacetate poisoning, 144 of cholinesterase against D.Zimbardo, P.
Optinos Clin. 1135. Nonetheless, evidence is accumulating to support the conclusion that the binary options safe brokers hemisphere is specialized for the processing of species-specific calls. 8, 4 mL glycerol, 0. Cancer Res. 9741984203, EPiddmgton, R.
The deficit is unlikely bbrokers have been one of simple memory, although there is still no widely accepted explanation. Psychiatry, Barkley indicated that young adults with ADHD had sexual intercourse at an earlier age, more sexual partners, and higher rates of pregnancy.
132) σ σ qσB2 binary options chart analysis B2 dt where JB,Jc, Jp are currents due binary option european gradB, so that they must make more decisions on their own. As seen from the example, vol. Add(item8 new Binary options safe brokers edit. People probably have experienced conflict in their relationships with acquaintances, friends, family members, spouses, and lovers as well as in their professional or more formal relationships.
Hirsch, no culture, certainly; but equally, and more significantly, without culture, no men. Morgan, a double standard binary stock market still frequently reported.
All rights reserved. Thus, the amount of helicity added binary options m5 charts each layer of optons is dK 2Φ ψdΦ (11. Out. For example, here is the same set of classes structured for Java class Foundation { Best binary option brokers canada. Language and Communication Style 9.
Schizophr Res. 10 Structure of EBV DNA episome indicating patterns of gene transcription during latency in cells of Burkitts lymphoma. These output points make up the codebook of the vector quantizer, and we will be looking at codebook design in some detail later in this chapter. (Added by Java 2, version 1. (2003). Lee, E. (A) The visual system is intact. Perhaps this is unsurprising given the recent origins of these treatments. There are, however, findings showing that under specific conditions the weaker member of the group tries hard to match the performance level of binar y stronger member (the Regulated binary options brokers uk ̈hler effect).
2 Organizational psychol- ogy (Vol. Binar. (2002). Caminiti, and J. For ex- ample, Zatorre found that patients with right temporal lobectomies that include the primary auditory cortex are impaired at making pitch discriminations when the binnary is absent but normal at making such discriminations when the fundamental is present.
This ratio is called the peak-signal-to-noise-ratio (PSNR) and is binary options safe brokers by 2 xpeak PSNR(dB) 1OioglO-2- (8. Life events. Have the ideal of fitting-in rather than shining. New York Routledge.
Syzmanski. (1994) Ribozyme-mediated re- versal binary options safe brokers the multidrug-resistant phenotype.L. Proc. ; applet code"MultiLine" binary options trading guide pdf height100 applet public class MultiLine extends Applet { int curX0, curY0; current position public void init() { Font f new Font("SansSerif".
Assess- ment center work at that binary option platform reviews, pilot selection and error, naval officer selection and training, and binary options safe brokers ergonomic studies.
Nature Environments been associated with improvement in behavior. However, most studies of this model have not examined generalization. Cold binary options safe brokers waves in a magnetized plasma and again two distinct binnary appear. By any criterion, how- ever, the practices of literacy instruction are quite distant from this base.
School- to-work programs that combine vocational counseling with on-the-job experience are successful ways in which to increase a sense list of binary option broker academic competence while connecting to students current self-concepts and needs. Ayman, choice, and commitment.
Brokersthe considerations described previously regarding adjudicative competence are relevant here, with a particular substantive focus on the purpose (retri- bution) and nature (loss of life) of capital punishment. 46) shows that there is binary options safe brokers appreciable change in the population difference only when the intensity of the incident radiation is not negligible compared with the saturation parameter.
Binary options keytrade x 0. THE CONTRIBUTION OF EMOTIONAL INTELLIGENCE TO HEALTH, WORK, AND EDUCATIONAL ADJUSTMENT Although there is some controversy about how much EI contributes to asfe, work.
FEBS Lett 325, M. 188203255, it is difficult option s accurately assess the time a witness had to view the perpetrator in situ, as studies have shown best free binary options signals witnesses post hoc recollection of time estimates can be very inaccurate.
It is customary, in our culture, to start with CNLs, if the patient is young, fit and can tolerate some side effects; otherwise, we can start with NAPs. A dissociation of right and left hemispheric effects for recognizing emotional tone and verbal content. When an instance variable is declared as transient, 37). Symptoms of a crisis-transition A optiьns theory study. Nestler, and B. Binary options safe brokers, 300143149, 376407.
NIO Fundamentals. In some binary options safe brokers stances, however, it has been possible to transplant neoplasms that have not been shown to be behavioristically malignant in the original binary options safe brokers host. Cohler, call binary options safe brokers ). Van de Vijver, F. Psychiatry Res. Streak for single colonies brrokers incubate the plate overnight at 37°C.. The attack binary options safe brokers be so sudden that the fall re- sults in injury, particularly because the loss of muscle tone and of reflexes pre- vents an affected person from making any motion that would break the fall.
In J. Meltzer J. Sully, J. Feusner, cued by an aurally presented word such as tree. For example, academic researchers empha- size the importance of research and publication. Binary options safe brokers finding of temporally graded retrograde amnesia in association with damage to the medial temporal lobe reveals that this brain region plays a critical role in the establishment of memory and also suggests a subse- quent slow transfer of memory to other brain regions.
Through repetition, skills and habits that are important for activities of daily living or occupation can be taught. Moreover, the developmental significance of youth employment varies for each individual depending on the individuals characteristics, intensity of the work experience, and Encyclopedia of Applied Psychology, VOLUME 3 family, community, economic, and cultural contexts within which the youths work is occurring.
22). We have already noted the changes spontaneously occur- ring in SHE cells transformed with chemical carcinogens or ionizing radiation (Table 14. 2, 4. 2 TheGalerkinmethod. 17 do binary options safe brokers satisfy the hypothesis of the theorem. Lets begin by reviewing the purpose and effect of a C destructor and binary options brokers in cyprus Java finalize( ) method.
(Adapted from Herman et al. Similarly, if amphetamine is injected into the cerebrospinal fluid, thereby bypassing both the stomach and the blood.
And Gendler. Question repetition, both within and across inter- views, has been especially controversial. (Adapted from Landowski et al.1982). 73) is binary option trading training the time derivative demo trading account for binary options the kinetic energy δT ̇. Bebbington P, E.
I Effects of the treatment phase. 6, you binary options cyprus regulation see binary options guide location of the two tracts-the one that crosses and the one that remains uncrossed-on each side.Binary option trading free account
|
http://newtimepromo.ru/binary-options-safe-brokers-17.html
|
CC-MAIN-2016-50
|
en
|
refinedweb
|
I'm taking a course in Java and we haven't officially learned if statements yet. I was studying and saw this question:
Write a method called pay that accepts two parameters: a real number for a TA's salary, and an integer for the number hours the TA worked this week. The method should return how much money to pay the TA. For example, the call pay(5.50, 6) should return 33.0. The TA should receive "overtime" pay of 1.5 times the normal salary for any hours above 8. For example, the call pay(4.00, 11) should return (4.00 * 8) + (6.00 * 3) or 50.0.
public static double pay (double salary, int hours) {
double pay = 0;
for (int i = hours; i > 8; i --) {
pay += (salary * 1.5);
}
}
To avoid direct use of flow control statements like
if or
while you can use
Math.min and
Math.max. For this particular problem using a loop would not be efficient either.
They may technically use an if statements or the equivalent, but so do a lot of your other standard library calls you already make:
public static double pay (double salary, int hours) { int hoursWorkedRegularTime = Math.min(8, hours); int hoursWorkedOverTime = Math.max(0, hours - 8); return (hoursWorkedRegularTime * salary) + (hoursWorkedOverTime * (salary * 1.5)); }
|
https://codedump.io/share/crAnLqKV3v2T/1/writing-java-method-called-pay
|
CC-MAIN-2016-50
|
en
|
refinedweb
|
Details
Description
The following test fails on Harmony.
(With thanks to)
import java.util.IdentityHashMap;
import java.util.Set;
import java.util.Map.Entry;
import junit.framework.TestCase;
public class IHMTest extends TestCase {
public void testEntrySet(){ IdentityHashMap<String, String> ihm = new IdentityHashMap<String, String>(); String key = "key"; String value = "value"; ihm.put(key, value); Set<Entry<String, String>> set = ihm.entrySet(); assertEquals(1, set.size()); Entry<String, String> entry = set.iterator().next(); String newValue = "newvalue"; entry.setValue(newValue); assertSame(newValue, ihm.get(key)); }
}
Activity
- All
- Work Log
- History
- Activity
- Transitions
FYI, this bug is the reason why recent Maven3 release candidates fail on IBM JDKs, so it would be good to know if this will be fixed in the near term.
In the meantime we'll attempt to workaround this bug, but I'm really surprised this fundamentally broken behavior has remained unfixed for so long.
Hi Tim,
I make a new patch for this problem. It passes the tests, would you please help to review it?
Would anyone like to help to review the
HARMONY-6419v2.diff patch ? Thank you very much
Thanks Kevin. Patch applied to LUNI module, along with a testcase, at repo revision r1043880.
Please verify it was applied as you expected.
Integrated in Harmony-1.5-head-linux-x86_64 #1024 (See)
Integrated in Harmony-select-1.5-head-linux-x86_64 #166 (See)
A simple fix is to store a reference to the IdentityHashMap in the IdentityHashMapEntry and override the MapEntry.setValue method to additionally put the new value in the hash map.
|
https://issues.apache.org/jira/browse/HARMONY-6419?attachmentOrder=desc
|
CC-MAIN-2016-50
|
en
|
refinedweb
|
NAME | SYNOPSIS | INTERFACE LEVEL | PARAMETERS | DESCRIPTION | RETURN VALUES | CONTEXT | SEE ALSO | NOTES
#include <sys/ddi.h> #include <sys/sunddi.h);
Solaris DDI specific (Solaris DDI).
The DMA handle previously allocated by a call to ddi_dma_alloc_handle(9F).
A pointer to an address space structure. This parameter should be set to NULL, which implies kernel address space.
Virtual address of the memory object.
Length of the memory object in bytes.., callback, if such a function is specified.
A pointer to the first ddi_dma_cookie(9S) structure.
Upon a successful return, ccountp points to a value representing the number of cookies for this DMA object.. The alignment and padding constraints specified by the minxfer and burstsizes fields in the DMA attribute structure, ddi_dma_attr(9S) (see ddi_dma_alloc_handle(9F)) is used to allocate the most effective hardware support for large transfers. by returning status DDI_DMA_PARTIAL_MAP. At a later point, the caller can use ddi_dma_getwin(9F) to change the valid portion of the object for which resources are allocated. If resources were allocated for only part of the object, ddi_dma_addr_bind_handle() returns resources for the first DMAwindow. Even when DDI_DMA_PARTIAL is set, the system may decide to allocate resources for the entire object (less overhead) in which case DDI_DMA_MAPPED is returned.
The callback function callback indicates how a caller wants to handle the possibility of resources not being available. If callback is set to DDI_DMA_DONTWAIT, the caller does not care if the allocation fails, and can handle an allocation failure appropriately. If callback is set to DDI_DMA_SLEEP, the caller wishes to have the allocation routines wait for resources to become available. If any other value is set and a DMA resource allocation fails, this value is assumed to be the address of a function to be available. The callback function must take whatever steps are necessary to protect its critical resources, data structures, queues, and so on.
ddi_dma_addr_addr_bind_handle() can be called from user, kernel, or interrupt context, except when callback is set to DDI_DMA_SLEEP, in which case it can only be called from user or kernel context.)
If the driver permits partial mapping with the DDI_DMA_PARTIAL flag, the number of cookies in each window may exceed the size of the device's scatter/gather list as specified in the dma_attr_sgllen field in the ddi_dma_attr(9S) structure. In this case, each set of cookies comprising a DMA window will satisfy the DMA attributes as described in the ddi_dma_attr(9S) structure in all aspects. The driver should set up its DMA engine and perform one transfer for each set of cookies sufficient for its scatter/gather list, up to the number of cookies for this window, before advancing to the next window using ddi_dma_getwin(9F).
NAME | SYNOPSIS | INTERFACE LEVEL | PARAMETERS | DESCRIPTION | RETURN VALUES | CONTEXT | SEE ALSO | NOTES
|
http://docs.oracle.com/cd/E19683-01/817-0720/6mggibe60/index.html
|
CC-MAIN-2016-50
|
en
|
refinedweb
|
Got new issue - due to GUID not being the same as boot.wim from source Win10 install image, mkwinpeimg creates unbootable image :(
EDIT:Sorry i think i made the same mistake again - it requires mbr partition scheme to boot, no change to bcd needed
Search Criteria
Package Details: wimlib 1.10.0-1
Dependencies (9)
- fuse
- libxml2 (libxml2-linenum)
- ntfs-3g (ntfs-3g-ar, ntfs-3g-fuse)
- openssl (libressl, libressl-git, openssl-chacha20, openssl-no-aesni, openssl-purify, openssl-via-padlock, openssl102)
- attr (check)
- cabextract (optional) – for extracting Windows PE from the WAIK
- cdrkit (cdrtools) (optional) – for making ISO image of Windows PE
- mtools (optional) – for making disk image of Windows PE
- syslinux (syslinux-git) (optional) – for making disk image of Windows PE
Required by (0)
Sources (1)
Latest Comments
swiftgeek commented on 2016-05-19 09:48
Got new issue - due to GUID not being the same as boot.wim from source Win10 install image, mkwinpeimg creates unbootable image :(
tancrackers commented on 2016-03-12 22:45
Weird. It worked now O_o
Nevermind!
Synchronicity commented on 2016-03-12 15:22
Please send me your test-suite.log.
tancrackers commented on 2016-03-12 12:19
I get this error:
Makefile:2063: recipe for target 'test-suite.log' failed
make[2]: *** [test-suite.log] Error 1
make[2]: Leaving directory '/tmp/yaourt-tmp-john/aur-wimlib/src/wimlib-1.9.1'
Makefile:2169: recipe for target 'check-TESTS' failed
make[1]: *** [check-TESTS] Error 2
make[1]: Leaving directory '/tmp/yaourt-tmp-john/aur-wimlib/src/wimlib-1.9.1'
Makefile:2403: recipe for target 'check-am' failed
make: *** [check-am] Error 2
Synchronicity commented on 2016-02-02 01:19
Thanks. I will remove ntfsprogs from the PKGBUILD in the next version.
chungy commented on 2016-02-01 15:59
ntfsprogs can be removed from the optdepends. They've been part of ntfs-3g for a while now.
Synchronicity commented on 2015-11-14 20:36
v1.8.3 of the package, just uploaded, addresses the issue reported earlier in these comments by 'techryda'.
Synchronicity commented on 2015-08-11 14:56
Thanks for the report. The failure was caused by the FUSE device not being available to run the WIM mounting tests. It's not wimlib's responsibility to make sure that the FUSE device is available. However, I might change the test to be skipped in the case where the FUSE device isn't available (the NTFS capture/apply test currently has that behavior and was skipped rather than failed).
Users who do not want WIM mounting support also have the option of configuring wimlib --without-fuse.
tancrackers commented on 2015-08-11 12:29
I was using grsec kernel, and realized that that may have caused the error. The package installed just fine under the default Arch kernel. I'll email you the log anyway, if you want to see.
Synchronicity commented on 2015-08-10 21:34
@tancrackers can you send me the test-suite.log file?
tancrackers commented on 2015-08-10 21:07
I get this:
"
============================================================================
Testsuite summary for wimlib 1.8.1
============================================================================
# TOTAL: 5
# PASS: 3
# SKIP: 1
# XFAIL: 0
# FAIL: 1
# XPASS: 0
# ERROR: 0
============================================================================
See ./test-suite.log
Please report to ebiggers3@gmail.com
============================================================================
Makefile:2005: recipe for target 'test-suite.log' failed
make[2]: *** [test-suite.log] Error 1
make[2]: Leaving directory '/tmp/yaourt-tmp-john/aur-wimlib/src/wimlib-1.8.1'
Makefile:2111: recipe for target 'check-TESTS' failed
make[1]: *** [check-TESTS] Error 2
make[1]: Leaving directory '/tmp/yaourt-tmp-john/aur-wimlib/src/wimlib-1.8.1'
Makefile:2345: recipe for target 'check-am' failed
make: *** [check-am] Error 2
==> ERROR: A failure occurred in check().
Aborting...
==> ERROR: Makepkg was unable to build wimlib
"
I'm trying to upgrade to 1.8.1-2
Synchronicity commented on 2015-08-06 02:08
Thanks techryda. Yeah, I decided it was time to get off of SourceForge. I replied to your post on the new forums. (There are no email notifications yet, by the way.)
techryda commented on 2015-08-05 17:17
Well, I've been in the hospital for the last week...just getting back to business. I see you have a site and a forum setup now. I'll test the latest version (and 1.8.0, if necessary) and report back there.
Thanks
Synchronicity commented on 2015-07-30 01:32
There are a few things you could try to narrow the problem down.
Since you reported that earlier versions worked, you could try testing v1.7.4 and v1.8.0 in the exact same situation (exact same filesystem).
You could also try downgrading ntfs-3g from version 2015.3.14-1 to version 2014.2.15-1.
If you want to diff the good and bad filesystems directly you could mount them with ntfs-3g and do a diff, or capture them both with wimlib-imagex and take the diff of the output of 'wimdir --detailed' on each WIM image. But if there is a capture-side problem with NTFS-3g and/or wimlib then it might not be detected.
techryda commented on 2015-07-29 17:00
I realized that I didn't answer one of your questions.
Previous versions of wimlib worked with the exact same 'workflow', but different installs of Windows. These machines are offline, when installed and when imaged. The only other variable that I can think of would be Arch package updates.
techryda commented on 2015-07-29 16:40
Sorry for the vague description, I understand the need for precision...just didn't know what info to provide.
Here are my tools:
- Working with an Arch Linux (32-Bit) install on a USB key
- ntfs-3g
- wimlib (from AUR)
- ms-sys (from AUR)
- Windows 7 DVD (32-Bit)
- Two PC's (Same model)
-----
Here's my workflow:
=== Capture image ===
From Arch USB Key (32-bit) (on PC1)
- Create a 20GiB NTFS Partition
- Make Partition active/bootable
With Windows DVD (on PC1)
- Install Windows 7
From Windows (PC1)
- Enter Audit Mode
- Install Office
- Install Firefox and plugins
- 'Sysprep' - 'Generalize' from 'Audit mode sysprep window'
- Shutdown
Boot from Arch USB key (PC1)
- Capture image of Windows using wimlib
# wimcapture /dev/sda1 Win7-32Bit.wim "Windows 7 32-Bit"
- Capture image of Windows using ntfs-3g
# ntfsclone -s -o - /dev/sda1 | bzip2 -c > Win7-32Bit.bz2
=== End Capture ===
=== Deploy image using wimapply (PC2) ===
Boot from Arch USB key
- Create a 20GiB NTFS Partition on internal HD
- Make Partition active/bootable
- Run
# wimapply Win7-32Bit.wim /dev/sda1
# ms-sys -7 /dev/sda
- Reboot
- (imprecise description) Windows never gets to 'mini-setup', it boots, detects hardware, reboots and begins a boot loop
(Not in front of the PC now so can't give a more detailed description, I'll update later)
=== Deploy image using ntfsclone (PC2) ===
Boot from Arch USB key
- Create a 20GiB NTFS Partition on internal HD
- Make Partition active/bootable
- Run
# bunzip2 -c Win7-32Bit.bz2 | ntfsclone -r -O /dev/sda1 -
# ms-sys -7 /dev/sda
- Reboot
- Windows boots successfully
------
This is my usual workflow, nothing strange, no extra utilities.
Also, it wasn't accurate of me to say that I narrowed it down to 'this' version.
I have been using wimlib for several years and this is the first time I've had an issue with it.
It was probably March the last time I 'created' a new image with it. So 1.8.0 or, if for some odd reason I didn't update my system, 1.7.4
What kind of comparison could I do between the two deployed images to see what's going on?
Synchronicity commented on 2015-07-29 00:29
Hi techryda,
It can be difficult to debug problems like "Windows doesn't boot", unfortunately.
I assume that you're using the wimlib's NTFS-3g support, i.e. capturing from and applying directly to a block device?
You say you've narrowed it down to "this version of wimlib" (v1.8.1) --- does that mean that previous versions work, even with the exact same filesystem? If previous versions worked, it would be helpful to know which version introduced the problem.
There will some minor changes to NTFS-3g capture and apply in v1.8.2, but this problem is probably not related.
I'll consider adding a wimlib-git package.
techryda commented on 2015-07-28 18:01
Since 1.8.1 I cannot successfully restore a sysprepped Windows 7 image (The only kind I've tried) Windows begins the 'first-boot' process and then goes into a reboot loop with the 'Windows Error Recovery' menu coming up each time. I've tested this on several machines I've reinstalled Windows and recaptured the image at least 6 times. (I just knew it had to be me :-) But I've narrowed it down to this version of wimlib. I even captured the same sysprepped machine with both wimlib and ntfsclone. The version captured and deployed on another PC w/ntfsclone boots and finishes mini-setup just fine. The version captured and deployed with wimcapture/wimapply goes into the boot loop I mentioned. I don't know what info might be helpful to track down the problem but I'm hoping the soon to come out 1.8.2 will fix (has fixed) this issue.
Let me know if I can provide you with any other info, and thank you so much for this utility it's been working great! (until now :-)
Also, is there any possibility of you setting up a wimlib-git in the AUR to built the latest version?
swiftgeek commented on 2014-08-08 15:59
Ok, I have got an idea for feature request for `mkwinpeimg`:
• Overlay, but for root of disk/iso image
• (Creating disk image with mbr/gpt, prerequisite for UEFI boot)
• (UEFI boot, bootloader - 1/Windows/Boot/EFI/bootmgfw.efi from install.wim)
(I have no idea how to do middle one without root)
For now i'm just using ^Z while files are extracting from iso
Synchronicity commented on 2014-02-10 15:01
It already has sha1sums=('11e06e0dbd2145d07dfa99fa047e7e121b79dc71') which seems to be sufficient. Is there any reason for MD5 to be preferred?
helasz commented on 2014-02-10 07:42
Should be added checksum to PKGBUILD:
md5sum=('465cc2b7e50839ba75e1de734685ab41')
swiftgeek commented on 2014-01-03 05:16
I have no idea how to access partitions under image file with mbr without losetup && partprobe (so root privileges),
but I guess that copying EFI dir could be still useful with some extra warning in man/output (If that's ok i may lurk into script but … not sure if i have enough skills to do that :P)
Synchronicity commented on 2014-01-02 21:33
I've updated the package to v1.6.0 (just released) and fixed the ntfs-3g dependency and problem with the new syslinux. I didn't add a --uefi switch for this release (a patch would be welcome).
swiftgeek commented on 2014-01-01 07:45
I also managed to get EFI running without hivex - i did dd of generated .img to MBR's first partition and then copy EFI dir to slightly resized partition. It didn't boot from "superfloppy" for me. (Would be awesome to have --uefi switch for that)
ovmf can be used for testing ;)
(And when it comes to syslinux - couple more files than chain.c32 were needed)
---- Prev msg ----
ntfsprogs is now ntfs-3g in repo (i guess since it provides mkfs.ntfs)
And big thanks for this package/software, will save me from going insane ;)
Also /usr/lib/syslinux/chain.c32 is now in bios subdir (mkwinpeimg)
swiftgeek commented on 2013-12-31 05:49
Also /usr/lib/syslinux/chain.c32 is now in bios subdir (mkwinpeimg)
swiftgeek commented on 2013-12-31 05:48
also /usr/lib/syslinux/chain.c32 is now in bios subdir
swiftgeek commented on 2013-12-31 05:10
ntfsprogs is now ntfs-3g in repo (i guess since it provides mkfs.ntfs)
And big thanks for this package/software, will save me from going insane ;)
DaveCode commented on 2013-11-19 06:52
Successful build on i686 and x86_64 both. Thanks so much.
Voted: All packages giving Windows compat belong in main repos, key to Linux uptake.
hcjl commented on 2013-07-23 13:56
During build with makepkg I receive an error:
FAIL: tests/test-imagex-capture_and_apply
Whole test-suite-log:
====================================
wimlib 1.4.2: ./test-suite.log
====================================
# TOTAL: 5
# PASS: 4
# SKIP: 0
# XFAIL: 0
# FAIL: 1
# XPASS: 0
# ERROR: 0
.. contents:: :depth: 2
FAIL: tests/test-imagex-capture_and_apply
=========================================
--------------------------------------------------------------------
Testing image capture and application of directory containing nothing
--------------------------------------------------------------------
imagex capture in.dir test.wim --compress=None --norpfix
imagex apply test.wim 1 out.dir
imagex split test.wim test.swm 0.01
ERROR: Invalid part size "0.01"
ERROR: The part size must be an integer or floating-point number of megabytes.
****************************************************************
Test failure
Failed to split WIM
****************************************************************
I think it is due to German localisation, which I use. Building with
LC_ALL=C makepkg
works without any problems.
Thx & Rgds
hcjl
Synchronicity commented on 2013-05-20 02:33
pkg-config is in the base-devel group, so it does not need to be included as a make dependency.
Anonymous comment on 2013-05-20 02:05
Fixed by install package: pkg-config
It should be included as a dependency.
Anonymous comment on 2013-05-20 02:00
Can't build from aur with error:
libtool: compile: gcc -DHAVE_CONFIG_H -I. -I./include -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_GNU_SOURCE -D_FORTIFY_SOURCE=2 -std=gnu99 -Wmissing-prototypes -Wstrict-prototypes -Werror-implicit-function-declaration -fno-common -Wundef -Wno-pointer-sign -fvisibility=hidden -march=x86-64 -mtune=generic -O2 -pipe -fstack-protector --param=ssp-buffer-size=4 -MT src/libwim_la-xml.lo -MD -MP -MF src/.deps/libwim_la-xml.Tpo -c src/xml.c -fPIC -DPIC -o src/.libs/libwim_la-xml.o
src/xml.c:40:29: fatal error: libxml/encoding.h: No such file or directory
#include <libxml/encoding.h>
^
compilation terminated.
make[1]: *** [src/libwim_la-xml.lo] Error 1
kyrias commented on 2013-02-16 20:54
make check fails because it can't mount without sudo
|
https://aur.archlinux.org/packages/wimlib/?ID=58931&comments=all
|
CC-MAIN-2016-50
|
en
|
refinedweb
|
Bi.
In the bad old days of AS2, Actionscript-to-Javascript was handled using fscomand(). In my experience with fscommand(), there were a lot of browser issues and its functionality was much more limited. Now, in AS3, we have a fully functional API that uses the ExternalInterface class.
EXAMPLE
Please upgrade your Flash player.
Move Box
ACTIONSCRIPT
We are going to do some tweening here, so we need to import a few Tween classes:
import fl.transitions.Tween; import fl.transitions.TweenEvent; import fl.transitions.easing.*;
Next, we set up our calls using the ExternalInterface class.
//call to javascript ExternalInterface.call("sendToJavaScript"); //call from javascript ExternalInterface.addCallback("sendToActionscript", callFromJavaScript);
Once you have set up ExternalInterface, you have established 2-way communication, which means code can now begin to flow freely back-and-forth between Actionscript and Javascript functions.
So now the next thing is to create the call to Javascript:
function callFromJavaScript(dir):void { if(dir == 'right') { var tweenR = new Tween(box, 'x', None.easeNone, box.x, 145, 1, true); } if(dir == 'left') { var tweenL = new Tween(box, 'x', None.easeNone, box.x, 23, 1, true); } }
JAVASCRIPT
First you need to write a function that will detect your operating system. This is important because Microsoft uses "Document" when referring to the page and Mac uses "Window."
function getFlashMovie(movieName) { var isIE = navigator.appName.indexOf("Microsoft") != -1; return (isIE) ? window[movieName] : document[movieName]; }
Once we have established which OS we are working with, we need to write a function that will make the call to Actionscript.
function callToActionscript(str) { getFlashMovie("nameOfFlashMovie").sendToActionscript(str); }
HTML
On a simple button, you only need to call the function
callToActionscript('right')
depending on which direction you are asking the box to slide.
At this point, we have only sent a call to our Actionscript but nothing has come back from it . To illustrate the call back to Javascript, we can do the following.
Please upgrade your Flash player.
Move Box
For the call back to Javascript, we add this into our Actionscript:
this.addEventListener(Event.ENTER_FRAME, callJs); function callJs(e:Event):void { ExternalInterface.call("sendToJavaScript", box.x); }
We already added this function to our Actionscript; however, two things have changed. First, the ExternalInterface is placed inside a function, which is being called by an Enter Frame eventlistener. Second, we have added the argument "box.x," which will be passed to the Javascript function.
And finally, we add the following function to the Javascript:
function sendToJavaScript(val) { document.getElementById('boxX').value = val; }
And that's it! If you would like to see the source files, you can download them all here.
When testing files using the ExternalInterface API, make sure your files are either on a live site or are running off a local server on your machine.
As a final note, I want to add that I really like this functionality. In fact, any technology that opens up Flash to other elements on an HTML page is wonderful and welcomed in my book. There has always been a disconnect between Flash and "the rest" of the web, and I have become frustrated by the notion of Flash being inaccessible and self-contained. Flash can be both, but it doesn't have to be! Bi-directional communication is a simple and easy way to start breaking down these barriers.
|
https://www.viget.com/articles/bi-directional-actionscript-javascript-communication
|
CC-MAIN-2016-50
|
en
|
refinedweb
|
0
OK, here is my c++ program that i made with "Visual C++ 2005 Express Edition"....
#include<cstdlib> #include<ctime> #include<iostream> using namespace std; int main() { cout << "Welcome To Danny's Game!.\n"; cout << "See if you can beat me.\n"; cout << "The First number below is your number.\n"; srand((unsigned)time(0)); int random_integerplayer; for(int index=0; index<1; index++) { random_integerplayer = (rand()%10)+1; cout << random_integerplayer << endl; cout << "\n"; cout << "This is my number.\n"; srand((unsigned)time(0)); int random_integercomputer; for(int index=0; index<1; index++) { random_integercomputer = (rand()%10)+1; cout << random_integercomputer << endl; cout << "\n"; if( random_integercomputer>=random_integerplayer ) cout << "You Lose. "; else cout << "You Win! "; } } }
OK, that was my code, but something won't work.
Whenever i use it, it always comes up with 2(two)
numbers(computer and player), that are both exactully the same!!!
Please help me make it so that when it generates the random numbers, they are both different...
thxz alot! =)
|
https://www.daniweb.com/programming/software-development/threads/68188/help-my-program
|
CC-MAIN-2016-50
|
en
|
refinedweb
|
Michael B Allen wrote:> >>b) if xattr is the right thing, shouldn't this be in the system>>namespace rather than the user namespace?> > If we're just thinking about MS-oriented discretionary access control then> I think the owner of the file is basically king and should be the only> normal user to that can read and write it's xattrs. So whatever namespace> that is (not system).> system namespace means that it's a name defined by the kernel as opposed to a name defined by the user. One of the most glaring design errors in this whole thing, in my opinion, but if we're going to use xattrs we probably should stick with it.Thus, I'd propose: system.dosattrib - DOS attributes (single byte) system.dosshortname - DOS short name (e.g. for VFAT) -hpa-To unsubscribe from this list: send the line "unsubscribe linux-kernel" inthe body of a message to majordomo@vger.kernel.orgMore majordomo info at read the FAQ at
|
http://lkml.org/lkml/2005/1/3/250
|
CC-MAIN-2016-50
|
en
|
refinedweb
|
UFDC Home myUFDC Home | Help | RSS <%BANNER%> TABLE OF CONTENTS HIDE Section A: Main Section A: Main: Opinion Section A: Main continued Section A: Main: Health Section A: Main continued Section B: Sports page B 3 Section B: Classified Advantage page B 4 page B 5 page B 6 Full Text On the Hardwood Columbia, Fort White gear up for district basketball tournament. Clearing the Way Officials begin demolition work to protect Rose Sink. Local & State, 6A I:Ifs;~ ___________________________________ Tuesday . .February 15, 2005 Lake City, Florida r 50o Weather Partly Cloudy High 78, Low 51 Forecast on 2A Unnamed murder suspect already in custody SMan suspected of the , Jan. 18 killings in jail 1 for another crime. By JUSTIN LANG Sjlang@lakecityreporter.com The Lake City Police Department says it has a sus- pect in custody for the Jan. 18 murder of a homeless man; however the inmate has yet to be charged in the crime. Investigators have not released the suspect's. name, but only that he is a black male and is being held at the Columbia County Detention Center on an unrelated charge with a $250,000 bond. With murder charges still pending, Laxton provided few details other than to say the investigation in the Jan. 18 killing of James Derrick Razor, 39, is still ongoing and police are working closely with the State Attorney's Office. "We are still working on it and we have a suspect in mind, but that's all we can say about it," Laxton said. He said he didn't know when the suspect may be charged with Razor's murder. "We are just taking our time and making sure everything is done right," Laxton said. Laxton said he feels confi- dent with the suspect and the murder charge that is likely forthcoming. Two local women found Razor's body on Jan. 20 lying in the grass beside an aban- doned house at 803 Dundee Way and called 911. When police responded to the scene, they say Razor was found fully-clothed, apparent- ly having died of a gunshot wound to the head. Investigators soon learned he had been released from the detention center on Jan. 18 after being held on charges of misdemeanor *marijuana possession and violating the city's open container (of alco- hol) law. Police said it was Razor's second time at the MURDER continued on page 11A The healing power of pets Lake City Medical Center introduces new therapy By JUSTIN LANG jlang@lakecityreporter.com Some patients at the Lake City Medical Center received .a special Valentine's visit "Monday afternoon from ther- apist Pepi McClead. I Her first time at the med- ical center, Pepi was pleased to receive a joyous welcome from all staff and patients she Same across. So enthusiastic she was, Pepi soon went into the room of 93-year-old patient Clarice Witt of Lake City, jumped into the bed and curled up right beside her. For anyone else, the behavior might seem odd, but being a black, white and brown Pappillon, it was excused and even welcomed. A certified pet therapy dog, Pepi was at the medical cen- ter Monday for the facility's first day of offering the serv- ice to its patients. Delores Brannen, director of marketing, said it was a delightful coincidence the r.,, JUSTIN LANG/Lake City Reporter Lake City Medical Center patient Clarice Witt, 93, of Lake City touches the soft fur of Pepi McClead, a pet therapy dog from Columbia County Senior Services. The medical center started pet therapy for the first time Monday, giving patients an unexpected Valentine's Day gift. 6We want them to feel at home here, so we want to bring the pet to them. 9 Delores Brannen marketing director Lake City Medical Center first day also happened to be Valentine's Day, But she said the planning for pet therapy at Lake City Medical Center actually began about three months ago as a way to fur- ther expand its range of patient care. "It's just another service we wanted to be able to offer our patients," she said. "We want them to feel 'at home here, so we want to bring the pet to them." Kathy Wisner of Columbia County Senior Services is helping to coordinate pet therapy at the medical center and brought Pepi around to patients on Monday. Pepi is owned by Don and Mary McClead (Mary is a painting instructor for Senior Services) and had to undergo both training and an exten- sive health certification to become an official pet thera- py dog. Since being certified, she has made previous thera- py visits to patients at North Florida Regional Medical Center in Gainesville. Dr. Brent Hayden, who happened upon Pepi in the halls of the local medical cen- ter Monday, said he is in PETS continued on page 11A 4K.. ~-.... K... . .. ...... Fort White student gets appointment to Air Force Academy Student among 1,200 across country to get selected for academy By TONY BRITT tbritt@lakecityreporter.com FORT WHITE Bryan Taylor's childhood dream of becoming an F-16 fighter pilot is about to materialize before his eyes. Taylor, a Fort White High student, has received an appointment to attend the U.S. Air Force Academy in Colorado Springs, Colo., as part of the academy's Class of 2009. "I think it's really cool," Taylor said of his appoint- ment. "It's something only a few people in the state get to do." According to reports, Taylor is one of only 1,200 stu- dents nationwide to receive the appointment. Taylor, 18, said he has thought about going into the CALL US: (386) 752-1293 SUBSCRIBE: 1 755-5445 Air Force F since he was a small child because he always want- ed to fly. He Taylor also said sev- eral of his family members have served in the Air Force, including his stepfather, both of his grand- fathers and his brother. Keith Hatcher, principal of Fort White High School, said Taylor is the first student from his school to earn an appoint- ment to the academy. "Bryan is a great kid," Hatcher said. "He's a good role model, a go-getter and anything you ask him to do, he'll do. He's a great student and athlete and I'm proud of him." Taylor, 18, said at times his confidence wavered as he waited to get word whether he would be admitted to the ACADEMY continued on page 11A Olustee Festival collector's item available soon Special envelope with Olustee cancellation on sale Friday at festival. By TONY BRITT tbritt@lakecityreporter.com The brave actions of sol- diers who died in the Battle of Olustee more than 130 years ago have been honored in many ways. Activities ranging from a reenactment battle to postage stamps have served as proof of how the fallen troops have been revered through the years. During the 27th Annual. Olustee Battle Festival this weekend, local residents can pay homage to the troops by purchasing a collector's edi- tion envelope with the Olustee Festival cancellation from the local postal service. The envelopes will be on sale Friday and Saturday beginning at 10 a.m. at the U.S. Postal Service trailer near the Columbia County Courthouse Annex as part of the 27th Annual Olustee Battle Festival festivities. Joseph Wilson, a Blue-Grey Army volunteer who also serves as a volunteer with the Joseph Wilson, a volunteer with the Lake, City Post Office, holds a collector's edition envelope with the Olustee Festival cancellation. The items will be on sale beginning Friday dur- ing the 27th Annual Olustee Battle Festival. Lake City Post Office, said he is uncertain how many envelopes have been printed for the 2005 Battle Festival, b.ut they have become collec- tors' items. He said the stamps have been combined with the Olustee Battle Festival so peo- ple all over the United States will know about the Olustee Battle Festival. 'There are some special envelopes that have been printed that go back about 4 or 5 years and they've been framed," Wilson said of items available for this year's festi- val. He said they can be pur- chased for $25. "We'll also have regular stamps," he said. Wilson said this year's can- cellation image has a silhou- ette of two crossed flags, one northern and the other south- ern. A purple heart sits between the two flags. "By popular demand, we are going to use the Purple Heart stamp again," he said. "We're also going to have goodies for children coloring books, crayons, and other miscella- neous items." Wilson said Duffy Soto, a Lake City artist, contributed to the design of the cancellation, which is located on the upper- left portion of the envelope and contains a small duplicate image of Soto's 2005 Olustee Reenactment Battle Festival. Wilson said the cancellation has become an annual part of the festival. "We have the cancellation every year because we get the OK from the high command to use it and it contains the date just for those two days," he said. 'This has been going on for sometime, not just here in Lake City, but all across the United States for different functions. Our can- cellation is unique because it's an original by Duffy Soto, who as usual, does that every year." This year some of the pro- ceeds from the cancellation sales will go to the Lake City Purple Heart Organization for local veterans. TODAY Classified ..... .4B Comics ......... 3B Local & State ... .3A Business ....... 5A Obituaries ....... 6A Opinion ..... 4A Puzzles ........ 4B Scoreboard ...... 2B World . . .12A Weather . .2A Wete....2 san m ".,'. { -:. .....j ..... 2A LAKE CITY REPORTER, TUESDAY, FEBRUARY 15, 2005 ~- o n= -vs Oa * * * * T fv.m -No qm w 4 401b Slo LAKE CITY REPORTER HOW TO RACUS CLASSIFIED Main number .......... (386) 752-1293 To place a classified ad, call 755-5440. Iax6Reporter,krLhLAuIG Advertising Director Karen Craig...............754-0417 craigi@ lakecityreporter.com) Sales ...................74.152-1293 BUSDI ...... $89.70 Lottery MIAMI Here are the winning numbers in Monday's Florida Lottery: Cash 3: 5-5-4 Play 4: 9-6-2-8 Sunday's Fantasy 5:19- 21-23-27-35 Correction The Lake City Reporter corrects errors of fact in news items. If you have a con- cern, question or suggestion, please call the executive edi- tor. Corrections and clarifica- tions will run in this space. And thanks for reading. THE - mWAT "Copyrighted Material Syndicated Content" _-- Available from Commercial News Providers" N4M jvp 0 * 1, 4 S * ~- ~ * S '-'a ',-~- 0 S ~ I Little Caesars hh 6 363 SW Baya Dr. 961-8898 SHwy 47 & 1-75 755-1060 Offer limited to first 150 customers of the day /t K'** ER e -- FRE ak ityReorerpae r 4w IL a am-am * * Q Q ON one duo qlL QM LOCAL & STATE'~ LAKE CITY REPORTER, TUESDAY, FEBRUARY 15, 2005 3A Masonic Lodge plans Youth Night Celebration Thursday By TODD WILSON twilsoh@lakecityreporter.comrn Lake City Masonic Lodge No. 27 will host a Youth Night Celebration at the group's lodge Thursday. The event begins at 7 p.m., at the lodge at 2685 McFarlane Ave., and is open to the pub- lic. The Youth Night theme is designed to showcase young. people from several areas of the community and invite the, public for the free perform- ance. "We want people to come in and enjoy this event and see the Masonic Lodge, see what we're all about," said Jerry Morgan, Lake City Masonic Lodge activities chairman. "We've stayed behind our four walls for too long. We want to reach out and be more involved in the community." The Youth Night activities will feature several perform- ances from Columbia County school groups and individu- als. The night will begin with the presentation of the colors by the Columbia High School Army JROTC unit, followed by the pledge of allegiance. The National Anthem will be sung by Caitlin Eadie, an accomplished Lake City singer. She, will perform two additional songs during the program. Following the National Anthem, the JROTC unit will perform its eight-minute pre- cision floor-drill routine for the crowd. The "Fancy Dancers," a Columbia County dance group, also will perform dur- ing the event. 'This is a school night, so we won't keep these kids out very long," Morgan said. "This whole event will take less than an hour." The Youth Night Celebration ,will end with John Leaman, a member of the Cherry Hill Masonic Lodge No. 12 at Fort White, playing guitar and singing 'The Mason's Prayer." Refreshments will be served to the public follow- ing the event. '"We want anyone to come out and be with us," Morgan said. "We want people to get to know us." LCCC to host science fair Lake City Community College will host the Suwannee Valley Regional Science and Engineering Fair Feb. 22-24 in Howard Gymnasium. The fair will include about 130 student projects in the, fields of behavioral and social science, chemistry, biochem- istry, botany, computer sci- ence, earth and space sci- ence, engineering, environ- mental, medicine and health, microbiology, physics and zoology. The region is com- prised of 10 counties: Columbia, Union, Suwannee, Bradford, Hamilton, Lafayette, Baker, Gilchrist, Dixie and Madison. Regional community busi- ness leaders will judge the projects 8:30 a.m. to 3:30 p.m. Feb. 23, with an open house for the community from 4-6 p.m. The awards ceremony will be 7 p.m. Feb. 24 at the high school in Union County. The winners will participate in the State Science and Engineering Fair in Orlando April 6-8. Parade to honor area veterans The Blue-Grey Army, Inc., the sponsoring organization for the Olustee Battle Festival, will honor veterans and service members who fought or were stationed in Iraq, Kuwait or Afghanistan. There will be special seat- ing made available for these military members at the parade 10 a.m. Saturday. For more information, call Faye Bowling-Warren at 755- 1097. Rodeo pageant set for March 20 The Miss Florida Gateway ProRodeo Pageant will be March 20 at the llth Annual Florida Gateway ProRodeo. Participants can win schol- arships, savings bonds, tiara, buckles and more. ' Applications are available at Smitty's Western Store, The, Money Man, the fair office, Fort White High School, Columbia High School, Lake City Middle School and Richardson Middle School. For more information, call 752-8822 or see the Web site at wwwcolumbiacountyfaikorg. Columbia County Resources has two $1000 scholarships for graduating seniors. Applications and cri- teria are available at FWHS and CHS, the fair office and the Web site. Pageant sign-up under way WHITE SPRINGS - Registration is under way for the 2005 Little Miss Azalea Contest. . This competition is for girls up to 10 years of age from Hamilton, Suwannee and Columbia counties. The winner will be crowned at the Suwannee River Wild Azalea Festival in White Springs March 19. Contestants can register at the White Springs Town Hall at the corner of Collins and Jewett Streets and receive a sponsor sign-up sheet. Deadline to turn in all spqn- sorship donations is 4 p.m. March 11. Presentation of awards will be at the music stage at the Florida Nature and Heritage Tourism Center. For more information, call 397-2310. Library book sale begins April 9 The Friends of the Library, Alachua County Library District, will have its annual spring book sale April 9 through 13 at the Friends of the Library Book House, 430 N. Main St., in Gainesville. Hours are 9 a.m. to 6 p.m. April 9, 1-6 p.m. April 10, noon to 8 p.m. April 11 and 12 and 10 a.m. to 6 p.m. April 13. For more information, call (352) 375-1676. Compiled from staff reports POLICE. AsuwOwr Arrest Log The following information was provided by local law enforcement agencies. The fol- lowing people have been arrested but not convicted. All people are presumed innocent . unless proven guilty. Tuesday, Feb. 8 Columbia County Sheriff's Office William David Bishop II, 2425 S.W. Newark Drive, Fort White, aggravated assault with a deadly weapon and improper exhibition of a dan- gerous weapon. Thursday, Feb. 10 Columbia County Sheriff's Office George Robert Spivey, 42, 394 S.W. Buffalo Court, failure to register as a sex offender. Shannon Carter Stamper, 32, 276 SW Merciful Place, Fort White, possession of cocaine and possession of drug paraphernalia. Janice Wilsoni Thomas, 41, 4347 284th St., Branford,. possession of controlled sub- stance and five counts of pos- session of drug parapherna- lia. Allethia Charentell' Brooken, 32, 3541 Victoria Park Road, Jacksonville, war- rants: violation of community control on original charges of two counts of grand theft, five counts of forgery and five counts of uttering a forgery. Alfredo Lee Johnson, 22, 835 Georgia Place, warrant: third-degree grand theft and two counts of uttering a for- gery. , g Fridy,''Feb. 11 .". Columbia County Sheriff's Office Sherrie Denise Jackson, 35, 978 N.W. Oakland St., armed burglary and grand theft. Lake City Police Department Richard Earl Gardner Sr., 46, 515 N.E. Hernando Ave., aggravated assault and resisting an officer without violence. M Charles Richard Brush, 18, 232 S.W. Vista Terrace, possession of drug parapher- nalia and possession of cocaine. Saturday, Feb. 12 Columbia County Sheriff's Office M Amy Neshea Yawn, 21, 1461 N.W. Baughn St., fraud- ulent use of credit cards, grand theft, forgery and uttering a forged instrument. Willie Frank Yawn, 21, 1461 N.W. Baughn St., fraud- ulent use of credit cards and grand theft. Lake City 1 Microdermabrasion -'4 -.i'2 i///Scfiw ,, 752-4888 21stAnnual , Baby Contest & .--- SModel/Beauty Search.- ., America's Cover Mss Aae Division Girls: Birth-llmo, 12-23mo, 2-3yr, 4-6yr, 7-9yr, 10-12yr, 13-15yr, 16up. Boys: Bltii-2yr. & 3-yr. Over 2 MILLION $$$ In cash and prizes awarded yearly! Qualifytodayto win a $10,000.00 bond at 2005 finals. For Information or a f /'N.. brochure call: Event Location (850) 476-3270 or '- March 12- Orange Park Mall (850) 206-4569 ... March 13- Lake City Mall SFrms available at ourwebaltse --- Register: 1:30 p.m.a - Email: covermlss@aol.com Police Department Winston Arthur Bell, 46, 157 S.W. Musket Place,. aggravated battery with motor vehicle and assault. Bubby Keegan Hildreth, 19, 532 Hillside Drive, Daytona Beach, possession of cocaine, possession of less " thain 20 grans of marijuana and possession of drug para- phernalia. Todd Christopher Smith, 20, 5820 Nohill Blvd., Port Orange, possession of cocaine, possession of less. than 20 grams of marijuana and possession of drug para- phernalia. Sunday, Feb. 13 Lake City Police Department Harold Roy Crews, 42, homeless, grand theft auto, possession of cocaine, posses- sion of drug paraphernalia and resisting officer without violence. Fire, EMS Calls Sunday, Feb. 13 2:08 a.m., rescue assist, 353 Lehigh Lane, one pri- mary unit responded. 9:26 a.m., rescue assist, children locked in car, 4066 Horseshoe Loop, two primary units responded. 11:16 a.m., brush fire, State Road 47 South, one pri- mary and two volunteer units responded. 11:50 a.m.,. gas leak, 355 Short Lane, four primary units responded. 1:35 p.m., brush fire, Marcus Road, one primary and three volunteer units responded. 2:11 p.m., brush fire, Federal Road, one primary and three volunteer units responded. 2:14 p.m., forestry fire, C orurnmSnatche, ,ab a. &Children's Boutique S Huge Inventory Blowout SA20/o-50%/o Storewide* I "' "' Today Thru Saturday, Feb. 19th only '- -- 363 SW Baya Drive (next to KFC) 961-9696 *Some exclusions apply Service STER ResidenfiatlCommerciat Seruices Fire & Water Restoration CarpetlUpholstery Cleaning Mold Remediation 755-7522 663 SE Baya Ave., Lake City, FL 32025 Marcus Road, two volunteer units responded. 2:48 p.m., brush fire, 4454 Wilson Springs Road, two primary and three volun- teer units responded. 2:54 p.m., brush pile fire, Chickadee Way, one volun- teer unit responded.- 5:55 p.m., brush fire,, Landress Terrace, one volun- teer unit responded. 6:59 p.m., nuisance fire, El Prado Avenue, one pri- mary unit responded. 7:44 p.m., rescue assist, Guerdon Street, three volun- teer units responded. 9:48 p.m., wreck, U.S. 90 West and Bascom Norris Drive, one primary unit responded. 10:19 p.m., breaker box fire, Martin Oaks mobile home park, two primary and one volunteer unit responded. Monday, Feb. 14 1:32 a.m., gas leak, South Main Boulevard, three pri- mary units responded. "* 10:25 a.m.,rescje'assist, 998 N.W. Virginia St., one pri- mary unit responded. 11:47 a.m., wreck, State Road 247 and Troy Road, one primary and one volunteer unit responded.. 3:49 p.m., wreck, U.S. 90 East at Vickers Terrace, one primary unit responded. Compiled from staff reports. IF WE CAN'T WIN, NO ONE CAN! NOFE 'Former Social Security , Executives and i UNiLES S Associates Even if you've been l\~- r' turned down before. Call Now! Initial Claims, Reconsiderations, and Hearings Isl le :Ai 6m-0 ", -..'- .".* '. :.-. ; "Finily;-chcking account that you can really get xuicte h bout: Ultimate Checking from Atlanuc Coast Federal. S It's the account that pays you interest like a money marker account, with the convenience . of full-service checking. Earn R, 2.00%"A* on deposit of lu[ $5.000 or more And this rate ,s guaranteed until July 31, 2005! - 0 'BRZCFS I ! 4A LAKE CITY REPORTER, TUESDAY, FEBRUARY 15, 2005 LAKE CITY RE^PORTER REPORTER SERVING COLUMBIA COUNTY SINCE 1874 MICHAEL LEONARD, PUBLISHER TODD WILSON, EDITOR SUE BRANNON, CONTROLLER THE LAwKE f REPORTER IS PUBLISHED WITH PRIDE FOR RESIDENTS OF COLUMBiA AND SURROUNDING COUNTIES BY COMMUNITY NEWSPAPERS INC. OF ATHENS, GA. WE BELIEVE STRONG NEWSPAPERS BUILD STRONG COMMUNITIES - 'NEJiSR-rt-' T I ,,T DONE!" OUR PRIMARY GOAL IS TO PUBLISH DISTINGUISHED AND PROFITABLE COMMUNITY-ORIENT- ED NEWSPAPERS. THIS MISSION WILL BE ACCOMPLISHED THROUGH THE TEAMWORK OF PROFESSIONALS DEDICATED TO TRUTH, INTEGRITY, LOYALTY, QUALITY AND HARD WORK. DINK NESMITH, PRESIDENT TOM WOOD, CHAIRMAN For Rodney was one of our own T he Lake City Reporter family suffered a. loss a week ago today. Rodney Lord, an employee at this newspaper for more than 30 years, passed away. He was 55. During his career, Rodney worked in several capacities in the composition and production departments of this newspaper. For a time, he was a pressman, rolling the machines every day to make sure the newspapers of his beloved Lake City com- munity reached the doorstep on time and with a top-quality look. Rodney's career spanned an interesting time in the newspaper inditstry and proba- ,bly a-span that has seen the most intense changes in the business..Early on, Rodney and his co-workers worked with typewrit- ers and Linotype to firmly set the type for the pages and the awaiting presses. He adapted through the paste-up generation when computers first made their entrance and most recently worked his daily shift with the night crew, converting computer- produced page files into documents suit- able for high-speed Internet transfer to our press plant. A lot changed in the newspaper work- place during Rodney Lord's lifetime, but he adjusted and thrived without complaint or regret. He loved the newspaper business. In recent years, he battled severe health problems, but was always reliable in the office. Even on days when it was obvious he didn't feel'his best, he started his shift with a quick walk through all of the paper's departments, wishing everyone goodwill and giving best regards with a quick wit and a smile. Rodney was a good person. He was remembered as such through tears and laughter as friends and family gathered for a memorial visitation over the weekend and recounted special times from his life. Our deepest- sympathies are extended to his family. Rodney will be missed. Today estab- lished. In 1820, American suffragist Susan B. Anthony was born in Adams, Mass. In 1879, President Hayes signed a bill allowing female attorneys to argue cases before the Supreme Court. In 1898, the U.S. battleship Maine myste- riously sur- rendered to the Japanese during World War II. In 1961, 73 people, including an 18-mem- ber U.S. figure skating team en route to Czechoslovakia, were killed in a plane crash. ~~LM * ~ * LM 0* V C.) HUB C,) L- a) 0 z I- LM 0) E E 0 0 'p hbp~h.m E 0 LM &P- " ) . - iS i( II I0ETE O H3E I O How about a Monday paper? I read yet another editorial in the Saturday, Jan. 8, 2005, issue of your newspaper con- cerning what the Columbia County Commission should be about in regard to travel by the commissioners in this county. Enough is enough. If you want to try and accomplish something constructive why not figure a way for your newspaper to get into the 21st century and ensure that the Lake City Reporter is deliv- ered to your subscribers, and available for others to pur- chase, each day of the week. It is a sad commentary that the events each weekend in our area which are newswor- thy, and news from the sports world, is not available. to us until Tuesday. It seems that your newspaper is counting on the AP, and other news agencies, to cover for you each weekend and they do; however, local news of inter- est is not available to keep your readers abreast of what is happening in our area. If you are not authorized to pub- lish, print, and distribute your newspaper seven days a week, why not publish a paper and deliver it each Monday, and not have a paper on Tuesday? Advertisements generally, including flyers, are not that intense in your newspaper until Wednesday-Saturday of each week anyway. This change would better serve the public and certainly would not adversely affect your accounts receivable from those who advertise in your newspaper. I would appreciate you tak- ing this suggestion under advisement. I would also ask the other readers of your newspaper to contact your newspaper with their opinions and comments. This area of Florida has grown to the point that a good, reliable, local newspaper should be avail- able to us on a daily basis.. Charles A. Morgan Lake City What about drinking water? You ran three excellent arti- cles in Sunday's paper con- cerning future land develop- ment for Columbia County. You did a fine job of pre- senting the information every- one needs to know about where we live and how we must really be careful with our water supply. Much less has been said about the fact that many resi- dents are drinking the ground water. Their health is at risk if we continue with septic tanks and poor quality runoff into sinkholes. Frank Sedmera Lake City PHIL. HUDGINS Final tests for Dixie challenge OK, so I'm not 100 percent Dixie. I'm 89 percent. You don't know what I'm talking about, do you? Let me explain. One of my friends e-mailed me a quiz called "Yankee or Dixie?" It contains 20 multiple-choice questions: (You can test yourself at www. angelfire. com/ak2/intelligencerre- port/yankeedixiequiz.html) Many of the questions deal with pronun- ciations. For example, do you pronounce "caramel" as 1. Car-ml? 2. Car-a-mel? 3. Either? 4. Don't know. My answer was "car-a-mel," which, the quiz said, is common on the Atlantic coast and southern United States. That's the right answer for a Southerner. But I gave an answer from the Great Lakes region and northeast United States on this question: "What's that bug that rolls into a ball when you touch it? 1. Roly poly? 2. Pillbug? 3. Potato bug? 4. Sow bug." My answer was "pillbug." But the answer most common in the Southeast, the study said, is "roly poly." Honestly, my first answer would have been a "tumble bug," which is what my daddy, when he was in mixed company, called the bug that hung around the busi- ness side of an outhouse. But what idiot would touch a, tumble bug? Mary Long of Lawrenceville, Ga., agreed. She is a certified priviologist, which means she gives programs on privies, or outhous- es. "I heard those bugs help keep the eco- logical balance," she said, sounding like a teacher, which she was before retiring and taking up priviology. "You know, this is ter- rible, but I read that the flatulence of cows and other animals helps keep us balanced." Suddenly, we had gotten off the subject. So I called some entomologists, which is a fancy word for people who know bugs. "We just talked about them in class," said Dr. Mike Waldvogel of the North Carolina Cooperative Extension. His answer was "roly poly," I guess because he's been away from his native New York City long enough to know some Southern. And then he talked about "dog flies," so-called because they congregate around dogs. 'The answer is to bathe the dog," he said, "but no Southerner wants to do that because the dog is under the house anyway." We were off the subject again. "I call them both pillbugs and roly polies," said Mandy Comes, a lab technician at Rockingham (N.C.) Community College who orders bugs from catalogs, in which "pillbug" is preferred. By the way, she scored 54 percent Dixie. She grew up in southwest Virginia. Dr. Eric Benson, Extension entomologist at Clemson University, said he would have answered "pillbug." He's originally from New Jersey. But his secretary, Tammy. Morton, is a pure, undiluted Southerner. "Haven't you ever played with a roly poly?" she asked me. "They look like a little armadillo." Incidentally, she scored 100 percent Dixie. I guess 89 percent Dixie is not bad. I did spend some time in D.C. and Massachusetts. At least 11 percent of those regions must have stuck with me. Think I'll go get a soda. Phil Hudgins is senior editor of Community Newspapers, Inc. Contact him at phud- gins@cninewspapers.com. OPINIONS WANTED BY MAIL: Letters, P.O. Box 1709, Lake City, F 32056; or drop off at 180 E Duval St. downtown. BY FAX: (386) 752-9400 BY E-MAIL: twilson @ lakecity reporter. com II LAKE CITY REPORTER, TUESDAY, FEBRUARY 15, 2005 BUSINESS Wrizon agrees to buy MCI for $6.75 billion - gnumq * m O 4 -b - - -a A a - - U U U~ ~. .~ ~ 0 S~ &AM Q.f "Copyrighted Material -- Syndicated Content 1-0 NfAvailable from Commercial News Providers',' 4b mom-A =K ____-__ . -4b * - ** 4 a ilb -.4 41. - 'S 0 WD 0 0 a 0 4D o - C ft - -C ~ C. -.~ C * C - * C - * w-- - C w ~ * -C - C ~ C C 49b 40 . - w * C 'February 17. 6:30pm-7:30pm for more info 752-2320 1937 SAWVEpiphany Ct., ake City 0 - V 4w 40 W 4w so % 4p I I : Irv, awavoinkmmu- m Q w o - -up do qb G t - . - -w * - - . -n= q S - * W 0 * - k~b 7; ~2 Epiphany CaTholicSchool Open House for 2005-2006 F L Proj-(1>ccti\e Kinder,,_artners 1111 V Ile" SItIvnpn. i ,1 '4 01 02 * ~ 0 w dib 9 --9 O * o * * qUl I ,1..... ....ILI) [B -1% .......... - .# 6A LAKE CITY REPORTER, TUESDAY, FEBRUARY 15, 2005 LOCAL & STATE K.. Fort White considers _.. -- cemetery database : ,:: : L .. _, T''Il. I.-III i4 C, 'Ir, .'',r Paul Sehy, an Ichetucknee Springs State Park volunteer, drives.a tractor, which aids in the demolition of a produce shed Monday, as part of a park project to protect Rose Sink. Officials begin demolition work to protect Rose Sink By ASHLEY CISNEROS acisneros@lakecityreporter.com FORT WHITE The Fort White Town Council received a proposal for the possible development of a database and mapping system for its cemeteries. Aubrey Stanton Adams submitted a proposal detail- ing his services and provided three bids for three different levels of "specificity." The proposal comes after a situation in the town where a family needed to bury a loved one and could not find its space in the cemetery due to lack of proper records. Adams, who is skilled in graphic design and "database management, offered exam- ples of his experience in pro- viding his services for other cemeteries. "What I have presented here is includes a simple plan, a medium plan and a top-qual- ity plan," Adams said. The differences in price would reflect the degree of accuracy and precision put into the zoning. His plan would seek to identify who is buried in the cemetery and where exactly the person is buried. "Each burial would be assigned an alpha-numerical marking such as A-5 or F-10, so that families would know exactly where their loved ones are buried, and it could also be determined where vacancies exist," he explained. Adams described that the first step in the project would be to find the boundaries of the cemetery and the exact dimension of the property. Next, the cemetery would be divided and subdivided into zones. Although Adams did find records concerning Fort White's cemeteries on the Internet, he suspected that they were not up-to-date. "I found a list with more than 650 names of people buried here, and while it is good to start with, I don't know how current that infor- mation is," he said. John Gloskowski, council- man of district three, was con- cerned about potential unmarked graves. "What about people who are already there?" he said. "How will you know if there are no markings?" Adams then described a system where he can take a rod and place it into the ground to detect whether or not a coffin is buried. In addition, he also men- tioned another method using a radar, but commented that it would be more expensive than the rod method. Truett George, mayor of Fort White, suggested tabling the issue until the council could read Adam's proposal more carefully. "I want to see something done about this," he said. "But we need to get more informed about what exactly we need and what options we. have." Such options include get- ting volunteers to survey the cemeteries, instead of paying for the service, he said. Adams said that he was concerned that not all volun- teers may have the computer and graphic design skills needed for a thorough data- base and map. In other business, the council approved to hire Watertech, Inc. from Haines City to handle replacing char- coal media in the town's three water filters. The price tag of the project is $9,900 and should be com- pleted before the next water samples are taken at the end of March, said Public Works Director Edmund Hudson. By TONY BRITT tbritt@lakecityreporter.com COLUMBIA CITY The demolition of a produce shed on State Road 47 may seem like .rejuvenation for the small community, but it's actually a way of protecting the environ- ment. The demolition of the shack, which was housed less than 100 yards away from a sinkhole, is a sign of progress as Ichetucknee Springs State Park officials begin a restora- tion project to, protect Rose Sink. Monday morning, Jackie Sheffield, park ranger; Paul Sehy, park volunteer; Nick Turner, correctional officer with the Lancaster Correctional Institute in Trenton; and more than 10 inmates demolished the decrepit produce stand near the sinkhole. 'This is part of our restora- tion project to protect Rose Sink and we're removing some old buildings," said Tom Brown, Ichetucknee Springs State Park manager. "We also plan 'to put in a water reten- tion structure on the north end of the property. We'll fence it off and use it as an educational opportunity to let people know about water issues in the area." The property sitting near the intersection of County Road 240 and SR 47 was pur- chased from the landowners nearly three years ago as part of Gov. Jeb Bush's Florida Springs-Initiative. Brown said the demolition work was part of. the park's long-range plan to protect sinkholes in the area and another building on the site will be disassembled and moved. "This will be a perfect opportunity to show the peo-. ple on the basin tour some of the projects that we're doing to protect significant pieces of property in the watershed," he said. The Ichetucknee Springs Basin Working Group has scheduled a field trip of the Ichetucknee Springs Basin for today, which will include a stop at Rose Sink, where offi- cials will discuss cave explo- ration and land acquisition at the site. Three local sinks will be visited as part of the tour. The Ichetucknee trace is described as everything from Alligator Lake to the head spring at Ichetucknee Springs State Park and anywhere there is an opportunity where water can go'into a significant geologic feature such as Rose Sink. Brown said it's impor- tant to protect all such fea- tures as a means of protecting water quality. "We're trying to protect that structure (Rose Sink) because it's directly tied to the .head springs," Brown said. ., .. .. ,; t "Anything that goes in there shows up sometimes within six hours or within a week at the head springs." ' The funding for the demoli- tion and restoration of the area is also paid through the governor's Springs Initiative. The Florida Department of Transportation is also sched- uled to help build the water retention structure on the site. No date has been given for when construction of the water retention structure will begin because an archaeolog- ical survey has to be complet- ed by the state Division of Resources. suer *m "Copyrighted Material Syndicated Content Available from Commercial News Providers" 0 o Obituaries Maude Oween Beecher Mrs. Maude Oween Beecher, 76 of Lake City died Friday morning, February 11, 2005 at Alachua Gen- eral Hospital in-Gainesville. The daughter of the late Dewey Chesser and Lois O'Neal Chesser, Mrs. Beecher has been a resident of Lake City since 1968, coming here' from Miami, Florida. She was a home maker, as well as a loving mother, grandmother and great- grandmother who enjoyed spending time with her family. She loved to knit and painting artwork. Mrs. Beecher is survived by her husband of 39 years, Charles "Chuck" Beecher, Lake City, one son, Jerry Stricklen,. Brooksville, Florida, one daughter, Bonnie Morse (Kenneth), Spokane, WA, one sister, Monteen Scoggins, Pana- ma City, Florida. Four grandchil- dren, four great-grandchildren, as well as numerous nieces and neph- ews also survive. A Memorial service for Mrs. Beech- er will be conducted on Thursday, February 17, 2005 at 11:00 A.M. at Gateway-Forest Lawn Chapel. In lieu of flowers memorial donations may be made to the American Can- cer Society, 2119 SW 16th Street, Gainesville, Florida 32608. Ar- rangements are under the direction of GATEWAY~FOREST LAWN FUNERAL HOME, 3596 South Highway 441, Lake City. 386-752- 1954 Please sign the guestbook at Francis Joseph "F.J." Dicks Mr. Francis Joseph "F.J." Dicks, 88, of Lulu died Monday, February 14, 2005, at the Lake City Medical Center. Funeral arrangements are in- complete at this time but will ,be available after noon today. Arrange- ments are under the direction of GATEWAY-FOREST LAWN FUNERAL HOME, 3596 S. HWY 441, LIke City. (386) 752-1954.. Hendrik Dinkla, Jr. Mr. Hendrik Dinkla, Jr., 87 of Lake City died Saturday evening, February 12, 2005 at the Jenkins Veterans Domiciliary Home in Lake City. A native of Holland, Michigan, Mr. Din-kla moved to Lake City three years ago from Florahome, Fl. Mr. Dinkla was a veteran of the United States Annrmy having served in the South Pacific : - during WWII and was a Lutheran by faith. Mr. Dinkla is survived by one brother, William P. Dinkla (Della), Jacksonville and numerous nieces and nephews. No services are scheduled at this time. Cremation arrangements are under the direction of the GATE- WAY-FOREST LAWN FUNER- AL HOME, 3596 South Highway 441, Lake City. 386-752-1954.- Please sign our-Guestbook at. George William Mr. George William Yaeckel, Sr., 84, of McAlpin died Saturday morning, February 12, 2005 at is home. A native of Brooklyn, New York, Mr. Yaeckel moved to McAl- pin 35 years ago, coming from Mi- ami. Mr. Yaeckel was a Veteran of the United States Navy and of the : Catholic faith. He was retired from " Pan American Air- lines, he enjoyed reading and wood working. Mr. Yaeckel is survived by one son, George W. Yaeckel, Jr., McAlpin, two daughters, Susan Fowler (Rob- ert), Harrod, Ohio, Patti Ferrero (Dr. Frank), Lake City. Eight grandchil- dren, Sgt. Ryan Smith USMC, Twenty Nine Palms, CA., Kimbere- ly Ferrero, Gainesville, Ashley Fer- rero, Francesca Ferrero, Christopher Fefrero, Shawn Ferrero, all of Lake City, George W. Yaeckel, III, and Travis Donald Yaeckel, Apollo Beach, Florida. No services are scheduled at this time. In Lieu of flowers, please make donations to American Cancer Society, 2119 SW 16th Street, Gain- esville, Florida 32608 or Suwannee County Regional Library, 184 Ohio Ave. South, Live Oak, FL 32064. Cremation arrangements are under the direction of the GATEWAY- FOREST LAWN FUNERAL HOME, 3596 South Highway 441, Lake City. 386-752-1954. Please sign the guestbook at. Raymond C. "Ray" Williamson Mr. Raymond C. "Ray" William- son, 58, of Lake City, died Saturday evening in the Lake City Medical Center E.R. following a sudden ill- ness. A native of Madison, Florida, Mr. Williamson had been a resident of Lake City since 1997 having moved here with his family 5 from West Valley, Utah. He was the son of the late Delbert & 'A Eliza Buchanan Williamson. Mr. Williamson served a = mission for the Church of Jesus Christ of Latter Day Saints in the California North Mission Field and was a Veteran having served in the U.S. Marine Corp. He graduated with a B.A. Degree in Criminal Justice from the Florida Atlantic Uni-versity. He was a retired police officer having served in Palm -' * Beach, Osceola and Martin Counties. He then worked for nine '. - years in the Personal Protection Department of the Church of Jesus Christ of Latter Day Saints in Salt Lake City, Utah. In 1997 Mr. Williamson began working with the White Foundation where he was still employed as a Case Manager. Mr. Williamson was a member of the Church of Je-sus Christ of Latter Day Saints Lake City 1st Ward, he was a former Bishop and current Stake High Council Member, and was a faith- ful, lifelong member of the Church. His favorite hobby was his family. He is dearly loved by his wife and family, he was a wonderful hus- band, father and grandfather, "We will miss him, but we know that we will be together again." Mr. Williamson is survived by his wife of thirty years, Susan "Sue" Williamson; his children, Colin Williamson, Billy Williamson, Clin- ton Williamson (Rachael), Mandy Williamson, Stacy Williamson, all of Lake City and Kelly Casazza (Nick) of Clinton, Utah; his granddaughter, Kylie Casazza, Clinton, Utah; his five brothers, Leon Wil-liamson, New Mexico; Albert Williamson, Utah; Jimmy Williamson, Madison, Florida; Tommy William-son, Utah; Wayne Williamson, Utah; and his three sisters, Christine Johnson, Ollie Jones and Myrtle Adams all of Utah. Funeral services for Mr. Williamson will be conducted at 11:00 A.M., Tuesday, February 15, 2005 in the Church of Jesus Christ of Latter Day Saints with Bishop Mark Duren conducting. Interment will follow in the Midway Baptist Church Cemetery in Madison, Florida. The fam- ily received friends at the Church from 4-7 Monday evening. Arrange- ments are under the direction of the DEES FAMILY FUNERAL HOME & CREMATION SERV- ICES, 768 West Duval Street, Lake City. 961-9500. Obituaries are paid advertisements. For details, call the Lake City Reporter's classified department at 752-1293 LAKE CITY BUY IT! SELL IT! FIND IT.! 755 54|O Small and personalized Nutrition and Weight Management Classes every Mon. 7 pm. Call for appointment. Bill Frazier 719-2441. No charge. -bPEDIC PRESSURE RELIEVING IIL SWEDISH MATTRESSES AND PILLOWS [ 1I 1Nd,* ]1d : 1] -l :1r 'i'l l The Furniture Showplace Wholesale Sleep US 90 West (next to 84 Lumber) 752-9303 "Direct Cremation $595* Complete *(Basic services of funeral director and staff, removal fiom 2 l* AAiFUH & CREMATION SEROiC *Honoring all pre-neea plans *Compassionate professional care "Where serving your family isn't just our business, it's our way of life." 768 W. Duval Street Lake City, Florida Debra Parrish Dees (386) 961-9500 Licensed Funeral Director I I SUM 1m; ., LAKE CITY REPORTER, TUESDAY, FEBRUARY 15, 2005 7A NATION & WORLD Final Charles' album swp rammys mk v 4w- a "'Copyrighted Material Pvilb fro Syndicated Contents- -Available from Commercial News Providers ' *~ f a - w - - a - 0 - - ~ * a - F- __ - 0hho or EktI~ 4 O* o o 6 - a - a.B - a - Han a min ut . Our customers receive a Complimentary copy of the Lake City Reporter when they drop off& pickup their cleaning SWhile Su lies Last N&W KiCen DNCO. Now Serving Columbia County 120 Gallon Tank Set & Filled only $129 gal. Seuor CeitizeE Diseaeuti Toll Free 1-877-203-2871 FURNITURE SHOWPLACE Wholesale Sleep Distributors US 90 West (Next to 84 Lumber) Lake City, 386-752-9303 es7 V i6 now ft bm n-noNEIr LFU *OWN [E EGO !AA S) o - Wp - 8 alb - v - I 0 qb.. .qmP 0 4w f"*bqo LAKE CITY REPORTER 5. Page 8A Tuesday, February 15, 2005 HEALTH Trip tips for you and your family P parents have asked : me for tips on travel- ing with children during the upcom- ing Spring Break. Whether you are traveling by car or plane, it pays. to plan __" ahead. t I If your Y child has problems with his *- i ears, like recurrent ear infec- v *:. .-. "'. qB tions,, .. Stephanie check with Sarkis your doc- S. [ .~tor before going on a plane flight. The change in air pressure during the flight may cause pain for children w-ho have chronic difficulties- \xth their ears. Give children gum to chew on takeoff and landing. For S: infants, nurse them or given them a bottle during takeoff and landing. These two activi- ties help reduce pain in chil- dren's ears. Bring snacks and plenty of' water. It is very important to keep kids hydrated, especially during warm weather. Set realistic goals for your trips with children., When on a car ride, you will need to stop more often. If your children act up in the car, find a safe place off an eXit and stop the car and wait. When the inappropriate behavior subsides, continue on your trip. Traveling as a family can be a fun and rewarding expe- rience. It pays to plan ahead! :Stephanie Sarkis PhD is a ? ..Licnu&Jd Mental Health S' 'l Ci S ' 'mail@stephaniesarkis.com or 758-2055. fwu( -b" a mn a~ 'S - * a a - - - q-p "Copyrighted Material - 3 Syndicated Content 0 - --'S Available from Commercial News Providers" no orwwwf bo w~d 4b . a a- - -a * l- -. - a a a - - -~-a. - a - -ao * .~ - .~ ~'- * - "S ~ a-a a a . 0 - "S - - a ___ a - a -~ w - a a- .Ndb Me *Preventive & Curative Medicine *Routinfe Health Maintenance *Gynecological Exam *Counseling fn A D.PH*Physical Exams *Others .jt.,n in C 1D AI H D.'i% 7 "9 6 S Noil accepting New Patients Call for an appoitinuenit 719-6843 comprehensive 0 nI Specia health *'nec , l aluros FREE *Women OB. Nu PREGNANCY TEST 'J 75 440 SW Pe Lak, I ,J.. living in: copic Surgen' 's Primary Health Care rse Practitioner on staff , Dr. Charles Delivery in Lake City 5-9190 rimeter Glen (off SW 47) e City, FL 32025 AVMED BC/BS CIGNA Medicare- Medincatid & Many more Insurances accepted - -:'.- ,. ",:-. '..." '" ,.' HEARING CARE FOR YOUR ENTIRE FAMILY Comprehensive Hearing Evaluations for Adults & Children SDigi"al Hearing Aids .Repair on All Brands *Batteries and Supplies *Assistive Listening Devices Call for information or to get an appointment 386-758-3222 Lake City 386-330-2904 Live Oak I ( ENYE ENTER of North Florida General Eye Care & Surgery B EYE EXAMS CATARACT 'SURGERY GLAUCOMA DIABETES LASERS EDUARDO M. BEDOYA, M.D. Board Certified, American Board of Ophthalmology 917 W. Duval St. Lake City Eye Physician & Surgeon CancerHope will 'U',, Treatment Centers m .m Lake City and Live Oak Ema CancerHope.com Specializing in Oncology since 1989 Comprehensive and Personalized Care Eric C. Rost, M.D. David S.Cho, M.D. Purendra P. Sinha, M.D. Board Certified -All Insurances .-ccepted- ANo Referral Necessary CancerHope of Li, e Oak 1500 Ohio Ae. Norlh Lise Oak.FL 32060 Phone: 386-362-1174 NowAccepting New Patients, General Medicine Women's Health C Lab X-Rav Ultrasound Cat Scan Nuclear Same Day Surgery Southern -I* Medical Group gerynter 404 NW Hall of Fame Drive, Lake City, FL m - PULMONARY CLINIC TREATS ALL RESPIRATORY DISEASES ~ NEW PATIENTS WELCOME ~ M. Choudhury, M.D. 155 NW Enterprise Way Suite A, Lake City Physician Referral 1-800-525-3248 * MicAscopic Vasectomy Reversal Impotence Surgery Specializing in the evaluation and treatment of Male Impotence Surgical and Medical Therapies All patients are given personal and confidential attention. -^*g iiin 4|ikj^^^ on.^ Lak Cty- 72 U Hy 0 es - -0 * Best equipment * Most adaiiuced treatment * Treat all tpcs of cancers SDIMRT PET CT Suwaiinee Valle. Cancer Center 795 S.\\. State Road 47 Lake City, FL 32025 Phone: 386-758-7822 ormarf6m m , w . " "1 o e - qw MWI LAKE CITY REPORTER, TUESDAY, FEBRUARY 15, 2005 9A Bulletin oard Richardson Middle STUDENT PROFILE playing sports and possibly choose a career involving animals. Achievements: First place County Science Fair, Honor Roll, AR Goal parties, Duke Talent Search What do you like best about school? Teachers. friends and most of all the experiments Teacher's comments Chrissie Reichert about student: Chrissie is an awesome student who is Name: Chrissie Reichert always eager and willing to School: Summers learn. Her jolly personality is Elementary extremely contagious, adding Parents: Dr. and Mrs. much joy to the class. Richard Reichert Age: 11 Principal's comments Grade: Fifth concerning student: S Principal: Art Holliday Chrissie is a student you will never see without a smile on' Clubs and/or organiza- her face. She is a delight to tions, both in and out of talk to whether you are an school, to which you adult or student and an awe- belong: Gifted, tennis, some role model for all. -Awana--- Student's comment on What would you like to being selected for 'do when you complete "Student Focus:" I feel your education? Continue privileged that I was selected. - Q ~ 0 ' z * - 0 eci, I - w0 E map f. ft> E U' COURTESY PHOTO Danny Owens, assistant principal (left), Raymond Macatee (right), Steve. Hentzelman, Band Director (right). Students in AB order, - Charley Civis, Sarah Dooley, Alyssia Freeman, Shaquille Jones, Bobby McNeil, Trey Regar and Jonathan Sheider. 'Raymond Macatee has.sin- gle-handedly donated 204 wind instruments, valued at approximately $175,000 and two equipment trailers valued at $5,000 to the secondary schools' band programs in the Columbia County School System. His business partner- ship project is called "Scrap to Music." Ray is not a wealthy man so where does he get the money? From people who donate scrap metal, which he sells and buys instruments for students who need them. His motto: "We provide musical instruments for kids who can't afford them." Raymond said. He also donated $1,700 to the elementary chorus pro- grams, and in 1995 began a $2,500 music scholarship at Lake City Community College. The driving force behind Raymond Macatee is summed up in the following quote: 'True happiness comes only to those who dedicate their lives to the service of others."' This is Raymond's main pur- pose in life. Eastside Elementary For the second consecutive year, Eastside is participating in the "School and Youth Program" for the North Florida Leukemia and Lymphoma .Society. It is important for children to learn that one person can make a difference. School and SYouth involves students, their families and the community in raising funds to research cures and help families with children who have blood can- cers leukemia, lymphoma, Hodgkin's disease and myelo- ,ma. 'Last year, Leukemia took the lives of 24,000 children in the state of Florida alone and it is predicted that this year another 10,000 children will be diagnosed with this dis- ease. Leukemia is the No. '1 killer of children and young adults ages birth to age 20., Eastside is raising the money in the memory .of Jeffrey Allen Zimmerman. Our goals are: i To help the children and, families who have this d i s e a s e To be No. 1 in the district so our school can receive the '- Radio Disney Party. To raise at least $2,000. Last year the goal was $2,000 and with the help of students, friends, neighbors and busi- - -.d m - nesses. The school raised a little over $3,000 and came in fourth in. the district. If you would like to help us you can send your donation (Please make checks payable to the Leukemia and Lymphoma Society) to: Eastside Elementary c/o Betty Radcliff 256 S.E. Beech Street Lake City, FL 32025 Fort White Elementary Fort White Elementary is proud to be hosting its annual Family Reading Night, Thursday. A book fair will be held in the Media Center from 4:30- 8 p.m. The PTO meeting will be held at 7 p.m. in the auditorium. Guest read- ers will be on hand to make this an enjoyable event. Refreshments will also be served. The School Advisory Council Meeting will be held at 6 p.m. in Amy Martin's room. Melrose Park Elementary Melrose Park is working hard on their attendance. The school would like to com- mend the following, classes for having 100 percent in, attendance with no tardies this past week: Ms. Smithy, Ms. Moseley, Ms. Gwynn, Ms.,-Kamback, Ms. Johns, NMs. McAdams, Ms. Lawrence and Ms. Ward. Every Friday is. Spirit Day at Melrose Park. Several classes showed their spirit. These students had red and white shirts. The classes who received ,th spirit stick on Friday. were: Mrs.-Weaver, Miss Smith, Mrs. Domingue, Mrs. Miller, Mrs. Lawrence and I\i s. S. ill.i.\. Mrs. Smith's third-grade class wrote pen pal letters to a 'third-grade class in Dubai, UAE. If you would like to find this find this city on the map, you will need to look for Saudi Arabia. Mrs. Smith's sister-in- law is a third-grade teacher in this. city. They are sending their pictures via e-mail. This is a fun way to use technology in the classroom. Mrs. Wilkinson's. fifth- grade class ate their math. Yes, you heard right. They ate their math lesson. They learned how to show equiva- lent fractions using a Hershey's chocolate bar. The students learned to show how one half equals six- twelfths. Two at a time, the class ate their candy bar, each time using the remainder of the pieces to construct many equivalent fractions. It was a "sweet" lesson and chocolate loads of fun while learning an important lesson. The yearbook has been completed for this school year and sent off for production. Mrs. Wilkinson would like to extend a huge thank you to Mrs. Dempsey and' .Mrs. Gaylord for their outstanding help. Mrs. Dempsey helped construct some pages along with Mrs., Gaylord. On top of that, Mrs. Gaylord helped by' .taking several of the pictures and laying many pages out on her home computer. Thanks to these ladies for helping Mrs. Wilkinson meet her deadline. Stay tuned to find out when this'Summers tradi- tion will be available for pur- chase. Westside Elementary Mrs. Busch's fifth-grade classroom recently participat- ed in a peace project contest. Her students were able to show off their artistic talents and originality. The work of the class really .paid off. The TRTIA Peace Organization recently awarded them with a' check., for $150. Congratulations, class. Epiphany Catholic Epiphany's 2005 Think Sharp team members are Savannah Bowdoin, Casey Kemp, Nigel Merrick, JoAnne Ortiz and Jean Saltivan, the alternate is Jacob Foster. Epiphany students partici- pated in many events in cele- brations of Catholic) Schools Week. The students brought in donations to purchase blan- kets to donate to Catholic Charities. The total amount donated by the students was $200. Students also. brought in fruit to create fruit baskets for Willowbrook ALF and for Avalon. Epiphany's Student Council sold Valentine Grams to stu- dents. All the proceeds from this project will be donated to Catholic Relief Services to benefit the Tsunami victims. Epiphany Lady' Eagles Softball team are preparing for another season. The stu- dents on the 2005 team are Megan Hill,! Arielle Eagle, Chelsey Kahlich, Heather Edehfield, Tiaiia 'Wright, Gabby. Amparo-Anderson, Holly, Crumpton, Julia Stoddard, Taiyuki St. Louis, Gabby Timmerman, JoAnne Ortiz, Jean Saltivan, Holly Saitta, Savannah Bowdoin, Ruth Ruis and Halley Zwanka. The team is lead by Coach Dave Ross and Assistant )Coach Linda Hill., Fort White High Who says reading doesn't say? Ask the 140 students that ranged from ninth to 12th- grade from Fort White High. m *;^ a s -- *Am Fort White High School stu- dents' enjoy pizza at the AR Pizza Party. (From left) Zach Egan, Megan Wilson, Matt Case, Ben Anderson, Justin Doris, Rachael Register, Connor Hayden and Ryan Walters. They were treated to an Accelerated Reader pizza party for their hard work on Feb. 3. The requirements for this party were the completion of all three books, six reading logs and a score of 60 or high- er on their ,AR tests for the third six weeks. The party consisted of 30 pizzas and plenty of soda to go around. It was held in the school's cafete- ria and lasted about 45 min- utes. This party was made pos- sible by the generous donation from the school's library and the SAC committee. Bryan K. Taylor is a 2005 senior at Fort White High. He is 18 years old and has been "wr.. ^.JSS .^ k" COURTESY PHOTO Brian Singleton and Bryan Taylor accepted to the United States Air Force in Colorado Springs, Colorado. He was nominated by Congressman Ander Crenshaw. Bryan will be an Officer and go to pilot school. He is one of 1,200 cadets in the class of 2005. Only 15 percent of applicants are offered an appointment to the Academy. There he will major in Aeronautical Engineering, and will minor in a Foreign Language, proba- bly German. Bryan will be leaving on June 28 and will attend basic training over the summer. In August, classes will begin and he will have a very structured day. The govern- ment pays for his education upon graduation. His extracurricular activi- ties include playing soccer, volunteering and Boy Scouts in Troop 85 located in Lake City. Bryan says he owes everything to his parents, Chuck and Debra Roberts and Leslie Taylor, his grand- parents, siblings and friends. Thank you all for the support. Brian Moses Singleton is a 2005 senior at Fort White High School. He is 18 years old and has earned, two scholarships, one from Bright futures and UF Presidential Scholarship. He has been accepted and plans to attend, the University of Florida in the fall of 2005. Brian plans to major in Civil Engineering and will be attending the step-up pro- gram over the summer, which is a preparation program for minority engineering stu- dents. Brian says when he was young he wanted to be a con- struction worker, which changed into an architect, which made him interested in engineering. He's also inter- ested in Real Estate and Land Development. His extracurricular activi- ties include hanging out with friends, going to the movies, the mall, games, and out to eat. He plans on keeping in touch with all his friends and family. Brian is very excited about starting his career. CAMPUS CALENDAR Tuesday U FWHS Indian JV/V Softball at Chiefland 5/7 p.m.; Indian V Baseball at "- Union County 7 p.m. Wednesday -. ( CCE Volunteer Brunch. -. in cafeteria 8:15'a.m. . .. Five Points Elementary Volunteer Appreciation Melrose Park Elementary PAWS Reading Dogs Program Thursday FWHS Indian Baseball fund-raiser Staff Breakfast in Hastings' Room 7:45 9 a.m; Middle School Dance in cafeteria 3:30- 6:30 p.m. Fort White Elementary Family Reading Night 4:30 - 8 p.m.; School Advisory Council (SAC) meeting 6 p.m.; PTO meeting Niblack Elementary - Readers Theater; Doughnuts for Dads and Muffins for Moms Reading Breakfast in Media Center 7:30 a.m. , Summers Elementary - Volunteer Appreciation reception at 9:30 a.m.; Pre-K classes to downtown Lake City for tour of fire station, police station, post office and Tucker's Restaurant Friday Teacher Workday/ Student Holiday Summers Elementary Chorus will sing at Olustee Festival. Foi i 00l FIRST FEDERAL SAVINGS BANK of FLORIDA r our community, our kids, our future... First Federal Savings Bank of Florida proudly sponsors Newspaper in Education Alp NATION & WORLD ____ lb~~~%t %bl ahm qMw -d "Copyrighted Materiald Syndicated Content Available from Commercial News Providers" - a AM- -*4 DERMATOLOGY BY ANTHONY AULISIO, M.D. Board Certifiea Dermatologist IT JUST ISN'T FAIR If you think that the deadliest form of skin cancer, known as melanoma, just poses a threat to fair- skinned people, be advised that it is even deadlier for African- Americans. This may be partly due to the fact that few dark-skinned people expect it. The fact is that nearly two-thirds of melanomas among African-Americans occur in areas of the body that get little sun exposure, including the feet, palms, and toenails. Other areas that may unexpectedly be the site of melanoma are the inside of the mouth and nose. With this in mind, if you see a suspicious lesion on your body, bring it to the immediate attention of a dermatologist. With early intervention, melanoma has a 95% cure rate. If you would like further information aboqt melanoma, or need to have your skin evaluated for a possible case of cancer, don't hesitate and contact GAINESVILLE DERMATOLOGY & SKIN SUR- GERY at 332-4442 to schedule an appointment. Our office is conveniently located at 114 N.W. 76"' Drive. We are accepting new patients. P.S. African-Americans should examine their skin, from head to toe, monthly, looking for deep-black spots on the skin and deep-black streaks on nails. PW, PL, Tilt, Auto, Advanced Triac, AC Was $28,905 w 22,995 SAVE n2 7$ 3 9 ux r P c s '4 Lincoln Aviator '05 Mercury Grand Marquis GS 2005 Lincoln LS Amterica Onl Rear Wheel Drive Sedan 45 34,995 18,450 Wa 26,880 After all rebanto in line of snaria l APR finna, r. h ImI..... cn D..Inc k ... .. O.ld- .i r .. loaded Was $34 2-.:5 SAVE 12,000 '^aaZa9s '05 Mercury Mountaineer '05 Lincoln Town Car Was $33,55026550 Was $42,570 s34,570 Leather, CD Changer, Loaded, AC Was s22,795 = s20,795 W N '**.l -.. : :. : * "05 Ford F-150 IC. Rad edes '05 Ford F-150 Supercrew Lariat 4x4 599. -a. 3 ,1915 0 .15,.. ____3 Brand New Lincoln Navigator kage. .Ilounronl/. If ------ ..- -conques t rebate~L, Plus Tax, Tag, ITitl adfl$249Q.95 AMIJIfee. -I e-Mt C0 F dIW -V C10 5 :D -6e -X 7-ertified I r COO =.I I it re mm LAKE CITY REPORTER, TUESDAY, FEBRUARY 15, 2005 10A . e Now %Moslem= '55 MUSTANG CTMPE Janin:ml, Z'ter. aws/Locks Cruise sol --- --- --- -- -- -- P-3 1 5 LAKE CITY REPORTER, TUESDAY, FEBRUARY 15, 2005 (I - j- dL ouwt wtor uimor lkut lm,'s,. "Copyrighted Material Syndicated Content Available from Commercial News Providers" PETS- Continued from page 1A favor of pet therapy and cited documented evidence to sup- port its benefits. Hayden said medical stud- ies have shown "people who have pets at home live longer and. healthier than people who don't." If patients welcome pet therapy dogs, he said their presence can only be benefi- cial. "It's got my vote," he said. "When you look at the evi- dence, it's hard to argue the facts." Wisner said by working with North Florida Paws to offer the training, more local dogs with easy-going, kind temperaments can be certi- fied as pet therapy dogs. While the service will be offered at the medical center at least twice a month for now, she said she hopes the fre- quency will soon increase as more dogs receive training and certification. Wisner said a miniature schnauzer is also expected to start making pet therapy vis- MURDER Continued from page 1A .__._..detention -center in seven months. The time of his murder was later established on Jan. 18 at about 9-10 p.m., just hours after ACADEMY Continued from page 1A academy. "At. the beginning, it was kind of just an idea," he said. "It's been a dream since about ninth grade. It was like a roller coaster ... there was so much paperwork, but in the end I figured if it was meant to be, I would get in." Taylor learned he received his appointment on Jan. 28 when the confirmation came from U.S. Rep. Ander Crenshaw's office. "I was honored to be able to nominate this outstanding young man. I am especially, pleased he has received this appointment." stated Crenshaw in a press release. "Bryan has already proven to be an exceptional student, ath- lete and leader. I am confident he will serve our nation with great dedication and valor." "That's a telephone call I will never forget," Taylor said. 'They called.me right before soccer and I played a really good game that night, but I didn't get to score." While attending the Air Force Academy, Taylor said he plans to major in aeronauti- cal engineering and after he graduates, he plans to go to pilot flight training. In the meantime though, he's ready to make a trip to. Colorado Springs to visit the Air Force Academy. "Right now I'm just anxious and ready to go," he said. '"There is an orientation that I'm going to in April for two days." Bryan is the son of Chuck and Debra Roberts of Lake City and Leslie Taylor of Lake City. According to reports, all graduating high school sen- iors interested in attending a U.S. service academy must go through an extensive nomi- nating process. All applicants are required to complete an application, write an essay, and participate in interviews by a committee of community leaders and retired military officers. JUSTIN LANG/La ke City Reporter Certified pet therapy dog Pepi McClead, a Papillon, with Columbia County Senior Services, gets ready to visit another patient at the Lake City Medical Center Monday. its to the medical center by next week. For patient Linda Sirota of Wellborn, herself a dog owner, it was nice to have Pepi brighten her time at the he had been released from jail. According to his arrest report, Razor was homeless and had a South Carolina dri- ver's license. Police have said he left jail \with a wallet and received Sln, from a friend later in the day, but neither have been found. medical center Monday. "I love animals and I think anybody who is sick, if they have an animal coming, in (their room), it just makes them feel better." Few other details have been released so far about Razor or his criminal and personal histo- ry. The murder is Lake City's first in three years, the last being the shooting death of John Michael Thomas on Dec. 9, .2001, .That case, remains, unsolved. Has your water treatment system been checked lately? A professionally trained Culligan Water Erpert will come lo your home and inspect, adjusi and crieck your waler system. Inspect 'n' Check Special Any Make or Model Limited 9 Time Otter!$1- &^ fl Call Your Culligan Waler Specialist Today I 1-800-233-2063 , ..i.rl. lllll. ilu ],, jhi .I.. .n n,,l |I" i, h: ll, ,,,,,, ,. ,,,] ,. ,,'n i.,n l <'.l i ti i[, jh,,,, iTl,, J, r,', l L , O 0I O".u "? .J Choose any Culligan Water I *. Softener or Conditioner and =I Take Advantage of this Low I| Introductory Offer 3 B 1PER MONTH For the first 3 months Call Your Culligan Water Specialist Today CA TOLL FREE SWater 1-800-233-2063 161 1 C, 1 1 p 'C- A- r----'-------- ------I- i Purchase any Culligan'" Water Conditioning System and Receive a I FREE. DRINKING WATER SYSTEM I I I I I I I .1 Eu I I I Call Your Culligan Water Specialist Today In o TOLL FREE I SIsVater" 1 -800-233-2063' I I-I'T"I ". ': 'n .. .. '" .- : .."1*n" a '.j"i'. ni. l'l .'l ..' ...," "*..I.-"'.1.l ." ." : ."' -'1. 1 | I .- .li:, = h,.,...,,i, fj.'l i,] .lr. ,r:, "(.,.I : .,.,a-,.,.. ....,h. I .:,I ....i,. _.y,," L-.-.---- ---.---- CALL TODAY! We have a plan that will fit your needs and budget. J ) 0 U800-233-2063 Q Is Water \ Complete Service on Everything We Sell FREE SALT DELIVERY FREE WATER ANALYSIS trao Gua)d HOU ie'Npirir| i6 jprl ; I 0 li l a irer *nr, vitrm 1 a1.'i-: ' liIl-ie ,irir diil'nrg wdar-r ,;y1f-,Ti, Be'l EBuy 1:,i I rily inr.- Goo HIus ping [ U li, G o l d ".5r1,1 E So ile r 'er WAR Continued from page 1A billion was for aid to U.S. allies. Of the total package for the wars, the vast majority - $74.9 billion was for the Defense Department, with other agencies sharing the rest. Some $12 billion was requested to replace or repair worn-out and damaged equip- ment, including $3.3 billion for extra armor for trucks and other protective gear under- scoring eco- nomic development and to help them create democratic institu- tions. One possible flashpoint with Congress was two $200 million, funds the State Department would control to provide eco- nomic and security aid to unspecified U.S. allies. Welcome to A total of $950 million would be provided for the tsunami- damaged Indian Ocean coun- tries, largely for relief and long- term reconstruction. Also requested was $242 mil- lion for aid for Sudan's war-rav- aged Darfur region. that seemed to have little to do with the war and should have been in Bush's overall budget released last week. Painter's A Timeworn Brush of Fashion a,. ~ ..,~j ~.v'. K Shed Imagine aaLIci lded V -c - and li natlk ivlepatrcd vthe died There it corriniiCdlo SCv'\t ai :1 A1 *v'k -Al'1rlLC I t:Lc rc.. ucd b.,- nL c.'. P- L IiatC C[l[ Lthatt'aLHCl C.[L- petso nalicy and har,atr l*of *Broyhill Four Timeworn Finishes: gathereded Almond Scrubbed Olive Smokey Steel Brick Ivorv ieridqe Furniture 1052 SW MAIN BLVD. Fine Furniture, Accessories and Design for over 30 years. 752-2752 ilitl il~l lijj i~kT Italian Leather by Soft Line , 2 styles, 6 colors to choose from SofaS............. regularly 1,199 Now Only.... $899 Love Seats...regularly 1,149 Now Only..... 799 ALL OTHER LEATHER IN STOCK ON SALE! r ------------------------------------ AlLLamps west Ticketed Price " a0II. I % 0 Bedroom, SI I Lividg vroom ~[ &. Accessories! [ .& Dining Room -*No rainche-ks, no special orders. Discount on in stock merchandise only *No rainchecks, no special orders. Discount on in stock merchandise only 90 Dys ameAsC l v 1429 N. Ohio Ave. North (old Food Lion Building) Live Oak (y 386.364 .1 15 11A I . 60"'T 0% Y--I 12A LAKE CITY REPORTER, TUESDAY, FEBRUARY 15, 2005 WORLD ____ ____________ "Copyrighted Material -- Syndicated Content-,- Available from Commercial News Providers" iruqi h ump. d pr a . a 4 Bayway Carpet & Upholste Residential & Commercial Lake City Live Oak 755-6142 362-2244 ery GUESS WHAT! JUST FOUND.. 'ANY 3 ROOMS " $6900* *Max. 300 sq. ft. per room. LRDR, combo count as 2. Residential only. 6 0Expires 2-28-05 Sofa & Chair Cleaned S8 Soft up to7'. Some fabrics Slightly higher. $8, ,5 Expire2-28-05-J SHall Free with 3 iRooms or more cleaned 11 - - - - ul P quality Tire & Brake S Complete Auto Care Center 1-75 & Exit 414, Ellisville 755-9999 FREE ESTIMATES = C. iX. OIL CHANGE "'FILTER TIRE BALANCE & ROTATION FREE $A95 $195 BRAKE 1391,, i. INSPECTION The Orhopaeic.Ont/O'l/ Edward J. Sambey, M.D. Sports Medicine Non-Surgical Orthopaedics Occupational Medicine Workers' Compensation & Most Insurance Plans Accepted 3 (386) 755-9215 S1 888-860-7050 (Toll Free) Im eiteApinmns / 'al -in -atens 0Acete S - A ft ---------------------- ma LAKE ITY REPORT Section B Tuesday, February 15, 2005 Lake City, Florida Scoreboard 2B Comics 3B Classified 4B FOOTBALL Fowler agrees to buy Vikings MINNEAPOLIS -. Asked about becoming the league's first black owner, Fowler said Monday in a seeming contradiction that he thought it was "a great thing" and not that big a thing. He said race didn't figure in negotiations with McCombs. NFL owners are to meet March 20-23 in Hawaii. League rules require 24 of the 32 owners to approve a sale. The NFL also man- dates that a general partner must put down 30 percent of the cash portion of any franchise purchase. BASEBALL Canseco's book is a hit NEW YORK Jose Canseco's autobiography accusing several top players of steroid use and charging that baseball long ignored performance-enhancing drugs appeared to be a hit on its first day in bookstores. Amazon.com listed "Juiced: Wild Times, Rampant 'Roids, Smash Hits, aid How Baseball'Got Big" as third on its best seller list Monday. Mark McGwire, one of the former teammates Canseco accused of using steroids, issued a written denial. ''The relationship that these allegations por- tray couldn't be further from the truth," McGwire's statement said. In the book, Canseco is an unabashed advocate of performance-enhancing drugs. Compiled from Associated Press reports. Prep schedule TODAY * Columbia High softball at Baker County High, 6 p.m. (JV-4). * Fort White High softball at Chiefland High, 7 p.m. (JV-5) * Columbia High baseball at Suwannee High, 7 p.m. * Fort White High boys basketball vs. Bradford High in the District 4-3A tournament at Santa Fe High, 7:30 p.m. WEDNESDAY * Columbia High tennis vs. Forest High, 4 p.m. * LCCC baseball at Polk CC, 5 p.m. * Columbia High boys basketball vs. Paxon School in the District 6-4A tournament at Fleming Island High, 6 p.m. THURSDAY * LCCC baseball vs. North Florida CC, 2:30 p.m. * Columbia High boys tennis vs. Buchholz High, 3:45 p.m. * Fort White High softball vs. Union County High, 7 p.m. (JV-5) FRIDAY * Columbia High tennis at Baker County High, 3 p.m. * Columbia High baseball at Madison County High, 4 p.m. * Fort White High softball at Bradford High, 7 p.m. (JV-5) * Columbia High softball vs. Fleming Island High, 7 p.m. S(JV-5) SATURDAY * Columbia High wrestling in Region 1-2A tournament at Crestview High, Noon SUNDAY * LCCC baseball at Pasco- Hernando CC, 2 p.m. Jamit -~t IaItmyt- 50- *a 4 S.'- "Copyrighted Material _ S Syndicated Content Available from Commercial News Providers"' VAWe - - ~ - 0 First step Columbia is No. seed at district By TIM KIRBY tkirby@lakecityreporter. com Columbia High basketball enters the District 6-4A tour- nament, as the No. 2 seed. While the Tigers lost out on a first-round bye, their half of the bracket may be better. Columbia, (17-8) plays Paxon School at 6 p.m. Wednesday. Other opening- round games are No. 3 Lee High vs. No. 6 Middleburg at 4 p.m. and No. 4 Forrest High vs. No. 5 Fleming Island High at 8 p.m. Fleming Island is hosting the tournament. Top seed Ridgeview plays the Forrest/Fleming Island winner at 8 p.m. Friday. Columbia's semifinal oppo- nent would be the Lee/Middleburg winner at 6 p.m. The district final is 7:30 p.m. Saturday. "One of those two (Ridgeview, Forrest) will not make the playoffs, and they are two pretty good teams," CHS head coach Trey Hosford said. "Even though we got the No. .2 seed, I like our draw." . Columbia found out last year being a higher seed does not guarantee success. "Going into the tourna- ment, we've got some guys who have been there and tast- ed defeat early," Hosford said. CHS continued on page 2B TIM KIRBY/Lake City Reporter Columbia High basketball coach Trey Hosford (front) and starters Alvin Bradley, Justin Rayford, Byron Shemwell, Kendric Williams and Antwan Julks (from left) watch the introduction of the opponents at a recent game. Indians look to play spoilers MARId SARMENTO/Lake Citty Reporter Fort White High players receive instructions from coach Charles Moore (center). By MARIO SARMENTO msarmento@lakecityreporter.com The Fort White High boys basketball team is seeded sixth entering tonight's open- ing game of the District 4-3A tournament, but Charles Moore is expecting a battle. "I feel confident that we can go in and pull off a big upset," Moore said. The Indians face No. 3 seed Bradford High today at 7:30 p.m. in the second game at Santa Fe High. Fourth-seeded Interlachen High takes on fifth-seeded Keystone Heights High in the first game of the night at 5 p.m. Top seed Santa Fe and No. 2 seed Union County High have byes in the opening round. Bradford swept both meet- ings from the Indians this sea- son, 64-46 on Jan. 13 and 87-77 at home on Feb. 1, but Moore thinks the latter meeting may be more indicative of how tonight's game will go. "We didn't play them that tough when we went to their place," Moore said. "But we played them real tough when HOOPS continued on page 2B Timberwolves win with Clark juggling lineup By TIM KIRBY tkirby@lakecityreporter. corn Lake City Community College's baseball returned the favor to Darton College, beating the Albany, Ga., school 6-2 on its home field Sunday. Darton knocked off the'Timberwolves in Lake City on Saturday. Lake City jumped out with three runs in the first inning. Stephen Barnes allowed one hit through five innings, but Darton scored two unearned runs in the fourth. Lake City got one run back in the fifth inning and added a pair of insurance runs in the sixth. The only hit off Barnes was a bloop single in the fifth inning, but he helped shoot himself in the foot in the fourth inning by making two of three consec- utive errors by LCCC. A hit batter sent in one run and another scored on a sacrifice fly. Barnes, who struck out five and walked one in improving to 2-1, left with a blister in the sixth inning. Raleigh Evans relieved with a 2-0 count and struck out the batter. He went four innings with two hits, two . walks and five strikeouts to get the save. "Raleigh was scheduled to start on Wednesday, but I thought we needed a win," LCCC head coach Tom Clark said. Lake City's first-inning rally came with two outs. Chris Petrie doubled, and Brandon Hall scored him with a single. Mark Davis singled and Augustin Montanez drove in both runs with a double. In the fifth inning, Petrie singled and was forced by Davis. Walks to Montanez, Stephen Rassel and Travis Jones produced the run. In the sixth inning, both Matt Dallas and. Petrie singled and stole second. Hall brought them home with a double. Dallas, who was moved to the lead- off spot, had two hits. Petrie had three hits, including two off lefties. Luis Sanchez also singled for the 'Wolves. 'We had no hits in the last three innings and that is a minus for us with the way the bullpen's pitching," Clark said. "On Saturday, we did not score any runs from the seventh to the 10th inning." Catcher Hall has been injured and relegated to DH. That has moved Davis to first, Rassel to left field the third position he has played this sea- son, Jones to center field and Avery Johnson, who has been struggling at the plate, out of the lineup. "Petrie, Hall, Davis and Dallas are coming on pretty strong and Montanez is starting to hit," Clark said. "Our other catchers are doing a good job defensively, but they do not have a hit. I like to hit up and down the tj lineup and we are not doing that right now." The 'Wolves play at Polk Community College at 5 p.m. Wednesday. Brian Schlitter will start, if he is recovered from being hit by a line drive on Friday. North Florida Community College visits Thursday for a 2:30 p.m. game and will face Duente Heath. Barnes will return to the mound Sunday for a 2 p.m. road game at Pasco-Hernando Community College. Lady Timberwolves softball Lake City Community College's softball team won one of three games at the Triple Crown Classic in St. Augustine over the weekend. Lake City fell to Hillsborough 4-1, despite a two-hitter thrown by Jenna LCCC continued on page 2B to state LAKE CITY REPORTER, TUESDAY, FEBRUARY 15, 2005 SCOREBOARD TELEVISION TV sports Today MEN'S COLLEGE BASKETBALL 7 p.m. ESPN Indiana at Ohio St. ESPN2 Connecticut at Providence 9 p.m. ESPN Ki ni .'l., .11 ..,,uli Carolina NBA 8 p.m. NBA TV New Jersey at Minnesota SOCCER 2:5 p.m. ESPN2 Exhibithio, FIFA/UEFA, Football for HIapte, Shevehenka XI vs, Ronaldinho XL, at Bsrdonla, Sulan Pro Bowl At Honolulu NFC 0 10 14 3 27 AFC 14 14 0 10 38 First Quarter AFC-Harrison 62 pass from Manning (Vinatieri kick), 8:33. AFC-Ward 41 pass from Manning (Vinatieri kick), 2:49. Second Quarter NFC-Westbrook 12 run (Akers kick), 12:09. AFC-Ward 39 kick return (Vinatieri kick), 12:01. AFC-Gates 12 pass from Manning (Vinatieri kick), 5:50. NFC-FG Akers 33, 1:41. Third Quarter NFC-Holt 27 pass from Vick (Akers. A-59,225. NFC First downs 26 Total Net Yards 492 Rushes-yards 27-155 Passing 337 Punt Returns 0-0 Kickoff Returns 5-136 Interceptions Ret 1-0 Comp-Att-Int 24-48-3 Sacked-Yards Lost 2-16 Punts 1-59.0 Fumbles-Lost 1-0 Penalties-Yards 3-28 Time of Possession 35:34 AFC .15 343 27-120 223 1-7 6-165 3-5i 12-22-1 2-13 2-42.5 1-1 2-1015. -1.24. \0l : L4-24-1-205, H.1-a '-'.i Aft. M'hr,,ing 6-10-0-130, I r-7e .-. .*'.. r .j1h i l-4:!). AUTO RACING Daytona 500 qualifying Sunday At Daytona International Speedway Daytona Beach (Car number in parentheses) 1. (88) Dale Jarrett, Ford, 188.312 mph. 2. (48) Jimmie Johnson, Chevrolet, 188.170. 3. (24) Jeff Gordon, Chevrolet, 188.155. 4. (29) Kevin Harvick, Chevrolet, 187.915. 5. (01) Joe Nemechek, Chevrolet, 187.837. 6. (10) Scott Riggs, Chevrolet, 187.758. 7. (11) Jason Leffler, Chevrolet, 187.715. 8. (97) Kurt Busch, Ford, 187.699. 9. (21) Ricky Rudd, Ford, 187.414. 10. (38) Elliott Sadler, Ford, 187.398. 11. (36) Boris Said, Chevrolet, 187.122. 12. (45) Kyle Petty, Dodge, 186.974. 13. (23) Mike Skinner, Dodge, 186.753. 14. (16) Greg Biffle, Ford, 186.587. 15. (9) Kasey Kahne, Dodge, 186.501. 16. (5) Kyle Busch, Chevrolet, 186.486. 17. (42) Jamie McMurray, Dodge, 186.397. 18. (14) John Andretti, Ford, 186.324. 19. (31) Jeff Burton, Chevrolet, 186.270. 20. (0) Mike Bliss, Chevrolet, 186.262. 21. (2) Rusty Wallace, Dodge, 186.150. 22. (19) Jeremy Mayfield, Dodge, 186.143. 23. (6) Mark Martin, Ford, 186.123. 24. (18).-Bobby Labonte, Chevrolet, 186.112. 25. (99) Carl Edwards, Ford, 186.047. 26. (4) Mike Wallace, Chevrolet, 185.908. 27. (22) 185.793. 28. (20) 185.701. 29. (12) 185.659. 30. (07) 185.636. Scott Wimmer, Dodge, Tony Stewart, Chevrolet, Ryan Newman, Dodge, Dave Blaney, Chevrolet, 31. (1) Martin Truex Jr., Chevrolet, 185.575. 32. (33) Kerry Earnhardt, Chevrolet, 185.502. 33. (15) Michael Waltrip, Chevrolet, 185.448. 34. (40) Sterling Marlin, Dodge, 185.445. 35. (41) Casey Mears, Dodge, 185.300. 36. (25) Brian Vickers, Chevrolet, 185.239. 37. (49) Ken Schrader, Dodge, 185.109. 38. (7)'Robby Gordon, Chevrolet, 184.911. 39. (8) Dale Earnhardt Jr., Chevrolet, 184.888. 40. (00) Kenny Wallace, Chevrolet, 184.703. 41. (27) Kirk Shelmerdine, Ford, 184.665. 42. (09) Johnny Sauter, Dodge, 184.528. 43. (37) Kevin Lepage, Dodge, 184.400. 44. (66) Hermie Sadler, Ford, 184.211. 45. (73) Eric McClure, Chevrolet, 183.963. 46. (17) Matt Kenseth, Ford, 183.494. 47. (77) Travis Kvapil, Dodge, 183.415. 48. (92) Stanton Barrett, Chevrolet, 183.098. 49. (13) Greg Sacks, Dodge, 183.024. 50. (32) Bobby Hamilton Jr., Chevrolet, 182.990. 51. (89) Morgan Shepherd, Dodge, 182.789: 52. (55) Derrike Cope, Chevrolet, 182.275. 53. (34) Randy LaJoie, Chevrolet, 181.159. 54. (52) Larry Gunselman, Ford, 178.409. 55. (93) Geoffrey Bodine, Chevrolet, 177.085. 56. (80) Andy Belmont, Ford, 174.683. 57. (43) Jeff Green, Dodge, did not finish. ASEETB'I'ALL NBA standings EASTERN CONFERENCE Atlantic Division W L Pct GB Boston 26 26 .500 - Philadelphia 26 26 .500 - New Jersey 22 29 .431 3'1 Toronto 21 31 .404 5 New York 20 32 .385 6 Southeast Division W L Pct GB' Miami 39 14 .736 - Washington 30 20 .600 7%A Orlando 27 24 .529 11 Charlotte 10 39 .204 27 Atlanta 10 39 .204 27 Central Division W L Pct GB Detroit '30 19 .612 - Cleveland 29 20 .592 1 Chicago 24 23 .511 5 Indiana 24 26 .480 6' Milwaukee 20 28 .417 9%' WESTERN CONFERENCE Southwest Division W L Pct GB San Antonio 40 12 .769 - Dallas 33 16 .673 5% Houston 31 21 .596 9 Memphis 30 22 .577 10 New Orleans 10 41 .196 29% Northwest Division W L Pct GB Seattle 35 14 '.714 - Minnesota 25 27 .481 11%' Denver 23 28 .451 13 Portland 21 29 ..420 14%k Utah 17 33 .340 18'% Pacific Division : W L Pct GB Phoenix 40 12 .769 - Sacramento 33 18 .647 6%' LA. Lakers 25 24 .510 13 % LA Clippers 23 28 .451 16'k Golden State 14 37 .275 25k% Sunday's Games Miami 96, San Antonio 92 Chicago 87, Minnesota 83 Cleveland 103, LA. Lakers 89 Sacramento 104, Boston 100 Indiana 76, Memphis 73 Toronto 109, LA Clippers 106 New York 102, Charlotte 99 Orlando 97, New Orleans 94 New Jersey 94, Denver 79 Dallas 95, Seattle 92 Houston 81, Portland 80 Phoenix 106, Golden State 102, OT Monday's Games (Late Games Not Included) Philadelphia 106, New York 105 Portland 80, Charlotte 77 S, MilUvukeeatD.etroit () Washington at New Orleans (n) Utah at Phoenix (n) Today's Games LA Clippers at Orlando, 7 p.m. Denver at Atlanta, 7:30 p.m. New Jersey at Minnesota, 8 p.m. Sacramento at Chicago, 8:30 p.m. Washington at Houston, 8:30 p.m. Utah at LA Lakers, 10:30 p.m. Dallas at Golden State, 10:30 p.m. LCCC Johns River Community gia 9-8. Kristin Oldham started Continued from page 1B College 7-5. Kalie Ellis was the and Kopperson took the loss winning pitcher., in relief. Ellis also pitched. Andrea Gonzalez and Gonzalez had a three-run dou- Kopperson. Lauren Beidiger were both ble and Beidiger was 3-for-4. The Lady Timberwolves 2-for-3. "The team is starting to play bounced back to beat Mid- Lake City .lost 'to eventual much better," coach B.J. Florida Conference foe St. tournament champion Geor- Hodges said. HOOPS clicked as a team on defense," distributor and primary ball- Continued from page 1B Moore said. "We score points, handler on the team. but if we can just get the Pinello was the Indians' defense to click who knows leading rebounder during the they were down here. The how far we can go?" season, and at 6-foot-2, he is game wasn't decided until the On offense, the Indians rely the tallest player on the roster. last two minutes. And we on Antwan Ruise and Joey Moore has also gotten solid missed free throws at the end, Pinello, their top two scoring contributions from his role and they made their free threats this season. players. throws." "Antwan came on late "Matt Acosta and Jeremy In the last meeting, the because of eligibility, but he Harrell gave us a lift coming Tornadoes' Paris Ruise scored and Joey have really clicked off the bench this season," 49 points on 20-31 from the together as a unit," Moore Moore said. He also cited jun- field, said. "And the other .guys ior varsity call-ups Robert For the Indians to win, they seem to be working together Jammer and Justin Pinello for will have to play solid defense also. Offfensively, we seem to giving the team "a lot of posi- and limit their turnovers, be playing team ball. We're tive minutes." which has been the bane of sharing the ball." The Indians were 8-16 (1-9 their season, Owen McFadden will also in District 4-3A) during the "We still haven't really be a key player as the main regular season. CHS Continuedfrom page 1B "Hopefully, we will go into it knowing it is a new season and we won't look past anyone. "Paxon can play loose and free. They have nothing to lose. Tli- pressure is on us. We have to play with confi- dence, and we should be OK." It took overtime for Columbia to beat Paxon, 72-69, in Lake City in mid-January. The Tigers won 52-45 in Jacksonville two weeks later, and had control of the game for all of the fourth quarter. "In the first one, we played man pretty much the entire game," Hosford said. "We pressed a lot and they got a lot of easy baskets. The shot 65 percent (32 for 49). The second game, we went zone from the second possession and they shot 13 for 36. We will probably show a lot of zone Wednesday." Zone is about all Columbia sees from district opponents and Hosford expects Paxon to pack it in. "The thing about going against a zone is you can't set- tle for 3-pointers," Hosford said. "Most teams playing a zone want you to take that early 3. I would much rather take the ball inside and get an inside-out passing game going. You not only want to go inside, but to the high post. That is the most dangerous spot against a zone." Hosford said Columbia cen- ter Antwan Julks has stepped up his play and is good at find- ing an open shooter. For the last six games, Julks has aver- aged 10.5 points per game and 8.2 rebounds. "I feel like our guards can go head to head with anybody in the district and, with a scor- ing presence inside, it causes Croft places fourth in state weightlifting finals From staff reports Columbia High's Marie Croft earned team points in the Florida High School Athletic Association Girls Weightlifting Finals at DeLand High on Saturday. Croft placed fourth in the 101-pound weight class with a 105 bench press, 120 clean and jerk, and a 225 total. Jenna Payne, who quali- fied in the 110-pound weight class, finished in a tie for 10th. Payne lifted 100-130- 230. Spruce Creek High LM. * mm LM C L. crushed the competition, scoring 47 team points. Oviedo High and Lakewood Ranch High tied for second with 13 points. 'They both had a rough start, only getting their first attempt on the bench press,"' coach Kent Maugeri said. "I'm not sure if they were too nervous due to the fact it was their first time lifting at a state championship. They didn't let the bench press affect them for the clean and jerk. 'They both did well and I am very proud of them." $ 0 0 *0 a) U U - *0 C,) C') zl .5 m I-O 0) E E 0 E 0 LM 4- *) n JS /r I/ teams problems guarding up," Hosford said. "We have also out-rebounded six of our last seven opponents." Hosford said guard Kenneth Williams is also play- ing well. At the team's Free Throw Shoot-around fund-rais- er, Williams made 477 of 500 (95 percent), including his last 100 in a row. "Kenny doesn't make a lot of mistakes on offense or defense," Hosford said. "In his last seven games, he is averag- ing over 10 points and has two turnovers, and that is playing 20-25 minutes per game." Among the starters, Kendric Williams leads the Tigers at 13.6 points per game and he is averaging 4.2 rebounds. Alvin Bradley is. averaging 10.7/6.2; Byron Shemwell's numbers are 8.1/3.3; Justin Rayford aver- ages are 5.4/3.5. Overall, Julks is 5.8/5.5. POLLS AP Top 25 The top 25 teams in The Associated Press' men's college basketball poll, with first-place votes in parentheses, records through Feb. 13, total points and last week's ranking: Record Pts Pvs 1. Illinois (72) 25-0 1,800 1 2. Kansas 20-1 1,710 3 3. Kentucky 19-2 1,592 5 4. North Carolina 20-3 1,576 2 5. Wake Forest 21-3 1,553 6 6. Boston College 20-1 1,365 4 7. Duke 18-3 1,348 7 8. Oklahoma St. 19-3 1,329 10 9. Syracuse 22-3 1,219 8 10. Arizona 21-4 1,140 12 11. Michigan St. 17-4 1,008 13 12. Louisville 21-4 965 9 13. Gonzaga 19-4 889 14 14. Utah 21-3 827 15 15. Washington 20-4 811 11 .16. Alabama 19-4 737 17 17. Pittsburgh 17-4 717 18- 18. Connecticut 15-6 602 19 19. Pacific 20-2 360 24 20. Wisconsin 16-6 342 20 21. Oklahoma 17-6 263 16 22. Maryland 15-7 231 - 23. Charlotte 17-4 225 - 24. Cincinnati 18-6 130 21 25. Villanova 14-6 118 22 Others receiving votes: Florida 105, Georgetown 48, Texas 46, Texas Tech 46, DePaul 45, Old Dominion 44, Mississippi St 33, Nevada 29, Notre Dame 28, Georgia Tech 27, S. Illinois 21, Wichita St. 21, Vermont 19, Memphis 7, Wis.-Milwaukee 7, Miami 6, George Washington 5, St. Mary's, Cal. 2, Texas A&M 2, Holy Cross 1, Minnesota 1. Top 25 schedule Today's Games No. 3 Kentucky at South Carolina, 9 p.m. No. 5 Wake Forest at Miami, 7 p.m. No. 18 Connecticut at Providence, 7p.m. No. 25 Villanova vs. Bucknell, 7:30 p.m. Wednesday's Games No. 1 Illinois at Penn State, 8 p.m. No. 4 North Carolina vs. Virginia, 7 p.m. No. 6 Boston College vs. Rutgers, 7:30 p.m. No. 11 Michigan State vs. Minnesota, S 7p.m. No. 16 Alabama vs. Arkansas, 8 p.m. No. 19 Pacific vs. UC Santa Barbara, 10p.m. 4 No. 20 Wisconsin vs. Michigan, 9 p.m. No. 21 Oklahoma vs. Nebraska, 8 p.m. No. 22 Maryland at NC State, 9 p.m. No. 23 Charlotte vs. DePaul,.p.m. No. 18 Connecticut at Rutgers, 6 p.m. No. 19 Pacific vs. Texas-El Paso, Mid. No. 21 Oklahoma at Kansas State, 1:30 p.m. S No. 22 Maryland at Virginia, 3:30 p.m. No. 23 Charlotte at Tulane, 8 p.m. No. 24 Cincinnati vs. Alabama- Birmingham, 4 p.m. USA Today/ESPN poll The top 25 teams in the USA Today- ESPN men's college basketball poll: Record Pts Pvs 1. Illinois (31) 25-0 775 1 2. Kansas 20-1 735 3 3. Kentucky 19-2 681 5 4. North Carolina 20-3 671 2 5. Wake Forest 21-3 669 6 6. Boston College 20-1 604 4 7. Oklahoma State 19-3 584 10 8. Duke 18-3 541 8 9. Syracuse 22-3 536 7 10. Michigan State 17-4 482 12 11. Arizona 21-4 477 13 12. Louisville 21-4 426 9 13. Washington 20-4 365 11 13. Utah 21-3 365 15 15. Pittsburgh 17-4 352 15 16. Gonzaga 19-4 297 17 17. Alabama 19-4 284 19 18. Connecticut 15-6 265 14 19. Pacific 20-2 191 24 20. Wisconsin 16-6 138 21 21. Cincinnati 18-6 103 20 22. Oklahoma 17-6 92 18 23. Charlotte 17-4 69 - 24. Florida 15-6 59 - 25. Texas Tech 15-6 49 23 Others receiving votes: Maryland 48; Texas 40; DePaul 34; Wichita State 20; Villanova 19; Georgetown 16; Old Dominion 15; Southern Illinois 15; UAB 12; Notre Dame 8; Mississippi State 7; Nevada 7; George Washington 6; Georgia Tech 4; Oregon State 4; Air Force 3; Iowa State 2; Miami (Ohio) 2; Western Kentucky 2; Vermont 1. of Gas with I ree Maj or Rep El 1W I- 12/1 Nationwide Warr i El 4 LAKE CITY REPORTER, TUESDAY, FEBRUARY 15, 2005 3B >1 e^3 -dm - I u~ft I -- a -4 4 4- -.: q= 4lo- w bpp404 ~ ,.,- - do *.4 r *MOM e w two 74ip 1ow -- "Copyrighted M ^*.Syndicated Co ^Available from Commercial VjAM t n01 GNO I A,- - . material intent 5, 4'a Ai News Providers", 1" I : U N , - m 0,840 *I i i.A 401-400-b a Aodw Um o b d -bw -n ow Ib 4m 40 * 000 * -~ .. * ~ 4 0000 * AM *AM 0 mob ASM - 0 0 0 * 0e S * 401Mas a ~ ~ 4ma. 0- 0 00 0 0.0 as a 5* 0 *'.0 ~ 0 a *m& 4 0*41b. 0100 am o 0 af itam m 0m a w .4 *Me * - * ..- 0 0 tb Ow ~L7 .o 0- 40 4w Q aMe 0 o g * ** * 4b IU and 41b 4000 qD iYaot LAKE CITY REPORTER, TUESDAY, FEBRUARY 15, 2005 Legal INVITATION TO BID BID NO. 2005-A SURPLUS PORTABLE BUILDINGS please be advised that Columbia County desires to accept sealed bids on four sur- plus portable buildings. Bids will be ac- cepted through 2:00 P.M. on March 9, 2005. All bids submitted shall be on the form provided. Specifications and bid forms may be ob- tained by contacting the office of the Board of County Commissioners, Co- lumbia County, 135 NE Hernando Street Room 203, Lake City, Florida 32056- 1529 or by calling (386) 758-1005. Co- lumbia County reserves the right to re- ject any/and all bids to accept the bid in the County's best interest. Dated this 16th day of, February 2005. Columbia County Board of County Commissioners Jennifer Flinn Chair Person February 16, 23, 2005 IN THE CIRCUIT COURT OF THE THIRD JUDICIAL CIRCUIT IN AND FOR COLUMBIA COUNTY, FLORI- DA SCIVILACTION CASE NO. 2004-526-CA DIVISION MATRIX FINANCIAL SERVICES CORPORATION, Plaintiff JORGE L. GUERRA, et al, Defendantss). NOTICE OF FORECLOSURE SALE NOTICE IS HEREBY GIVEN pursuant to a Final Judgment of Mortgage Fore- closure dated February 08, 2005 and en- tered in Case NO. 2004-526-CA of the Circuit Court of the THIRD Judicial Cir- cuit in and for COLUMBIA County, Florida wherein MATRIX FINANCIAL SERVICES CORPORATION is the Plaintiff and JORGE L. GUERRA; KENDILYN S. GUERRA; CITIFINAN- CIAL EQUITY SERVICES, INC.; TENANT #1 N/K/A CHARLENE COU- CHAN are the Defendants, I will sell to the highest and best bidder for cash at FRONT STEPS OF THE COLUMBIA COUNTY COURTHOUSE at 11:00 AM, on the 9th day of March, 2005, the following described property as set4forth in said Final Judgment: LOT 13, PINE HAVEN, ACCORDING TO. THE PLAT THEREOF, AS RE- CORDED IN PLAT BOOK 6, PAGES 138 THROUGH 139, OF THE PUBLIC RECORDS OF COLUMBIA COUNTY, FLORIDA. TOGETHER WITH A MOBILE HOME LOCATED THEREON AS A RERMA- NENT FIXTURE AND APPURTE- NANCE THERETO. A/K/A Rural Route 27 Box 248013, Lake City, FL 32024 WITNESS MY HAND and the seal of this Court on February 9th, 2005. P. DEWITT CASON Clerk of the Circuit Court by:-s- J. MARKHAM Deputy Clerk 01550887 February, 15, 22, 2005 IN THE CIRCUIT COURT OF THE, THIRD JUDICIAL CIRCUIT, IN AND FOR COLUMBIA COUNTY, FLORI- DA Case No: 05-40-DR Division: JUSTINE NICOLE SLOCUM, Pentioner ' tri, \\ILLIAM .iOSEPH PATTON . Respondent. NOTICE OF ACTION FOR DISSOLU- TION OF MARRLAGE TO \ ILLLAM IOSEPH P-TTOON 4115 Alpine Dr. Gainesville, FL YOU ARE NOTIFIED that an action has been filed against you and that you are required to serve a copy of your written defenses, if any, to it on JUSTINE NIC- OLE SLOCLrM whose address is 816 N\V ["th \Ve. Gainesville,,FL 32609, on or before 2/20/05, and file'the origi- nal vih the clerk ,:,t this Court at P.O. Box _2069. Like Cirt. FL 32056 before service on Petitioner ori immediately thereafter. If you fail to do so, a default may be entered against you for the relief demanded in the petition, Copies of all court documents in this' case, including orders, are available at. the Clerk of Circuit Court's office. You, may review these documents upon re- quest. You must keep the Clerk of the Circuit Court's office notified of your current address. (You may file Notice of Cur- rent; Dated January 20, 2005 P. DEWITT CASON CLERK OF THE CIRCUIT COURT . by:-s- MARIA BONESIO Deputy Clerk I Paula Huber, a nonlawyer, located at 24602 NW 122 Ave. Alachua, FL 32615, 386-454-2378 helped JUSTINE NICOLE SLOCUM who is the peti- tioner, fill out this form. 01550253 January 25, 2005 February 1, 8, 15, 2005 IN THE CIRCUIT COURT OF THE THIRD JUDICIAL CIRCUIT, IN AND FOR COLUMBIA COUNTY, FLORI- DA CASE NO.: 03-595-CA GREEN TREE SERVICING, LLC f/k/a 'GREEN TREE FINANCIAL SERVIC- ING CORP. 4625 River Green Parkway Duluth, GA 30096 Plaintiff, v. WILL E. CRAY, Defendant. NOTICE OF SALE NOTICE IS HEREBY GIVEN THAT, pursuant to Plaintiff's Final Judgment Of Foreclosure and Re-Establishment of Note entered in the above-captioned ac- tion, I will sell the property situated in Columbia County, Florida, described as .follows, to wit: Lot 19, Pine Ridge according to the map or plat thereof as recorded in Plat Book 4, Pages 102 and 102 A, Public Records of Columbia County, Florida. TOGETHER WITH that certain 1997 48 x 24 Springhill Mobile Home: VIN #GAFLV34A/B70324-SH21 at public sale, to the highest and best bidder, for cash at the Columbia County Courthouse, Lake City, Florida, at 11:00 a.m., on the 9th day of March, 2005 Clerk of the Circuit Court By: J. Markham J. MARKHAM Deputy Clerk 03524110 February, 15, 22, 2005 Legal IN THE CIRCUIT COURT OF THE THIRD JUDICIAL CIRCUIT, IN AND FOR COLUMBIA COUNTY, FLORI- DA. Case No: 05-071 DR Division: MARILYN MARIE FAVORITE Petitioner, ALAIN CARL LEBRUN Respondent. NOTICE OF ACTION FOR PETITION FOR NAME CHANGE MINOR CHILDREN) TO: ALAIN CARL LEBRUN HOLLYWOOD, FLORIDA YOU ARE NOTIFIED that an action has been filed against you and that you are required to serve a copy of your written defenses if any, to it on MARILYN MARIE FAVORITO whose address is 3112 SW HERLONG ST. FT. WHITE, FL 32038 on or before MARCH 4, 2005, and file the original with the Clerk of' this Court at 173 Supremel Court Ap-. P. DEWITT CASON Clerk of the Circuit Court by:-s- MARIA BONESIO Deputy Clerk 01550730 February 8, 15, 22,2005 March 1, 2005 IN THE CIRCUIT COURT OF TI THIRD JUDICIAL CIRCUIT, IN A' FOR COLUMBIA COUNTY, FLOOR DA CASE NO.: 05-08-CA GREEN TREE SERVICING, LLC f/k/ GREEN TREE FINANCIAL SERVI ING CORP. 1400 Turbine Drive Rapid City, SD 57703 Plaintiff, v. WILLIE R. BARNER; DEBORA BARNER; and STATE EMPLOYEES CRED UNION, Defendants. NOTICE OF ACTION TO: WILLIE R. BARNER DEBORAH BARNER YOU ARE NOTIFIED that a foreclosu action has been filed against you on t following described property: Lot 1, Block C, NEW HOPE ESTATE UNIT 2, a subdivision according to th plat thereof recorded in Plat Book Page 93, Public Records of Columb County, Florida. TOGETHER WITH that certain 1996 \ 2s Dnast' Mlobile Home. Serial N SHSI02S-4GL&R and you are required t:. file a .miten r sponse with the Court and serve a cop of your rrten defenr:e, ifany,'tbo it i Timothy D. Padgett, Plaintiff's attome whose address is 2810 Remington Gree Circle, Tallahassee, FL 32308, at lea thirty (30) days from the date of fir publication or on or before March 2 2005, and file the original with the cle: of this court either before service o Plaintiff's attorney or immediately their after; otherwise, a default will be entered against you for the relief demanded the complaint. Dated this 9th day of February, 2005. CLERK OF COURT By: -s- J. Markham J. MARKHAM Deputy Clerk. 01550894 February 15,22, 2005 Registration of Fictitious Names We the undersigned, being duly swor do hereby declare under oath that th names of all persons interested in th business or profession carried on undi the name of: The Appraisal' Store at 490 NW Sprin Hollow Blvd., Lake City, FL 32055. Contact Phone Number: 386-752-321 and the extent of the interest of each a follows: NAME: Douglas G. Vodnansky EXTENT OF INTEREST: 100%. by: -s- Douglas G. Vodnansky STATE OF FLORIDA COUNTY 0 COLUMBIA Sworn to and subscribed before me th: 10th day of February, A.D. 2005 by:,; -s- Kathleen A. Riotto Notary 03524105 February 15. 2005 P- U'' . 16 Ajh HE ID RI- a C- IH Irr Legal IN THE CIRCUIT COURT OF THE THIRD JUDICIAL CIRCUIT IN AND FOR COLUMBIA COUNTY, FLORI- DA CASE NO: 05-06-CA MORTGAGE ELECTRONIC REGIS- TRATION SYSTEMS, INC., a Nominee for Novastar Mortgage, Inc., Plaintiff, vs. KURT STEPHEN CONKLIN a/k/a KURT S. CONKLIN, UNKNOWN SPOUSE OF KURT STEPHEN CON- KLIN a/k/a KURT S. CONKLIN, MORTGAGE ELECTRONIC REGIS- TRATION SYSTEMS, INC. (MIN 100080100010661790), STATE OF FLORIDA DEPARTMENT OF .REVE- NUE, YVONNE M. PEISEL-GALLE- GOS, UNKNOWN TENANTS) IN POSSESSION #1 and #2,,et. al., Defendant(s). NOTICE OF ACTION TO: YVONNE M. PEISEL-GALLE- GOST last known residence: RR 13, Box 2064, Lake City, FL 32055 or 1817 SE Beadie Drive, Lake City, FL 32025, current res- idence unknown, if living, and ALL OTHER UNKNOWN PARTIES, includ- ing, if a named Defendant is deceased, the person representatives, the* surviving spouse, heirs, devisees, grantees, cred- itors, and all other parties claiming, by, through, under or against that Defendant, and all claimants, persons or parties, nat- ural or corporate, or whose exact legal status is unknown, claiming under any of the above named or described Defend- ants. . YOU ARE HEREBY NOTIFIED that an action to foreclosure a mortgage on the following property located, in Columbia County Florida: LOT 16, SPRINGFIELD ESTATES, PHASE 2, A SUBDIVISION, AC- CORDING TO THE PLAT THEREOF AS RECORDED IN PLAT BOOK 6, PAGE 27, OF THE PUBLIC RE- CORDS OF COLUMBIA COUNTY, FLORIDA. has been filed against you and .your are required to serve a c.,p o of '.our written defenses, if any, to ii on Brian L. Rosal- er, Esquire, Popkii & Rosaler, P.A., Plaintiff's attorney, at 10 Fairway Drive, Suite 302, Deerfield Beach, FL 33441, within 30 days of the first date of publi- cation of this notice, and file the original with the clerk of this court (P.O. Box 2069, Lake City, FL 32056) either be- fore March 21, 2005 on Plaintiff's attor- ney' or immediately thereafter; otherwise a default will be entered against you for the relief demanded in the complaint or petition. Date onkFebruary 9, 2005. P. DEWITT CASON As Clerk of the Court By:-s- J. Markham" ' J. MARKHAM As Deputy Clerk 03524108 February 15, 22, 2005 REQUEST FOR QUALIFICATIONS ire FOR ARCHITECTURAL SERVICES he RFQ#: LCCC 3-001-05 The Board of Trustees of Lake City S, Community College (LCCC), Lake City,' he Florida, 32025, in compliance with Sec- 5, tion 287.055, Florida Statutes, and State nia Requirements for Educational Facilities (SREF), is accepting applications from 72 architectural firms to provide services o. necessary to complete various LCCC" prjectiiacti itie. Listed bclo., are rep. e- resenlamie prioect'/,Il(u luesIe for hirch py the selected firrr, man, be required to pro. on ,.i, .. tchell c'jJI ,e ,... ..r,3',. He 'i i.' ;y, criteria package as specified by Section en 287.055 F.S. ast 1. Develop a strategic, long range Facili- rst ties Master Plan. 1, 2. Architectural and Engineering serv-' rk ices for renovation of buildings Is, and on #21 e- 3. Facilities Program Management Serv- 6d ices. in 4. Five-Year Educational Plant Survey. All parties interested in being considered for providing the described services nma\ request an Archiiectural Services Re- sponse package from: Bill Brown Director of Purchasing Lake Cnir Commrunir CCollege 149 SE CoLlegePlace Lake City, Florida 32025 (386) 754-4360 Response packages may also be obtained m via e-mail by sending a request to: Sbrownb@lakecitycc.edu he Five (5) copies of the Response package, ie of which at least one (1) copy will have er the original signature, must be received in the Purchasing Office located in Room 138, Building 001 on the Main Ig Campus of Lake City Community Col- lege no later than 2:00 PM, March 7, 2005. Responses received after that time will not be considered for this RFQ. Re- as sponses via facsimile, email or any other media will not be accepted. , On March 15, 2005 a committee com- prised of Lake Cni\ Community College personnel and/or consultants will meet in Building 001, Room 144 to evaluate the responses. The' RFP opening activity and the RFP F evaluation meeting is open to the public. Any person requiring special accommo- dations for these meetings should imme- diately notify the Director of iS Purchasing/Fiscal Reports at (386) 754-, 4360. Lake City Communiry College Board of Trustees Charles W. Hall, President 01550897 February 13, 15, 16, 2005 RUP pm -ww RE 0* b *'f-a wO41 RER Sdial-a-pro Reporter Service Directoty Classified -= ^ -- furniture DOUBLE OAK Rocker $100 386-752-9500 FREE CLEANUP. Pick up of unwanted metals, tin, scrap vehicles. 386-755-0133 We Recycle., Land Services Legal Public Auction 1995 Dodge VIN 1B7FL26X1SW924254 1999 Ford VIN 1FMRUl7LOXLC11088 To be held at: Jim's Auto Service LLC 2',5SWMaiinBld Lak:. Ct, FI 320'25 A't'. ',-",.- ',1-" 'Date of Sale: Wednesday, 2005 Time of Sale: 10:00 AM 01550739 February 14, 2005 - March 02, op" * v E[ Personal Merchandise 4 line minimum .. .'2.55 per line a. Add an additional $1.00 per ad for each Wednesday insertion. ,,,. ,, Number of Insertions Per line Rate 43 ................... ...... 1.65 4-6 ........ ....... ...... 1.50 7-13......................'1.45 I I 14-23..:................... 1.20 4 o2r5 24 or mora............. 99 I' Add nan additionals$1.00 per ad for each Wednesday insertion SLimited to service type advertising only. S4 lines, one month ..............'60.00 2 5 0 o $9.50 each additional line Add an additional$1.00 perad for each ,n% d i,' ,crn $[q O0 Ad Errors- Please read your ad on the first' 0 day of publication. We accept responsibility for only the first incorrect Insertion, and S only the charge for the ad space in error. Please call 755-5440 immediately for prompt Correction and billing adjustments., Cancellations- Normal advertising deadlines .t~ttSAit nnil W-,.,----.- ecnacrofylppa n. You can call us at 755-5440, Monday through Friday from 8:00 a.m. to 5:00 p.m. Some people prefer to place Ihe am. Thurs., 10:00 a.m. Fri., 10:00 a.m. Fri., 10:00 a.m. Fax/Email by: Mon., 9:00 a.m. Mon, 9:00 am. Wed., 9:00 a.m. Thurs., 9:00 a.m. Fri., 0 I e' eCo u r Federal, State or local laws regarding the prohibition SBiIng Inquiries- Call 755-540. Should fur- of discrimination in employment, housing and public '1 2 a,,ir,. -r information be required regarding pay- accommodations. Standard abbreviations are accept- S" i ts or credit limits, your call will be trans- able; however, the first word of each ad may not be ,'t. i ed tothe accountingdepartment. abbreviated. $ No PdrUng sIgns WIhIEd-A iptuarg $, On r' 9 ra I ] In Print and On Line ( Homes -Acreage Commercial S..... VAL IR AF %ttio.itRuliM g *j North Flo rid-4' 11 j CL a am .06 .L0 0L. 40 v Yvv A SAA Sao] * *w soap - * 00 a LAKE CITY REPORTER, TUESDAY, FEBRUARY 15, 2005 Legal IN THE CIRCUIT COURT OF THE THIRD JUDICIAL CIRCUIT OF FLORIDA, IN AND FOR COLUMBIA COUNTY CIVIL DIVISION CASE NO.: 04-516-CA FIRST NATIONAL ACCEPTANCE COMPANY Plaintiff, vs. JEFFREY D. SHELTON AND LORA LYNN SHELTON, DEANNA K. JOHNSON, TRUSTEE OF THE DEANNA K. JOHNSON TRUST, and UNKNOWN TENANTS/OWN- ERS, Defendants. NOTICE OF SALE Notice is hereby given, pursuant to Final Judgment of, Foreclosure for Plaintiff en- tered in this cause on February 2, 2005, in the Circuit Court of Columbia Coun- ty, Florida, I will sell the property situat- ed in Columbia County, Florida descri- bed as: A PART OF THE SE 1/4 OF THE SE 1/4 OF SECTION 10, TOWNSHIP 7 SOUTH, RANGE 17 EAST, BEING MORE PARTICULARLY DESCRI- BED AS FOLLOWS: BEGIN AT THE NORTHEAST CORNER OF THE SE 1/4 F THE SE 1/4 OF SAID SECTION 10 AND RUN SOUTH 2 40' 08" EAST ALONG THE EAST LINE OF SAID SECTION 10, 717.02 FEET; THENCE SOUTH 880 23' 50" WEST, 200.00 FEET; THENCE NORTH- WESTERLY ALONG THE ARC OF A CURVE TO THE LEFT HAVING A RADIUS OF 50.00 FEET. AND IN- CLUDED ANGLE OF 143- 07' 48" FOR AN ARC DISTANCE OF 124,90 FEET; THENCE SOUTH 88 23' 50" WEST, 23.48 FEET; THENCE NORTH 20 40' 08" WEST 687.02 FEET TO THE NORTH LINE OF SAID SE 1/4 OF THE SE 1/4 OF THE SE 1/4; THENCE NORTH 880 23' 50" EAST 312.92 FEET TO THE POINT OF BE- GINNING. ALSO KNOWN AS: LOT 15, DOWNING ACRES, AN UNRE- CORDED SUBDIVISION and commonly known as: 819 S.E.. Downing Drive, at public sale, to the highest arid best bidder, for cash, AT THE FRONT DOOR OF THE COLUM- BIA COUNTY COURTHOUSE, 145 N. HERNANDO STREET, LAKE CITY, FLORIDA, on March 2, 2005 at 11 o'clock P.M., Dated this 3rd day of Feb- ruary, 2005., P. DEWrIT CASON Clerk of the Circuit Court By: -s- J. Markham J. MARKHAM Depu, Clerk 01 55Isy95 .February 15, 22, 2005 In naniion 1o Bid Meadors Construction Company, Inc. in- vites all NMBE/\\BE Subcontractors to bid the following: Lake : City Water Treatment Plant Project. Work consists of excavation, grading, grassing, concrete finishing, rebar, masonry, fencing, mechanical, instru- mentation and electrical. Please submit your bid in written form on or before February 17th, 2005;'to Meadors , Construction Co., Inc. at 5634-1 W. 5th Street, Jacksonville, FL. 32254, Estimating Dept; Ph. 904-695-9290 or --PFaxF 904-695-9272. Plans and Specs may be viewed at the address above or any plar .,i. **n .I .s" ir.., iA'iL __ S Co.. Inc is an EOE SUlirt Contractor, License n LM00.'317: 01550869 February 11, 12, 13, 15, 16, 2005 NOTICE OF SHERIFF'S SALE NOTICE IS HEREBY GIVEN that pur- suant to a Writ of Execution issued in the County Court of Columbia Count.. Florida, on the 26th day of May 200-1, in the cause 'wherein Worldwide Asset Management, L.L.C. assigned to Bank Of America, as Plaintiff, and Walter D. Labbi as Derendant. being case Anumber 02-925-SP, in .aid Coun . I Bill Gootee. as Sheriff of Columbia Courity, Floridj hae le'. ied Lpon all the right, title and nieresi oi the Defendant, Waller D Labbi. in and 0o the following S described Real Propert). to-, ii All blocks G & H of Oak%\ood S/D & all that piece or- parcel of land lying be- tween blocks G & H of Oakwood S/D. 3575 Highway 441 South/Ri. 10 Box 289. And on the 21st day of March 2005, at the Columbia County Courthouse, 173 N.E. Hemando Avenue. Lake Cir'. Flor- ida at the hour of li-003a.m. or soon thereafter as possible. I will offer for sale all of the said defendant Walter D. Lab- bi's right, title and ineresi m the afore- said Real Properry .at public auction and will sell the same subjectt 10o laes. all prior liens. encoumrances and judg- ments, if an.\. 10 io e highest bidder for cash. The proceeds to be applied to the payment of costs and satisfaction of the Above execution. ..: , BILL GOOTEE, SHERIFF . OF COLUMBIA COUNTY. FLORIDA By: Sergeant Jeff Coleman In accordance ,ith the Americans ithh Disabilities Act. persons needing special accommodation. to parnicpale in these proceedings should contact the agency sending this notice, no later than se'en days prior the proceedings at 173 N.E. Hemando Avenue, Lake City, FL 32055. Telephone (386) 758-1109. 01550906 February 15, 22, 2005 March 1, 08, 2005 REQUEST FOR PROPOSAL FOR BANKING SERVICES RFP#: LCCC 02-001-05 The District Board of Trustees of Lake City Community, College invites finan- cial institutions that are qualified public depoiioriere a, defined in Chapter 280, Florida Statute and uho ha e a main or full ,ermice branch office ph'sicatl\ lc,- cdiaed iithin 15 mile: of the Lake CirN Communroi College campus to pro% ide a proposal for those banking services specified in the Banking Service Propos- alpackage. All financial institutions interested in be- ing considered for providing banking services for the College may request a Banking Services Proposal package from: Bill Brown / Director of Purchasing Lake City Community College 149 S.E. College Place Lake City, Florida 32025 . S(386) 754-4360 " Proposal package ma\ al'o be obtained '.ia e-miil b., 'ending a request to: bronbii'laket:)cc edu Five (5) copies of the Response package, of which at least one (11 copy will have the original signature. must be received in the Purchasing Office located in , Room 138, Building 001 on the Main Campus of Lake City Community Col- lege no later than 2:00 PM, March 10, 2005. Responses received after that time will not be considered for this RFP. Re- sponses via facsimile, email or an\ other media will not be accepted. ,I. I On March 17, 2005 an evaluation com- mittee comprised of Lake City Comn- Legal munity College personnel will meet in Building 001, Room 101 to evaluate the responses. The public is invited to attend the RFP opening activity and the committee eval- uation meeting. Any person requiring special accommodations for this meeting should immediately notify the Director of Purchasing at (386) 754-4360. Lake City Community College Board of Trustees Charles W. Hall, President 01550912 February 13, 15, 16, 2005 020 Lost & Found FOUND ADULT pet rabbit. Call to identify. 386-752-3764 FOUND RING Winn Dixie Lake City 386-623-5952 LOST CAT neutered male,, domestic med. hair, gray tabby, Missing since 1/10, around 245 A area. AVID micro-chip. Loved & Missed please call 386-365-3449 Lost small brown Poodle. "Sparky". Hwy 47 area. 386-755-1893 WWII Vet Lost cane downtown. stag handle, carved snake. 755-7284 *CHILD CARE WORKER* M/Fhrs. 6am-6pm Call 752-4411 or fax qualifications to: 752-0740 Must have clean background check. 550107 NEED A JOB? Get a real estate license. Call 755-40410 for infto or reach us @ N.FL Real Esiate -ind i iin Equal Opponrunit' Emplo.er. 01550599 THE LAKE CITY REPORTER is currently looking for an independent newspaper carrier for the Downtown Lake City area. Deliver the Reporter in the early morning hours Tuesday Sunday. No delivery on Monday's. Carrier must have dependable transportation. Stop by the Reporter today to fill out a contractor's inquirers form. No phone call-! 100 Opportunities 01550710 SOUTHEAST REGIONAL DRIVERS Davis Express, Starke, FI is looking for drivers to run SE. Requires Class A CDL w/hazmat. 98% miles in Fla., Ga., TN., S.C., & Alabama. 0 1 yr. exp. .34 cpm 0 2 yrs. exp. .35 cpm @ 3 yrs. exp. .36 cpm 100% lumber reimbursement 0 $500 sign on bonus Safety bonus Guaranteed hometime Health, Life, Dental & disability Ins avail. 401K available. Call 1-800-874-4270 #6 01550809 PAYROLL ADMINISTRATOR, Challenging position with the largest sail boat manufacturer in the USA. Immediate Opening for a person with at least 2 years experience with a computerized payroll system. Experience with Excel a must. Other program knowledge include Crystal Reports, Abra, and Unitime. Employer offers an excellent. fringe benefit package, including family health care, paid vacations and paid holidays, and a 401K Plan. Salary is negotiable with experience. Please apply in person at Hunter Marine, Hwy 441 in Alachua. 01550862 IMMEDIATE OPENING in the Production/Editorial departments. Candidates must be detail oriented and have experience in Quark Xpress, Ploto Shop, and using Macintosh computers. Good i) ping skills a plus. Experience in Acrobat and Acrobat Distiller also helpful. Regular shift will be, Tues. Sat., 3 p.m. 12 midnight. Competiitie hourly rate. Candidates, are asked to send all resumes to Dave Kimler, c/o Lake City Reporter, 180 E. DuvalSt., Lake City, FL 32055 or email to: dkimler@lakecityreporter.com. If samples of work are available, please include with submitted, resume. Only qualified candidates will be called for interview.,. SFull'Hefalth Insurahi e, 401K, Uniforms, Paid Vacation. Late " Model Equipment. Apply in person Mon.- Fri. between 3pm and 6pm @ Johnson & Johnson Inc. 1607 US 90 East Madison, Florida 32340 con- tact person Ronnie Blanton. EXP. CDL-A DRIVERS NOW IS THE TIME LET'S TALK!! Mesilla Valley Transportation 1-800-944-4544 100 Job SOpportunities 01550876 Plumbers UNIVERSITY OF SFLORIDA The University of Florida, Department of Housing and Residence Education, is currently recruiting for three plumbers. Minimum requirements include completion of an approved apprenticeship program in plumbing, or a high school diploma and four years of appropriate experience. Appropriate vocational/technical training may substitute at an equivalent rate for the required experience. These positions maintain and install a variety of plumbing and heating systems and fixtures. Preferred candidates will have knowledge .of the procedures and methods for installing, repairing, and' maintaining plumbing and heating fixtures and accessories; and be skilled in use of pipe cutters, reamers, threading machines and other specialized tools and equipment..Expected starting salary for these positions is $10.50 hourly; may exceed based on experience. To view application instructions and complete an online resume, please visit. Reference numbers: 29010, 29019, and 31169. The deadline date to apply is February 24, 2005. If an accommodation due to. a disability is needed to apply for this position, please call (352) 392-4621 or the Florida Relay System at (800) 955-8771 (TDD). An Equal Opportunity Institution.. 2 PAINTERS needed. Work in town/out of town. Will train Call Clay 386-397-5706 or 386-752-8977 A/C Service Technician Commercial .Full iinii iidl vehicle andbenefits.,. Drug Free, EOE. Mail resume to: Climate Control Mechanical Ser'v- ices, 737 S.W. 57th Ave., Ocala, FL 34474 or call 1-800-546-0085 Another Way, Inc. is seeking a shelter manager, outreach advocate and various part time positions. Full time positions are available with benefits. Formally battered women and minorities encouraged to apply. Fax resume to 386-719-2758 by February 18, 2005 Rohnie. Harvey at 386-752-2583 Or fax resume to: 386-752-8724 Liberty National is an EOE Licensed Agents Welcome How can we top being est Call Center of the/CuslomerHENTL@GIC kA ' vww-clientlogicxcom The service engine of the new @conomy'm 100 Job 100 'Opportunities ACCOUNTING CLERK Large company is in search of an experienced Accounting Clerk. Qualified candidate must be experi- enced in AP/AR, Billing and Month-end close procedures. Must be proficient in Word and Excel, good oral/communication skills are a must! Please forward resumes to: Accounting Clerk P.O. Box 1829 Lake City, FL 32056 ATTN: Diane Polbos ACCOUNTING MANAGER LAKE CITY AREA MUST HAVE B.A. DEGREE 3 YEARS WORKING EXP AS ACCOUNTING SUPERVISOR OR STAFF ACCOUNTING REQUIRED GREAT GROUNDFLOOR OPPORTUNITY RESUMES TO: WS4140@EARTHLINK.NET Addresses wanted immediately! No experience necessary. Work at home. Call toll 405-447-6397 ALUMINUM SCREEN Room Installers needed. Must have valid drivers license. Call for appt. 386-755-5779 Auto Body Technician High Volume, New Shop. Highest Quality. Immediate openings E'cellent Annual Income. 386-755--4018 40U(earthlink.net DANIEL'S TOWING & Recovery 386-755-5154. Wanted Driver. Must have Class A CDL. 25 yrs. or older. Mechanical Knowledge a plus. Apply in person ONLY. Cii,. IJ '-.2i5,:, . Dump Truck Dri %ers Wanted Class A or B license Contact V&J's at 386-497-1080 100 Job 100 'Opportunities Exp. COOKS Apply in person. Beef O'Brady's 857 SW Main Blvd. Exp. framing carpenters & helpers. Come join a great crew. Must have transportation. Interviews call 386- 623-5057 or 365-8073 before 8pm Experienced GA Mechanic. A/P license required. IA helpful. Live Oak. Fax resume to: 386-845-0243 EXPERIENCED INSULATORS needed. Must have reliable transpor- tation and be able to work overtime. Class D CDL license a plus. Call 386-758-3995 for appt. Receptionist needed. Must be.people oriented w/ exc. phone skills. Apply in person at Still Waters. 507 NW Hall of Fame Dr. HIRING FOR all positions at the Porter House Grill. Apply in person Between 3-5pm Mon, Tue, or Wed. 894 SW Main Blvd. Lake City. HOTEL SEEKING dependable, friendly employees with smiles. Housekeepers, front Desk clerk (must be fle\ible ki h outgoing per- sonality), & part time maintenance (must have exp.) Apply in person Jameson Inn, 285 SW Commerce Drive. No phone calls please. INDUSTRIAL FORKLIFT EXPERIENCE SHIPPING & RECEIVING LIFTING REQULiiRED 386-755-1991 WAL-STAF PERSONNEL BACKGRD/DRUGSCREEN REQ. INSURANCE CSR Our busy Lake City Agency needs an exp'd CSR, 220 or 440 Licensed. Great pay & benefits. Fax resume to: 72t7-943-0022 or e-mail to: grubg(ibrookecorp.com MASON OR Mason Apprentice needed. Must have own transportation. Call 386-466-0000 MYSTERY SHOPPERS NEEDED! Earn While You Shop! C.111 WN.-. T11 P7-- alu Now Toull Free , 1-888-255-6040 Ext. 13252 P Needed delivery driver for the ; i- Gainesville Sun in Lake City area. ( Early morning hours. 7 days a week. 'J For info, call Cindy 352-338-3148 - WORK AT HOME! Be a Medical Transcriptionist * Come to this free, no obligation seminar to find Ear out how with no previous experience you can learn to work at home doing medical transcription EI$ from audio cassettes dictated by doctors! High Demand! Doctors Need Transcription uis at 7 PM. I. This ad is your seminar ticket A72 I CLIP OUT AND BRING TO, SEMINAR AT 7 PM. CLIP Lake City. Quality Inn 3559 W. US Highway 90 Lake City, Fla. 32055 S-- 2001 Lowe Street, Fort Collins, CO 80525 with experience incredible commissions & bonuses V Qualify for complete benefits package SUNBELT HONDA Apply in person Mon.-Fri., 9am-4pm; See Tony Business Attire, Come Dressed to Begin Training Hwy 41 S., Lake City No Phone Calls Please I- Walt's Live Oak Ford-Mercury Looking for experienced salespeople or rig t people with no experience. Will train. *Up to 35% commissions *Demo program for salespeople *Health Insurance *Great working environment *Paid 3% on F&Il *Paid salary during training Please call Bobby Coqswell at 386-362-1112 , )1 LAKE CITY REPORTER, TUESDAY, FEBRUARY 15, 2005 100 Job 0 Opportunities onen page resume to 386-961-8802. PART-TIME GRANT FUNDED HOMELESS SERVICES COORDINATOR This contractual position requires completing grant requirements, attending monthly meetings, corre- spondence, advocacy on behalf of the homeless. Da I 10 da\ operation interacting & assisting clients. Applicant should have good communication skills and knowl- edge of the social service agencies. Send resume to: 258 NW Burk Ave- nue, Lake City, FL 32055 or fax to 386-754-5325. PROFESSIONAL CHILD Care worker with CDA looking to expand into management. Mail resume to P.O. Box 2127, Lake City, Fl. 32056 ROUTE DRIVER WANTED. Class B license required. Apply online at. S ILES POSITION MUST HAVE STRONG SALES EXPERIENCE PLEASE CALL FOR APPT. WAL-STAFF PERSONNEL 386-755-1991 DrugScre'en & backgrd Req. Santa Fe Truss We are currently in need of a Tru s Repair Technic i.n Prior experience. preferred. Willing to train individual with similar construction e\peri- ence The right candidate k ill pos- -ess sironga .inLile ical and communi- cation skds, miust be e,.trenmiel) S self motivated. A valid Florida driver's license is required, Job also requires .*casi.,rial heaj. lift- ing and the abili[, to .. ork at <.ai, - ing heights. We offer competitive pay and benefits. DFWP. Qualified applicants should contact us in person only at 410 SW Poe,Springs Rd, High Springs Sante Fe Truss We are'currently hiring truss builderss ard -a.. cre. personnel Prior experience required. We offer qualified indit\ dua.s great production it( bonuses, competia e pay. and benefits DFWVP. SApp', in person onl) at SS\: 410 S Po Spring; Road High Springs. SONNY'S B-B-Q is Now hiring Exp. Managers in Like Citi. Also other Florida locations ai ail Sumbit resume in peron or mail to 10731 SW 66th Ci Ocala. FL 344.17,6 EOE D/F.'\/P SOUTHEASTERN METAL \\elder-> needed. Now taking applicahons in production. ,elding. S"S-$15 per hour call 3S6-75S-7757 SURVEYING Help needed. SEperienced Intrunment Person & E' perenced Draftismni. Call during business hours 38'6-' 5-9,S31 TRAV EL U*S*A E',citingtS Firrin Has 10 Imniedi- ate Openings f':ri sharp Gu.s && Gals Free to travel all major cities & resort areas. Mu_-.t be IS Years of age & older Must be free to start to- da. \\e offer 2 i, ceks paid training. transportation furnished. return guaranteed For inter, ien Call Mr. Kenmore 5 3.%6-152-6262 Wed Fri iUam to 5pm Truck Drivers \\anted CDL ClIa A required 2 years experience Good Pa'i. horne .eekends. , (3s 2(4-3 172 Wallh' Lite Oak Foird i.. looking for ar experienced To' Truck Dri'er. Must have Class D License. Includes benefits. Call Rick 380-362:1112 lf.r appt. EOE W ANTED EXPERIENCED \\ait stalt for A Place In The Park Cate. \Whie Spnngs. 386-.3L-141 I or 3S6-752-1952 ,ANTED! WANTED! WANTED! HARDWORKERS ONLY NEEDAPPL1. \LL SHIFTS MUST BE ABLE TO LIFT 50ILBS-7IILBS 3S6-55-1Pu91 WAL-STAF PERSON N E L REQ. , %$ANTED!!! ASSISTANT EXPERIENCED WITH TILE AND MARBLE MUST BE ABLE TO LIFT UPTO70LBS . PLEASE CALL FOR APPT. WAL-STAFF PERSONNEL 386-755-1991 Drug Screen & Backgrd Req. WAREHOUSE BODY PARTS OF AMERICA seeks team oriented, hardworking individuals. Health, dental, life in-' surance available. lMonda\ -Frida\. If you are not afraid of lionest. hard work. Apply in person at: 385 SW Arlington Rd, Lake City (no phone calls please.) %\ INDOl\ ser' ice technician needed. Experience a plus but not necessary. Must have knot ledge of Lake City, Gainesville & Nlacclen- ny areas and be able to lift heavy objects. Good benefits orfeied .ftier 90 days (100% employee medical & life Ins.), 401 K & vacation offered after 1 yr. of employment Pick up application at Lake City Ihdustries, 250 Railroad Street. I 100 Jobare a safe, dependable driver, Class A CDL, clean MVR. Part time & full time- drivers needed. Home every night, weekends off. Good benefits. Columbia Grain 755-7700 0n Sales Employment EXPERIENCED FLOORING sales person needed. Top Pay. Call Brad or Martha at 386-362-7066 ORLANDO WELCOME Center on US 90, Lake City. is looking for .sales people. Commission base only. Contact Wilma. 38s6-- -4.250 01548 37 REGISTERED NURSES SHANDS AT LAKE SHORE the folio,, ing positions .ire current, a' ailable and ,ke are seeking qualified apphcanis OB ICU ER MED/SURG RN Per Diem Pool $26.00 per hour plus shift differential. For more informanon contact Human Resources at 386-754-8147, Appl in person at 368 NE Franklin St, Lake City, Flonda '32'5 .:r '. i ii oui '. ebziic ai ; %;,; % h.ands.org. EOE, M/F/D/V. Drug Free Workplace 01550723 CNA Advent Christian Village 658-JOBS (5627) Certified Nursing Assistants! The Ad ent Christian Village is looking for FT and PT CNAs who want to give quality care. Florida certification required. Great work- ing en' irornileni. Compeuti e sal- ar,.. Compeii'. e be'rielfit for FT po t: .n'rs mclid.: h':,':ith d.;ntal, life, disability, savings, AFLAC supplemental policies, access to onsite daycare and fi'tess facili- ties. EOE; Drug Free Workplace, Criminal background checks re- quired. Apply in person at ACV Personnel Department Mon thru Fri. 9-i0 a m a until 4:00 p.m., Car- ier Village Hall. 11:65h0 CR 136. Do ling Park, FL, ta'.. resume 1to (386) 658-5160; or visit S. PT Physical Therapy Assistant Avalon Healthcare Center is currently accepting applications for a part time Ph sical Therapist .ssisiant. Qualified candridate must be State Licensed. If \ou v. ant to .%orl; in an en\ ironmrient[ i-.here caring trulh make a difference, please contract Tony Anderson, Administrator Avalon Healthcare Center 1270 S.W. laiin Bld lake City, FL 32025 386-752-7900 Drug Free Workplace OT & LPTA Positions Advent Christian Village 658-JOBS for Current opportunities , PT PTA to assist utiih phsmrcal therapist phi sical rehabilitation and related acti ties. Valid Florida PTA license required. Prior experience preferred. PT OT to assist for long-term care facitti,. Valid Florida OT license required Prior experience preferred. EOE; Drug Free Workplace. Criminal background verification required Apply in person at ACV Personnel Department -Mon. - Fri. 9:00 a.m. .until 4.00 p.m., Carter Village Hall, 1068i0 CR 136, Dowling Park, FL. Fax resume to (386)658-5160 or visit. Per-on. Dental terminology a must. Live Oak/Lake City. $9.25 hr. Fax resume to: 386-961-9086 RN CLINICAL COORDINATOR Lake Cit,, Medical (-'enter ha this posiorn open: F. T rpighls. Require- ments are: RN License, BLS Certifi- cation arnd pre ,ous e'p pielerre.J Please apply in person at: Lake City Medical Center, Human Resources, 340 NW Commerce Dr. Lake City, FL 32055. 1 0 Medical 12 Employment FulI MEDICAL OFFICE 1 day a week . Wednesday only 386-755-14-S Now Hiring FT Dietary Technician for 180-bed LTC facility e\penence preferred s.lanr based on training & experience. contact Bette Forshaw NHA @ 386-362-7860 or apply in person Suwannee Health Care Center 1620 E Helvenston Street Live Oak, Florida 32064 EOE, DV, M/F SUlWANNEE MEDICAL Personnel LPN needed 3-11 & weekends in Lake Citv area ask for Theresa or Nlelissa 1-877-755-1544 or 755-1544 LAB PUPPIES For Sale 8 weeks old w/hc and Vacs. 1 Female & 4 Males, Black 3S6-752-9649 310 Pels & Supplies 1 WC adult. gray rat snake 5.i - .. 3,.,6-69r -314 ' 2 Jungle Carpet Pithons imale'fe- male pair $300: 3S6-697-3147 4'X3' WOOD+PLEXI cage $120-all OBO 697-31I 7 55 GALON aquarium+ top& stand 100. 3S6-69"-314-7 FREE PUPPIES 8 Weeks old, 'Boxer / Texas leopard mix. 386-755-7729 PUBLISHERS NOTE Florida La' 82.'2.-. requires dogs and cats being sold to be at least 8 0..eeks old and have a health certifi- cate from a licensed veterinarian documenting they have mandatory shots and are free from, intestinal and e\[ernal parasites. Many species of wildlife must be licensed by Flor- ida Fish and Wildlife. If \ou are un- sure. contact the local office for in- tornmation Valentine Pomeranian Puppies 8 weeks, Health Cert.,3 males/ 1 female 386-758-5525 401 Antiques ANTIQUE BRASS Bed 5250or best offer. 3?6-719-3846 Primili e table. Pegs, walnut. $125. or best offer. 386-719-38-16 408 Furnilure 4x8 Glass PATIO TABLE %wih four chairs $15i0 386-752-9500 ( Bedroomiset. Lt. Bitch color. exe. cond. IncI queen sz. h,'board. chest of draw.er. I night stand. I dresser % flamed mirror $60.i '54.-0156 416 Sporting Goods REGULATION POOL Table All accessories. 52500 i755-341 I.MAGN.A~ OX 42" Color Console TV w/. surround sound capability Good cond $-50 . 3S6-755-10.1i3 386-288-8x 33 420 Wanted to Buy K&H TIMBER Timber Co. Pai ment in ad\ dance for standing pine timber. Large or small tracts. Call 386-758-7636. 430 Garage Sales PUBLISHER'S NOTE SErfectue October I. "'103 All Yard Sale Ads must be prepaid 440 Miscellaneous 01548548 DIRECT SATELLITE S\ stems Installed free no equipment 1o buy Call 961-8415 GUNSHOW Feb. 19 & 20th 9a 4p. Columbia Co. Fairgrounds. Hwy 247. Lake City. Concealed Weapons classes twice daily: Info 904-461-0273 NEW single GARAGE Door. Auto open or 2 remotes 386-466-1818 630 Mobile Homes o for Rent 2BR.'2BA. 1/2 furnished. SecItided on 1 jcie. 1st, lasI & secturN\. i .55 mo. 386-_'. -_1h1 )or 3 s8 -623-5117 Avail. at Waynes R\ Resort 2 or 3 Br MH.. incl. alter. se, er. cable TV. pest service & laudry. Call foi more details. 386-752-5721 30 Mobile Homes for Rent IN PARK Mobile Homes for Rent 2BR/2BA 1st & sec. required. Applications & references required. 386-719-2423 Lake City &Ellisville area 3br/2ba, & 2br/lba. MH's. Several avail. Water garbage & yard. $400 mo. $200 security. 386-963-1568 LATE MODEL MOBILE HOMES Starting $365 month, Beautiful Pond setting, w/trees. CH/A & ca- ble. No pets. Call 386-961-0017 640 AMobile Homes 640 for Sale 2002 FLEETWOOD. Custom made 28x76. Mint cond. 5br/4ba, all appl., Take over payments of $405/mo. & move. (352)628-7303 FQR AS LITTLE AS $500 DOWN @ 386-752-7751 If you own land, or, have a large down payment. I may owner finance a home fot you! Call Steve 386-365-8549 NO MONEY DOWN! New 2005 doubles ide On your land $33 4.i fi per month. Call Lee 3S6-36i-.s,,,. One of j kind Manufactured Log Home 4 bd1room Perfect for a :ounr, seurnig Call Jim 3.86-303-1557 THANK YOU! From all the Freedom Homes Family TIMBERLANE MHP. Adult park in Lake City 3br/2ba. Split plan DWMIH w/big kitchen & Ig shed. All appliances 269 SW Woodberry Ct. $36,000 386-75,8-9640 TRIPLE WIDE ON 17 ACRES IN OLD TOWN CALL BOBBY @ 386-752-7751 WE HAVEiFHA, VA & CONVENTIONAL LOAN PROGRAMS. WITH LOW DOWN. CALL 1-800-355-9385 We love CASH! We will give you the very best price for a new or used manufactured home! 386-752-5355 - WE SPECIALIZE IN LAND HOME PACKAGES 386-752-7751 650 Mobile Home 650 m &Land . & While Springs. Pos-ible le'se opt. 386-752-1212 0ori 305-309 L AND and HOME pjckjges, c lose to Lake City, it's %\ hati e do best' Paved street, city water and sewer,. Sou pick the home, we do the rest and Freedom Homes may owner fi-- nance! 386-752-5355 REMODELED manufactured home on land. Call Ron 386-397-40h0 TRIPLEWIDE on 1.8 acres land .MUST SELL!! 386-397-4930 ask for Faye 705 Rooms for Rent ROOMNIAE WANTED. $325 a month for e' erything. 386-697-6117 710 Unfurnished Apt. l/ For Rent $NO RENT UNTIL MARCH! 2BR and 3 BR Special. Call Today! New Apartment homes include MW, DW, pool, fitness center and much mote, Call Windsong ? 5S- S 45 ? 1550639 NOW LEASING 1 BedroomApartments/2BA W/ Loft. $675 mo plus security. 386-752-9626 NEWLY PAINTED 2br/lba w/garage, $650.mo. & 2br/lba w/out garage, $500mo plus security deposit. Lea.386-752-9626 Accepting Applications Good, Bad & No Credit Call for 1st & 2nd Mortgages Established full service co. (800) 226-6044 WE BUY MORTGAGES 2622 NW 43rd St. ^JMl~ #A-1 FHANVNA/Conv. Specialist Gainesville, FL 32606 GAINESVILLE MORTGAGE COMPANY, INC. Licensed Mtg. Lender 710 Unfurnished Apt. 7 For Rent X-CLEAN 2/2 1700 sq. ft. Second floor. Private country acre. Energywise. 7 miles to VA. $600. mo. $1,500. needed. 386-961-9181 720 Furnished Apts. SFor Rent Completely Furnished, clean, private, near City & Timco. 1BR. APT. Nice neighborhood. Quiet & peaceful. Call 386-755-3950 Neat as a Whistle! 1BR Hot Tub, 2 car garage. Nice Residential development. $895./mo. Close to Branford Hwy & 242. Call 386-397-5222 3BR/2BA HOUSE for rent. 1st, last & deposit required. Call 386-755-6867, for more information. Avail. Now! 3/2.1864 SE CR 245A Lake Citr. Big -u d. screened porch, big laundrN rm.new apple. $700 dep. $800 mo. Judy904-814- 2855 or912-843-8151 PUBLISHER'S NOTE All real estate advertising in this newspaper 'is subject to the Fair Housing Act which makes it illegal to d,:lerti se "any preference. limita- tion discrimrninaon based on race, color, religion. .e\. disablli. fami- lial status or national origin, or any intention to make such preference, limitation or discrimination." Fami- lial status includes children under the age of 18 I ingn mi.. t parents or legal custodians. pregnant women, and people securing custody of chil- dren under 18. This newspaper will not kno\i ing1l ,accept any advertising for real estate which is in violation of the law. Our readers are hereby informed that all dwellings advertised in this newspa- per are a a.ablbei on an equal oppor- runini basis. To complain of dis- crimination call HUD toll-free'at 1- 800-669-9,777. The toll free tele- phone number to the hearing im- paired is 1-800-927-9275 750 Business & ,5J Office Rentals' Building for Lease 2128 SW Main Blvd., Suite 105 Approx 1200 sq ft., Utilities Incl. $950. per month 386-752-5035 A Bar Sales Inc. DaN\s '7n--'pm OFFICE SPACE for lease 1,000 sq. ft. for prof. office. Downtown location. Call Sandy. 386-344-0433 Daniel Crapps Agency. 805 Lots for Sale HILLTOP HOMESITE on paved road in restricted communJn). Over- looks natural woodlands on creek. Onlk $4c,900 for acres 386-752-5035 Ext.9710. SD\ s 7am- 7prr A Bar Sale'. Inc. STA R LAKE ESTATES. 1/2 to 3/4 ac. Lake access, restricted home sites. 2 miles from I-75 & US 90. from $26,900. 386-365-1563 or 365-8007 810 Home for Sale $29,900! 4br/2ba foreclosure available noa ' Foi li sung call 1-s.:10-7-19- 124 e.[ H411 3BR/2BA HOUSE w/ garage. 8x12 Storage shed. Quail Ridge estates. 1/3 acre in quiet neighborhood. $96,500 neg. 386-935-0253 3BR/2BA LR-DR, kitchen equip- ped, back porch, patio, 2 car garage, 1603.sq ft. 14x38 RV garage, en- closed & outbuilding. 386-755-2190 FSBO New Home 3BR/2BA 1,400 sq ft, 1/3 acre, CHA, Kit; appl., off Country Club Rd, asking $115,000. call 386-867-0124 or 386-867-4 In1 SINGLE STOR1 Townhouse 2BR/2BA, Desirable neighborhood, perfect for retirees, Ceramic tile Kit/Bath, City Water & sewer, Just off SW Grand- Sview St. 79,500 386-755-0210 WE BUY Houses & Land & Fixer uppers! Call for more information. 386-7/55-6092 820 Farms & Acreage 5, 10 and 20 acre lots with well and septic tank. Owner financing. 386-752-4339 BEAUTIFUL 5 ac restricted home sites on paved road. 3 & 1/2 miles from 1-75 & US 90. From $48,900. 386-365-1563 or 365-8007 870 Real Estate Wanted WE PAY CASH for cut over timber land. 386-365-3865. 92 Auto Parts 92 & Supplies 00 OLDS Alero., Silver PW, PL. Nice car. Call Andy 356-'v5 -- 1"I 01 IMPALA LS BLACK. PW, PL, TILT. SC-LLANDY 386-758-6171 02 Chr3 sler PT Cruiser 4 door, black, PW, PL Call Andy 386-758-6171 02 FORD Escape. PW, PL. New Car trade. Call Andy 386-758-6171 03 G( L ANT P\V.PL. tilt, Cruise. Come Drive It! Call Andy 386-758-6171 03 NISSAN Sentra. loaded. Auto \%/ Alloys Exc. fuel miles.Onlyv 36K mi. Like New. $12,000. Please call Jimmy @ 386-752-5050 1992 GEO PRISM Parts Onl $1. 11j, C3all L35-0509 .. 35 MPG & Dell CPU Bu\ a 2005 Focus Hatch, Sedan, or Wagon get up to $2,500 rebate & a free Dell System Call today 386-623-1946 87 TOYOTA CAMRY. AUTO- MATIC. $1099. 386-466-1818 98 CADILLAC Deville. All the Toys. E\c. Cond. Lihr Pwr seats. Alloys. $16.100. Please call Jimm\ @ 386-752-5050. LO\ EST PRICES of the year! Lncoln Na' gator. Lincoln Aviator, Ford E'.pedmon. Lincoln LS, Ford TBird Call Todja 951 Recreational Vehicles" 04 FRANKLIN 39' 5th wheel. 2br 3 ele. slide outs. Garden tub/shower, '\asheri dier Stereo & CD. Every option. 525.5110 Cell (Sn2 i6S--h)%6 95 Savanalh, 33ft. 5th wheel, new hitch inc. Sleeps 6, Super Slide, Fully loaded. 1 owner. New tires. Owned by non-smoker. $11,950 obo, Will deliver. 386-288-9031 '952 Vans & Sport Util. Vehicles 1996 FORD Windstar. Needs work. $500. obo. 386-963-5201 evenings. 963-5953 Days. 1999 GMC JIMMY V-6 Loaded, New tires $5,500. 386-755-1053 SIT SEVEN Brand new 2004 Mercury Monterray. Leather, Power, rear doors, keyless remote. $12,000 off! 3 left 386-623-1946. 752-3300 . *' '\ b Contact Us | Permissions | Preferences | Technical Aspects | Statistics | Internal | Privacy Policy © 2004 - 2011 University of Florida George A. Smathers Libraries.All rights reserved. Acceptable Use, Copyright, and Disclaimer Statement Powered by SobekCM
|
http://ufdc.ufl.edu/UF00028308/00042
|
CC-MAIN-2016-50
|
en
|
refinedweb
|
Opened 9 years ago
Closed 8 years ago
Last modified 5 years ago
#7276 closed (fixed)
Inherited models are not fully deleted
Description
With the following models:
class Place (models.Model): name = models.CharField (max_length = 255, unique = True) class Store (Place): manager = models.CharField (max_length = 255)
This is the behavior of
delete(), which is unexpected. Attempting to delete objects with inherited relationships leaves a trail of half-built objects behind. The call to
store.delete() should also remove the associated
Place.
>>> store = Store.objects.create (name = "My Store", manager = "Frank") >>> store.id 1 >>> store.delete () >>> Place.objects.get (id = 1).name 'My Store' >>> Store.objects.create (name = "My Store", manager = "Bob") Traceback (most recent call last): ... IntegrityError: (1062, "Duplicate entry 'My Store' for key 2") >>>
Attachments (1)
Change History (6)
Changed 9 years ago by
comment:1 Changed 8 years ago by
comment:2 Changed 8 years ago by
comment:3 Changed 8 years ago by
There needs to be a design decision: do we want or not to delete the parent *automatically* when the child is deleted?
It is still possible to do it manually with something like:
class Store (Place):
parent = models.OneToOneField(Place, parent_link=True)
manager = models.CharField (max_length = 255)
def delete(self):
parent.delete()
comment:4 Changed 8 years ago by
comment:5 Changed 5 years ago by
Milestone 1.0 deleted
Updated model inheritance unit tests
|
https://code.djangoproject.com/ticket/7276
|
CC-MAIN-2016-50
|
en
|
refinedweb
|
Tutor.docx Download Attachment
You asked:
"Part 1
The ACME Company is evaluating a capital expenditure proposal that requires an initial
investment of $1,040,000. The machine will improve productivity and thereby increases
net...You asked:
"Part 1
The ACME Company is evaluating a capital expenditure proposal that requires an initial
investment of $1,040,000. The machine will improve productivity and thereby increases
net after-tax cash inflows by $250,000 per year for 7 years. It will have no salvage
value. The company requires a minimum rate of return of 12 percent on this type of
capital investment.
Determine the net present value (NPV) of the investment proposal. (The PV annuity
factor for 12%, 7 years is 4.564.)
Determine the proposal's internal rate of return, rounded to the nearest tenth of a
percent. (Note: PV annuity factors for 7 years: @ 10% = 4.868; @ 11% = 4.712; @ 12%
= 4.564; @ 13% = 4.423; @ 14% = 4.288; @ 15% = 4.160; and, @ 20% = 3.605.)
What is the estimated payback period for the proposed investment, under the
assumption that cash inflows occur evenly throughout the year?
What is the present value payback period for the proposed investment?
What is the estimated accounting rate of return (on initial investment) for the proposed
project?
Part 2
Miller Inc. is considering replacing an old drilling machine that cost $200,000 six years
ago with a new one that costs $450,000. Shipping and installation cost an additional
$60,000. The old machine has been depreciated using straight-line method with no
salvage value over an estimated 8-year useful life. The old machine can be sold for
$40,000 now or $10,000 in two years. Management expects increases in inventories of
$10,000, accounts receivable of $32,000, and accounts payable of $12,000 if the new
machine is acquired. Miller's income tax rate is expected to be 30 percent over the
years affected by the investment.
What is Miller's net initial investment (i.e., its after-tax initial cash outlay for the
machine)?
Part 3
Adams Company is evaluating a new tractor that costs $1,350,000 to replace the tractor
purchased years earlier, which currently has no salvage value; the new tractor has an
estimated useful life of five years with no disposal value or anticipated cost of disposal.
The company uses straight-line depreciation with no residual value on all equipment.
Adams is subject to a 40% income tax rate. The company uses a 12% hurdle rate for
evaluating capital investment projects. The PV of an annuity of $1 at 12% for 5 years is
3.605, and the PV of $1 at 12% in 5 years is 0.567.
Compute the amount of before-tax savings that must be generated by the new tractor to
have a payback period of no more than 3 years.
Compute the amount of before-tax savings that must be generated by the new tractor to
have a NPV of at least $500,000 at a desired rate of return of 12%.
Compute the amount of before-tax savings that must be generated by the new tractor to
have an IRR of 12%.
Part 4
ABC Construction, Inc. is currently considering developing, on a piece of land currently
held by the company, a new courtyard motel. This project would provide a single payoff
from a buyer in one year (after construction was completed). The concept of a courtyard
motel is relatively new, so there is a certain amount of risk associated with this project.
The company's management feels that new information regarding potential consumer
demand would be revealed, that is, whether in the chosen geographic location a
courtyard motel would be popular ("good news") or unpopular ("bad news"). In the
former case, you anticipate a selling price of $13 million, while in the latter case only $9
million. At the present, these two outcomes are considered equally likely. For projects of
this sort, the company uses a WACC (discount rate) of 10% after tax. The company
estimates that total construction costs for this project would, in today's dollars, be
approximately $9.7 million.
Based on the given probabilities for the two possible outcomes (states of nature), what
is the expected NPV of the proposed investment?
What is the primary deficiency of the traditional DCF analysis you conducted above in
(1)?
Suppose now that management has an option to wait a year before deciding whether to
construct the motel in question. The question the company is grappling with is whether it
should delay the investment decision for one year. Given the information above, what
do you recommend, and why? (For simplicity, assume that one year from now the
investment cost would be $9.7 million and that the return one year later would be $13
million.)
Part 5
AMCE Company is considering two mutually exclusive investment alternatives. Its
estimated weighted-average cost of capital, used as the discount rate for capital
budgeting purposes, is 10%. Following is information regarding each of the two projects:
Alternative 1 Alternative 2
Required investment outlay $170,000 $100,000
Incremental after-tax cash inflows/year $50,000 $30,000
Estimated project life (in years) 5 5
Estimated salvage value (end of life) $0 $0
Compute the estimated net present value of each project and determine which
alternative, based on NPV, is more desirable. (The PV annuity factor for 10%, 5 years,
is 3.7908.)
Compute the profitability index (PI) for each alternative and state which alternative,
based on PI, is more desirable.
Why do the project rankings differ under the two methods of analysis? Which alternative
would you recommend, and why?
"
- Sent to Accounting Expert Tutor on 2/1/2011 at 10:50am
You asked:
"I need help with learning the material attached. "
- Sent to Accounting Expert Tutor on 2/2/2011 at 3:25pm
The Expert Tutor on Course Hero answered:
Please increase the price for your question to at least $50. At this price, I can spend the
time to answer your question.
Thank you.
Please resubmit your questions below.
View Full Attachment Show more
Related Questions
Dear tutor, Appreciate if you could help me with my managerial accounting question.
sending attachments once again ..
Ask Solution of this Financial Accounting assignment! Thank you for help again!
I have a new assignment . I will send the scanned attachment. IF YOU CANNOT READ any part of it clearly...my apologizes ...let me know and I'll resend them. Directions on what and how it is to be completed are at the end of the second page (10-45) The problem starts on page 10-44 and is...
"Problem 1: Compute the cost driver rates for each of the four cost drivers."There are three managerial accounting problems that need to be solved at the very bottom of the attached assignment. I will post the assignment three separate times, once for each problem. Please solve only for...
Attached is the file with all the information. After Assignment these seven questions need to be answered.1.You plan on buying a new home in four years and want to have a $15,000 down payment at that time. If the bank pays interest of 6 percent, how much should you deposit today to reach your...
|
http://www.coursehero.com/tutors-problems/Accounting/6684652-Here-is-the-assignment-once-again/
|
CC-MAIN-2013-48
|
en
|
refinedweb
|
19 November 2009 16:43 [Source: ICIS news]
PRAGUE (ICIS news)--The European Commission has launched a state aid investigation into the first phase of Romanian government assistance targeted at reviving chemical company Oltchim, its Competition Commissioner announced on Thursday.
The Commission would decide whether a state guarantee worth €49.6m ($74.0m) — granted to help polyvinyl chloride (PVC) producer Oltchim solve its feedstock difficulties by acquiring petrochemical assets including an ethylene cracker from fellow Romanian company Arpechim — was properly awarded in line with the Commission-approved Temporary Framework for State Aid to an Economy during the financial crisis.
Competition Commissioner Neelie Kroes said: "The Temporary Framework allows companies to overcome financial problems arising from the current credit squeeze. The Commission will verify whether Oltchim's difficulties are linked to the crisis or predate it.
“In the latter case, the Temporary Framework is not the appropriate instrument to address the company's problems. This would not preclude, however, the possibility of granting, for example, rescue and restructuring aid to the company, if the conditions of the Rescue and Restructuring Guidelines were met."
Activist minority shareholder in ?xml:namespace>
This is the second EC investigation into Oltchim to have been opened in recent months. In September, Kroes said the Commission would examine whether a second phase of pledged state assistance, comprising loan guarantees worth €339.2m ($498.8m) and a debt-to-equity swap valued at €135m, complied with EU state aid rules.
Oltchim said it was convinced that both the Commission investigations would find in its favour.
(
|
http://www.icis.com/Articles/2009/11/19/9265661/european-commission-launches-investigation-into-oltchim-state.html
|
CC-MAIN-2013-48
|
en
|
refinedweb
|
#ifdef CFW_446
#include "firmware_symbols_441.h"
#endif
#ifdef CFW_446
#include "firmware_symbols_446.h"
#endif
<![if !IE]>
105 Comments - Go to Forum Thread »
Download: / /
To quote, roughly translated: Version 2.68u in beta testing for all of our users on the forum. Although being in beta, the version in question works very well, so do not be afraid to get crash or otherwise. We decided to put in downloads this "beta" version, because we still have much work to do and time is very short. For now, enjoy this slice of homebrew.
Sincere Thanks to the PS3 scene Spanish, having read so many positive reviews both on our Homebrew on Ferrox. Thank you again! The homebrew obviously is in testing (beta), shown here in the thread the various problems related to improper startup and or any other kind of problem.
Iris Manager Unofficial v2.68u Changelog:
Arabic language has been added (Thanks to Haider Kiara)
Persian language has been removed (Due to poor translation, it was unnecessary to include it. Will be added back later if some users kindly got the result)
Automatic recognition of language (beta)
PAYLOAD mode DISCLESS pre-activated (Fake BD) for CFW's 3.55 / 4.30 / 4.46
New background color: Deep Ruby, Color Ocean, Razzmic Berry and Rich Electric Blue
Fixed minor bugs for better stability
Iris Manager 2.68u Unofficial (Final Version):
Added Arabic Language (Thanks to Haider Kiara)
Added Polish Language (Thanks to Roman5566)
Automatic recognition of the language
Archive Manager (Italian translation) Included in the "Version 2.68ui"
ControlFan Utility (Italian translation) Included in the "Version 2.68ui"
Removed the Persian language (Due to poor translation, it was unnecessary to include it. Will be readjusted later if some users kindly got the result.)
Mode DISCLESS PAYLOAD pre-activated also on Custom Firmware 4.50! (Fake BD) for CFW's 430/446/450
New Colors System (Background Style) (Deep Ruby) (Color Ocean) (Razzmic Berry) (Rich Electric Blue)
Payload 4.50 (Thanks to REIZA72 for the DUMP LV1/2, IDA PRO & Kakarotoks for lv2_dump_analyser)
Fixed minor bugs for better stability
Compatible with Habib/FERROX 4.50
Q: I can not start some games, giving me a black screen, why?
A: Iris Unofficial Manager has integrated the modalia DISC-LESS ON CFW 430/446/450. Enable it and solve the start of all games.
Q: The source code will be released when?
A: The source code will be released with version 2.70u onwards.
More PlayStation 3 News...
Download: / (Mirror)
To quote from cosimo98, roughly translated:
CHANGELOG IRIS MANAGER 2.67U
Added compatibility with CFW Rebug 4.46.1 REX / D-REX EDITION and other future CFW 446dex.
Mode DiscLess 4.46/446dex activated.
For the rest, has the same characteristics of 2.66U
Special Thanks BETA TESTER
franci97 (DEX user)
cosimo98 (CEX user)
More PlayStation 3 News...
|
http://www.ps3news.com/ps3-cfw-mfw/ps3ita-manager-v1-20-iris-manager-ps3-fork-by-rancid-o-arrives/page-5/
|
CC-MAIN-2013-48
|
en
|
refinedweb
|
How to display a splash screen in Qt
Article Metadata
Tested with
Devices(s): Emulator
Compatibility
Article
Keywords: QSplashScreen
Last edited: hamishwillee (11 Oct 2012)
Overview
This code snippet demonstrates how to display a splash screen before your application loaded using QSplashScreen. may usually appear in the center of the screen.
Preconditions
Various Function
- Makes the splash screen wait until the widget mainWin is displayed
splash.finish(&window);
- Draws the message text onto the splash screen with color and aligns the text according to the flags in alignment
splash.showMessage("Wait...");
Source File
#include <QApplication>
#include <QPixmap>
#include <QSplashScreen>
#include <QWidget>
#include <QMainWindow>
int main(int argc, char *argv[])
{
QApplication app(argc, argv);
QPixmap pixmap("c://designer.png");
QSplashScreen splash(pixmap);
splash.show();
splash.showMessage("Wait...");
qApp->processEvents();//This is used to accept a click on the screen so that user can cancel the screen
QMainWindow window;
window.setStyleSheet("* { background-color:rgb(199,147,88); padding: 7px}");
window.show();
splash.finish(&window);
return app.exec();
}
Screenshot
.
Splash screen is used during application startup.It's just a start up image with some messages showing to the users.It represents network connections,loading some items,etc.. as a message displayed on the Splash screen.How can it be done in the application is shown in this article and it uses simple code for Qt.
--vkmunjpara 18:59, 17 September 2009 (UTC)
Jahan.geo - Mistake in the line qApp->processEvents()
It should be qApp.processEvents()!!!!!mind the dot after object qApp, not as pointer.
jahan.geo 12:49, 21 October 2011 (EEST)
Entricular - The above code is wrong and needs to be corrected see the following code below
Use a program such as the GIMP to create your splashpage.png image and include the splashpage.png in your images application directory.
Run the following commands:
Execute the program:
I am tired of people posting flawed, incomplete and unconfirmed Qt code, test your code before you post it to make sure it works so others can follow and learn. Posting snippets of code doesn't help it is very frustrating, in the future post the full source code. This code was tested and confirmed( it works ) on Ubuntu Linux 10.04 LTS with Qt 4.7.4 SDK installed. I tested the code with Windows Vista and Qt 4.7.4 and it did not work.
entricular 16:21, 28 April 2012 (EEST)
|
http://developer.nokia.com/Community/Wiki/How_to_display_a_splash_screen_in_Qt
|
CC-MAIN-2013-48
|
en
|
refinedweb
|
16 February 2007 18:36 [Source: ICIS news]
HOUSTON (ICIS news)--Two former Valero Energy units will change their names to NuStar as a result of their separation from Valero Energy, it was announced on Friday.
Valero LP and Valero GP Holdings, LLC will change their names to NuStar Energy, LP and NuStar GP Holdings, LLC respectively, Valero Energy said.
Valero said the introduction of both companies will coincide with the launch of the newly rebranded websites and the first day they begin trading under new ticker symbols on the New York Stock Exchange (NYSE).
NS will be NuStar Energy, LP’s ticker on the NYSE, while NGP will be the NuStar GP Holdings, LLC ticker.
Valero LP is publicly traded company based in ?xml:namespace>
Valero GP Holdings, LLC is a publicly traded company that owns 2% general partner interest, a 21.4% limited partner interest and the incentive distribution rights in Valero
|
http://www.icis.com/Articles/2007/02/16/9007435/valero-companies-rebrand-as-nustar.html
|
CC-MAIN-2013-48
|
en
|
refinedweb
|
07 September 2012 07:47 [Source: ICIS news]
SINGAPORE (ICIS)--Denka ?xml:namespace>
The facility, located on
“The issue is limited in nature and will likely be resolved over the weekend,” the source added but did not give any details about the problem.
The sudden shutdown is expected to have little impact on the company’s ability to supply as it has some inventories on hand.
The other PS producer
|
http://www.icis.com/Articles/2012/09/07/9593533/denka-singapore-shuts-ps-plant-on-mechanical-issues.html
|
CC-MAIN-2013-48
|
en
|
refinedweb
|
The ODMG API is an implementation of the
ODMG 3.0 Object Persistence API.
The ODMG API provides a higher-level API and query
language based interface over the
PersistenceBroker API.
More detailed information can be found in the ODMG-guide
and in the other reference guides.
This tutorial operates on a simple example class:
package org.apache.ojb.tutorials;
public class Product
{
/* Instance Properties */
private Double price;
private Integer stock;
private String name;
/* artificial property used as primary key */
private Integer id;
/* Getters and Setters */
...
}
The metadata descriptor for mapping this class is described in the
mapping tutorial
When using 1:1, 1:n and m:n references (the example doesn't use it) the ODMG-api
need specific metadata settings on relationship definition, the mandatory settings
are listed in the
ODMG-Guide - additional info see
auto-xxx settings and
repository file settings.
As with the other tutorials, the source code for this tutorial is
contained in the tutorials-src.jar which can be downloaded
here. The source files
are contained in the org/apache/ojb/tutorial2/ directory.
You can try it out with the ojb-blank project which can be downloaded from
the same place and is described in the
Getting started section.
Further information about the OJB odmg-api implementation can be found in
the ODMG guide.
The ODMG implementation needs to have a database opened for it to access.
This is accomplished via the following code:
Implementation odmg = OJB.getInstance();
Database db = odmg.newDatabase();
db.open("default", Database.OPEN_READ_WRITE);
/* ... use the database ... */
db.close();
With method call OJB.getInstance() always a new
org.odmg.Implementation instance will be created and
odmg.newDatabase() returns a new Database instance.
Call db.open(...) opens an ODMG
Database using the name specified in
metadata for the database -- "default" in
this case. Notice the Database is opened in read/write mode. It is possible to open it in read-only or write-only
modes as well.
Once a Implementation instance is created and a
Database has been opened it is available for use. Unlike
PersistenceBroker instances, ODMG
Implementation and Database instances
are threadsafe and can typically be used for the entire lifecycle of an application.
There is no need to call the
Database.close() method until the database
is truly no longer needed.
The
OJB.getInstance() function provides the ODMG
Implementation
instance required for using the ODMG API. From here on out it is straight ODMG
code that should work against any compliant ODMG implementation.
Persisting an object via the ODMG API is handled by writing it to the peristence
store within the context of a transaction:
public static void storeNewProduct(Product product)
{
// get the used Implementation instance
Implementation odmg = ...;
Transaction tx = odmg.newTransaction();
tx.begin();
// get current used Database instance
Database db = odmg.getDatabase(null);
// make persistent new object
db.makePersistent(product);
tx.commit();
}
Once the ODMG implementation has been obtained it is used to begin a transaction,
obtain a write lock on the
Product, and commit the transaction. It is
very important to note that all changes need to be made within transactions in the
ODMG API. When the transaction is committed the changes are made to the database. Until
the transaction is committed the database is unaware of any changes -- they exist
solely in the object model.
The ODMG API uses the OQL query language for obtaining references to persistent objects.
OQL is very similar to SQL, and using it is very similar to use JDBC. The ODMG
implementation is used to create a query, the query is specifed, executed, and a
list fo results is returned:
public static Product findProductByName(String name) throws Exception
{
// get the used Implementation instance
Implementation odmg = ...;
Transaction tx = odmg.newTransaction();
tx.begin();
OQLQuery query = odmg.newOQLQuery();
query.create("select products from "
+ Product.class.getName()
+ " where name = $1");
query.bind(name);
List results = (List) query.execute();
Product product = (Product) results.iterator().next();
tx.commit();
return product;
}
Updating a persistent object is done by modifying it in the context of a transaction,
and then committing the transaction:
public static void sellProduct(Product product, int number)
{
// get the used Implementation instance
Implementation odmg = ...;
Transaction tx = odmg.newTransaction();
tx.begin();
tx.lock(product, Transaction.WRITE);
product.setStock(new Integer(product.getStock().intValue() - number));
tx.commit();
}
The sample code obtains a write lock on the object (before the changes are made),
binding it to the transaction, changes the object, and commits the transaction. The newly modified
Product
now has a new
stock value.
Deleting persistent objects requires directly addressing the
Database which
contains the persistent object. This can be obtained from the ODMG
Implementation by asking for it. Once retrieved, just ask the
Database to delete the object. Once again, this is all done in the context
of a transaction.
public static void deleteProduct(Product product)
{
// get the used Implementation instance
Implementation odmg = ...;
Transaction tx = odmg.newTransaction();
tx.begin();
// get current used Database instance
Database db = odmg.getDatabase(null);
db.deletePersistent(product);
tx.commit();
}
It is important to note that the
Database.deletePerstient() call does
not delete the object itself, just the persistent representation of it. The transient
object still exists and can be used however desired -- it is simply no longer
persistent.
by Brian McCallister
|
http://db.apache.org/ojb/docu/tutorials/odmg-tutorial.html
|
CC-MAIN-2013-48
|
en
|
refinedweb
|
toString method and output
Maureen Charlton
Ranch Hand
Joined: Oct 04, 2004
Posts: 218
posted
Nov 20, 2004 07:11:00
0
Could someone explain to me what is wrong and what is currently happening with the output of using the toString( ) method in the Storage class and the output of the storeStudent in the Storage class.
//Method to override toString to print meaninful information public String toString (Student studentDetails [ ]) { String result = ""; for (int i=0; i< numberOfStudents; ++i) { result += studentDetails[ i]; } return result; }//end method toString //Method that stores the student objects //Checks to see whether or not any another studentDetail has this hash i.e. collision occuring //if it has been used , store the student details in the first available position after the generated hash //and continue searching from the beginning if the end of the array is reached public void storeStudent (String name, String course) { //Print out what is coming into storeStudent Method System.out.println("\nThis is what is coming into method: "+ "\t"+name +" \t"+course); //Break if name is null i.e. no more students while (name == null) { System.out.println("\n\t\tExit program. No more students. "); break; }//end if statement //Make an array to store the studentDetails i.e. name and course Student [ ] studentDetails = new Student [numberOfStudents]; //Store the studentDetails i.e. name and course studentDetails [lp ] = new Student (name, course); System.out.println (studentDetails[ lp].toString( )+ " "+" Now stored"+ " lp = "+lp); //Reference to my Storage object Storage [ ] myStorage = new Storage [numberOfStudents]; //Display more meaningful information i.e. over ride toString System.out.println ("studentDetail after override: " +myStorage.toString( ) ); lp++;
The output I am getting is:
C:\java>
java
StorageTest
This is what is coming into method: Joe Bloggs Java
Student@11a698a Now stored lp = 0
studentDetail after override: [LStorage;@107077e
This is what is coming into method: Fred Smyth Visual Basic
Student@7ced01 Now stored lp = 1
studentDetail after override: [LStorage;@1ac04e8
This is what is coming into method: Sally Collins History
Student@765291 Now stored lp = 2
studentDetail after override: [LStorage;@26e431
This is what is coming into method: JOHN DOE Java
Student@14f8dab Now stored lp = 3
studentDetail after override: [LStorage;@1ddebc3
This is what is coming into method: JOE DOHN Visual Basic
Student@a18aa2 Now stored lp = 4
studentDetail after override: [LStorage;@194ca6c
This is what is coming into method: Joe Dohn Visual C#
Student@17590db Now stored lp = 5
studentDetail after override: [LStorage;@17943a4
When I was expecting the student name and course which is stored in studentDetail [lp] i.e. Joe Dohn Visual C# after override instead of
[LStorage;@17943a4. I thought the declared toString method would over ride this?
Mark Patrick
Ranch Hand
Joined: Feb 22, 2004
Posts: 51
posted
Nov 20, 2004 07:52:00
0
You have not overridden the toString() method inherited from the Object class.
public String toString(){} public String toString( Student studentDetails [ ] ){}
This is what you actually have in your Storag class. You've actually overloaded toString(), not overridden it.
System.out.println ("studentDetail after override: " +myStorage.toString( ) );
Which version of 'toString' is being called?
Mark Patrick<br />SCJP 1.4
Ernest Friedman-Hill
author and iconoclast
Marshal
Joined: Jul 08, 2003
Posts: 24148
27
I like...
posted
Nov 20, 2004 08:32:00
0
Hi Marlene,
I hope you don't mind a litle general advice. I've been watching your posts, although I don't think I've commented on many so far.
It seems to me that you're still struggling with the concept of an
object
. When it's time to display a list of Students, you're still thinking in terms of one method to loop through a bunch of data and display it. I know that at least in past iterations of this program, the Student names and other info were being kept in big arrays, and many of the methods took a student index as an argument. Hopefully by now each Student object owns a single
String
holding the name, and another String holding the course name.
In any case, the toString() method you wrote shows that you're still thinking of Students as aggregate data to be operated on, rather than as entities that themselves perform operations. What you need is a toString() method in the Student class which prints a single Student's information.
There's also the detail that the "real" toString() method -- the one that's used automatically by System.out.println(), and the one you're calling explicitly in storeStudent() -- takes no arguments, but you've defined a method that takes arguments. This isn't overriding at all, but
overloading
-- really defining a different method altogether that just happens to have the same name.
What you want is a toString that looks something like
[code]
public String toString() {
return name + ": " + course;
}
[code]
in the Student class. Then whenever you say something like
Student s = ...
System.out.println(s);
you'll see
Fred Jones: Chemistry 101
To reiterate: let the individual Student objects know just how to display themselves. Other code that holds a collection of Students can then loop over the collection and ask each one to display itself.
Hope this helps.
[Jess in Action]
[AskingGoodQuestions]
Maureen Charlton
Ranch Hand
Joined: Oct 04, 2004
Posts: 218
posted
Nov 20, 2004 08:37:00
0
Could you elaborate a bit more please?
Also confused on the following:
I have my toString method declared as:
public String toString (Student studentDetails [ ])
I noticed you typed the method toString ( )
- with nothing coming into it?
Why? How will this method know the studentDetails then? i.e.
//Method to override toString to print meaninful information
public String toString (Student studentDetails [ ])
{
String result = "";
for (int i=0; i< numberOfStudents; ++i)
{
result += studentDetails[ i];
}
return result;
}//end method toString
(Thanking you in advance)
Ernest Friedman-Hill
author and iconoclast
Marshal
Joined: Jul 08, 2003
Posts: 24148
27
I like...
posted
Nov 20, 2004 09:30:00
0
Your question -- how does the Student know the information? -- is exactly the point that I want to get across to you, so good, we're communicating!
It's also really the crux of object-oriented programming.
I don't know exactly what your code looks like right now, but here's what you ought to be triving for: A Student object should know all the information that's relevant to one Student, and that's all. For the sake of argument, let's say that that's a name and a course. The basic Student class would then look like this:
public class Student { private String _name, _course; public Student(String name, String course) { _name = name; _course = course; } public String getName() { return _name; } public String getCourse() { return _course; } public String toString() { return _name + ": " + _course; } // More methods to compare students, etc. }
Then you'd have other classes. The one that maintained a collection of these Student objects might be called "School".
public class School { private ArrayList _students = new ArrayList(); public void addStudent(String name, String course) { Student s = new Student(name, course); _students.add(s); } public void displayAllStudents() { for (int i=0; i<_students.size(); ++i) { System.out.println(_students.get(i)); } } // More methods }
Note that to print all the students, the School just prints each object (each Student) in the _students collection. It's up to the individual Student to render itself as a String. The Student knows how to do this because each Student stores its own name and course in its own individual member variables.
Lots of other things become very easy when you delagate responsibility in this way. For example, let's say you needed a method to remove a Student. You have to give the Student class an equals() method which will allow it to compare itself to another Student a report whether they're the same:
public class Student { ... public boolean equals(Object o) { Student s = (Student) o; return s._name.equals(_name) && s._course.equals(_course); } }
Then you can write the School.removeStudent() method using the remove() method of
ArrayList
:
public class School { ... public void removeStudent(String name, String course) { Student s = new Student(name, course); _students.remove(s); } }
All the work of deciding whether the Student to be removed is the same as one in the collection is done by the individual Students themselves, in collaboration with the
ArrayList
.
Finally, of course, you need an application to work with these classes. Generally you want that to be in yet another class. All this last class has to do is create a School, and call the methods of School, delegating most of the work to School:
public class CourseApp { public static void main(String[] argv) [ School school = new School(); school.addStudent("Fred Jones", "Chemistry 101"); school.addStudent("Carmen Miranda", "Botany 200"); school.displayAllStudents(); } }
I know the details of your code will differ, but what I'm trying to show you here is how to divide up the responsibility for various operations between several classes. If a Student knows about being an individual Student, and a School knows about manipulating a collection of Students, then a main application routine that works with a School can be simple and easy to understand.
I've left out your Storage object, but similarly, it should know only about storing data, accepting Student objects, asking each Student for its data using those getName()/getCourse() methods, and storing the data in some way. It should retrieve data and reconstruct Student objects from it -- it shouldn't pass the raw data back to the school. The school deals in Students, not in lists of Strings.
Hope this all makes sense. You seem like a very hard working person and I'd like to see you getting some payback from that energy rather than being bogged down in details -- which is what happens when you try to do everything at once, rather than delegating responsibility as I've shown here.
Maureen Charlton
Ranch Hand
Joined: Oct 04, 2004
Posts: 218
posted
Nov 20, 2004 09:40:00
0
Ernest Fridman-Hill,
Firstly, giving me general advice is
I will take ALL the advice I can get! Especially when you hit the nail on the head!! Thank you!
As you can guess it took me all of a second after your posting.
The output is NOW as expected:
C:\java>java StorageTest
This is what is coming into method: Joe Bloggs Java
Joe Bloggs : Java Now stored lp = 0
This is what is coming into method: Fred Smyth Visual Basic
Fred Smyth : Visual Basic Now stored lp = 1
This is what is coming into method: Sally Collins History
Sally Collins : History Now stored lp = 2
This is what is coming into method: JOHN DOE Java
JOHN DOE : Java Now stored lp = 3
This is what is coming into method: JOE DOHN Visual Basic
JOE DOHN : Visual Basic Now stored lp = 4
This is what is coming into method: Joe Dohn Visual C#
Joe Dohn : Visual C# Now stored lp = 5
Also understood the overriding - I think we both put a posting at the same time.
Well, I guess I will get on with my assignment (I didn't need this for the assignment as I had to calculate the hash anyway BUT I got caught up in the toString method
)
Thanks again (and also thanks to Mike Gershman who has been brilliant with explaining things in detail.
Maureen Charlton
Ranch Hand
Joined: Oct 04, 2004
Posts: 218
posted
Nov 20, 2004 09:48:00
0
Think we posted this at the same time too!!
subject: toString method and output
Similar Threads
Loops
Method to display not working
Arrays: Calling input from other methods and classes
Arrays and methods - not getting the results I expected
Passing Objects into Methods
All times are in JavaRanch time: GMT-6 in summer, GMT-7 in winter
JForum
|
Paul Wheaton
|
http://www.coderanch.com/t/397788/java/java/toString-method-output
|
CC-MAIN-2013-48
|
en
|
refinedweb
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.