青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品

DraculaW

  C++博客 :: 首頁 :: 新隨筆 :: 聯(lián)系 :: 聚合  :: 管理 ::
  19 隨筆 :: 0 文章 :: 7 評論 :: 0 Trackbacks

2008年11月28日 #

     摘要: 我嘗試寫的一個智能指針
希望大家能幫我提一些意見 謝謝

上面是測試碼
下面是代碼  閱讀全文
posted @ 2008-11-28 17:39 DraculaW 閱讀(417) | 評論 (0)編輯 收藏

2007年11月22日 #

     摘要: 紅黑樹的插入算法的描述 不知道清楚么 希望大家指正  閱讀全文
posted @ 2007-11-22 20:47 DraculaW 閱讀(325) | 評論 (0)編輯 收藏

2007年11月21日 #

     摘要: 對內(nèi)存分配算法的一點想法 希望大家指正  閱讀全文
posted @ 2007-11-21 22:38 DraculaW 閱讀(1983) | 評論 (1)編輯 收藏

2007年11月20日 #

     摘要: 大概的介紹了下deque的實現(xiàn)
為什么要用這種實現(xiàn)方式 誰能解釋一下  閱讀全文
posted @ 2007-11-20 22:30 DraculaW 閱讀(1178) | 評論 (0)編輯 收藏

2007年11月15日 #

template<typename T, typename U>
class Conversion
{
    typedef char Small;
    class Big{char dummy[2];};
    static Small Test(U)    {   }  
    static Big Test(...) { }  
    static T MakeT() { }
   
public:
    enum { exists = sizeof(Test(MakeT())) == sizeof(Small)};   
};

如果T可以轉(zhuǎn)換為U 于是就調(diào)用Test(U)這個函數(shù) 返回一個char;
如果不能 就調(diào)用使用(...)缺省參數(shù)的函數(shù) 返回一個數(shù)組

然后對返回值進(jìn)行判斷....
posted @ 2007-11-15 20:45 DraculaW 閱讀(282) | 評論 (0)編輯 收藏

     摘要: STL與boost的type traits  閱讀全文
posted @ 2007-11-15 20:43 DraculaW 閱讀(946) | 評論 (0)編輯 收藏

# The readfpl accept a file's path while is fpl(foobar play list),
# and return a list which holds all the file'path
sub readfpl
{
    my @files;
    my @chunks;
    my $index = 0;

    open(INPUT, "< $_[0]")
        or die "can't open";

    @chunks = split(m{file://}, <INPUT>);

    foreach(@chunks)
    {   
        if($_ =~ m/.+\.(mp3|wma|m4a)/)
        {
            $files[$index] = $&;
            $index ++;
        }
    }

    print $files[0];
   
    return @files;
}

my @files = readfpl($ARGV[0]);
my $string;

foreach(@files){
     $string = $_;
        # the next while get name from path
     while( substr($string, 1) =~ m{\\.+\.(mp3|wna|m4a)}) {
         $string = $ARGV[0].$&;
         }
     rename $_, string;
}

將這段代碼存為movefpl.pl然后在命令行打入 movefpl.pl 播放列表的全路徑 要存歌曲的新路徑
就可以了呢 呵呵
posted @ 2007-11-15 20:41 DraculaW 閱讀(315) | 評論 (0)編輯 收藏

Assessing Infection

Background

According to the World Health Organization, infectious disease ranks as the leading cause of death in the world. In 1998 alone, over 17 million people died from infectious and parasitic diseases such as acute lower respiratory infections, tuberculosis, HIV/AIDS, and malaria. It is forecast that infectious disease will continue to kill millions of people, especially those living in developing countries.

The medical profession and scientific community of the world are fighting the infectious disease threat with new tools and technologies from a variety of fields. From this effort, a new field of research has emerged. Infectious Disease Epidemiology is the study of the variables that influence the growth and spread of infectious diseases. This relatively new field combines molecular biology, immunology, genetics, and the computational sciences. A focus of this field is the study of the factors that influence the growth of an infectious disease within a single organism, and the factors that influence the pattern of infection across an entire population.

Description

This assignment asks you to finish the implementation of a program that assesses the level of infection in a tissue sample. You are given data representing a rectangular tissue sample, overlaid with a grid. Certain portions of the tissue are infected; others are not. Your goal is to help assess the extent of the infection by writing a program that, given the coordinates of a colony of infection, can determine its size.

A typical use of the program follows. The user interacts with the program only through command-line arguments. The user supplies to the program a data filename and the coordinates of a cell in the grid. The coordinates are specified by row and then column, both starting at zero. The program calculates the extent of infection at that coordinate and outputs a two-dimensional representation of the tissue sample. Figure 1 depicts the execution of the program.

A screen shot from a sample solution
Figure 1 Output from a sample solution

For the purpose of this assessment, we consider a "colony" of infected tissue to be a set of adjacent and infected cells. In Figure 1, we can see three separate colonies. The smallest colony consists of two cells and is located in the lower left corner of the grid. Another colony consisting of three infected cells exists on the far right edge of the grid. The largest colony of eight cells resides primarily in the middle of the grid. This colony has a small arm into the upper left corner of the grid. Notice from this colony that cells residing in diagonals are considered "adjacent." The plus signs next to the cells in this largest colony indicate that they all belong to the colony that contains the user entered coordinate.


solution :

#ifndef GRID_H
#define GRID_H

#include <string>
#include <vector>

using namespace std;

/*
* IMPORTANT NOTE:
*
* For this assignment, you might need to add state to the
* class and/or augment existing methods, and/or create private helper
* methods, but you should not delare new public methods
*/

const bool INFECTED = true;
const bool NOT_INFECTED = false;

class grid;

class grid {

private:
    int rows;
    int cols;
    vector<bool> *area;
    vector<bool> *infect;
    int indexof (int row, int col) const;
    bool infected(int row, int col) const;

public:
    grid (string file);
    ~grid ();

    int count (int row, int col);

    friend ostream &operator<<(ostream &stream, const grid& ob);

};

#endif

============================================================================

#include <iostream>
#include <fstream>

using namespace std;

#include "grid.h"

// You do not need to alter function indexof.
int grid::indexof (int row, int col) const {
    return row*cols+col;
}

// You do not need to alter function infected.
bool grid::infected(int row, int col) const {
    return (area->operator[](indexof(row, col)) == INFECTED);
}

// You may need to alter the constructor
grid::grid (string file) {

    ifstream grid_file;

    grid_file.open (file.c_str());

    grid_file >> rows;
    grid_file >> cols;

    area = new vector<bool>(rows*cols, NOT_INFECTED);
    infect = new vector<bool>(rows*cols, NOT_INFECTED);
   
    while (true) {

        int blob_row;
        int blob_col;

        grid_file >> blob_row;
        grid_file >> blob_col;

        if (grid_file.eof()) {
            break;
        }

        area->operator[](indexof(blob_row,blob_col)) = INFECTED;
    }

    grid_file.close();
}

// You may need to alter the destructor
grid::~grid () {
    delete area;
    delete infect;
}

// You will need to alter this function to display the
// plus signs (+) next to the cells that belong to
// a counted colony.
ostream &operator<<(ostream &stream, const grid& ob) {

    for (int row=0; row < ob.rows; row++) {
   
        for (int col=0; col < ob.cols; col++) {

            stream << ob.area->operator[](ob.indexof(row, col));
            if( ob.infect->operator[] ( ob.indexof(row, col) ) )
                stream << "+ ";
            else
                stream << "   ";
        }

        stream << endl;
    }

    stream << endl;
    return stream;
}

// Replace the return statement in this function with your
// recursive implementation of this method */
int grid::count (int row, int col) {

    if( row < 0 || col < 0 || row == rows || col == cols)
        return 0;

    if( area->operator[](indexof(row,col) ) == NOT_INFECTED )
        return 0;

    if(infect->operator[](indexof(row,col)) == INFECTED)
        return 0;

    infect->operator[](indexof(row,col)) = INFECTED;

    // Recursive test the 8 point near the point
    // which area is INEFCTED and infect is NOT_INFECTED

    return    count( row - 1, col - 1 ) + count ( row - 1, col )
        + count( row - 1, col + 1 ) + count( row, col - 1 )
        + count( row, col ) + 1 + count( row, col + 1 )
        + count( row + 1, col - 1 ) + count( row + 1, col )
        + count( row + 1, col + 1 );
}
posted @ 2007-11-15 20:40 DraculaW 閱讀(502) | 評論 (0)編輯 收藏

     摘要: 一道簡單的作業(yè)貼 呵呵   閱讀全文
posted @ 2007-11-15 20:39 DraculaW 閱讀(460) | 評論 (0)編輯 收藏

手機(jī)的英文智能輸入法其實很簡單的想法 使用哈希來實現(xiàn) 呵呵

1       2       3
,.    abc    def

4       5       6
ghi    jkl    mno

7       8       9
pqrs tuv   wxyz

譬如說輸入 43
進(jìn)入這個哈希里面去尋找
key[43] -> [if] -> [he] -> [id] -> [ie]-> [ge] -> [gf] -> 0
還可以輸入更多的 呵呵。

以此類推,如果是拼音輸入也是一樣,只不過要多進(jìn)行一次哈希。從拼音哈希到具體的漢字里面去。

不過拼音輸入的狀態(tài)機(jī)應(yīng)該更復(fù)雜一些。因為拼音輸入可以根據(jù)前一個字來推斷可能出現(xiàn)的下一個字。

其實 不只是手機(jī),只要是使用數(shù)字鍵盤的機(jī)器都可以使用這樣子的輸入法。

使用這種算法的變種還可以實現(xiàn)一個好玩的游戲:就是輸入一個單詞,然后輸出所有與它組成元素相同的單詞(就是輸入stop 它可以輸出tops等單詞)。具體也是使用哈希。哈希真是一個好算法
posted @ 2007-11-15 20:37 DraculaW 閱讀(342) | 評論 (0)編輯 收藏

僅列出標(biāo)題  下一頁
青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品
  • <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            久久精品91久久久久久再现| 日韩网站在线观看| 国产精品久久久久久妇女6080| 国产精品视频最多的网站| 一区在线观看视频| 亚洲欧美区自拍先锋| 亚洲激情第一区| 午夜欧美大片免费观看| 欧美日韩在线影院| 亚洲美女性视频| 欧美福利视频一区| 久久综合影视| 亚洲高清影视| 欧美激情一二三区| 免费试看一区| 亚洲日本成人| 亚洲国产欧美一区二区三区久久| 久久免费视频网站| 1000部精品久久久久久久久| 久久先锋资源| 裸体一区二区三区| 最新精品在线| 亚洲精品视频免费观看| 欧美日本国产视频| 亚洲一区中文字幕在线观看| 在线视频亚洲一区| 国产精品久久久久久久久久三级 | 国外成人在线视频网站| 久久精品导航| 久久三级福利| 日韩亚洲国产精品| 99精品99久久久久久宅男| 国产精品盗摄久久久| 午夜精品免费| 久久高清一区| 亚洲肉体裸体xxxx137| 亚洲国产三级在线| 欧美视频导航| 久久av免费一区| 久久久国产精品一区| 亚洲夫妻自拍| 一本不卡影院| 国产在线精品二区| 亚洲电影第1页| 国产精品久久久久久影视| 久久精品中文字幕一区| 老司机67194精品线观看| 日韩一区二区福利| 亚洲欧美日韩在线观看a三区| 韩国av一区二区三区在线观看| 欧美高清hd18日本| 国产精品爽爽ⅴa在线观看| 欧美成人久久| 国产精品一区视频| 亚洲精品久久久久| 国内精品久久久久久久影视蜜臀| 欧美激情视频一区二区三区在线播放| 欧美日韩在线视频一区| 久久野战av| 欧美亚洲成人精品| 久久在线免费视频| 亚洲人屁股眼子交8| 久久婷婷丁香| 欧美精品免费观看二区| 欧美一区二区视频网站| 蜜桃av久久久亚洲精品| 亚洲欧美综合另类中字| 免费在线日韩av| 久久久亚洲高清| 国产精品国产成人国产三级| 亚洲国产高清aⅴ视频| 国产精品自拍视频| 夜色激情一区二区| 99人久久精品视频最新地址| 久久精品官网| 久久精品五月| 国产精品美女久久久免费| 亚洲高清资源综合久久精品| 国产综合色在线视频区| 亚洲免费影院| 夜夜爽夜夜爽精品视频| 久久免费99精品久久久久久| 午夜老司机精品| 欧美三级特黄| 亚洲激情视频网站| 亚洲激情成人在线| 快播亚洲色图| 欧美a级一区二区| 一区二区视频在线观看| 久久av二区| 玖玖玖国产精品| 一色屋精品视频免费看| 久久精品国产第一区二区三区最新章节| 午夜精品免费在线| 国产美女一区| 久久国产精品一区二区| 久久天堂精品| 亚洲缚视频在线观看| 免费成人av资源网| 欧美激情亚洲自拍| 日韩亚洲欧美一区| 欧美日韩国产在线播放| 99re国产精品| 午夜欧美大片免费观看| 国产日韩在线一区| 久久er精品视频| 免费在线欧美黄色| 亚洲日韩成人| 欧美日韩精品免费观看视频| 99re8这里有精品热视频免费| 亚洲永久免费视频| 国产欧美一区二区三区国产幕精品 | 欧美一区高清| 黄色工厂这里只有精品| 另类av一区二区| 亚洲日韩成人| 亚洲综合社区| 国产在线拍揄自揄视频不卡99| 久久精品亚洲乱码伦伦中文| 麻豆精品网站| 一区二区精品在线| 国产精品综合| 久久动漫亚洲| 亚洲国产欧美一区| 香蕉乱码成人久久天堂爱免费| 国产一区日韩一区| 卡一卡二国产精品| 在线性视频日韩欧美| 久久爱www| 亚洲日本一区二区| 国产亚洲欧美一区二区| 久久亚洲二区| 一区二区三区.www| 久久人人超碰| 在线视频中文亚洲| 国产综合视频在线观看| 欧美久久久久久久久| 亚洲一级黄色av| 欧美二区不卡| 欧美一区二区国产| 亚洲日本欧美天堂| 国产欧美一区二区三区久久人妖| 老色批av在线精品| 亚洲免费中文| 亚洲第一免费播放区| 性欧美1819sex性高清| 亚洲精品美女久久久久| 国产欧美一二三区| 欧美片网站免费| 久久久在线视频| 午夜精品视频一区| 亚洲视频中文字幕| 亚洲激情影院| 欧美刺激午夜性久久久久久久| 欧美一区二区视频97| 一本色道久久88综合亚洲精品ⅰ| 国产亚洲一区精品| 欧美日韩亚洲三区| 欧美成人精品一区二区| 欧美一区二区三区四区在线观看地址| 亚洲精品日产精品乱码不卡| 欧美.www| 久久综合五月| 久久嫩草精品久久久精品一| 亚洲欧美日韩综合一区| 在线一区观看| 一区二区三区日韩| 亚洲精品在线三区| 亚洲精品久久久久久久久久久久久| 国产亚洲一级| 国际精品欧美精品| 国产日本欧美视频| 国产伦精品免费视频| 欧美午夜久久久| 欧美日韩另类视频| 欧美视频一区在线观看| 欧美日韩亚洲一区二| 欧美日韩成人| 欧美日韩一二三四五区| 欧美日韩亚洲综合在线| 欧美日韩精品在线观看| 欧美日韩另类国产亚洲欧美一级| 欧美日韩1234| 欧美视频日韩视频| 国产精品一二| 国内精品久久久久影院色| 黄色一区三区| 亚洲国产女人aaa毛片在线| 亚洲国产欧美一区二区三区久久| 在线成人国产| 亚洲国产日日夜夜| 日韩视频在线观看一区二区| 野花国产精品入口| 午夜激情一区| 久久夜精品va视频免费观看| 美日韩精品视频| 亚洲精品国产精品乱码不99| 夜夜爽www精品| 久久www免费人成看片高清| 久久午夜电影|