一个有关List中元素替换的问题

2013-08-27 11:35:01 391 阅读 AI 写同款 · GEO 优化AI 选题数据监测一键分发 ›

麒麟V10等保三级配置实战：从auditd规则到PAM锁定的可信基线构建 Linux安全基线是信息系统可信运行的基础能力，其核心在于身份鉴别、访问控制与安全审计三大机制的协同落地。在国产化信创环境中，麒麟V10作为深度适配飞腾/鲲鹏平台的操作系统，其等保三级合规并非简单套用CentOS加固脚本，而是需围绕内核审计（auditd）、可插拔认证模块（PAM）及国产安全增强机制（如kysec）进行精细化编排。技术价值体现在将抽象条款（如GB/T 22239-2019中6.1.2、6.3.3条）转化为可验证的命令行操作，确保登录失败可锁定、关键行为可追溯、时间偏差不致日志失效。典型应用场阅读详情

现在我有两个类



    //trans

    public class Trans

    {

        public string name;

        public double fix_x;

        public double fix_y;

        public Trans(string a, double b, double c)

        {

            this.name = a;

            this.fix_x = b;

            this.fix_y = c;

        }

    }

    //Nails

    public class Nails

    {

        public string name;

        public string nail;

    }

这两个类分别用List<Trans>和List<Nails>装起来的,现在我要将List<Trans>中的name替换成List<Nails>中的nail,我写了一个实现方法,但是不知道为什么返回的还是原来的List<Trans>,求解!



        public static List<Trans> change(List<Trans> a,List<Nails> b)

        {

            List<Trans> Transf_new = new List<Trans>();

            Trans nail_new;

            

            foreach (Trans nail in a)

            {

                string c = nail.name;

                foreach (Nails net in b)

                {

                    if (nail.name == net.nail)

                        c = net.name;

                }

                nail_new = new Trans(c, nail.fix_x, nail.fix_y);

                Transf_new.Add(nail_new);

            }

            return Transf_new;

        }

...全文

Matlab使用GitHub的踩坑记录（持续更新） Matlab使用git的踩坑记录前言Matlab设置Git的官方帮助文档系统配置新建Git两种代码管理方式典型源代码管理SVN分布式源代码管理 Git注意：SVN和Git都可以用GitHub创建新的库前言作为Git初学者，对Git的代码版本管理非常非常喜欢，给了我极大的安全感。特别是想到之前的几次Matlab、Latex和python的代码莫名其妙被折腾没了又没法找回的悲剧，决定慢慢的走入gi... 阅读详情

Neo_Xiao

C# 111,129 成员 642,538 内容

+ 关注 + 加入社区

切换为时间正序

Neo_Xiao 2013-08-28

打赏
举报

感谢了各位,我已经找到原因,是我自己用错了字段,三楼给我的办法更简便.学习了,谢谢大家!

lele_nancy 2013-08-28

打赏
举报

没有问题的啊完全可以的。


 private void Form1_Load(object sender, EventArgs e)
        {
            List<Trans> trans = new List<Trans>();
            trans.Add(new Trans("a1", 200, 300)); 
            trans.Add(new Trans("a2", 1200, 1300)); 
            List<Nails> nails = new List<Nails>(); 
            nails.Add(new Nails("name1", "a1")); 
            nails.Add(new Nails("name2", "a2")); 
            //List<Trans> list = change(trans, nails); 
            //list.ForEach(x => Console.WriteLine("name:" + x.name + " fix_x:" + x.fix_x + " fix_y:" + x.fix_y));        
            var result = from p in trans 
                         from q in nails 
                         where p.name == q.nail 
                         select new { q.name, p.fix_x, p.fix_y }; 
            result.ToList().ForEach((x) => 
            { 
                Console.WriteLine("name:" + x.name + " fix_x:" + x.fix_x + " fix_y:" + x.fix_y); 
            });
        }

        //trans    
        public class Trans    
        {        
            public string name;        
            public double fix_x;        
            public double fix_y;        
            public Trans(string a, double b, double c)        
            {            
                this.name = a;            
                this.fix_x = b;            
                this.fix_y = c;        
            }    
        }    
        //Nails    
        public class Nails    
        {        
            public string name;        
            public string nail;
            public Nails(string a, string b)
            {
                this.name = a;
                this.nail = b;
            }
        }


        public static List<Trans> change(List<Trans> a, List<Nails> b)
        {
            List<Trans> Transf_new = new List<Trans>();
            Trans nail_new;

            foreach (Trans nail in a)
            {
                string c = nail.name;
                foreach (Nails net in b)
                {
                    if (nail.name == net.nail)
                        c = net.name;
                }
                nail_new = new Trans(c, nail.fix_x, nail.fix_y);
                Transf_new.Add(nail_new);
            }
            return Transf_new;
        }

threenewbee 2013-08-28

打赏
举报

public static List<Trans> change(List<Trans> a,List<Nails> b)
{
return a.Join(b, x => x.name, y => y.name, (x, y) => new Trans(y.name, x.fix_x, x.fix_y)).ToList();
}

能用join就用join
join的原理是分别计算作为连接字段的hash，并且放入hash表中，所以它的算法复杂度是O(NlogN)
而你的写法包括ls的，相当于2层循环，复杂度是O(N^2)。

全栈极简 2013-08-28

打赏
举报

or use linq:

List<Trans> trans = new List<Trans>();
            trans.Add(new Trans("a1", 200, 300));
            trans.Add(new Trans("a2", 1200, 1300));

            List<Nails> nails = new List<Nails>();
            nails.Add(new Nails("name1", "a1"));
            nails.Add(new Nails("name2", "a2"));

            var result = from p in trans
                         from q in nails
                         where p.name == q.nail
                         select new { q.name, p.fix_x, p.fix_y };
            result.ToList().ForEach((x) =>
            {
                Console.WriteLine("name:" + x.name + " fix_x:" + x.fix_x + " fix_y:" + x.fix_y);
            });

Neo_Xiao 2013-08-28

打赏
举报

引用 2 楼 guwei4037 的回复:

or use linq:

List<Trans> trans = new List<Trans>();
            trans.Add(new Trans("a1", 200, 300));
            trans.Add(new Trans("a2", 1200, 1300));

            List<Nails> nails = new List<Nails>();
            nails.Add(new Nails("name1", "a1"));
            nails.Add(new Nails("name2", "a2"));

            var result = from p in trans
                         from q in nails
                         where p.name == q.nail
                         select new { q.name, p.fix_x, p.fix_y };
            result.ToList().ForEach((x) =>
            {
                Console.WriteLine("name:" + x.name + " fix_x:" + x.fix_x + " fix_y:" + x.fix_y);
            });

我尝试用4.0 但是不管用linq或者是join都还是一样.


            List<Trans> transf = new List<Trans>();
            transf = Read.trans(textBox_trans.Text);
            List<Nails> nailf = new List<Nails>();
            nailf = Read.nails(textBox_nail.Text);
            List<Trans> transf_new = new List<Trans>();
            transf_new = Read.change(transf, nailf);
            richTextBox1.Clear();
            foreach (Trans nail in transf_new)
            {
                richTextBox1.AppendText(nail.name + "\t");
                richTextBox1.AppendText(nail.fix_x + "\t");
                richTextBox1.AppendText(nail.fix_y + "\n");
            }

Neo_Xiao 2013-08-28

打赏
举报

引用 3 楼 caozhy 的回复:

public static List<Trans> change(List<Trans> a,List<Nails> b) { return a.Join(b, x => x.name, y => y.name, (x, y) => new Trans(y.name, x.fix_x, x.fix_y)).ToList(); } 能用join就用join join的原理是分别计算作为连接字段的hash，并且放入hash表中，所以它的算法复杂度是O(NlogN) 而你的写法包括ls的，相当于2层循环，复杂度是O(N^2)。

这个看起来非常不错,可以我的.net还是用的2.0,还不支持Join

全栈极简 2013-08-27

打赏
举报

我用了你的相关类和转换方法，并测试了一下，发现确实转换了。

static void Main(string[] args)

        {

            List<Trans> trans = new List<Trans>();

            trans.Add(new Trans("a1", 200, 300));

            trans.Add(new Trans("a2", 1200, 1300));



            List<Nails> nails = new List<Nails>();

            nails.Add(new Nails("name1", "a1"));

            nails.Add(new Nails("name2", "a2"));



            List<Trans> list = change(trans, nails);

            list.ForEach(x => Console.WriteLine("name:" + x.name + " fix_x:" + x.fix_x + " fix_y:" + x.fix_y));

        }

一个有关List中元素替换的问题

相关推荐