" + Html::escape( Utf8::encode( word.toStdWString() ) ) + "

/* This file is (c) 2008-2009 Konstantin Isakov * Part of GoldenDict. Licensed under GPLv3 or later, see the LICENSE file */ #include "article_maker.hh" #include "config.hh" #include "htmlescape.hh" #include "utf8.hh" #include #include using std::vector; using std::string; using std::wstring; using std::set; using std::list; ArticleMaker::ArticleMaker( vector< sptr< Dictionary::Class > > const & dictionaries_, vector< Instances::Group > const & groups_ ): dictionaries( dictionaries_ ), groups( groups_ ) { } std::string ArticleMaker::makeHtmlHeader( QString const & word, QString const & icon ) { string result = "" "" ""; // Add a css stylesheet QFile builtInCssFile( ":/article-style.css" ); builtInCssFile.open( QFile::ReadOnly ); QByteArray css = builtInCssFile.readAll(); QFile cssFile( Config::getUserCssFileName() ); if ( cssFile.open( QFile::ReadOnly ) ) css += cssFile.readAll(); result += "\n"; result += "" + Html::escape( Utf8::encode( word.toStdWString() ) ) + ""; // This doesn't seem to be much of influence right now, but we'll keep // it anyway. if ( icon.size() ) result += "\n"; result += ""; return result; } std::string ArticleMaker::makeNotFoundBody( QString const & word, QString const & group ) { return string( "

" ) + tr( "No translation for %1 was found in group %2." ). arg( QString::fromUtf8( Html::escape( word.toUtf8().data() ).c_str() ) ). arg( QString::fromUtf8( Html::escape( group.toUtf8().data() ).c_str() ) ). toUtf8().data() +"

"; } sptr< Dictionary::DataRequest > ArticleMaker::makeDefinitionFor( QString const & inWord, unsigned groupId ) const { if ( groupId == UINT_MAX ) { // This is a special group containing internal welcome/help pages string result = makeHtmlHeader( inWord, QString() ); if ( inWord == tr( "Welcome!" ) ) { result += tr( "

Welcome to GoldenDict!

" "

To start working with the program, first visit Edit|Sources to add some directory paths where to search " "for the dictionary files, and/or set up various Wikipedia sources. " "After that, you can optionally organize all the dictionaries found into groups " "in Edit|Groups." "

You can also check out the available program preferences at Edit|Preferences. " "All settings there have tooltips, be sure to read them if you are in doubt about anything." "

And then you're ready to look up your words! You can do that in this window " "by using a pane to the left, or you can look up words from other active applications. " "

Should you need further help, have any questions, " "suggestions or just wonder what the others think, you are welcome at the program's forum." "

You can also contact the author directly by writing an \">e-mail." "

Check program's website for the updates. " "

Working with the popup

" "To look up words from other active applications, you would need to first activate the \"Scan popup functionality\" in Preferences, " "and then enable it at any time either by triggering the 'Popup' icon above, or " "by clicking the tray icon down below with your right mouse button and choosing so in the menu you've popped. " ) + #ifdef Q_OS_WIN32 tr( "Then just stop the cursor over the word you want to look up in another application, " "and a window would pop up which would describe it to you." ) #else tr( "Then just select any word you want to look up in another application by your mouse " "(double-click it or swipe it with mouse with the button pressed), " "and a window would pop up which would describe the word to you." ) #endif ).toUtf8().data(); } else { // Not found return makeNotFoundTextFor( inWord, "help" ); } result += ""; sptr< Dictionary::DataRequestInstant > r = new Dictionary::DataRequestInstant( true ); r->getData().resize( result.size() ); memcpy( &( r->getData().front() ), result.data(), result.size() ); return r; } // Find the given group Instances::Group const * activeGroup = 0; for( unsigned x = 0; x < groups.size(); ++x ) if ( groups[ x ].id == groupId ) { activeGroup = &groups[ x ]; break; } // If we've found a group, use its dictionaries; otherwise, use the global // heap. std::vector< sptr< Dictionary::Class > > const & activeDicts = activeGroup ? activeGroup->dictionaries : dictionaries; string header = makeHtmlHeader( inWord.trimmed(), activeGroup && activeGroup->icon.size() ? activeGroup->icon : QString() ); return new ArticleRequest( inWord.trimmed(), activeGroup ? activeGroup->name : "", activeDicts, header ); } sptr< Dictionary::DataRequest > ArticleMaker::makeNotFoundTextFor( QString const & word, QString const & group ) const { string result = makeHtmlHeader( word, QString() ) + makeNotFoundBody( word, group ) + ""; sptr< Dictionary::DataRequestInstant > r = new Dictionary::DataRequestInstant( true ); r->getData().resize( result.size() ); memcpy( &( r->getData().front() ), result.data(), result.size() ); return r; } //////// ArticleRequest ArticleRequest::ArticleRequest( QString const & word_, QString const & group_, vector< sptr< Dictionary::Class > > const & activeDicts_, string const & header ): word( word_ ), group( group_ ), activeDicts( activeDicts_ ), altsDone( false ), bodyDone( false ), foundAnyDefinitions( false ), closePrevSpan( false ) { // No need to lock dataMutex on construction hasAnyData = true; data.resize( header.size() ); memcpy( &data.front(), header.data(), header.size() ); // Accumulate main forms for( unsigned x = 0; x < activeDicts.size(); ++x ) { sptr< Dictionary::WordSearchRequest > s = activeDicts[ x ]->findHeadwordsForSynonym( word.toStdWString() ); connect( s.get(), SIGNAL( finished() ), this, SLOT( altSearchFinished() ) ); altSearches.push_back( s ); } altSearchFinished(); // Handle any ones which have already finished } void ArticleRequest::altSearchFinished() { if ( altsDone ) return; // Check every request for finishing for( list< sptr< Dictionary::WordSearchRequest > >::iterator i = altSearches.begin(); i != altSearches.end(); ) { if ( (*i)->isFinished() ) { // This one's finished for( size_t count = (*i)->matchesCount(), x = 0; x < count; ++x ) alts.insert( (**i)[ x ].word ); altSearches.erase( i++ ); } else ++i; } if ( altSearches.empty() ) { printf( "alts finished\n" ); // They all've finished! Now we can look up bodies altsDone = true; // So any pending signals in queued mode won't mess us up vector< wstring > altsVector( alts.begin(), alts.end() ); for( unsigned x = 0; x < altsVector.size(); ++x ) { printf( "Alt: %ls\n", altsVector[ x ].c_str() ); } wstring wordStd = word.toStdWString(); for( unsigned x = 0; x < activeDicts.size(); ++x ) { sptr< Dictionary::DataRequest > r = activeDicts[ x ]->getArticle( wordStd, altsVector ); connect( r.get(), SIGNAL( finished() ), this, SLOT( bodyFinished() ) ); bodyRequests.push_back( r ); } bodyFinished(); // Handle any ones which have already finished } } void ArticleRequest::bodyFinished() { if ( bodyDone ) return; printf( "some body finished\n" ); bool wasUpdated = false; while ( bodyRequests.size() ) { // Since requests should go in order, check the first one first if ( bodyRequests.front()->isFinished() ) { // Good printf( "one finished.\n" ); Dictionary::DataRequest & req = *bodyRequests.front(); QString errorString = req.getErrorString(); if ( req.dataSize() >= 0 || errorString.size() ) { string dictId = activeDicts[ activeDicts.size() - bodyRequests.size() ]->getId(); string head; if ( closePrevSpan ) { head += ""; closePrevSpan = false; } string jsVal = Html::escapeForJavaScript( dictId ); head += ""; head += ""; closePrevSpan = true; head += string( "

" ) + Html::escape( tr( "From %1" ).arg( QString::fromUtf8( activeDicts[ activeDicts.size() - bodyRequests.size() ]->getName().c_str() ) ).toUtf8().data() ) + "

"; if ( errorString.size() ) { head += "

" + Html::escape( tr( "Query error: %1" ).arg( errorString ).toUtf8().data() ) + "

"; } Mutex::Lock _( dataMutex ); size_t offset = data.size(); data.resize( data.size() + head.size() + ( req.dataSize() > 0 ? req.dataSize() : 0 ) ); memcpy( &data.front() + offset, head.data(), head.size() ); if ( req.dataSize() > 0 ) bodyRequests.front()->getDataSlice( 0, req.dataSize(), &data.front() + offset + head.size() ); wasUpdated = true; foundAnyDefinitions = true; } printf( "erasing..\n" ); bodyRequests.pop_front(); printf( "erase done..\n" ); } else { printf( "one not finished.\n" ); break; } } if ( bodyRequests.empty() ) { // No requests left, end the article bodyDone = true; { string footer; if ( closePrevSpan ) { footer += ""; closePrevSpan = false; } if ( !foundAnyDefinitions ) { // No definitions were ever found, say so to the user. footer += ArticleMaker::makeNotFoundBody( word, group ); } footer += ""; Mutex::Lock _( dataMutex ); size_t offset = data.size(); data.resize( data.size() + footer.size() ); memcpy( &data.front() + offset, footer.data(), footer.size() ); } finish(); } else if ( wasUpdated ) update(); }